Lean and Mathlib say they certified a Riemann formalization

On Nov. 21 the Lean and Mathlib communities, with the Lean FRO and the Mathlib Initiative, said they certify that Levent Alpöge's Lean library states and proves Mathlib's Riemann hypothesis, citing compilation, a statement match by comparator and con-leche, and checks by Lean's kernel, con-leche, and con-ron. Andrew Sutherland's MIT page, updated Nov. 22 at 16:20 UTC, reports that nanoda, con-leche, con-ron's compare mode, and lean4lean accepted or passed their checks, while the lake comparator run and the Lean-kernel replay of the export were still running. The pages do not say the Clay prize process has accepted the argument, and the MIT page limits the generalized case it checked to Dirichlet L-functions.

/ Sources

/ About this story

Compiled by Venture Atlas from the sources above, using automated AI-assisted research. This is a summary of reporting published elsewhere, not original reporting - follow the source links for the full account. See our editorial standards.

Something wrong here? Email apostructura@gmail.com and we will fix it.

/ Related