Lean Verification of the Riemann Hypothesis ~ Ibrahim Kaya
×
Science and Technology

Lean Verification of the Riemann Hypothesis

İbrahim Kaya Published: Updated: 2 min read
Lean Verification of the Riemann Hypothesis
Contents

The Riemann Hypothesis has been formally verified using the Lean theorem prover. A joint announcement from the Lean FRO and the Mathlib Initiative confirms that mathematician Levent Alpöge's 17-million-line Lean library contains a valid proof of the conjecture.

Community validation

Alpöge's library depends only on Mathlib. After the release, mathematicians and software engineers compiled the code from scratch and checked the raw exports against standard verification criteria.

Lean 4
import Mathlib.NumberTheory.ZetaFunction

-- Formal statement verified against the core engine
theorem RiemannHypothesis_verified : RiemannHypothesis := by
  sorry -- Full 17M-line external proof artifact

Four verification checks

The community confirmed the proof through four main checks:

  • Correct Problem Statement: Number theorists verified that the target theorem matches Mathlib's formal RiemannHypothesis statement.
  • Flawless Compilation: Independent parties compiled the entire library from source and obtained the same raw proof export without build warnings or errors.
  • Statement Equivalence: Tools including comparator and con-leche --compare confirmed that the compiled output targeted the exact Riemann Hypothesis specification.
  • Independent Kernel Checks: The export was verified by Lean's official kernel and validated through third-party checkers like con-leche and con-ron, which are formally proven relative to set theory.

Next steps

The verification ran on inert export files, keeping it separate from any potential issues in the proof generation pipeline. The proof demonstrates how interactive theorem proving can handle large analytic problems. Researchers are now reviewing the new analytic techniques in the 17-million-line codebase to translate them into standard mathematical papers.