The Riemann hypothesis,
open to inspection.
Levent Alpöge’s submitted Lean argument claims the Riemann hypothesis and the stated Dirichlet L-function results. Read the complete source, inspect the exact theorem, or independently run the pinned checker on your own computer.
Every nontrivial zeta zero has real part ½.
ζ(s) = 0, s ∉ {−2, −4, −6, …}, s ≠ 1 ⇒ Re(s) = ½
Here s is a complex number. The negative even integers are the trivial zeros; s = 1 is excluded. The claim concerns every other zero, at any height.
Exact Lean statement
theorem riemannHypothesis : RiemannHypothesis := rhOfAll -- RiemannHypothesis in the pinned mathlib: ∀ (s : ℂ) (_ : riemannZeta s = 0) (_ : ¬∃ n : ℕ, s = -2 * (n + 1)) (_ : s ≠ 1), s.re = 1 / 2
Run the check. Keep the evidence.
The Python checker verifies the source fingerprint, installs the pinned Lean tools and dependencies, compiles the proof, audits the exported theorems’ axioms, and writes a local certificate with logs, hashes, and measured CPU time.
Download the checker, then run:
python3 verify_proof.py --yes
To use a source archive you already downloaded, add --archive lean-sources.tar.gz. Rerun the same command to resume an interrupted build; use --fresh for a new project build. Full verification can be lengthy.
Run statistics without installing Lean
python3 proof_stats.py lean-sources.tar.gz --output statistics.json
The same script also accepts the TXT archive or an extracted source folder.
A certificate records a local run and its assumptions. Its digest detects report changes; it is not an identity signature. You can rerun the same source and compiler to check the result yourself.
Counts include comments and blank lines. Dependencies and generated files are excluded.
Follow this proof’s final assembly.
Start from the claimed upstream inputs and trace how the code reaches RH. Select a step for an explanation and a direct link to its source.
This reading guide is inferred from the submitted definitions and theorem applications. Large internal arguments are collapsed. Step cards show logical relationships; the quantitative layer chart below measures unique source lines. The compilation report below separately records what has been verified on this computer.
Verification pending
A successful typecheck has not yet been established.
Start with the statements
The archive in numbers
Compilation time
A completed full-proof typecheck time is not yet available.
Source size by dependency layer
Layer 0 is Main.txt. A file’s layer is its shortest import distance from Main. Each file belongs to one layer, even when many modules import it.
Bar width is proportional to physical source lines on one linear scale, starting at zero. Colors divide each layer by source section. Counts include comments and blank lines; external dependencies are excluded.
Inspect the exact layer totals
Largest source files in this layer
Where the proof’s size comes from
Rectangle area is directly proportional to source lines. Open a folder to see its contents at the same exact proportions within that folder; select a file to read it.
Browse the folders and exact counts
Inspect imports between source sections
A web of source dependencies
Each connection represents explicit imports between project modules. Circle area is directly proportional to each section’s source line count. Connections indicate imports and have uniform width. Select a section to browse its files.
Inside the archive
Text copies preserve the original source bytes. A claimed result is not a verified proof until the complete required sources pass the compiler and their dependencies are checked.
Explore the dependencies.
Inspect a file’s imports and the modules that use it. This graph is extracted from source imports; it is not a kernel-level analysis of proof terms.