Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

High-zero error after the actual explicit formula, quarter-support Proposition 7.2

Proved
TaoFivePrimes.prop72_high_zero_error_after_explicit_formula

by raresbuhai · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

explicit-formulanumber-theorytao-five-primes

Let T0=3.29×109T_0=3.29\times10^9T0​=3.29×109. Let η\etaη be smooth and nonnegative, supported on [1/4,1][1/4,1][1/4,1], let y≥4000y\ge4000y≥4000, and assume ∣θ∣≤T0/(4πy)|\theta|\le T_0/(4\pi y)∣θ∣≤T0​/(4πy). Put

E=Sη,1(y,θ)−y∫Rη(t)e(θyt) dt,J=y∫Rη(t)e(θyt)(yt)3−yt dt.E=S_{\eta,1}(y,\theta)-y\int_{\mathbb R}\eta(t)e(\theta yt)\,dt,\qquad J=y\int_{\mathbb R}\frac{\eta(t)e(\theta yt)}{(yt)^3-yt}\,dt.E=Sη,1​(y,θ)−y∫R​η(t)e(θyt)dt,J=y∫R​(yt)3−ytη(t)e(θyt)​dt.

Let LLL be the paired contribution of the actual nontrivial zeros through height T0T_0T0​, with analytic-order multiplicities, as defined in TaoFivePrimes_Prop72ZeroTerms. After the explicit-formula identity removes the low zeros and the archimedean integral, the high-zero error satisfies

∣E+L+J∣≤(60∫η+32∫∣η′∣+4∫∣η′′∣)log⁡T03T0y.|E+L+J|\le\left(60\int\eta+32\int|\eta'|+4\int|\eta''|\right)\frac{\log T_0}{3T_0}y.∣E+L+J∣≤(60∫η+32∫∣η′∣+4∫∣η′′∣)3T0​logT0​​y.

This is the remaining analytic estimate in a reduction of the existing smooth quarter-support Proposition 7.2 node. It includes the conversion from the actual zeta explicit formula and the summed high-zero bound. The low-zero contribution and the archimedean norm bound are separate children. No numerical RH hypothesis occurs in this analytic statement.

Preamble
import Definitions.Def_TaoFivePrimes_Prop72ZeroTerms
import Mathlib.Analysis.Calculus.ContDiff.Defs
open MeasureTheory
Formal statement
theorem TaoFivePrimes.prop72_high_zero_error_after_explicit_formula
    (eta : ℝ → ℝ) (hsmooth : ContDiff ℝ (⊤ : ℕ∞) eta)
    (hnonneg : ∀ t, 0 ≤ eta t)
    (hsupp : ∀ t, eta t ≠ 0 → t ∈ Set.Icc (1 / 4 : ℝ) 1)
    (y : ℝ) (hy : 4000 ≤ y) (theta : ℝ)
    (hup : |theta| ≤ TaoFivePrimes.T0 / (4 * Real.pi * y)) :
    ‖TaoFivePrimes.smoothedExpSum eta 1 y theta -
        (y : ℂ) * (∫ t : ℝ, (eta t : ℂ) * TaoFivePrimes.expCircle (theta * y * t)) +
      TaoFivePrimes.prop72LowZeroPairSum eta y theta +
      (y : ℂ) * (∫ t : ℝ, (eta t : ℂ) * TaoFivePrimes.expCircle (theta * y * t) /
        (((y * t) ^ 3 - y * t : ℝ) : ℂ))‖ ≤
      (60 * (∫ t : ℝ, eta t) + 32 * (∫ t : ℝ, |deriv eta t|) +
        4 * (∫ t : ℝ, |deriv (deriv eta) t|)) *
        (Real.log TaoFivePrimes.T0 / (3 * TaoFivePrimes.T0)) * y := by sorry
Source
Terence Tao, Every odd number greater than 1 is the sum of at most five primes, arXiv:1201.6656v4, Section 7, Proposition 7.1 equation (7.1), and the high-zero part of the proof of Proposition 7.2, equation (7.5), the twice-integrated nonstationary-phase estimate and displayed inverse-square zero-tail bound. https://arxiv.org/html/1201.6656v4

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