Weyl's inequality, degree
ProvedCircleMethod.weyl_inequality_deg_twoWeyl's inequality in degree two, for a general quadratic phase. For every there is a constant such that whenever , , and ,
for every real and every .
This is the first genuinely non-trivial exponential sum estimate of the subject and the natural entry point to the general case. The proof requires exactly one squaring step: , and writing turns the phase into , which is linear in . The geometric sum bound then gives for each , and summing over using the rational approximation to produces the stated bound.
The saving is real: when lies in the range the right-hand side is , a power better than the trivial bound . Outside that range the estimate is trivially true, which is intended — those are the major arcs, where the sum genuinely is of size comparable to .
Formalization Note. The linear coefficient is unconstrained, so this is the full quadratic case, not just the pure square. The exponents and are real powers. The constant is quantified after and before all of ; a solver must not weaken this by letting depend on , which 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_deg_two {ε : ℝ} (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 : ℝ) ^ 2 + β * (x : ℝ))‖
≤ C * (N : ℝ) ^ (1 + ε) *
((1 / (q : ℝ) + 1 / (N : ℝ) + (q : ℝ) / (N : ℝ) ^ 2) ^ ((1 : ℝ) / 2)) := by sorry
end CircleMethod