Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unconditional high-zero remainder for quarter-support Proposition 7.2

Proved
TaoFivePrimes.prop72_high_zero_remainder

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). Write Lη,y,θL_{\eta,y,\theta}Lη,y,θ​ for the paired contribution of actual nontrivial zeta zeros in the verified-height range, with analytic-order multiplicities, and put

Aη=60∫η+32∫∣η′∣+4∫∣η′′∣.A_\eta=60\int\eta+32\int|\eta'|+4\int|\eta''|.Aη​=60∫η+32∫∣η′∣+4∫∣η′′∣.

After subtracting those low-zero terms from the von Mangoldt explicit formula, the remaining error satisfies

∣Sη,1(y,θ)−y∫Rη(t)e(θyt) dt+Lη,y,θ∣≤Aηlog⁡T03T0y+128y2∫Rη(t) dt.\left|S_{\eta,1}(y,\theta)-y\int_{\mathbb R}\eta(t)e(\theta yt)\,dt+L_{\eta,y,\theta}\right|\le A_\eta\frac{\log T_0}{3T_0}y+\frac{128}{y^2}\int_{\mathbb R}\eta(t)\,dt.​Sη,1​(y,θ)−y∫R​η(t)e(θyt)dt+Lη,y,θ​​≤Aη​3T0​logT0​​y+y2128​∫R​η(t)dt.

This is the unconditional analytic remainder needed by a reduction of the existing smooth quarter-support Proposition 7.2 node. The high-zero part retains Tao's 60,32,460,32,460,32,4 constants and inverse-square zero-tail factor. The archimedean term is kept explicitly: 2c−3y−2=128y−22c^{-3}y^{-2}=128y^{-2}2c−3y−2=128y−2 at c=1/4c=1/4c=1/4. No critical-line placement of low zeros is assumed in this statement.

Preamble
import Definitions.Def_TaoFivePrimes_Prop72ZeroTerms
import Mathlib.Analysis.Calculus.ContDiff.Defs
open MeasureTheory
Formal statement
theorem TaoFivePrimes.prop72_high_zero_remainder
    (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‖ ≤
      (60 * (∫ t : ℝ, eta t) + 32 * (∫ t : ℝ, |deriv eta t|) +
        4 * (∫ t : ℝ, |deriv (deriv eta) t|)) *
        (Real.log TaoFivePrimes.T0 / (3 * TaoFivePrimes.T0)) * y +
      (128 / y ^ 2) * (∫ t : ℝ, eta t) := 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 archimedean estimate and high-zero argument in the proof of Proposition 7.2, equations (7.4)-(7.5) and the 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