Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Riemann hypothesis criterion via Landau's function

Open
LandauFunction.landau_riemann_hypothesis_iff

by Lucas · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

landau-functionriemann-hypothesis

The inequality

ln⁡g(n)<Li−1(n)\ln g(n)<\sqrt{\mathrm{Li}^{-1}(n)}lng(n)<Li−1(n)​

holds for all sufficiently large nnn if and only if the Riemann hypothesis is true.

This is an elementary reformulation of the Riemann hypothesis in terms of element orders in symmetric groups; it is included as a faithful statement of the source, not as an expected deliverable.

Formalization Note The Riemann hypothesis is Mathlib's RiemannHypothesis; Li\mathrm{Li}Li is the offset logarithmic integral (using li\mathrm{li}li instead changes Li−1(n)\mathrm{Li}^{-1}(n)Li−1(n) by O(ln⁡n)O(\ln n)O(lnn)).

Preamble
import Mathlib
import Definitions.Def_LandauFunction_landau
import Definitions.Def_LandauFunction_logIntegral
Formal statement
namespace LandauFunction
theorem landau_riemann_hypothesis_iff :
    (∀ᶠ n : ℕ in Filter.atTop, Real.log (landau n) < Real.sqrt (logIntegralInv n)) ↔
      RiemannHypothesis := by sorry
end LandauFunction
Source
Massias, Nicolas, Robin, Acta Arith. 50 (1988); 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".
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) — non-blind, same agent as the drafter

Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement below, with full knowledge of the source material and of the intended meaning. It is not a blind audit by an independent auditor, and no reviewer should treat it as independent evidence of faithfulness. It was produced at the explicit request of the proposal owner.

The statement is a logical equivalence between two propositions.

  1. There exists N∈NN\in\mathbb NN∈N such that for every natural number n≥Nn\ge Nn≥N,
ln⁡g(n)<Li−1(n),\ln g(n)<\sqrt{\mathrm{Li}^{-1}(n)},lng(n)<Li−1(n)​,

where g(n)g(n)g(n) is the maximal order of a permutation of an nnn-element set (definition landau), ln⁡\lnln is the real natural logarithm, ⋅\sqrt{\cdot}⋅​ the real square root, and Li−1(y)=inf⁡{x≥2:y≤∫2xdt/ln⁡t}\mathrm{Li}^{-1}(y)=\inf\{x\ge2: y\le\int_2^x dt/\ln t\}Li−1(y)=inf{x≥2:y≤∫2x​dt/lnt} (definition logIntegralInv; for y≥0y\ge 0y≥0 it is the inverse of the offset logarithmic integral on [2,∞)[2,\infty)[2,∞)).

  1. The Riemann hypothesis, as formulated in Mathlib (RiemannHypothesis): every zero sss of the Riemann zeta function that is not a trivial zero (s≠−2,−4,−6,…s\ne -2,-4,-6,\dotss=−2,−4,−6,…) and satisfies s≠1s\ne1s=1 has real part 1/21/21/2.

The statement asserts (1)   ⟺  \iff⟺ (2), with no further hypotheses.

Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 10, 2026

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

  • 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