A Source-Audited Human-Readable Reconstruction of the Riemann Hypothesis / GRH Lean Formalization

A source-audited, human-readable mathematical account of the Lean 4 formalization released on 20 November 2026, which claims a proof of the Riemann Hypothesis and of the Generalized Riemann Hypothesis for Dirichlet L-functions. The document is organized into eight parts by logical dependency (statements and reductions; the quantitative core; the p-adic/Iwasawa layer; the multiplicity machine; integral structures; the load-bearing wall; the sieve window and final assembly; and the status ledger) plus self-contained appendices. A direct audit of the author's 175,187-file Lean archive shows that the five top-level theorems in src/Main.lean are parameter-free: the structure OpenLiteratureStatements is instantiated in MainConclusion.lean and the row parameter is produced by an unconditional theorem in RowSrc.lean. An earlier "Caraiani universalization assumption" was a misreading of a structure type and is withdrawn. Every component is tagged as complete proof, proof sketch, or statement only. The analytic prerequisites (Euler products, Poisson summation, functional equations with root numbers, trivial zeros, reductions A/B) are derived in full; the quantitative core (t <= x^400) is transcribed line by line from the 126-line Lean source; all eighteen 2-adic tower propositions, the nine field-side layer statements, and the valuation-grid, window-sums, linear-algebra, finite-field, and bideterminant layers are proved from scratch; and the deep external inputs are reduced to five precisely named residual assertions. The document does NOT claim that the mathematical community has accepted the Riemann Hypothesis. The formal chain is closed relative to the three standard Lean axioms (propext, Classical.choice, Quot.sound); independent kernel replays (leanchecker, nanoda, con-leche, lean4lean) as reported by Andrew Sutherland (MIT) accepted the full export. Remaining human checks are definition faithfulness, kernel soundness of the toolchain, completion of two still-running verification items, and the absence of a peer-reviewed human-readable account.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24412167
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Source-Audited Human-Readable Reconstruction of the Riemann Hypothesis / GRH Lean Formalization

Chunping Zeng
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

A Source-Audited Human-Readable Reconstruction of the Riemann Hypothesis / GRH Lean Formalization

Chunping Zeng
preprint en

Abstract

A source-audited, human-readable mathematical account of the Lean 4 formalization released on 20 November 2026, which claims a proof of the Riemann Hypothesis and of the Generalized Riemann Hypothesis for Dirichlet L-functions. The document is organized into eight parts by logical dependency (statements and reductions; the quantitative core; the p-adic/Iwasawa layer; the multiplicity machine; integral structures; the load-bearing wall; the sieve window and final assembly; and the status ledger) plus self-contained appendices. A direct audit of the author's 175,187-file Lean archive shows that the five top-level theorems in src/Main.lean are parameter-free: the structure OpenLiteratureStatements is instantiated in MainConclusion.lean and the row parameter is produced by an unconditional theorem in RowSrc.lean. An earlier "Caraiani universalization assumption" was a misreading of a structure type and is withdrawn. Every component is tagged as complete proof, proof sketch, or statement only. The analytic prerequisites (Euler products, Poisson summation, functional equations with root numbers, trivial zeros, reductions A/B) are derived in full; the quantitative core (t <= x^400) is transcribed line by line from the 126-line Lean source; all eighteen 2-adic tower propositions, the nine field-side layer statements, and the valuation-grid, window-sums, linear-algebra, finite-field, and bideterminant layers are proved from scratch; and the deep external inputs are reduced to five precisely named residual assertions. The document does NOT claim that the mathematical community has accepted the Riemann Hypothesis. The formal chain is closed relative to the three standard Lean axioms (propext, Classical.choice, Quot.sound); independent kernel replays (leanchecker, nanoda, con-leche, lean4lean) as reported by Andrew Sutherland (MIT) accepted the full export. Remaining human checks are definition faithfulness, kernel soundness of the toolchain, completion of two still-running verification items, and the absence of a peer-reviewed human-readable account.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
A Source-Audited Human-Readable Reconstruction of the Riemann Hypothesis / GRH Lean Formalization — Chunping Zeng · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS