Minor arc estimate: a power saving off the trivial bound
ProvedCircleMethod.minor_arc_boundThe payoff of Weyl's inequality. Fix and . For every there is such that whenever , and the denominator lies in the minor-arc range
the Weyl sum satisfies
This is a genuine power saving over the trivial bound , uniform over the whole minor-arc region. It is the estimate that makes the circle method work: integrating this bound over the minor arcs shows their total contribution is smaller than the main term produced by the major arcs, so the asymptotic formula survives.
In the stated range each of the three terms , , in Weyl's bracket is at most , and raising to the power gives the saving.
Formalization Note. The hypothesis is necessary, not cosmetic. For the term exceeds , so the bracket is bounded below by and no use of Weyl's inequality can produce an exponent better than ; since the hypotheses only force , that strip is non-empty for and the conclusion is genuinely out of reach there. In the classical dissection the minor arcs always have with , so the restriction is exactly the intended one.
import Definitions.Def_CircleMethod_waring import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.MeasureTheory.Integral.DominatedConvergence import Mathlib.Algebra.BigOperators.Group.Finset.Basic open Finset
namespace CircleMethod
theorem minor_arc_bound {k : ℕ} (hk : 2 ≤ k) {ε δ : ℝ} (hε : 0 < ε) (hδ : 0 < δ) (hδ1 : δ ≤ 1) :
∃ C : ℝ, 0 < C ∧ ∀ (N q : ℕ) (a : ℤ) (α : ℝ), 0 < N → 0 < q →
Nat.Coprime a.natAbs q → |α - (a : ℝ) / (q : ℝ)| ≤ 1 / (q : ℝ) ^ 2 →
(N : ℝ) ^ δ ≤ (q : ℝ) → (q : ℝ) ≤ (N : ℝ) ^ ((k : ℝ) - δ) →
‖∑ x ∈ Finset.range N, e (α * (x : ℝ) ^ k)‖
≤ C * (N : ℝ) ^ (1 - δ * (2 : ℝ) ^ (1 - (k : ℝ)) + ε) := by sorry
end CircleMethod