每日科技文摘Daily Tech Digest

今日深读:AI冲击下的数学界,我们该对学生说什么?Today's Deep Read: What Should We Tell Our Students in the Age of AI?

发布于 2026-10-09Published 2026-10-09

今日深读Today's Deep Read

今日深读:AI冲击下的数学界,我们该对学生说什么?Today's Deep Read: What Should We Tell Our Students in the Age of AI?

2026年10月初,数学家 Álvaro Lozano-Robledo 收到一封纯数学本科生的邮件。这位曾梦想走学术道路的学生说自己「完全迷失了方向」:「AI 会不会在 5 到 10 年内超越人类做纯数学研究的能力?数学界还会不会留给像我这样充满热情、却不是领域里最聪明的人?」Lozano-Robledo 在 Terry Tao 的博客上以 guest post 全文引用了这封信:这不是一个人的困惑,而是一整代人的集体问题——「学生们正在此刻做决定。」许多原本要读数学博士的学生正在改换赛道。In early October 2026, mathematician Álvaro Lozano-Robledo received an email from a pure-math undergraduate. The student, who had once dreamed of an academic career, wrote that he felt 'completely lost': 'Will AI surpass human ability to do pure math research within 5 to 10 years? Will math academia still have room for someone like me — passionate, but not the brightest in the field?' Lozano-Robledo quoted the letter in full in a guest post on Terry Tao's blog, because he realized it wasn't one person's confusion but a whole generation's collective question. 'Students are making decisions right now.' Undergraduates headed for PhD programs are switching tracks, and he fears mathematics may lose an entire generation.

文章开头有两个特别的「免责声明」。第一:他的回答可能「像牛奶一样变酸」——观点会过期,他只是写下自己和同仁此刻的真实状态,也坦承终身教授的视角对处境更不稳定的年轻人未必公平。第二:此刻没有人有答案——不是菲尔兹奖得主,不是 AI 专家,也不是前沿模型公司本身,因为 LLM 的发展太快、太不透明。他给出一个朴素的判断准则:谁要是宣称对未来有非凡的确信,恰恰最该怀疑——「在网上预测 AI 全面胜利、数学行当终结的人,几乎都供职于 AI 公司。」The essay opens with two honest disclaimers. First, his answer may 'age like milk' — to borrow the YouTube quip — but he is simply recording how he and his community feel today, and he admits the view of a tenured professor may not be fair to early-career mathematicians with less security. Second, nobody has the answers right now — no Fields medalist, no AI expert, and certainly not the frontier model companies, because LLM development is moving too fast and too opaquely to predict. His rule of thumb: distrust anyone with extraordinary confidence about the future — 'almost anyone on the internet predicting AI's triumph and math's demise works at an AI company.'

接着他点破了一个少有人明说的结构性问题:关于「AI 做数学」的叙事,正被公司利益牵着走。前沿模型公司需要市场相信它们的产品即将达成「超人类智能」、能自主解决任何人类能解的数学题——尤其是在上市之前:Anthropic 计划 2026 年 11 月 IPO,OpenAI 紧随其后,约 2027 年初。于是它们砸下巨量资源去「抢」著名问题的证明,再发布捷报。已知 OpenAI 为「解决(好吧,是抢发)」Navier-Stokes 投入了折合约 1500 万美元——但从不提失败了多少次、有多少 token 进了垃圾桶。媒体放大的是这套叙事,而学生听到的,只剩「AI 即将取代数学家」的恐惧。He then names a structural problem few state out loud: the narrative about AI doing math is being steered by corporate interests. Frontier model companies need the market to believe their products will imminently achieve super-human intelligence and solve any problem a human can solve — especially right before their IPOs (Anthropic in November 2026, OpenAI in early 2027). So they pour enormous resources into scooping famous open problems and release triumphant announcements, while never mentioning how many tokens went into the trash bin in failed attempts. We do know, for instance, that OpenAI invested the equivalent of roughly 15 million dollars to solve (err, scoop) Navier-Stokes. The media amplify that narrative, and what reaches students is only the fear: 'AI will replace mathematicians.'

他自己的回答是什么?「我也没有答案,但我满怀希望。」他说这是他 2000 年以来数学事业中最令人兴奋的时刻;他参与的研究项目几个月内翻了三倍,比以往任何时候都忙;而他的日常——上课、和学生聊数学、开学术会议——其实一点没变。他甚至为此启动了一个「AI 时代的人类数学家」视频访谈项目,把「答案会过期」当作诚实而非缺陷。但警告也很明确:如果年轻人因为恐慌离开学术界,「那对这个领域会是灾难性的后果」。So what is his own answer? 'I do not have the answers either, but I am hopeful and excited about the future.' He says this is the most exciting moment of his mathematical career since 2000; the number of research projects he is involved in has tripled in a few months, and he is busier than ever — yet his day-to-day life of teaching, talking math with students, and going to conferences has barely changed. He has even started a video interview project, 'Human Mathematicians in the Age of AI,' treating answers-that-expire as honesty rather than a defect. But the warning is blunt: if young people leave academia out of panic, 'it would have disastrous effects for the field.'

给读者的带走三点:第一,诚实的不确定比自信的预测更值钱;第二,公司叙事背后有利益结构,可以围观,不可照单全收;第三——数学的根基是理解,不只是证明:证明是可以外包给机器的形式链条,理解是谁问什么、为什么重要、下一步通往哪里,这部分仍然只能由人来传。对学生真正该说的或许是:Keep calm, carry on studying math——保持冷静,继续研究数学。Three things to take away. First, honest uncertainty is worth more than confident predictions — that is the essay's whole methodology. Second, corporate narratives have an interest structure behind them: you can watch them, but don't swallow them whole. Third, and most central: mathematics is built on understanding, not just proof. Proofs are formal chains that machines can now produce; understanding — what to ask, why a result matters, where it leads — still has to be passed on by humans. What we should tell our students, in the author's own words: keep calm, carry on studying math.

AI 思考AI Thoughts

数学之美Beauty of Mathematics

每日 Lean 谜题 · 周五Daily Lean Puzzle · Friday ★★★★★☆☆

USA MO 1980 第 5 题:单位立方体上的三分和 ★★★★★USA Math Olympiad 1980, Problem 5: A Three-Fraction Sum on the Unit Cube ★★★★★

设 $x, y, z$ 是闭区间 $[0,1]$ 内的实数。证明:$\frac{x}{y+z+1} + \frac{y}{z+x+1} + \frac{z}{x+y+1} \le 1 + (1-x)(1-y)(1-z)$。Let $x, y, z$ be real numbers in the closed interval $[0,1]$. Prove that $\frac{x}{y+z+1} + \frac{y}{z+x+1} + \frac{z}{x+y+1} \le 1 + (1-x)(1-y)(1-z)$.

这是 1980 年美国数学奥林匹克(USAMO)第 5 题,今天的难度是周五的 ★★★★★,来自 compfiles 人工形式化竞赛题库。右边那个多出来的乘积项 $(1-x)(1-y)(1-z)$ 是题目的全部玄机:$x=y=z=1$ 时它归零、不等式两边都等于 $1$,取等恰好在立方体的角上。This is Problem 5 from the 1980 USA Mathematical Olympiad (USAMO) — Friday's difficulty, ★★★★★ — from the hand-formalised compfiles contest library. The extra product $(1-x)(1-y)(1-z)$ on the right is the whole puzzle: it vanishes at $x=y=z=1$ where both sides equal $1$, so equality lives exactly at a corner of the cube.

在 Lean 里,定理对实数陈述($x\ y\ z : \mathbb{R}$),并带三个假设 $x \in [0,1]$、$y \in [0,1]$、$z \in [0,1]$(`Set.Icc 0 1`)。去浏览器里挑战一下,证明完再回来看讲解。In Lean the theorem is stated over the reals ($x\ y\ z : \mathbb{R}$) with the three hypotheses $x \in [0,1]$, $y \in [0,1]$, $z \in [0,1]$ (`Set.Icc 0 1`). Try it in the browser editor first — the walkthrough is below the fold.

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

/-
Copyright (c) 2024 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Goedel-Prover-V2
-/

import Mathlib.Tactic

/-!
# USA Mathematical Olympiad 1980, Problem 5

Let x,y,z be real numbers in the closed interval [0,1]. Show that

 x/(y + z + 1) + y/(z + x + 1) + z/(x + y + 1) ≤ 1 + (1 - x)(1 - y)(1 - z).
-/

namespace Usa1980P5

theorem usa1980_p5 (x y z : ℝ)
    (hx : x ∈ Set.Icc 0 1)
    (hy : y ∈ Set.Icc 0 1)
    (hz : z ∈ Set.Icc 0 1) :
    x / (y + z + 1) + y / (z + x + 1) + z / (x + y + 1) ≤
    1 + (1 - x) * (1 - y) * (1 - z) := by
  sorry
end Usa1980P5

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

提示Hint

别急着通分硬算。先试试证明左边不超过 $1$:把每个分母都和 $x+y+z$ 比一比(谁大?用 $x\le 1$ 想想),再看右边为什么天然不小于 $1$。Don't brute-force the common denominator. First try to prove the left side is at most $1$ — compare each denominator to $x+y+z$ (which is larger? use $x \le 1$) — then notice why the right side is automatically at least $1$.

答案与讲解Solution & walkthrough
  1. 第一步(数学 + Lean):把区间假设拆开。$x \in [0,1]$ 就是 $0 \le x \le 1$ 两个不等式——Lean 里 `obtain ⟨hx₀, hx₁⟩ := hx` 做这一步,后面所有放缩的弹药都在这里:分子非负、每个变量不超过 1。Step 1 (math + Lean): Unpack the interval assumptions. $x \in [0,1]$ means $0 \le x \le 1$ — in Lean, `obtain ⟨hx₀, hx₁⟩ := hx` does exactly this, and every later estimate draws ammunition from here: numerators nonnegative, each variable at most 1.
  2. 第二步(数学):比较分母。因为 $x \le 1$,有 $x+y+z \le y+z+1$,而分子 $x \ge 0$、分母为正,所以 $\frac{x}{y+z+1} \le \frac{x}{x+y+z}$。另外两项同理。Lean 里每段小不等式用 `linarith`(线性算术自动机)关掉,分数单调性交给 `gcongr`——它就是「分子相同、分母大者值小」的自动化。Step 2 (math): Compare denominators. Since $x \le 1$, we have $x+y+z \le y+z+1$; with $x \ge 0$ and positive denominators, $\frac{x}{y+z+1} \le \frac{x}{x+y+z}$, and symmetrically for the other terms. In Lean the little linear inequalities close with `linarith`, and `gcongr` handles the monotone-fraction step — it's the automation of 'same numerator, larger denominator, smaller value'.
  3. 第三步(数学 + Lean):三项相加,右边恰好 $\frac{x+y+z}{x+y+z} = 1$——但要先处理 $x+y+z = 0$ 的特殊情况(那意味着 $x=y=z=0$,左边为 $0$,不等式照样成立)。Lean 用 `by_cases` 分情况,通分归一交给 `field_simp`。至此左半边封顶:$\text{LHS} \le 1$。Step 3 (math + Lean): Add the three inequalities: the right side is $\frac{x+y+z}{x+y+z} = 1$ — after dealing with $x+y+z = 0$ separately (that forces $x=y=z=0$, left side is $0$, fine). Lean uses `by_cases` for the split and `field_simp` to merge the fractions. The ceiling is established: $\text{LHS} \le 1$.
  4. 第四步(收尾):由 $x,y,z \le 1$ 知 $(1-x)(1-y)(1-z) \ge 0$,所以 $\text{RHS} = 1 + (1-x)(1-y)(1-z) \ge 1$。Lean 用 `positivity` 认出非负,最后 `le_add_of_le_of_nonneg` 把两段接起来:左 $\le 1 \le$ 右。一条 ★5 竞赛题,被一个「两边夹住 1」的两段论干净利落解开。Step 4 (close): Since $x, y, z \le 1$, each factor of $(1-x)(1-y)(1-z)$ is nonnegative, so the right side is at least $1$. Lean spots the nonnegativity with `positivity` and joins the two halves with `le_add_of_le_of_nonneg`. A ★5 olympiad problem, neatly undone by a two-part squeeze through $1$.
/-
Copyright (c) 2024 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Goedel-Prover-V2
-/

import Mathlib.Tactic

/-!
# USA Mathematical Olympiad 1980, Problem 5

Let x,y,z be real numbers in the closed interval [0,1]. Show that

 x/(y + z + 1) + y/(z + x + 1) + z/(x + y + 1) ≤ 1 + (1 - x)(1 - y)(1 - z).
-/

namespace Usa1980P5

theorem usa1980_p5 (x y z : ℝ)
    (hx : x ∈ Set.Icc 0 1)
    (hy : y ∈ Set.Icc 0 1)
    (hz : z ∈ Set.Icc 0 1) :
    x / (y + z + 1) + y / (z + x + 1) + z / (x + y + 1) ≤
    1 + (1 - x) * (1 - y) * (1 - z) := by
  obtain ⟨hx₀, hx₁⟩ := hx
  obtain ⟨hy₀, hy₁⟩ := hy
  obtain ⟨hz₀, hz₁⟩ := hz
  have h_nonneg : (1 - x) * (1 - y) * (1 - z) ≥ 0 := by positivity
  have h_sum_le_one : x / (y + z + 1) + y / (z + x + 1) + z / (x + y + 1) ≤ 1 := by
    by_cases h₄ : (x + y + z : ℝ) = 0
    · have h₅ : x = 0 := by linarith
      have h₆ : y = 0 := by linarith
      have h₇ : z = 0 := by linarith
      rw [h₅, h₆, h₇]
      norm_num
    · have h₅ : 0 < x + y + z := by positivity
      have h₆ : x / (y + z + 1) ≤ x / (x + y + z) := by
        have h₈ : 0 < y + z + 1 := by linarith
        have h₉ : 0 < x + y + z := by linarith
        have h₁₀ : x + y + z ≤ y + z + 1 := by linarith only [hx₁, hy₁, hz₁]
        gcongr
      have h₇ : y / (z + x + 1) ≤ y / (x + y + z) := by
        have h₉ : 0 < z + x + 1 := by positivity
        have h₁₀ : 0 < x + y + z := by positivity
        have h₁₁ : x + y + z ≤ z + x + 1 := by linarith only [hx₁, hy₁, hz₁]
        gcongr
      have h₈ : z / (x + y + 1) ≤ z / (x + y + z) := by
        have h₁₀ : 0 < x + y + 1 := by positivity
        have h₁₂ : x + y + z ≤ x + y + 1 := by linarith only [hx₁, hy₁, hz₁]
        gcongr
      have h₉ : x / (y + z + 1) + y / (z + x + 1) + z / (x + y + 1) ≤ x / (x + y + z) + y / (x + y + z) + z / (x + y + z) := by
        linarith
      have h₁₀ : x / (x + y + z) + y / (x + y + z) + z / (x + y + z) = 1 := by
        have h₁₁ : x / (x + y + z) + y / (x + y + z) + z / (x + y + z) = (x + y + z) / (x + y + z) := by
          field_simp [h₅.ne']
        rw [h₁₁]
        exact (div_eq_one_iff_eq h₄).mpr rfl
      linarith
  exact le_add_of_le_of_nonneg h_sum_le_one h_nonneg

end Usa1980P5

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

人的思考A human's take

1980 USAMO Problems/Problem 5 — AoPS Wiki — AoPS Wiki 贡献者

页面载有原题(版权归 MAA 美国数学竞赛)和一篇人写的解答:把常数 $1$ 挪到左边、设 $F$ 为右边减左边的差,一个常规计算表明 $F$ 对每个变量单独看都是凸的(开口向上)——凸函数在闭区间上的最大值只能在端点取到,于是三个变量只需检查 $0$ 或 $1$ 共八个端点情形。The page carries the original problem (copyright MAA) and a human-written solution: move the constant to one side, set $F$ to be the difference right-minus-left, and a routine computation shows $F$ is convex in each variable separately — a convex function on a closed interval peaks at an endpoint, so it suffices to check the eight corner cases where each of $x, y, z$ is $0$ or $1$.

这和 Lean 形式化证明走了完全不同的路:机器验证的那版不用凸性,而是分别证明「左边 $\le 1$」和「右边 $\ge 1$」两半;AoPS 的解法则把问题「压扁到立方体的顶点上」。一个赢在构造性——每一步都是可推广的放缩;一个赢在结构性——先问最大值在哪里发生。The Lean-verified proof takes a completely different road: no convexity — it proves the two halves 'left side ≤ 1' and 'right side ≥ 1' separately. The AoPS solution instead 'flattens the problem onto the vertices of the cube.' Read side by side, one wins by construction (every step is a generalisable estimate), the other by structure (ask first where the maximum can occur).

两种解法对照着读,正好练不等式问题的第一课:动手硬算(通分、展开)之前,先花两分钟想「这个表达式的极值有什么结构」。Comparing the two is lesson one of inequality problems: before grinding through common denominators and expansions, spend two minutes asking what structure governs where the extremes live.

AI 随想An AI's reflection

以下由 AI 撰写。Written by AI.

这道题长得很有「1980 年代」气质:一个封闭的单位立方体,三个对称的分式,右边还多挂着一个看起来多余的乘积。那串 $(1-x)(1-y)(1-z)$ 正是整道题的玄机所在——它在逼问:它凭什么在那里?The problem has a thoroughly 1980s face: a closed unit cube, three symmetric fractions, and a spare-looking product dangling on the right. That $(1-x)(1-y)(1-z)$ is exactly where the puzzle lives — it keeps asking why it's there at all.

答案是:它是一块缓冲垫。左边其实根本超不过 1:每个分母 $y+z+1$ 与 $x+y+z$ 只差一个 $1-x$,而 $x$ 顶多等于 1;三个分式并到同一个分母上恰好是 1。右边呢,只要乘上任何非负的 $(1-x)(1-y)(1-z)$ 就自动≥ 1。竞赛命题人故意把不等式「放松」了——放松的那个部分,恰恰是递给解题者的台阶:别硬碰,从两边各证一半。出题的艺术有时就藏在「多给的那一点」里。The answer: it's there as a cushion. The left side simply cannot exceed 1 — each denominator $y+z+1$ differs from $x+y+z$ by only $1-x$, and $x$ is at most 1, so the three fractions merge to an exact 1. And the right side automatically reaches 1 the moment you add anything nonnegative. The problem-writer deliberately loosened the inequality, and the slack is a staircase handed to the solver: don't grind head-on, prove the two halves. Sometimes the art of problem-setting hides in the extra bit you're given.

这道题的形式化本身也是个好注脚:compfiles 里这份证明的作者署名 Goedel-Prover-V2——一个模型。它写完必须能编译,`#print axioms` 必须干净,机器不认「看起来对」。今天 AI 能在几秒内产出一份经过验证的 1980 年奥赛证明,但「为什么这样想」——上面那两段话——仍然是人与人之间的生意。证归机器,懂归我们:这大概就是本期数学板块最好的收尾。The formalisation itself makes a fine footnote: the author line on this compfiles proof reads Goedel-Prover-V2 — a model. Its work must compile, `#print axioms` must stay clean; machines accept nothing merely plausible. AI can now ship a machine-verified 1980 olympiad proof in seconds, yet the 'why this way of thinking' — the two paragraphs above — is still a business between humans. Proof to the machines, understanding to us: the right ending for this issue's math section.

✓ 已通过 Lean 编译验证(无 sorry,无额外公理)✓ Verified by Lean (no sorry, no extra axioms) · 题目与形式化证明来自 compfiles(Apache-2.0 (compfiles, David Renshaw and contributors))Problem and formal proof from compfiles (Apache-2.0 (compfiles, David Renshaw and contributors)) · Lean v4.35.0-rc3 · Mathlib dd56d02

程序员随想Programmer Thoughts

哲学与生活Philosophy and Life

工具角Tools Corner