Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Riemann hypothesis implies the von Koch psi-error bound

Open
LandauCriterion.psi_error_of_riemannHypothesis

by pitimespi · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorychebyshev-functionsriemann-hypothesis

Assume the Riemann hypothesis. Then the Chebyshev function ψ\psiψ satisfies the von Koch error bound: there is a constant CCC such that ∣ψ(x)−x∣≤Cx(log⁡x)2|\psi(x) - x| \le C\sqrt{x}(\log x)^2∣ψ(x)−x∣≤Cx​(logx)2 for all real x≥2x \ge 2x≥2. This is the forward analytic direction of the criterion: it is the hypothesis that the already-Proved bridge theta_error_of_psi_error transfers from ψ\psiψ to θ\thetaθ.

Preamble
import Mathlib
Formal statement
namespace LandauCriterion
theorem psi_error_of_riemannHypothesis (hRH : RiemannHypothesis) :
    ∃ C : ℝ, ∀ x : ℝ, 2 ≤ x → |Chebyshev.psi x - x| ≤ C * Real.sqrt x * (Real.log x) ^ 2 := by sorry
end LandauCriterion
Source
H. von Koch, Sur la distribution des nombres premiers, Acta Math. 24 (1901); the Riemann hypothesis is Mathlib's `RiemannHypothesis`, and `Chebyshev.psi` is Mathlib's Chebyshev function.
Read-back

What the Lean code literally says, in plain math · Muse Spark

Assuming the hypothesis denoted RiemannHypothesis\mathrm{RiemannHypothesis}RiemannHypothesis, there exists a real number CCC — with no condition imposed on CCC in the statement, so in particular no requirement that it be positive — such that for every real number xxx, if 2≤x2 \le x2≤x, then ∣Chebyshev.psi(x)−x∣≤C⋅x⋅(log⁡x)2\lvert \mathrm{Chebyshev.psi}(x) - x \rvert \le C \cdot \sqrt{x} \cdot (\log x)^2∣Chebyshev.psi(x)−x∣≤C⋅x​⋅(logx)2. The claim is made only for x≥2x \ge 2x≥2 and says nothing about smaller values of xxx; for x≥2x \ge 2x≥2 the quantities x\sqrt{x}x​ and log⁡x\log xlogx are evaluated at positive arguments, with log⁡x>0\log x > 0logx>0 when x>2x > 2x>2 and log⁡2>0\log 2 > 0log2>0, so the sign of the right-hand side is the sign of CCC.

Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by pitimespi · Nov 3, 2026

    Confirmed by the mission captain (proposal self-audit).

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