Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Summed paired high-zero bound for Proposition 7.2

Proved
TaoFivePrimes.prop72_high_zero_pair_bound

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

explicit-formulanumber-theoryodd-goldbach

Let η\etaη be smooth, nonnegative and supported on [1/4,1][1/4,1][1/4,1], y≥4000y\ge4000y≥4000, and ∣θ∣≤T0/(4πy)|\theta|\le T_0/(4\pi y)∣θ∣≤T0​/(4πy). Sum the multiplicity-weighted Mellin pairs over actual nontrivial zeta zeros with positive ordinate greater than T0T_0T0​. This series is summable and

∣∑γ>T0m(ρ)(M(ρ)+M(ρ‾))∣≤(60∥η∥1+32∥η′∥1+4∥η′′∥1)ylog⁡T03T0.\left|\sum_{\gamma>T_0}m(\rho)\bigl(M(\rho)+M(\overline\rho)\bigr)\right|\le\left(60\|\eta\|_1+32\|\eta'\|_1+4\|\eta''\|_1\right)\frac{y\log T_0}{3T_0}.​γ>T0​∑​m(ρ)(M(ρ)+M(ρ​))​≤(60∥η∥1​+32∥η′∥1​+4∥η′′∥1​)3T0​ylogT0​​.

This is the high-zero contribution needed for Proposition 7.2, separately from the explicit formula and finite low-zero RH clause.

Preamble
import Definitions.Def_TaoFivePrimes_Prop72HighZeroTerms
import Mathlib.Analysis.Calculus.ContDiff.Deriv
import Mathlib.Analysis.Normed.Group.InfiniteSum
open MeasureTheory
Formal statement
theorem TaoFivePrimes.prop72_high_zero_pair_bound
    (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)) :
    Summable (TaoFivePrimes.prop72HighZeroPairTerm eta y theta) ∧
    ‖∑' rho, TaoFivePrimes.prop72HighZeroPairTerm eta y theta rho‖ ≤
      (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, https://arxiv.org/html/1201.6656v4, Proposition 7.2, (7.4), high-zero estimate (7.5) and the inverse-square tail at the end of its proof.

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