Major arc approximation
ProvedCircleMethod.major_arc_approxThe factorisation at the heart of the major-arc analysis. For , any integer and any real ,
Near a rational the Weyl sum splits into a purely arithmetic factor and a purely analytic one, the singular integral. The proof sorts into residue classes mod : writing , the phase becomes modulo one, since . The sum over is exactly , and the inner sum over is a Riemann sum for the integral, with error controlled by the variation of the integrand.
Together with the minor-arc estimate this is what produces the Hardy--Littlewood asymptotic: summing the main terms over the major arcs assembles the singular series and singular integral, while the minor arcs contribute only to the error.
Formalization Note. The bound is stated with an explicit constant and with rather than , which is what the argument gives unconditionally — the last sample point in a residue class can overshoot by less than . On the major arcs , so this immediately yields the classical . No hypothesis is needed.
import Definitions.Def_CircleMethod_waring import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.NumberTheory.Divisors import Mathlib.Data.ZMod.Basic import Mathlib.Algebra.Field.ZMod import Mathlib.Algebra.BigOperators.Group.Finset.Basic open Finset
namespace CircleMethod
theorem major_arc_approx {k q N : ℕ} (hq : 0 < q) (a : ℤ) (β : ℝ) :
‖(∑ x ∈ Finset.range N, e (((a : ℝ) / (q : ℝ) + β) * (x : ℝ) ^ k))
- ((q : ℂ)⁻¹ * S k q a) * (∫ γ in (0:ℝ)..(N : ℝ), e (β * γ ^ k))‖
≤ 2 * (q : ℝ) * (1 + Real.pi * |β| * ((N : ℝ) + (q : ℝ)) ^ k) := by sorry
end CircleMethod