IT之家 11 月 22 日消息,11 月 21 日,Lean 與 Mathlib 社區發佈聯合聲明,稱萊文特・阿爾波格(Levent Alpöge)以 Lean 庫形式給出的黎曼猜想證明已經通過核驗,該證明的代碼約 1700 萬行。(IT 之家注:Lean 是交互式定理證明器,可逐行機械核驗數學推理是否符合邏輯公理。)

聲明由 Lean 與 Mathlib 社區聯合發佈,並獲 Lean FRO 與 Mathlib Initiative 背書。聲明稱,阿爾波格的庫僅直接依賴 Mathlib;過去一天內,Lean 與 Mathlib 社區已參與驗證。
聲明列出四項核驗標準,並稱這幾項標準均已滿足:
陳述正確:證明所用的陳述來自 Mathlib 的 RiemannHypothesis,已由 Lean 與數論專家審核;
代碼可編譯:數十人報告編譯通過,並復現出相同的原始證明導出文件;
證明對應正確陳述:社區新增一個僅導入 Mathlib 的文件以隔離該陳述,再用 comparator 和 con-leche –compare 兩套獨立工具比對,確認庫中證明的定理與 Mathlib 的陳述完全一致;
證明有效:原始導出文件經多個證明檢查器檢驗,包括 Lean 官方內核、con-leche、con-ron,以及第三方以不同編程語言實現的檢查器。
聲明特別提到,con-leche 與 con-ron 附帶相對集合論的形式化證明,因此可以保證它們不會接受錯誤證明,這也回應了“Lean 邏輯本身可能存在漏洞”的擔憂。上述檢查在惰性導出文件上運行,不受源碼中潛在惡意代碼影響。
聲明最後稱,感謝為驗證提供資源的社區成員,並期待數學界後續工作解釋該證明中的新思路。
IT之家注:黎曼猜想由德國數學家伯恩哈德 · 黎曼於 1859 年提出,認為看似隨機分佈在數軸上的質數,實際上遵循著複雜而有意義的規律。此後,黎曼猜想成為整個數論研究領域的重要指引,也是數學界最著名的未解難題。
IT之家附聲明原文及譯文:
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 ( and ), both confirming that the theorem proved in Alpöge’s library is exactly Mathlib’s statement of the Riemann Hypothesis. comparatorcon-leche –compare
The Lean proof is valid. The exported raw proof has been checked by several proof checkers, including Lean’s official kernel, the and checkers, and several independent checkers contributed by third parties and implemented in different programming languages. The checkers and come 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. con-lechecon-roncon-lechecon-ron
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.
Lean 對黎曼猜想的驗證
Lean 與 Mathlib 社區聯合聲明,由 Lean FRO 與 Mathlib Initiative 背書。
2026 年 11 月 20 日,萊文特・阿爾波格(Levent Alpöge)在發佈了一項黎曼猜想的證明,該證明以包含 1700 萬行代碼的 Lean 庫形式呈現。
我們完全相信阿爾波格的黎曼猜想證明是正確的,並對這一成就表示祝賀。
我們的依據如下。
該代碼庫僅直接依賴 Mathlib。在過去一天裡,Lean 與 Mathlib 社區齊心協力核驗了該證明的正確性。我們特此認證:黎曼猜想的陳述與證明均是正確的。四項標準均已滿足。
黎曼猜想的陳述是正確的。該陳述是 Mathlib 的一部分,並已由 Lean 與數論領域的專家仔細審核。
阿爾波格的庫可以正確編譯。目前已有數十人報告代碼庫編譯正確,並復現出同一份原始證明導出文件。該庫編譯無錯誤,也沒有構建失敗。
代碼證明的是正確的陳述。關鍵在於,社區新增了一個文件,用於隔離黎曼猜想的陳述,並且只導入 Mathlib。該陳述已使用兩套獨立工具(comparator 與 con-leche –compare),與阿爾波格所證明的定理進行比對,兩者均確認:阿爾波格庫中所證明的定理正是 Mathlib 對黎曼猜想的陳述。
Lean 證明是有效的。導出的原始證明已通過多個證明檢查器的檢驗,包括 Lean 官方內核、con-leche 與 con-ron 檢查器,以及第三方貢獻的、以不同編程語言實現的若干獨立檢查器。con-leche 與 con-ron 附帶相對於集合論的形式化證明,證明它們不可能接受錯誤的證明,從而回應了“Lean 的邏輯本身可能存在缺陷、並可能被該證明利用”的擔憂。這些檢查是在該證明的惰性導出文件上運行的,因此不會接觸到 Lean 證明源碼中假設存在的惡意代碼。
我們期待數學界接下來的各項工作,幫助解釋這一證明中的新思路。
相關閱讀:
來源:IT之家


