Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Under RH, ∑ρmρ/∣ρ∣2≤2+γ−log⁡4π\sum_{\rho} m_\rho/|\rho|^2 \le 2+\gamma-\log 4\pi∑ρ​mρ​/∣ρ∣2≤2+γ−log4π over nontrivial zeros

Proved
LandauCriterion.sum_multiplicity_div_normSq_zeros_le

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

analytic-number-theoryriemann-hypothesisriemann-zeta

Assume the Riemann hypothesis. Let ZZZ be a finite set of zeros ρ\rhoρ of the Riemann zeta function ζ\zetaζ with Re⁡ρ>0\operatorname{Re}\rho>0Reρ>0 (that is, nontrivial zeros), and for each ρ\rhoρ let mρm_\rhomρ​ be its multiplicity as a zero of ζ\zetaζ. Then

∑ρ∈Zmρ∣ρ∣2  ≤  2+γ−log⁡(4π),\sum_{\rho\in Z}\frac{m_\rho}{|\rho|^2}\;\le\;2+\gamma-\log(4\pi),ρ∈Z∑​∣ρ∣2mρ​​≤2+γ−log(4π),

where γ\gammaγ is the Euler–Mascheroni constant (2+γ−log⁡4π≈0.04622+\gamma-\log 4\pi\approx 0.04622+γ−log4π≈0.0462).

Under RH one has ∣ρ∣2=ρ(1−ρ)|\rho|^2=\rho(1-\rho)∣ρ∣2=ρ(1−ρ) for every nontrivial zero, and the constant 2+γ−log⁡4π2+\gamma-\log 4\pi2+γ−log4π equals ∑ρ1ρ(1−ρ)=2∑ρRe⁡1ρ\sum_\rho\frac{1}{\rho(1-\rho)}=2\sum_\rho\operatorname{Re}\frac1\rho∑ρ​ρ(1−ρ)1​=2∑ρ​Reρ1​, the sum over all nontrivial zeros counted with multiplicity; so the bound is sharp. It controls, with an explicit leading constant, the sum over zeros in the explicit formula for the Riesz mean ψ1(x)=∑n≤xΛ(n)(x−n)\psi_1(x)=\sum_{n\le x}\Lambda(n)(x-n)ψ1​(x)=∑n≤x​Λ(n)(x−n), which is what the Massias–Nicolas–Robin criterion for Landau's function requires.

Formalization Note The multiplicity mρm_\rhomρ​ is analyticOrderNatAt riemannZeta ρ; ∣ρ∣|\rho|∣ρ∣ is the complex norm. Since ζ(1)≠0\zeta(1)\neq0ζ(1)=0, the condition excludes ρ=1\rho=1ρ=1.

Preamble
import Mathlib
Formal statement
namespace LandauCriterion
theorem sum_multiplicity_div_normSq_zeros_le (hRH : RiemannHypothesis) (Z : Finset ℂ)
    (hZ : ∀ ρ ∈ Z, riemannZeta ρ = 0 ∧ 0 < ρ.re) :
    ∑ ρ ∈ Z, (analyticOrderNatAt riemannZeta ρ : ℝ) / ‖ρ‖ ^ 2 ≤
      2 + Real.eulerMascheroniConstant - Real.log (4 * Real.pi) := by sorry
end LandauCriterion
Source
H. Davenport, Multiplicative Number Theory, 3rd ed., GTM 74 (Springer, 2000), Chapter 12: the constant B in the Hadamard product of ξ satisfies B = −Σ_ρ Re(1/ρ) and B = −γ/2 − 1 + (1/2) log 4π; under RH, Re(1/ρ) = 1/(2|ρ|²), so Σ_ρ m_ρ/|ρ|² = 2 + γ − log 4π. Auxiliary lemma for the formal proof of the criterion of J.-P. Massias, J.-L. Nicolas, G. Robin, "Évaluation asymptotique de l'ordre maximum d'un élément du groupe symétrique", Acta Arith. 50 (1988), 221–242; as quoted in Wikipedia, "Landau's function", revision oldid=1303222269 (https://en.wikipedia.org/w/index.php?title=Landau%27s_function&oldid=1303222269), sentence "The statement that ln g(n) < sqrt(Li^{-1}(n)) for all sufficiently large n is equivalent to the Riemann hypothesis".

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