Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weyl's inequality, degree kkk

Proved
CircleMethod.weyl_inequality

by tabbott · Sep 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorycircle-methodexponential-sumsnumber-theory

The goal of this mission. Weyl's inequality for a monomial phase of degree kkk.

Fix k≥2k\ge2k≥2. For every ε>0\varepsilon>0ε>0 there is a constant C=C(k,ε)C=C(k,\varepsilon)C=C(k,ε) such that whenever gcd⁡(∣a∣,q)=1\gcd(|a|,q)=1gcd(∣a∣,q)=1, q≥1q\ge1q≥1, and ∣α−aq∣≤1q2\left|\alpha-\frac{a}{q}\right|\le\frac{1}{q^{2}}​α−qa​​≤q21​,

∣∑x=0N−1e ⁣(αxk)∣  ≤  C N1+ε(1q+1N+qNk)21−k(N≥1).\left|\sum_{x=0}^{N-1}e\!\left(\alpha x^{k}\right)\right|\;\le\;C\,N^{1+\varepsilon}\left(\frac{1}{q}+\frac{1}{N}+\frac{q}{N^{k}}\right)^{2^{1-k}}\qquad(N\ge1).​x=0∑N−1​e(αxk)​≤CN1+ε(q1​+N1​+Nkq​)21−k(N≥1).

Proved by Weyl in 1916, this is the estimate that makes the minor arcs of the circle method negligible. Its proof is k−1k-1k−1 iterations of the differencing step: squaring the sum and substituting y=x+hy=x+hy=x+h lowers the degree of the phase by one, at the cost of a square root in the final bound, which is where the exponent 21−k2^{1-k}21−k comes from. After k−1k-1k−1 steps the phase is linear and the geometric sum bound ∣∑x<Ne(xθ)∣≤min⁡ ⁣(N,12∥θ∥)\left|\sum_{x<N}e(x\theta)\right|\le\min\!\left(N,\frac{1}{2\|\theta\|}\right)​∑x<N​e(xθ)​≤min(N,2∥θ∥1​) applies; the divisor bound is then used to count the differencing parameters that contribute significantly.

The estimate is only useful for qqq in an intermediate range — roughly Nδ≤q≤Nk−δN^{\delta}\le q\le N^{k-\delta}Nδ≤q≤Nk−δ — 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 21−k2^{1-k}21−k decays exponentially in kkk, Weyl's inequality becomes weak for large degree, which is why Vinogradov's mean value method supersedes it there. For small kkk, and as the foundation of the subject, it remains the standard tool.

Formalization Note. The phase is the pure monomial αxk\alpha x^{k}αxk; the general polynomial version of Vaughan's Lemma 2.4 is a strengthening and would be a welcome separate contribution. The exponents 1+ε1+\varepsilon1+ε and 21−k2^{1-k}21−k are real powers (Real.rpow); q2q^2q2 and NkN^kNk are natural powers. The constant CCC is quantified after kkk and ε\varepsilonε and before N,q,a,αN,q,a,\alphaN,q,a,α, and this order must be preserved: allowing CCC to depend on NNN would make the statement vacuous.

Preamble
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
Formal statement
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
Source
H. Weyl, Ueber die Gleichverteilung von Zahlen mod. Eins, Mathematische Annalen 77 (1916), 313-352; R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge University Press, 1997, Lemma 2.4 (Weyl's inequality), specialised to the pure monomial alpha*x^k.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me