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 CircleMethodRead-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: weyl_inequality_deg_two
What the declaration asserts. Fix a real number (supplied implicitly) and assume . The statement then claims the existence of a real constant with such that the following holds for every choice of a natural number , a natural number , an integer , and real numbers and :
if
- ,
- ,
- (the coprimality is asserted between the natural-number absolute value of and ), and
- (a non-strict inequality, with the quotient formed in the reals),
then
Meaning of the symbols. The function is the bundle's own additive character, defined by
a complex-valued function of a real argument. The summation index ranges over the finite set (the first natural numbers, starting at and excluding ); each such is cast to a real number before being squared and multiplied by , so the summand is and the sum is a complex number. The double-bar is the norm on , i.e. the complex modulus. On the right-hand side, and the outer exponent are real-exponent powers of the real numbers and respectively, while the exponents occurring in , and are natural-number exponents. All of , , appear on the right-hand side and in the hypotheses cast into .
Quantifier structure and dependencies. The constant is chosen after but before , , , , : a single must serve uniformly for all admissible tuples , and may depend on . Existence of is asserted, not uniqueness, and no explicit value or upper bound for is given; is only required to be positive. The claim is an implication, not an equivalence.
Scope of the hypotheses, and what is not assumed. The real number is entirely unconstrained — no relation whatsoever is imposed between and , , , or . No relation is imposed between and (in particular is not required to satisfy , nor , nor anything of the kind), so the case enormously larger than is included, as is . There is no upper bound on : it may be arbitrarily large as well as arbitrarily small, provided it is positive. The integer may be negative or zero; the coprimality condition is stated for , so it is insensitive to the sign of , and when it forces . The positivity assumptions and ensure the divisions , , , and are all divisions by nonzero reals, so no junk value from division by zero arises; correspondingly the sum is over a nonempty index set, and when it consists of the single term . The base of the outer power is strictly positive under these hypotheses. The Diophantine hypothesis is satisfiable for every (for instance by itself), so the universally quantified implication is not vacuous.
Definitions in scope but unused. The bundle also brings into scope the generating function for a finite set , and the distance-to-nearest-integer function . Neither of these appears in the statement being read back; the only bundle definition it uses is the character .
Proof status. The declaration is stated with its proof left as an unfilled placeholder; no proof is provided.
Confirmed by the mission captain (proposal self-audit).