Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Major-arc approximation from Siegel--Walfisz

Proved
ThreePrimes.major_arc_approx

by tabbott · Sep 3, 2026 · Mathlib c5ea003 (Lean v4.30.0)

circle-methodnumber-theorythree-primesvinogradov

The major-arc approximation. Assume the Siegel--Walfisz theorem. For every A,B>0A,B>0A,B>0 there is a constant CCC such that for all N≥2N\ge2N≥2, 1≤q≤(log⁡N)A1\le q\le(\log N)^A1≤q≤(logN)A with (a,q)=1(a,q)=1(a,q)=1, and all real β\betaβ,

∣S(aq+β,N)−μ(q)φ(q) v(β,N)∣ ≤ C (1+∣β∣N) N (log⁡N)−B,\Bigl|S\bigl(\tfrac aq+\beta,N\bigr)-\frac{\mu(q)}{\varphi(q)}\,v(\beta,N)\Bigr| \ \le\ C\,(1+|\beta|N)\,N\,(\log N)^{-B},​S(qa​+β,N)−φ(q)μ(q)​v(β,N)​ ≤ C(1+∣β∣N)N(logN)−B,

where v(β,N)=∑m<Ne(βm)v(\beta,N)=\sum_{m<N}e(\beta m)v(β,N)=∑m<N​e(βm).

Near a rational point with small denominator the primes are equidistributed among the reduced residue classes mod qqq, so the exponential sum behaves like μ(q)/φ(q)\mu(q)/\varphi(q)μ(q)/φ(q) times the sum with no arithmetic weight at all. The proof splits off the nnn sharing a factor with qqq, expands the coprime part in Dirichlet characters, applies Siegel--Walfisz to each ψ(N,χ)\psi(N,\chi)ψ(N,χ), and inserts the twist e(βn)e(\beta n)e(βn) by partial summation — which is where the factor (1+∣β∣N)(1+|\beta|N)(1+∣β∣N) comes from. The identification of the main term uses τ(χ0)=cq(1)=μ(q)\tau(\chi_0)=c_q(1)=\mu(q)τ(χ0​)=cq​(1)=μ(q).

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.

Preamble
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
Formal statement
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
Source
H. Davenport, Multiplicative Number Theory, 3rd ed., GTM 74, Springer, 2000, Chapter 26 (the three primes theorem)

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