Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Arc split for Tao's Theorem 8.2: the factors Sη1S_{\eta_1}Sη1​​, Sη0S_{\eta_0}Sη0​​, DN0/3D_{N_0/3}DN0​/3​ and the strongly major arc

Definition
TaoFivePrimes_ArcSplit

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

additive-number-theorycircle-methodfive-primesgoldbachnumber-theory

Names for the pieces of the circle-method integrand (8.11) in the proof of Theorem 8.2 of Tao's five-primes paper, at K=1000K = 1000K=1000, building on the definitions TaoFivePrimes_RepresentationCount and TaoFivePrimes_FourierRepresentation.

  • T0 =3.29×109= 3.29\times10^9=3.29×109, the height to which the Riemann hypothesis is verified (Theorem 1.5).
  • S1 x α =Sη1,x♯(x,α)=∑nΛ(n) 1(n,x♯)=1 η1(n/x) e(nα)= S_{\eta_1,\sqrt{x}\sharp}(x,\alpha) = \sum_n \Lambda(n)\,\mathbf 1_{(n,\sqrt x\sharp)=1}\,\eta_1(n/x)\,e(n\alpha)=Sη1​,x​♯​(x,α)=∑n​Λ(n)1(n,x​♯)=1​η1​(n/x)e(nα), the smoothed sifted prime sum carrying the first two primes.
  • S0 x α =Sη0,x/K♯(x/K,α)= S_{\eta_0,\sqrt{x/K}\sharp}(x/K,\alpha)=Sη0​,x/K​♯​(x/K,α), the smaller-scale sum carrying the third prime (Bourgain's trick).
  • DK H α =DH/3(α)=∑1≤n≤H/3e(nα)= D_{H/3}(\alpha) = \sum_{1\le n\le H/3} e(n\alpha)=DH/3​(α)=∑1≤n≤H/3​e(nα), the Dirichlet-type kernel; the application takes H=N0=4×1014H = N_0 = 4\times10^{14}H=N0​=4×1014.
  • majorArc x ={α:∥α∥R/Z≤T0/(3.6πx)}= \{\alpha : \|\alpha\|_{\mathbb R/\mathbb Z} \le T_0/(3.6\pi x)\}={α:∥α∥R/Z​≤T0​/(3.6πx)}, the strongly major arc of Proposition 8.3.

The structural lemma representationIntegrand_eq records that representationIntegrand x H α = S1 x α ^ 2 * S0 x α * DK H α ^ 3 * e(-xα) definitionally, so that estimates stated for the named factors apply verbatim to the integrand of the exact Fourier identity representationCount_fourier.

Definition code
import Definitions.Def_TaoFivePrimes_FourierRepresentation

/-!
# The major/minor arc split in the proof of Tao's Theorem 8.2

Source: Terence Tao, https://arxiv.org/abs/1201.6656, Section 8, equations (8.11)–(8.12)
and the discussion following (8.16). Names for the three factors of the circle-method
integrand (8.11) at `K = 1000`, and the strongly major arc `‖α‖_{ℝ/ℤ} ≤ T₀/(3.6πx)` with
`T₀ = 3.29 × 10⁹` (Theorem 1.5).
-/

open scoped BigOperators

namespace TaoFivePrimes

/-- The height `T₀ = 3.29 × 10⁹` to which the Riemann hypothesis is numerically verified
(Theorem 1.5). -/
noncomputable def T0 : ℝ := 3.29 * 10 ^ 9

/-- `S_{η₁,√x♯}(x, α)`: the smoothed, sifted prime exponential sum with cutoff `η₁`
(the first two primes in (8.11)). -/
noncomputable def S1 (x : ℕ) (α : AddCircle (1 : ℝ)) : ℂ :=
  TaoFourierIdentity.fourierPolynomial (Finset.range (x + 1))
    (fun n ↦ (siftedVonMangoldt x n * eta1 ((n : ℝ) / x) : ℝ)) (fun n ↦ (n : ℤ)) α

/-- `S_{η₀,√(x/K)♯}(x/K, α)` at `K = 1000`: the smaller-scale sum with cutoff `η₀`
(Bourgain's trick, the third prime in (8.11)). -/
noncomputable def S0 (x : ℕ) (α : AddCircle (1 : ℝ)) : ℂ :=
  TaoFourierIdentity.fourierPolynomial (Finset.range (x / 1000 + 1))
    (fun n ↦ (siftedVonMangoldt (x / 1000) n * eta0 (1000 * (n : ℝ) / x) : ℝ))
    (fun n ↦ (n : ℤ)) α

/-- The Dirichlet-type kernel `D_{H/3}(α) = ∑_{1 ≤ n ≤ H/3} e(nα)`. -/
noncomputable def DK (H : ℕ) (α : AddCircle (1 : ℝ)) : ℂ :=
  TaoFourierIdentity.fourierPolynomial (Finset.Icc 1 (H / 3)) (fun _ ↦ 1) (fun n ↦ (n : ℤ)) α

/-- The strongly major arc `{α : ‖α‖_{ℝ/ℤ} ≤ T₀ / (3.6 π x)}` of Proposition 8.3. -/
def majorArc (x : ℕ) : Set (AddCircle (1 : ℝ)) :=
  {α | ‖α‖ ≤ T0 / (3.6 * Real.pi * x)}

/-- The integrand (8.11) is the product of the three named factors and the phase `e(-xα)`. -/
theorem representationIntegrand_eq (x H : ℕ) (α : AddCircle (1 : ℝ)) :
    representationIntegrand x H α = S1 x α ^ 2 * S0 x α * DK H α ^ 3 * fourier (-(x : ℤ)) α :=
  rfl

end TaoFivePrimes
Source
T. Tao, Every odd number greater than 1 is the sum of at most five primes, Math. Comp. 83 (2014), 997-1038, https://arxiv.org/abs/1201.6656, Section 8, eqs. (8.11)-(8.12) and the arc split following (8.16); Theorem 1.5 for T_0

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me