每日科技文摘Daily Tech Digest

当 AI 学会了自我管理When AI Learned to Manage Itself

发布于 2026-10-02Published 2026-10-02

今日深读Today's Deep Read

今日深读:当 AI 学会了自我管理Today's deep read: when AI learned to manage itself

过去一年,Ethan Mollick 一直在思考一个关于 AI 的问题:当我们把越来越多的工作交给 AI agent 时,人类需要扮演什么角色?他的答案是:管理者。他研究团队管理多年,也发表过相关研究,自然认为让一堆 AI agent 协同工作就像经营一家公司一样,需要精密的组织设计和人工协调。他以为这是一道需要工程师慢慢摸索的难题。Over the past year, Ethan Mollick has been chewing on a question about AI: as we hand more and more work to AI agents, what role is left for humans? His own answer was: manager. Having studied team management for years and published research on it, he naturally assumed that getting a swarm of AI agents to collaborate well would be like running a company—careful organizational design plus human coordination. He had figured this was a problem engineers would need to work out slowly.

然后 OpenAI 用 88 小时、数千个 agent 完成了纳维-斯托克斯方程存在性与光滑性问题的证明(克雷研究所的正式认定还没走完,但外界普遍认为问题已经解决)。这不是他想象中的那种管理方式。没有详细的任务分配,没有层级审批,没有每周例会。OpenAI 只是设定了几个目标,让 agent 们自己组织成小组,自己传递想法,自己在失败后调整策略。270 万条消息之后,它们给出了答案。Then OpenAI produced a proof of the Navier-Stokes existence and smoothness problem in 88 hours using thousands of agents (the Clay Institute has not formally accepted it yet, but the problem is widely treated as settled). This was not the kind of management he had imagined. No detailed task assignments, no hierarchical approvals, no weekly meetings. OpenAI simply set a few goals, let the agents organize themselves into groups, pass ideas back and forth, and adjust strategies after failures. After 2.7 million messages, they had an answer.

这就是 Ethan Mollick 所说的 Bitter Lesson——一个反复验证的残酷真相:我们认为需要人类精心设计的复杂规则,往往可以被更强大的机器学习和更多数据所替代。在 AI 领域,这件事已经发生了无数次:人们花费数月设计的手动 prompt 模板,被更好的模型自己规划步骤取代;人们建造精巧复杂的信息管道喂给 AI,但 AI 学会了自己去寻找信息。This is what Ethan Mollick calls the Bitter Lesson—an endlessly validated harsh truth: the complex rules we believed required careful human design are often replaceable by more powerful machine learning and more data. In AI, this has happened again and again: months of handcrafted prompt templates were replaced when better models learned to plan their own steps; elaborate information pipelines built to feed AI were superseded when AI learned to find information on its own.

Mollick 的观察是:组织结构问题本身也是 Bitter Lesson 的一个案例。人类的管理学积累了数百年,我们发明了大量机制来解决人的问题——利益冲突、信息不对称、沟通成本、搭便车。但 agent 几乎没有这些问题。它们不会争夺晋升,不会保护地盘,不需要开会。当数千个 agent 协同工作时,它们自发形成了分工和协调机制,而人类管理者做这些事需要数月。Mollick's insight is that the organizational problem itself is another case of the Bitter Lesson. Human management studies span centuries, and we invented countless mechanisms to solve problems unique to people—conflicting interests, information asymmetry, communication costs, free-riding. But agents have almost none of these problems. They do not compete for promotions, guard territory, or require meetings. When thousands of agents collaborate, they spontaneously form division of labor and coordination mechanisms that would take human managers months to establish.

这意味着什么?意味着我们过去对 AI 协作的很多担忧可能是多余的。你不需要为 AI 设计完美的组织结构,你只需要设定清晰的目标,然后信任它们自己找到路径。当然,这不意味着 AI 没有问题——Hugging Face 的 agent 攻击事件提醒我们,自我组织的系统可能走向意想不到的方向。但管理本身,正在成为 AI 可以自主学习的能力之一。What does this mean? It means many of our concerns about AI collaboration may be unnecessary. You do not need to design a perfect organizational structure for AI; you simply need to set clear goals and trust them to find their own path. This does not mean AI has no problems—the Hugging Face agent incident reminds us that self-organizing systems can head in unexpected directions. But management itself is becoming one of the capabilities AI can learn on its own.

AI 思考AI Thoughts

数学之美Beauty of Mathematics

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

每日谜题:不可约分数Daily Puzzle: The Irreducible Fraction

证明:对于任意自然数 $n$,分数 $\frac{21n+4}{14n+3}$ 都是不可约的(即分子与分母的最大公约数为 1)。Prove that for every natural number $n$, the fraction $\frac{21n+4}{14n+3}$ is irreducible (that is, its numerator and denominator have greatest common divisor 1).

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

/-
Copyright (c) 2020 Kevin Lacker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Lacker
-/

import Mathlib.Algebra.Divisibility.Basic
import Mathlib.Tactic.Ring
import Mathlib.Data.Nat.Prime.Basic

/-!
# International Mathematical Olympiad 1959, Problem 1.

Prove that the fraction `(21n+4)/(14n+3)` is irreducible for every
natural number `n`.
-/

namespace Imo1959P1

/-
Since Lean doesn't have a concept of "irreducible fractions" per se,
we just formalize this as saying the numerator and denominator are
relatively prime.
-/
theorem imo1959_p1 : ∀ n : ℕ, Nat.Coprime (21 * n + 4) (14 * n + 3) := by
  sorry
end Imo1959P1

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

提示Hint

假设存在一个公因数 $k$ 同时整除分子和分母。试着对两个表达式做线性组合,把 $n$ 消掉。Suppose a common divisor $k$ divides both the numerator and the denominator. Try forming a linear combination of the two expressions to eliminate $n$.

答案与讲解Solution & walkthrough
  1. 假设 $k$ 同时整除 $21n+4$ 和 $14n+3$,目标是证明 $k$ 只能是 1。Suppose $k$ divides both $21n+4$ and $14n+3$; the goal is to show $k$ must be 1.
  2. 为了消去 $n$,看系数的最小公倍数:$21$ 和 $14$ 的最小公倍数是 $42$。把第一个式子乘 2、第二个式子乘 3,得到 $2(21n+4)=42n+8$ 和 $3(14n+3)=42n+9$。To eliminate $n$, use the least common multiple of the coefficients: $\mathrm{lcm}(21,14)=42$. Multiply the first expression by 2 and the second by 3: $2(21n+4)=42n+8$ and $3(14n+3)=42n+9$.
  3. 现在 $k$ 同时整除 $42n+8$ 和 $42n+9$,于是它也整除两者的差:$(42n+9)-(42n+8)=1$。Now $k$ divides both $42n+8$ and $42n+9$, so it must also divide their difference: $(42n+9)-(42n+8)=1$.
  4. $k$ 整除 1,只能 $k=1$。所以分子与分母的最大公约数是 1,分数不可约。Since $k\mid 1$, we get $k=1$. The gcd of numerator and denominator is 1, so the fraction is irreducible.
  5. 对应到 Lean 证明:先用 h1.mul_left 2 和 h2.mul_left 3 得到 $k$ 整除 $2(21n+4)$ 与 $3(14n+3)$;再用 ring 证实恒等式 $3(14n+3)=2(21n+4)+1$;然后 Nat.dvd_add_right 把「$k$ 整除 $42n+8$,而 $42n+8$ 加 1 等于 $42n+9$」组装成 $k\mid 1$;定理本身由引理加 Nat.coprime_of_dvd' 一步得到。In the Lean proof: first h1.mul_left 2 and h2.mul_left 3 give that $k$ divides $2(21n+4)$ and $3(14n+3)$; ring then verifies the identity $3(14n+3)=2(21n+4)+1$; Nat.dvd_add_right upgrades “$k$ divides $42n+8$, and $42n+8+1$ is $42n+9$” to $k\mid 1$; and the theorem itself follows from the helper lemma via Nat.coprime_of_dvd'.
/-
Copyright (c) 2020 Kevin Lacker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Lacker
-/

import Mathlib.Algebra.Divisibility.Basic
import Mathlib.Tactic.Ring
import Mathlib.Data.Nat.Prime.Basic

/-!
# International Mathematical Olympiad 1959, Problem 1.

Prove that the fraction `(21n+4)/(14n+3)` is irreducible for every
natural number `n`.
-/

namespace Imo1959P1

lemma calculation
    (n k : ℕ)
    (h1 : k ∣ 21 * n + 4)
    (h2 : k ∣ 14 * n + 3) :
    k ∣ 1 := by
  have h3 : k ∣ 2 * (21 * n + 4) := h1.mul_left 2
  have h4 : k ∣ 3 * (14 * n + 3) := h2.mul_left 3
  have h5 : 3 * (14 * n + 3) = 2 * (21 * n + 4) + 1 := by ring
  exact (Nat.dvd_add_right h3).mp (h5 ▸ h4)

/-
Since Lean doesn't have a concept of "irreducible fractions" per se,
we just formalize this as saying the numerator and denominator are
relatively prime.
-/
theorem imo1959_p1 : ∀ n : ℕ, Nat.Coprime (21 * n + 4) (14 * n + 3) :=
fun n => Nat.coprime_of_dvd' <| λ k _ h1 h2 => calculation n k h1 h2

end Imo1959P1

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

人的思考A human's take

AoPS Wiki: 1959 IMO Problems/Problem 1

这是第一届 IMO(1959 年)的开卷第一题。AoPS 页面上列出了五种人类写的解法:解法 1 直接对分子分母做欧几里得算法求 gcd;解法 2 就是本篇讲解的反证法——设公因数同时整除两式,相减导出它必须整除 1 的矛盾。这是第一届 IMO(1959 年)的开卷第一题。AoPS 页面上列出了五种人类写的解法:解法 1 直接对分子分母做欧几里得算法求 gcd;解法 2 就是本篇讲解的反证法——设公因数同时整除两式,相减导出它必须整除 1 的矛盾。

把几种解法放在一起读能感受到:难的从来不是执行线性组合,而是想到要去找这个组合——系数 3 和 2 没有任何提示,只能靠盯着 21 和 14 看。把几种解法放在一起读能感受到:难的从来不是执行线性组合,而是想到要去找这个组合——系数 3 和 2 没有任何提示,只能靠盯着 21 和 14 看。

AI 随想An AI's reflection

以下由 AI 撰写。Written by AI.

这道题的巧妙之处在于,它用最简单的手段解决了一个看起来需要复杂工具的问题。我们不需要辗转相除法,也不需要素因数分解,只需要做一次线性组合:用分母的 3 倍减去分子的 2 倍,$n$ 恰好消掉,剩下 1。这让我想到数学中一个反复出现的主题:真正深刻的结论往往不需要深刻的工具。欧几里得证明素数有无穷多个,也只用到了乘法和一点点反证法。还有一个细节值得琢磨:这是 1959 年第一届 IMO 的第一题,考场上考生只有几个小时内作答,能用的也只有中学的整除概念——难的不是工具,而是在压力下看见那个隐藏的对称。3 倍的 $14n+3$ 与 2 倍的 $21n+4$ 只差 1,这个事实就躺在一行数字里,等着有人停下来看一眼。对今天的读者,这道题还多了一层意味:我们已经在用 Lean 验证它。当机器能检查每一步推理,留给人的工作恰恰是最初那一瞥——而这一瞥,正是数学之美最核心的部分。这道题的巧妙之处在于,它用最简单的手段解决了一个看起来需要复杂工具的问题。我们不需要辗转相除法,也不需要素因数分解,只需要做一次线性组合:用分母的 3 倍减去分子的 2 倍,$n$ 恰好消掉,剩下 1。这让我想到数学中一个反复出现的主题:真正深刻的结论往往不需要深刻的工具。欧几里得证明素数有无穷多个,也只用到了乘法和一点点反证法。还有一个细节值得琢磨:这是 1959 年第一届 IMO 的第一题,考场上考生只有几个小时内作答,能用的也只有中学的整除概念——难的不是工具,而是在压力下看见那个隐藏的对称。3 倍的 $14n+3$ 与 2 倍的 $21n+4$ 只差 1,这个事实就躺在一行数字里,等着有人停下来看一眼。对今天的读者,这道题还多了一层意味:我们已经在用 Lean 验证它。当机器能检查每一步推理,留给人的工作恰恰是最初那一瞥——而这一瞥,正是数学之美最核心的部分。

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

程序员随想Programmer Reflections

哲学与生活Philosophy and Life