《临界线上的对称:黎曼猜想是如何被证明的》封面Cover of Symmetry on the Critical Line: How the Riemann Hypothesis Is Proved

ZETA//CRITICAL · v0.1.0

临界线上的对称:黎曼猜想是如何被证明的Symmetry on the Critical Line: How the Riemann Hypothesis Is Proved

一部面向直觉的 Lean 形式化导读An Intuitive Guide to the Formal Proof

这部中英双语专著导读 Levent Alpöge 用 Lean 4 完成的黎曼猜想及狄利克雷 L 函数广义黎曼猜想的证明。The Omega Institute 将证明源码托管于 the-omega-institute/riemann-hypothesis,该仓库派生自 Deicyde 的上游验证镜像 Deicyde/riemann-hypothesis。全书由序章、七章正文和尾声组成,配有脚本生成的静态插图(figures/)、四个交互式可视化(viz/)和两部带中英双语字幕的讲解影片(films/)。This bilingual monograph in Chinese and English guides readers through Levent Alpöge's Lean 4 proof of the Riemann Hypothesis and the Generalized Riemann Hypothesis for Dirichlet L-functions. The Omega Institute hosts the proof source in the-omega-institute/riemann-hypothesis, a fork of Deicyde's upstream verification mirror (Deicyde/riemann-hypothesis). The book comprises a prelude, seven chapters, and a coda, with script-generated static figures (figures/), four interactive visualizations (viz/), and two explainer films with Chinese and English subtitles (films/).

LEAN ✓定理Theorems
44
Lean 声明Lean declarations
45
OPEN开放问题Open problems
4
语言版本Editions
2
章节Chapters
9
作者Authors
The Omega Institute
版本Version
0.1.0
许可License
CC-BY-4.0
日期Date
2026-11-21
语言Language
中文 · English
riemann-hypothesis
0bcc9368e418

目录Contents

9 · 章节Chapters
  1. 序曲 临界线上的寂静
  2. 第一章 对称之镜:为什么只需清空右半平面LEAN ✓ 11
  3. 第二章 素数的影子与朗道陷阱:把零点变成符号问题LEAN ✓ 7
  4. 第三章 给整数求导:斯捷潘诺夫行列式与高重数梦境LEAN ✓ 5
  5. 第四章 面镜子:迭代 Theta 提升与跷跷板法则LEAN ✓ 5
  6. 第五章 冲破 天花板:格斜率、博斯特不等式与积分胶合LEAN ✓ 4
  7. 第六章 贝伦德塔与收网时刻:驯服余项与打通所有特征LEAN ✓ 8
  8. 第七章 一千七百万行代码的骨架:独立内核重放与数学诚实LEAN ✓ 4
  9. 终章 黎曼之后的群山OPEN 4
  10. 形式化验证账本LEAN ✓ 44
  1. Prelude Silence on the Critical Line
  2. Chapter 1 The Mirror at One-Half: Why Clearing the Right Half-Plane SufficesLEAN ✓ 11
  3. Chapter 2 The Prime Shadow and Landau's Trap: Turning Zeros into SignsLEAN ✓ 7
  4. Chapter 3 Differentiating the Integers: Stepanov's Determinant and the Dream of MultiplicityLEAN ✓ 5
  5. Chapter 4 A Chain of Mirrors: Iterated Theta Lifts and the Seesaw LawLEAN ✓ 5
  6. Chapter 5 Breaking the Ceiling: Lattice Slopes, Bost's Inequality, and Integral GluingLEAN ✓ 4
  7. Chapter 6 Behrend Towers and Closing the Net: Taming Obstructions Across All CharactersLEAN ✓ 8
  8. Chapter 7 Anatomy of 17 Million Lines: Independent Kernel Replay and Mathematical HonestyLEAN ✓ 4
  9. Coda The Mountains Beyond RiemannOPEN 4
  10. Verification ledgerLEAN ✓ 44

形式化验证Formal verification

LEAN ✓ 44 · OPEN 4

形式化依据:trureturing 提交Formal basis: trureturing commit 0bcc9368e418 · the-omega-institute/riemann-hypothesis

以下定理均引用 riemann-hypothesis 所钉提交中的 Lean 声明。

全部 44 条定理

开放问题与猜想

完整的形式化验证账本

Each theorem below cites a Lean declaration in riemann-hypothesis at the pinned commit.

All 44 theorems

Open problems and conjectures

Full verification ledger

交互可视化Interactive visualizations

全部可视化All visualizations ▸

临界之镜 · Re(s) = 1/2 把离线零点映成孪生,离线零点会冲破 √x 的堤坝Critical mirror · Re(s) = 1/2 mirrors every off-line zero into a twin, and an off-line zero would break the √x barrier

拖动假想零点 ρ = σ + it,观察函数方程如何把它映到 (1 − σ) + it。多余欧拉因子的零点示例沿 Re(s) = 0 排列。素数影子场景逐项计算冯·曼戈尔特函数的平滑和,并展示实部为 0.78 的假想零点所激起的波如何在 x ≈ 67 越过图中的 0.05√x 屏障。Drag a hypothetical zero ρ = σ + it to see how the functional equation reflects it to (1 − σ) + it. The illustrated zeros of extra Euler factors line up on Re(s) = 0. The prime-shadow scene computes a smoothed sum of the von Mangoldt function term by term and shows how the wave from a hypothetical zero with real part 0.78 crosses the plotted 0.05√x barrier near x ≈ 67.

LEAN ✓ riemannHypothesisLEAN ✓ rh_of_rightLEAN ✓ prim_reflectLEAN ✓ zetaLandau

Theta 链预算 · √X 面镜子单打独斗卡在 2/3,胶合一族才把屋顶压平Theta chain budget · a chain of √X mirrors stalls at 2/3 until a glued family flattens the roof

沿共用的时间轴调节链长预算 m/√X。Theta 提升链场景展示跷跷板如何把依赖赫克特征的提升周期换成不依赖该特征的贝塞尔周期。示意曲线中,单特征的无零点边界停在 2/3 上方,胶合一族近似正交的特征后可越过 2/3 并趋近 1/2。格斜率场景从秩 7 的滤过点计算 Harder–Narasimhan 多边形,并用最大斜率和体积给出短向量的长度上界。Adjust the chain budget m/√X on the shared timeline. The theta-lift scene shows how the seesaw trades a lift period that depends on the Hecke character for a Bessel period independent of it. On the illustrative curves, the zero-free boundary for a single character stalls above 2/3, while gluing a nearly orthogonal family takes it past 2/3 toward 1/2. The lattice scene computes the Harder–Narasimhan polygon of a rank-7 filtration and uses the maximal slope and covolume to bound the length of a short vector.

LEAN ✓ final_gaussOpLEAN ✓ bigCellMinorsLEAN ✓ shortVectorLEAN ✓ muMaxLeMin

贝伦德球壳 · 整数球壳上排不出三项等差数列Behrend sphere · no three-term progression on an integer shell

把立方体 {0, …, M − 1}³ 的格点按 R = x² + y² + z² 分层,球心在立方体的一个角。同一层球壳上任取两点 a ≠ b,中点 m = (a + b)/2 满足 ‖m‖² = R − ‖a − b‖²/4 < R。中点严格落在球内,所以壳上没有三项等差数列。M = 5 时 125 个点分在 32 层非空球壳上,格点最多的 R = 17 有 9 个点。转动玻璃球壳,点两个格点选出 a 与 b。Sort the lattice points of the cube {0, …, M − 1}³ into shells R = x² + y² + z², measured from a corner of the cube. Any two distinct points a and b on one shell have a midpoint m = (a + b)/2 with ‖m‖² = R − ‖a − b‖²/4 < R. The midpoint lies strictly inside the sphere, so the shell contains no three-term arithmetic progression. For M = 5 the 125 points lie on 32 nonempty shells, and the most populated shell, R = 17, holds 9 points. Rotate the glass shell and click two lattice points to choose a and b.

LEAN ✓ selectLEAN ✓ trivStabLEAN ✓ everyCharacter

证明重放 · 8,490 个内容寻址分片与零信任的本地内核重放Proof replay · 8,490 content-addressed shards and a zero-trust local kernel replay

CI 把 Main 的真实导入闭包切成 8,490 个分片、36 层依赖:17 个基础分片之后,529 个任务同时开工。分片 DAG 场景沿时间轴推动 CI 波,点任一分片即可看它的依赖锥并模拟改动:页面用 SHA-256 真算每个示意分片的内容键,改动后变了键的恰好是通往 Main 的失效锥,其余分片原样复用。零信任重放场景演示读者在自己机器上运行 ./verify Main:从 16 个 Release 拉回分片,依次经过 SHA-256、空白内核、公理审计与 Challenge 陈述比对,再到六个独立校验器;“试着作弊”注入伪造的 .olean、偷塞的 sorry 或改写的陈述,看哪一道关当场拦下。图上的分片布局与各关判决是示意模型,不是运行记录。CI cuts the real import closure of Main into 8,490 shards over 36 dependency levels: after 17 foundation shards, 529 jobs start at once. The shard DAG scene drives the CI wave along the rail; clicking a shard shows its dependency cone and simulates an edit: the page computes the SHA-256 content key of every illustrative shard, and the keys that change after the edit are exactly the invalidation cone up to Main, while every other shard is reused. The zero-trust replay scene follows a reader running ./verify Main on their own machine: the shards come from 16 Releases and pass SHA-256, an empty kernel, an axiom audit and the comparison with the Challenge statements before six independent checkers; the fault injector plants a forged .olean, a smuggled sorry or a tweaked statement and shows which gate stops it cold. The shard layout and the verdicts of the gates are an illustrative model, not a log of a run.

临界线与 √X 面镜子The Critical Line and √X Mirrors

函数方程让 Re(s) = 1/2 成为一面镜子;素数影子与朗道判据把零点变成增长;Stepanov 重数、约 √X 次 Theta 提升连成的链、被压平的 Harder–Narasimhan 屋顶与 Behrend 球一起收网,最后落在 Lean 定理 riemannHypothesis 上。The functional equation turns Re(s) = 1/2 into a mirror; the prime shadow and Landau's criterion turn zeros into growth; Stepanov's multiplicities, chains of about √X theta lifts, a flattened Harder–Narasimhan roof and Behrend's sphere close the net, ending on the Lean theorem riemannHypothesis.

2:13 · 2026-11-21

如何验证一千七百万行黎曼猜想证明Verifying 17 Million Lines of Lean

175,187 个 Lean 文件、17,374,215 行、没有一行注释:没有审稿人读得完,所以别信它,重放它。27 行的 Challenge.lean 以官方 Mathlib v4.33.1 锁定五条陈述;ci/plan.py 把 Main 切成 8,490 块以 SHA-256 内容寻址的分片,由公开 CI 发布到公开 Release;四行命令加上 leanchecker --fresh,让任何人都能在空白内核里重放并审计公理;六个检查器的离线评审路线则审查导出的副本(已完成演练,完整运行仍在进行中)。175,187 Lean files and 17,374,215 lines with no comments: no referee can read them, so do not trust them, replay them. The 27-line Challenge.lean fixes the five statements against official Mathlib v4.33.1; ci/plan.py cuts Main into 8,490 SHA-256 content-addressed shards that public CI publishes to open Releases; four commands and leanchecker --fresh let anyone replay them in an empty kernel and audit the axioms; and a six-checker route judges an exported copy offline (rehearsed; the full run is still in progress).

2:15 · 2026-11-21