Lean 與 Mathlib 社群確認黎曼猜想的 Lean 證明通過查核
Lean verification of the Riemann Hypothesis
黎曼猜想的證明很長,光是能編譯成功,還不能確定它證明的命題正確。
- Lean 與 Mathlib 社群表示,Levent Alpöge 在 2026 年 11 月 20 日發布的證明包含 1,700 萬行程式碼,並由社群多人重複編譯。宣告說,兩種工具確認程式證明的正是 Mathlib 收錄的黎曼猜想。
- Lean 官方核心與多個獨立證明檢查器也檢查了匯出的證明。這些查核分別確認命題、程式和證明本身,讓社群有根據地認可這項成果。
AI 伴隨問答
針對這篇報導有疑問?可直接點選快捷問題或向 AI 追問背景脈絡與技術細節:
這份聯合宣告說明社群如何分別檢查定理內容、程式編譯與證明有效性,呈現大型數學證明的多層查核方式。
Lean verification of the Riemann Hypothesis
Joint statement by the Lean and Mathlib communities, endorsed by the Lean FRO and the Mathlib Initiative.
On November 20, 2026, Levent Alpöge released a proof of the Riemann Hypothesis as a Lean library comprising 17 million lines of code.
We have full confidence that Alpöge's proof of the Riemann Hypothesis is correct, and we congratulate him on this achievement.
Our rationale is outlined below.
The codebase depends directly only on Mathlib. Over the past day, the Lean and Mathlib communities have rallied to verify the proof's correctness. We hereby certify that both the statement and the proof 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.
- The statement of the Riemann Hypothesis is correct. This statement is part of Mathlib: RiemannHypothesis and has been carefully vetted by experts in Lean and number theory.
- Alpöge’s library compiles correctly. By now, dozens of people have reported correct compilation of the codebase, reproducing the same raw proof export file. The library compiles without errors or build failures.
-
The code proves the correct statement. Crucially, the community has added a file that isolates the statement of the Riemann Hypothesis and imports only Mathlib. That statement was compared against the theorem proved by Alpöge using two independent tools (
comparatorandcon-leche –compare), both confirming that the theorem proved in Alpöge’s library is exactly Mathlib’s statement of the Riemann Hypothesis. -
The Lean proof is valid. The exported raw proof has been checked by several proof checkers, including Lean’s official kernel, the
con-lecheandcon-roncheckers, and several independent checkers contributed by third parties and implemented in different programming languages. The checkerscon-lecheandcon-roncome with a formal proof, relative to set theory, that they cannot accept a false proof, thus addressing concerns that Lean’s logic itself might have flaws that the proof could exploit. An extensive overview is available at https://math.mit.edu/~drew/grh/. These checks ran on an inert export of the proof, out of reach of hypothetical malicious code in the Lean proof sources.
Thanks are owed to everyone in the community who provided resources for the verification.
We look forward to all the activity in the mathematical community that will help explain the new ideas in this proof.