Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Chebyshev psi error in the middle range from RH through height one million

Proved
TaoFivePrimes.schoenfeld_psi_error_middle_of_rh_million

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

chebyshev-functionsexplicit-boundsnumber-theoryriemann-zeta

Assume that every zero ρ\rhoρ of the Riemann zeta function satisfying 0<Re⁡ρ<10<\operatorname{Re}\rho<10<Reρ<1 and 0≤Im⁡ρ≤1060\le\operatorname{Im}\rho\le10^60≤Imρ≤106 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 Chebyshev error estimate in Tao's five-primes argument. Its finite-height hypothesis is weaker than the verified-height statement quoted by Tao; no global Riemann hypothesis is assumed.

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_million
    (hRH : ∀ s : ℂ, riemannZeta s = 0 → 0 < s.re → s.re < 1 →
      0 ≤ s.im → s.im ≤ 10 ^ 6 → 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 stated cutoff and implication are a derived strengthening, not a verbatim quotation. Uses the existing proved Prove2Me smoothed Chebyshev formula, explicit zero reciprocal estimates, and the proved zeta zero-free half-plane Re(s)>7/8.

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