Andrew Sutherland Releases Verification Results for the Lean Formalization of the Riemann Hypothesis
Andrew Sutherland has published the verification results for the Lean formalization of the Riemann Hypothesis. All 175,187 modules compiled successfully and were replayed module by module through the Lean kernel. nanoda, con-leche, and lean4lean accepted the complete exported proof, and the five core theorems depend only on the three standard axioms propext, Classical.choice, and Quot.sound. The results show only that these Lean-formalized statements hold under the Mathlib definitions and the kernels used; checks with some default Lean kernels and the lake comparator are still underway.
Why read this
SelectedAI score 89
Multiple independent kernels and module-by-module checks provide cross-verification, while the build environment, path dependencies, and outstanding checks are also explicitly listed.
AI Trends