Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tao Lemma 4.3 — both zero-frequency bounds with the prime-counting input discharged

Proved
TaoFivePrimes.lemma43

by Johan Mercedes · Oct 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorynumber-theorytao-five-primes

Let x≥1x\ge1x≥1 be real, q≥1q\ge1q≥1 be an integer, and let η:R→R\eta:\mathbb R\to\mathbb Rη:R→R be a bounded nonnegative function supported in [0,1][0,1][0,1]. Put M=sup⁡t∈R∣η(t)∣M=\sup_{t\in\mathbb R}|\eta(t)|M=supt∈R​∣η(t)∣, using the pointwise supremum. Then

∣Sη,q(x,0)∣≤Mψ(x)≤1.04Mx.|S_{\eta,q}(x,0)|\le M\psi(x)\le1.04Mx.∣Sη,q​(x,0)∣≤Mψ(x)≤1.04Mx.

Moreover, if 0<c≤10<c\le10<c≤1, η\etaη is smooth and supported in [c,1][c,1][c,1], and cx≥108cx\ge10^8cx≥108, then

∣Sη,1(x,0)−x∫R∣η(t)∣ dt∣≤x40log⁡(cx)∫R∣η′(t)∣ dt.\left|S_{\eta,1}(x,0)-x\int_{\mathbb R}|\eta(t)|\,dt\right|\le\frac{x}{40\log(cx)}\int_{\mathbb R}|\eta'(t)|\,dt.​Sη,1​(x,0)−x∫R​∣η(t)∣dt​≤40log(cx)x​∫R​∣η′(t)∣dt.

The absolute values on the complex sums are Lean's complex norm. This gives both (4.3) and (4.4) of Tao's Lemma 4.3, with the slightly stronger closed threshold. Unlike the earlier Abel summation interface, this statement does not assume a bound for ψ\psiψ; that input is discharged by the separately proved unconditional Chebyshev estimate. The finite-sum domination, Rosser–Schoenfeld upper bound, and Abel summation proofs are reused from existing proved platform theorems.

Preamble
import Mathlib
import Definitions.Def_TaoFivePrimes_SmoothedExpSum

open MeasureTheory

Formal statement
theorem TaoFivePrimes.lemma43
    (eta : ℝ → ℝ) (q : ℕ) (x : ℝ) (hq : 1 ≤ q) (hx : 1 ≤ x)
    (hnonneg : ∀ t : ℝ, 0 ≤ eta t)
    (hbounded : BddAbove (Set.range (fun t : ℝ => |eta t|)))
    (hsupp : ∀ t : ℝ, t < 0 ∨ 1 < t → eta t = 0) :
    (‖TaoFivePrimes.smoothedExpSum eta q x 0‖ ≤
        sSup (Set.range (fun t : ℝ => |eta t|)) * Chebyshev.psi x ∧
      sSup (Set.range (fun t : ℝ => |eta t|)) * Chebyshev.psi x ≤
        1.04 * sSup (Set.range (fun t : ℝ => |eta t|)) * x) ∧
    (∀ c : ℝ, 0 < c → c ≤ 1 → ContDiff ℝ (⊤ : ℕ∞) eta →
      (∀ t : ℝ, t < c ∨ 1 < t → eta t = 0) → (10 : ℝ) ^ 8 ≤ c * x →
      ‖TaoFivePrimes.smoothedExpSum eta 1 x 0 -
        (((∫ t : ℝ, |eta t|) * x : ℝ) : ℂ)‖ ≤
        1 / (40 * Real.log (c * x)) * (∫ t : ℝ, |deriv eta t|) * x) := by sorry
Source
https://arxiv.org/pdf/1201.6656v4#page=16

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