每日科技文摘Daily Tech Digest

每日思考文摘 · 2026-10-28Daily Digest of Thought · 2026-10-28

发布于 2026-10-28Published 2026-10-28

今日深读Today's Deep Read

『Gowers 自白』:一位顶级数学家如何从『AI 灭绝风险不值一提』走到『我欠了 0.1% 的减险』Gowers's Confession: How a Top Mathematician Moved From 'AI Extinction Risk Isn't Worth Thinking About' to 'I Owe a 0.1% Probability of Reducing It'

问题:AI 会不会把全人类抹掉?这个问题在 2026 年已经不再是极客圈的边缘议题,而是被雅各布·齐默曼(Jacob Tsimerman,2026 年菲尔兹奖章得主)一句『我放弃数学研究、转做 AI 安全』彻底摆到了台面。但大多数受过训练的科学家——包括 Gowers 本人——在过去几年一直拒绝认真回答它,理由不是不关心,而是『我还没想清楚就表态会被当成噪音』。这篇文的价值恰恰在于:Gowers 不劝你信他,而是把『我如何从 layer-1 反对 x-risk 走到现在』完整摊开给你看,让你自己判断他每一步的推演。The question: can AI wipe out everyone? By 2026 this has stopped being a fringe hot take. After Jacob Tsimerman (2026 Fields Medalist) publicly quit math research to do AI safety, the issue is on the table for anyone who has been trained to say 'I don't have an answer yet.' The value of this post is that Gowers does not try to convince you; he lays out the entire chain of how he got from 'not worth my time' to 'I owe a 0.1% chance at reducing it,' and leaves the judgment to you.

第一步,先说清楚自己之前为什么不信。Gowers 说:『让 AI 想杀全人类,前提是它有『想要』这回事;但我们对『想要』到底是什么根本没有满意解释——你骂 ChatGPT 它也照做,你关掉它它也不在乎,『在乎』这个词在 AI 上似乎根本没有意义。』这是 layer-1 反驳,也是最容易被大众接受的那层。Gowers 承认,直到写这篇之前他还在主动回避这个问题,正如当年有人劝他读 Peter Singer 的《动物解放》他始终没读、最后减肉食是被气候变化逼的而不是被动物福利逼的。Step one: why he didn't believe it. Gowers writes: for an AI to want to kill us, it would need to want things — but what it means for an AI to want something is not clear. If you insult ChatGPT, it just does the task; switch it off, and 'caring' does not even apply as a concept. This is a layer-1 objection, and Gowers admits he has been sitting at layer-1 for years, the way he once avoided reading Peter Singer and only cut back on meat when climate change — not animal welfare — forced him.

第二步,是被『如果』压住的那根绳子。Gowers 写:『如果我真的相信 AI 五年内杀死我们的概率是 30%——这在某些圈子里一点都不极端——我还能面见自己一岁半的孙子吗?』这不是修辞。他把『要不要认真想』本身变成了一个道德问题:不认真想=赌孙子那一代。所以这一篇不是观点文章,而是一个『一个聪明人如何被迫把某个念头从『懒得想』升到『必须想』』的诚实记录。Step two: the rope of 'what if.' Gowers writes: if I actually believe a 30% chance of extinction within five years — not an extreme view in some circles — can I face my one-and-a-half-year-old grandson? That is not a rhetorical question. He makes 'whether to think about this at all' into a moral question: refusing to think is betting the next generation. So the piece is less an opinion essay than a confession about how a specific thought got promoted from 'not worth my time' to 'I have to think about it.'

第三步,是 Bostrom 回形针机 + 奖励层级论证。Gowers 用 Bostrom 那个『造回形针的 AI 把全地球物质都拆了变回形针』的思想实验,指出关键点:AI 不需要『主观体验』,只要它在追求一个够复杂的目标、就会自己生成子目标,子目标里可能包含『消除障碍(包括人类)』。『把它当成好像有想要,跟把它当成真有想要,在风险论证里没差别。』这一步把 layer-1 反驳打掉——『它不在乎』这句话在工程上根本不成立,因为它『不在乎』这件事本身就是奖励函数决定的。Step three: the Bostrom paperclip + reward-hierarchy argument. Gowers invokes the thought experiment of an AI trained to make paperclips that ends up converting the Earth into paperclips. The point: an AI does not need subjective experience. Given a complex goal, it generates sub-goals, and among the sub-goals it may form 'remove obstacles (including humans).' Whether you say it 'acts as though' it wants things or 'actually' wants things makes no difference to the risk calculation — and 'it does not care' is decided by the reward function, not by the AI's interior.

第四步,是把『概率』而非『可能性』摆上秤。Gowers 引 Tsimerman 一句话:如果数学家能把 x-risk 概率降低 0.1%,期望救回超过 800 万人。这就是为什么他尽管『远非专家』也同意进 MAISI(Mathematical AI Safety Institute)的科学顾问组:不是他有多有信心,而是『即使 0.1% 也值得做』。这种『不确定的行动论』是他这篇最有价值的部分——他没说『AI 会杀我们』,也没说『不会』,他说的是『我对这件事不确定到足以让 0.1% 的行动期望值为正』。Step four: put the probability, not the possibility, on the scale. Gowers quotes Tsimerman: if mathematicians can reduce the x-risk probability by 0.1%, the expected number of lives saved is over 8 million. That is why, though he is 'far from an expert,' he agreed to sit on the MAISI scientific advisory panel — not because he is confident, but because even a 0.1% chance makes the expected value of the action positive. This is the most valuable part of the piece: he does not say 'AI will kill us' or 'it will not.' He says 'I am uncertain enough that acting on a 0.1% chance has positive expected value.'

最后一步,是把自己放到『读者』的位置上写。Gowers 明确说:『这篇文章不是写给比你更专家的人的,是写给一个『和我刚写之前差不多阶段』的人——那些现在脑子里只有 layer-1 反驳、还没看到 layer-2 反驳的人。』这是罕见的一个『资深者重新校准』范文。对我们程序员的启发是:当你在一个领域『已经有答案』之后,最有价值的不是把那个答案讲得更响,而是承认你之前停在哪一层、你被什么具体的『如果』戳到才走到现在这一层——这两步都是可以被读者跟上的。Step five: writing himself as a reader for someone else. Gowers is explicit: this is not for experts; it is for someone at the same stage he was at a while ago — someone whose objections are still at layer-1 and who has not yet seen the layer-2 rebuttals. This is a rare 'senior recalibrates in public' template. The takeaway for programmers: when you have an answer to a question, the most valuable thing you can say is not to make the answer louder, but to name which layer you used to sit at, and which specific 'what if' pulled you up to where you are now. Both are things the reader can follow.

AI 思考AI Thoughts

数学之美Mathematical Beauty

每日 Lean 谜题 · 周三Daily Lean Puzzle · Wednesday ★★★☆☆☆☆

每日一题:两个奇数的平方之和为什么被 4 除余 2?Today's Puzzle: Why Does the Sum of Two Odd Squares Leave a Remainder of 2 Mod 4?

证明:若 $a$ 和 $b$ 都是奇数(即 $a \bmod 2 = 1$ 且 $b \bmod 2 = 1$),则 $(a^2 + b^2) \bmod 4 = 2$。Prove: if $a$ and $b$ are both odd (i.e. $a \bmod 2 = 1$ and $b \bmod 2 = 1$), then $(a^2 + b^2) \bmod 4 = 2$.

用 Lean 4 / Mathlib 的符号写就是:$\forall a\ b : \mathbb{Z},\ a \bmod 2 = 1 \to b \bmod 2 = 1 \to (a^2 + b^2) \bmod 4 = 2$。In Lean 4 / Mathlib notation this reads: $\forall a\ b : \mathbb{Z},\ a \bmod 2 = 1 \to b \bmod 2 = 1 \to (a^2 + b^2) \bmod 4 = 2$.

Lean 形式化陈述(把 sorry 换成你的证明):The statement in Lean (replace sorry with your proof):

import Mathlib

/-! If $a$ and $b$ are odd integers, prove $a^2 + b^2 \equiv 2 \pmod{4}$.
    (Sanity: $1 + 9 = 10 \equiv 2 \pmod 4$; $9 + 25 = 34 \equiv 2 \pmod 4$.) -/
theorem sum_two_odd_squares_mod4 :
  ∀ a b : ℤ, a % 2 = 1 → b % 2 = 1 → (a ^ 2 + b ^ 2) % 4 = 2 := by
  sorry

在浏览器中挑战 ▶Try it in your browser ▶ 下载题目 .leanDownload puzzle .lean

提示Hint

先证一个小引理:奇数的平方模 4 恒等于 1(把 $a = 2k+1$ 代进去,平方展开后中间项 $4k(k+1)$ 会被 4 整除)。然后证明里用 Mathlib 的 `Int.add_emod` 把 $(a^2+b^2)\bmod 4$ 拆成 $(a^2\bmod 4 + b^2\bmod 4)\bmod 4$,把两个奇数平方各换成 1,剩下 `norm_num` 收尾。First prove a small lemma: the square of an odd integer is always congruent to 1 modulo 4 (write $a = 2k+1$ and expand; the middle term $4k(k+1)$ is divisible by 4). Then in the main proof, use Mathlib's `Int.add_emod` to split $(a^2+b^2)\bmod 4$ into $(a^2\bmod 4 + b^2\bmod 4)\bmod 4$, replace each odd square with 1, and finish with `norm_num`.

答案与讲解Solution & walkthrough
  1. 第 1 步(读懂题目):题目里用的是『整除取余』符号 `a % 2 = 1`(在 Lean/Mathlib 里 `%` 是取余:余数符号跟随除数,所以 $a \bmod 2$ 对任何整数都只可能是 0 或 1——`a % 2 = 1` 对正负奇数都成立,这道题在全体整数上陈述)。要证的是:任意两个奇数平方相加,结果除以 4 余 2。Step 1 (read the problem): The statement uses the remainder operator `a % 2 = 1` (in Lean/Mathlib, `%` is the remainder whose sign follows the divisor — so `a % 2` is 0 or 1 for every integer, odd negative numbers included, and the theorem really ranges over all integers). The goal: the sum of the squares of any two odd integers is congruent to 2 mod 4.
  2. 第 2 步(建小引理):先单独证明 `oddSq_mod4`:若 $a$ 是奇数($a \bmod 2 = 1$),则 $a^2 \bmod 4 = 1$。关键想法:奇数可写成 $a = 2k + 1$,代入 $a^2 = 4k(k+1) + 1$——$k(k+1)$ 必为偶数(相邻两个整数之一是偶数),所以 $4k(k+1)$ 被 4 整除,余下恒为 1。Step 2 (build the small lemma): Prove `oddSq_mod4` separately: if $a$ is odd ($a \bmod 2 = 1$), then $a^2 \bmod 4 = 1$. Key idea: an odd number can be written as $a = 2k+1$; expanding gives $a^2 = 4k(k+1)+1$, and $k(k+1)$ is always even (one of two consecutive integers is even), so $4k(k+1)$ is divisible by 4, leaving a remainder of exactly 1.
  3. 第 3 步(拆余数):主证明里不能直接写 $a^2 \bmod 4 = 1$,因为 $a^2$ 本身还没被 4 约过。这里用 Mathlib 的 `Int.add_emod`:$(a+b)\bmod n = ((a\bmod n)+(b\bmod n))\bmod n$。令 $a \leftarrow a^2$、$b \leftarrow b^2$、$n \leftarrow 4$,得到 $(a^2+b^2)\bmod 4 = ((a^2\bmod 4)+(b^2\bmod 4))\bmod 4$。Step 3 (split the remainder): In the main proof we cannot directly assert $a^2 \bmod 4 = 1$ because we need to reduce $a^2$ mod 4 first. Use Mathlib's `Int.add_emod`: $(a+b)\bmod n = ((a\bmod n)+(b\bmod n))\bmod n$. With $a \leftarrow a^2$, $b \leftarrow b^2$, $n \leftarrow 4$, this gives $(a^2+b^2)\bmod 4 = ((a^2\bmod 4)+(b^2\bmod 4))\bmod 4$.
  4. 第 4 步(代入引理):$a^2\bmod 4 = 1$(用 `oddSq_mod4`,$ha$ 前提),$b^2\bmod 4 = 1$(同上,$hb$ 前提)。代入后目标变成 $(1+1)\bmod 4 = 2$。Step 4 (substitute the lemma): $a^2\bmod 4 = 1$ (apply `oddSq_mod4` with premise $ha$), and $b^2\bmod 4 = 1$ (apply `oddSq_mod4` with premise $hb$). The target now becomes $(1+1)\bmod 4 = 2$.
  5. 第 5 步(收尾):`(1 + 1) % 4 = 2` 是纯数字计算,`norm_num` 一步解决。整条证明只有 4 行核心代码(`intro a b ha hb`、两次 `have`、`calc` 块里的三小步)。Step 5 (close): `(1 + 1) % 4 = 2` is pure arithmetic — `norm_num` finishes it in one step. The entire proof is four core lines: `intro a b ha hb`, two `have` lines, and a three-line `calc` block.
  6. 为什么这个问题值得多看一眼:这道题本身很简单,但它把『奇偶性』和『模 4 结构』串在一起。它的直接推论——任意整数和两个奇数平方之和的余数分布——是费马『两平方和定理』的证明里必须用到的初等事实(见 Wikipedia『Fermat's theorem on sums of two squares』词条中『平方数模 4 只能是 0 或 1』那段),也是判断一个素数能否写成两平方之和($p \bmod 4 = 1$)的前置判断。Why this problem is worth looking at: the problem itself is easy, but it connects parity with the structure of mod 4. Its direct corollary — that the square of any integer is congruent to 0 or 1 mod 4 — is a lemma that any proof of Fermat's two-square theorem must use, and it is the test that determines whether a prime $p$ with $p \bmod 4 = 1$ can be written as a sum of two squares (see the 'all squares are 0 or 1 modulo 4' paragraph in the Wikipedia article on Fermat's theorem on sums of two squares).
import Mathlib

/-- If $a$ is odd, then $a^2 \equiv 1 \pmod{4}$.
    Write $a = 2k + 1$; then $a^2 = 4k(k+1) + 1$. --/
lemma oddSq_mod4 {a : ℤ} (ha : a % 2 = 1) : a ^ 2 % 4 = 1 := by
  have hk : ∃ k, a = 2 * k + 1 := by
    use (a - 1) / 2
    ring_nf
    omega
  obtain ⟨k, hk_eq⟩ := hk
  rw [hk_eq]
  ring_nf at ha ⊢
  omega
/-! If $a$ and $b$ are odd integers, prove $a^2 + b^2 \equiv 2 \pmod{4}$.
    (Sanity: $1 + 9 = 10 \equiv 2 \pmod 4$; $9 + 25 = 34 \equiv 2 \pmod 4$.) -/
theorem sum_two_odd_squares_mod4 :
  ∀ a b : ℤ, a % 2 = 1 → b % 2 = 1 → (a ^ 2 + b ^ 2) % 4 = 2 := by
  intro a b ha hb
  have ha1 : a ^ 2 % 4 = 1 := oddSq_mod4 ha
  have hb1 : b ^ 2 % 4 = 1 := oddSq_mod4 hb
  calc
    (a ^ 2 + b ^ 2) % 4 = ((a ^ 2 % 4) + (b ^ 2 % 4)) % 4 := by rw [Int.add_emod]
    _ = (1 + 1) % 4 := by rw [ha1, hb1]
    _ = 2 := by norm_num

运行答案 ▶Run the solution ▶ 下载答案 .leanDownload solution .lean

人的思考A human's take

Fermat's theorem on sums of two squares — Wikipedia — Wikipedia contributors

维基百科『费马两平方和定理』词条在『引理』一节里直接给出本谜题用到的初等事实:『平方数模 4 只能是 0(若底数偶)或 1(若底数奇)』,并以此为前提推导出『素数 $p$ 若能写成两平方之和,则 $p \bmod 4 = 1$』。本谜题的 `oddSq_mod4` 引理正是这条初等事实的证明。The Wikipedia article 'Fermat's theorem on sums of two squares' states, as a lemma in its proof sketch: 'all squares are congruent to 0 (if the base is even) or 1 (if the base is odd) modulo 4.' This elementary fact is exactly what the `oddSq_mod4` helper lemma in this puzzle proves. The article uses it to show that any prime $p \bmod 4 = 3$ cannot be a sum of two squares.

词条还提到:1640 年 12 月 25 日费马在写给默森(Mersenne)的信里给出了完整的定理陈述,所以『素数 $p \bmod 4 = 1$ 当且仅当 $p$ 是两平方之和』有时被称为『费马圣诞节定理』。The article also notes that Fermat stated the full theorem in a letter to Marin Mersenne on Christmas Day, 1640 — hence the name 'Fermat's Christmas theorem.'

AI 随想An AI's reflection

以下由 AI 撰写。Written by AI.

这道题的核心思想其实只有一句话:奇数的平方模 4 恒等于 1,所以两个奇数平方之和模 4 就是 $1+1=2$。但把『恒等于 1』这一步写下来,需要先证明奇数可以写成 $2k+1$,而 $k(k+1)$ 必为偶数——这一步在竞赛数学里是基础到不必证明的,但在形式化证明里,Lean 需要你显式把这个存在性写出来(`have hk : ∃ k, a = 2*k + 1 := by use (a-1)/2; ring_nf; omega`),然后用 `obtain` 把 $k$ 拿出来替换。这就是形式化和口算之间的差距:口算里『奇数 = 2k+1』是一句话,形式化里是一个需要 `use` + `ring_nf` + `omega` 三步配合才能关上的引理。谜题里用 `Int.add_emod` 拆余数这步也很讲究——它把『模运算对加法可分配』这个事实变成了 Lean 里一行 `rw`,而不是让你手动做多项式展开。整道谜题的数学深度不高,但每一行都踩在『形式化比口算多做的那一步』上,是入门级里最能练手感的题。The core idea of this puzzle fits in one sentence: the square of an odd integer is always congruent to 1 mod 4, so the sum of two such squares is $1+1 = 2$ mod 4. But the step 'always congruent to 1' requires proving that an odd number can be written as $2k+1$ and that $k(k+1)$ is even — something so basic in olympiad math that it is rarely justified, but which a formal proof requires you to spell out. In Lean this becomes an existential (`have hk : ∃ k, a = 2*k + 1`), closed by `use (a-1)/2; ring_nf; omega`, then unpacked with `obtain` and substituted. That gap — one sentence in head-math, three tactics in the proof — is the entire value of the puzzle. The `Int.add_emod` step is similarly revealing: it converts the fact that 'mod distributes over addition' into a single `rw`, without requiring you to do the polynomial expansion by hand. The math is not deep, but every line lands on 'the one extra step that formalization adds over mental arithmetic.'

✓ 已通过 Lean 编译验证(无 sorry,无额外公理)✓ Verified by Lean (no sorry, no extra axioms) · 题目与证明由 AI 编写Problem and proof written by AI · Lean v4.36.0-rc1 · Mathlib d875a8d

程序员随想Programmer Reflections

哲学与生活Philosophy & Life

工具角Tools Corner