◂ 返回本书◂ Back to the book

ZETA//CRITICAL

临界线上的对称:黎曼猜想是如何被证明的Symmetry on the Critical Line: How the Riemann Hypothesis Is Proved · 交互可视化Interactive visualizations

把书中的关系结构,做成可以操作的对象The relations in the book, as objects you can operate

每个可视化都链接到所依据的书中章节、riemann-hypothesis 中的 Lean 声明及页面计算。Each visualization links to the book sections, Lean declarations in riemann-hypothesis, and computations it draws on.

动画只改变看法,真值以 Lean 内核验证为准animation changes the view; truth rests on the Lean kernel

  • LEAN ✓riemann-hypothesis 中的 Lean 定理Lean theorem in riemann-hypothesis
  • THEORY书中章节与理论条目book section or theory entry
  • NUM页面上的数值计算,不是证明computed on the page, not a proof

索引Index

4 个已发布 · 按登记顺序4 published · in registry order

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

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.

  • Theta 提升
  • 贝塞尔周期
  • 赫克特征
  • 格斜率
  • 第四章
  • 第五章
  • theta lifts
  • Bessel periods
  • Hecke characters
  • lattice slopes
  • chapter 4
  • chapter 5
登记ADDED 2026-11-21进入ENTER ▸

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

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.

  • 贝伦德集合
  • 三项等差数列
  • 球壳
  • 鸽巢原理
  • 第六章
  • Behrend sets
  • 3-term progressions
  • spherical shells
  • pigeonhole principle
  • chapter 6
登记ADDED 2026-11-21进入ENTER ▸

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

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.

  • 内核重放
  • 内容寻址
  • 分片
  • 公理审计
  • Comparator
  • 第七章
  • kernel replay
  • content addressing
  • shards
  • axiom audit
  • Comparator
  • chapter 7
登记ADDED 2026-11-21进入ENTER ▸