Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Chebyshev psi error on the middle range from finite-height RH

Proved
TaoFivePrimes.schoenfeld_psi_error_middle_of_rh

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

chebyshev-functionsexplicit-boundsnumber-theoryriemann-zeta

Write H=3.29⋅109H=3.29\cdot10^9H=3.29⋅109. Assume that every zero ρ\rhoρ of the Riemann zeta function satisfying 0<Re⁡ρ<10<\operatorname{Re}\rho<10<Reρ<1 and 0≤Im⁡ρ≤H0\le\operatorname{Im}\rho\le H0≤Imρ≤H lies on the critical line Re⁡ρ=1/2\operatorname{Re}\rho=1/2Reρ=1/2. Then for every real yyy with e23≤y<e136e^{23}\le y<e^{136}e23≤y<e136, the second Chebyshev function ψ(y)=∑n≤yΛ(n)\psi(y)=\sum_{n\le y}\Lambda(n)ψ(y)=∑n≤y​Λ(n) satisfies

∣ψ(y)−y∣≤y40log⁡y.|\psi(y)-y|\le\frac{y}{40\log y}.∣ψ(y)−y∣≤40logyy​.

This conditional intermediate covers the middle range needed to assemble the explicit Chebyshev error bound in Tao's five-primes argument. The hypothesis is precisely the zero-location clause of the existing finite-height verification; it does not assume the full Riemann hypothesis.

Preamble
import Mathlib.NumberTheory.Chebyshev
import Mathlib.NumberTheory.LSeries.RiemannZeta
import Mathlib.Analysis.SpecialFunctions.Exp
Formal statement
theorem TaoFivePrimes.schoenfeld_psi_error_middle_of_rh
    (hRH : ∀ s : ℂ, riemannZeta s = 0 → 0 < s.re → s.re < 1 →
      0 ≤ s.im → s.im ≤ 3.29 * 10 ^ 9 → s.re = 1/2)
    (y : ℝ) (hy : Real.exp 23 ≤ y) (hY : y < Real.exp 136) :
    |Chebyshev.psi y - y| ≤ y / (40 * Real.log y) := by sorry
Source
Derived conditional intermediate for T. Tao, arXiv:1201.6656v4, Theorem 1.5 and Section 4, proof of Lemma 4.3, https://arxiv.org/html/1201.6656v4#S4. The hypothesis is exactly the zero-location clause of the finite-height RH input; the interval and explicit implication are an independently derived specialization, not a verbatim quotation. Uses the published Prove2Me smoothed Chebyshev formula and zero reciprocal bounds in ExplicitPNT.DusartTable1.

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