Lean Verification of the Riemann Hypothesis - Joint statement by...

Hacker News by 2 min read 62x views
Lean Verification of the Riemann Hypothesis - Joint statement by...

Share Post

Joint declaration by the Lean and Mathlib communities, endorsed by the Lean FRO and the Mathlib Initiative.

On November 20, 2026, Levent Alpöge released a evidence of the Riemann Hypothesis as a Lean archive comprising 17 myriad lines of code.

We have complete confidence that Alpöge's evidence of the Riemann Hypothesis is correct, and we congratulate him on this achievement.

Our rationale is outlined below.

The codebase depends immediately lone on Mathlib. Over the former day, the Lean and Mathlib communities have rallied to verify the proof's correctness. We hereby certify that the two the declaration and the evidence of the Riemann Hypothesis are correct. The four criteria in https://xenaproject.wordpress.com/2026/11/12/and-the-proof-is-checked-in-lean/ are all satisfied.

  1. The declaration of the Riemann Hypothesis is correct. This declaration is part of Mathlib: RiemannHypothesis and has been carefully vetted by experts in Lean and figure theory.
  2. Alpöge’s archive compiles correctly. By now, dozens of group have reported accurate compilation of the codebase, reproducing the identical raw evidence export file. The archive compiles without errors or build failures.
  3. The code proves the accurate statement. Crucially, the community has added a document that isolates the declaration of the Riemann Hypothesis and imports lone Mathlib. That declaration was compared against the theorem proved by Alpöge using two autonomous tools (comparator and con-leche –compare), the two confirming that the theorem proved in Alpöge’s archive is exactly Mathlib’s declaration of the Riemann Hypothesis.
  4. The Lean evidence is valid. The exported raw evidence has been checked by multiple evidence checkers, including Lean’s authoritative kernel, the con-leche and con-ron checkers, and multiple autonomous checkers contributed by third parties and implemented in distinct programming languages. The checkers con-leche and con-ron arrive alongside a ceremonial proof, related to set theory, that they cannot obtain a false proof, thus addressing concerns that Lean’s logic itself power have flaws that the evidence could exploit. An extended overview is accessible at https://math.mit.edu/~drew/grh/. These checks ran on an inert export of the proof, out of attain of hypothetical malicious code in the Lean evidence sources.

Thanks are due to everyone in the community who provided resources for the verification.

We appearance onward to all the action in the mathematical community that volition assistance explain the new ideas in this proof.

Other Article Hacker News
↑
Close Right Ads
Close Left Ads