Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tao Lemma 4.2: replacing a smooth cutoff by the sharp truncation costs ∥η′∥L1\|\eta'\|_{L^1}∥η′∥L1​

Proved
TaoFivePrimes.smoothedExpSum_le_deriv_L1_mul_sharp

by Hartmann_Psi · Sep 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theoryexponential-sumsgoldbachnumber-theory

For a cutoff η\etaη, a modulus q0q_0q0​, a scale xxx and a frequency α\alphaα, write

Sη,q0(x,α)  =  ∑nΛ(n) e(αn) 1(n,q0)=1 η ⁣(nx),S_{\eta,q_0}(x,\alpha)\;=\;\sum_{n}\Lambda(n)\,e(\alpha n)\,\mathbf 1_{(n,q_0)=1}\,\eta\!\left(\frac nx\right),Sη,q0​​(x,α)=n∑​Λ(n)e(αn)1(n,q0​)=1​η(xn​),

where Λ\LambdaΛ is the von Mangoldt function and e(t)=e2πite(t)=e^{2\pi i t}e(t)=e2πit.

Let η\etaη be smooth, compactly supported and vanishing on [1,∞)[1,\infty)[1,∞), and let x≥1x\ge1x≥1. Suppose the unsmoothed partial sums are uniformly bounded by BBB:

∣∑n≤NΛ(n) e(αn) 1(n,q0)=1∣  ≤  Bfor every N≤x.\Bigl|\sum_{n\le N}\Lambda(n)\,e(\alpha n)\,\mathbf 1_{(n,q_0)=1}\Bigr|\;\le\;B\qquad\text{for every }N\le x .​n≤N∑​Λ(n)e(αn)1(n,q0​)=1​​≤Bfor every N≤x.

Then

∣Sη,q0(x,α)∣  ≤  ∥η′∥L1(R)  B.\bigl|S_{\eta,q_0}(x,\alpha)\bigr|\;\le\;\|\eta'\|_{L^1(\mathbb R)}\;B .​Sη,q0​​(x,α)​≤∥η′∥L1(R)​B.

This is the transfer principle that lets an estimate for the sharp-cutoff exponential sum be carried over to the smoothed one, at the cost of the total variation of the cutoff. It is how the minor-arc bounds of Section 5, which are proved for sharp cutoffs, are applied to the smoothed sums used elsewhere.

Preamble
import Mathlib
import Definitions.Def_TaoFivePrimes_SmoothedExpSum

open MeasureTheory
Formal statement
theorem TaoFivePrimes.smoothedExpSum_le_deriv_L1_mul_sharp
    (eta : ℝ → ℝ) (q₀ : ℕ) (x alpha B : ℝ)
    (hx : 1 ≤ x) (heta : ContDiff ℝ (⊤ : ℕ∞) eta) (hcs : HasCompactSupport eta)
    (hsupp : ∀ t : ℝ, 1 ≤ t → eta t = 0)
    (hB : ∀ N : ℕ, N ≤ ⌊x⌋₊ →
      ‖∑ n ∈ Finset.range (N+1),
        (if Nat.Coprime n q₀ then
          (ArithmeticFunction.vonMangoldt n : ℂ) * TaoFivePrimes.expCircle (alpha * n)
         else 0)‖ ≤ B) :
    ‖TaoFivePrimes.smoothedExpSum eta q₀ x alpha‖
      ≤ (∫ u : ℝ, |deriv eta u|) * B := by sorry
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.6656, https://arxiv.org/abs/1201.6656, Section 4, Lemma 4.2

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