Major-arc approximation from Siegel--Walfisz
ProvedThreePrimes.major_arc_approxThe major-arc approximation. Assume the Siegel--Walfisz theorem. For every there is a constant such that for all , with , and all real ,
where .
Near a rational point with small denominator the primes are equidistributed among the reduced residue classes mod , so the exponential sum behaves like times the sum with no arithmetic weight at all. The proof splits off the sharing a factor with , expands the coprime part in Dirichlet characters, applies Siegel--Walfisz to each , and inserts the twist by partial summation — which is where the factor comes from. The identification of the main term uses .
This is the only place in the argument where deep information about primes enters, and it is why the three primes theorem is stated here conditionally on Siegel--Walfisz.
import Definitions.Def_Vino_threeprimes import Mathlib.Analysis.Asymptotics.Defs import Mathlib.Analysis.Asymptotics.Lemmas import Mathlib.MeasureTheory.Integral.IntervalIntegral.Basic import Mathlib.MeasureTheory.Integral.Bochner.Set import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Data.Nat.Totient open CircleMethod Vino Finset Filter Asymptotics MeasureTheory open scoped Topology
namespace ThreePrimes
theorem major_arc_approx (hSW : SiegelWalfisz) {A B : ℝ} (hA : 0 < A) (hB : 0 < B) :
∃ C : ℝ, ∀ (N q a : ℕ) (β : ℝ), 2 ≤ N → 1 ≤ q → (q : ℝ) ≤ Real.log N ^ A →
Nat.Coprime a q →
‖vmSum ((a : ℝ) / (q : ℝ) + β) N - arith q * v β N‖
≤ C * (1 + |β| * N) * (N : ℝ) * Real.log N ^ (-B) := by sorry
end ThreePrimes