Weyl's inequality, degree
ProvedCircleMethod.weyl_inequalityThe goal of this mission. Weyl's inequality for a monomial phase of degree .
Fix . For every there is a constant such that whenever , , and ,
Proved by Weyl in 1916, this is the estimate that makes the minor arcs of the circle method negligible. Its proof is iterations of the differencing step: squaring the sum and substituting lowers the degree of the phase by one, at the cost of a square root in the final bound, which is where the exponent comes from. After steps the phase is linear and the geometric sum bound applies; the divisor bound is then used to count the differencing parameters that contribute significantly.
The estimate is only useful for in an intermediate range — roughly — and is trivially true outside it. That is exactly the point: the range where it is trivial is the major arcs, where the sum really is large and must be evaluated asymptotically rather than bounded.
Because the saving decays exponentially in , Weyl's inequality becomes weak for large degree, which is why Vinogradov's mean value method supersedes it there. For small , and as the foundation of the subject, it remains the standard tool.
Formalization Note. The phase is the pure monomial ; the general polynomial version of Vaughan's Lemma 2.4 is a strengthening and would be a welcome separate contribution. The exponents and are real powers (Real.rpow); and are natural powers. The constant is quantified after and and before , and this order must be preserved: allowing to depend on would make the statement vacuous.
import Definitions.Def_CircleMethod_genfun import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.NumberTheory.Divisors import Mathlib.Data.Fintype.Pi open Finset
namespace CircleMethod
theorem weyl_inequality {k : ℕ} (hk : 2 ≤ k) {ε : ℝ} (hε : 0 < ε) :
∃ C : ℝ, 0 < C ∧ ∀ (N q : ℕ) (a : ℤ) (α : ℝ), 0 < N → 0 < q →
Nat.Coprime a.natAbs q → |α - (a : ℝ) / (q : ℝ)| ≤ 1 / (q : ℝ) ^ 2 →
‖∑ x ∈ Finset.range N, e (α * (x : ℝ) ^ k)‖
≤ C * (N : ℝ) ^ (1 + ε) *
((1 / (q : ℝ) + 1 / (N : ℝ) + (q : ℝ) / (N : ℝ) ^ k) ^ ((2 : ℝ) ^ (1 - (k : ℝ)))) := by
sorry
end CircleMethod