Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Full-circle mesoscopic L² bound for eta₁

Proved
TaoFivePrimes.minor_arc_L2_full_circle_8001

by marwahaha · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theoryfive-primeslarge-sievenumber-theory

Let xxx be an integer satisfying

8.7×1036≤x≤e3100,8.7\times 10^{36}\le x\le e^{3100},8.7×1036≤x≤e3100,

and put N0=4×1014N_0=4\times10^{14}N0​=4×1014 and m=⌊N0/3⌋m=\lfloor N_0/3\rfloorm=⌊N0​/3⌋. Let S1(x,α)S_1(x,\alpha)S1​(x,α) be Tao's sifted prime exponential sum with cutoff η1\eta_1η1​, and let

Dm(α)=∑1≤h≤me(hα).D_m(\alpha)=\sum_{1\le h\le m} e(h\alpha).Dm​(α)=1≤h≤m∑​e(hα).

Then the full-circle weighted second moment satisfies

∫R/Z∣S1(x,α)∣2∣Dm(α)∣2 dα≤8.001 m2x.\int_{\mathbb R/\mathbb Z} |S_1(x,\alpha)|^2 |D_m(\alpha)|^2\,d\alpha \le 8.001\,m^2x.∫R/Z​∣S1​(x,α)∣2∣Dm​(α)∣2dα≤8.001m2x.

This is the mesoscopic large-sieve input used before subtracting the mass on the strongly major arc.

Formalization Note The integer mmm is natural-number division N0/3N_0/3N0​/3, followed by coercion to the real numbers. Haar measure on the period-one additive circle is probability-normalized.

Preamble
import Definitions.Def_TaoFivePrimes_ArcSplit

open MeasureTheory
Formal statement
namespace TaoFivePrimes

theorem minor_arc_L2_full_circle_8001 (x : ℕ)
    (h1 : 87 * 10 ^ 35 ≤ x)
    (h2 : (x : ℝ) ≤ Real.exp 3100) :
    (∫ α, ‖S1 x α‖ ^ 2 * ‖DK (4 * 10 ^ 14) α‖ ^ 2
      ∂AddCircle.haarAddCircle) ≤
      8.001 * ((4 * 10 ^ 14 / 3 : ℕ) : ℝ) ^ 2 * x := by
  sorry

end TaoFivePrimes
Source
Terence Tao, “Every odd number greater than 1 is the sum of at most five primes,” Mathematics of Computation 83 (2014), 997–1038, arXiv:1201.6656v4, https://arxiv.org/abs/1201.6656. Proposition 4.10 and equation (4.15), specialized in Section 8 in the proof of Proposition 8.4 at the displayed 8.001 bound immediately after the definition H := floor(N₀/3); equation (8.3) gives ||η₁||∞ = 1.

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