每日科技文摘Daily Tech Digest

今日深读:科学不缺数据,缺的是组装数据的人Today's Deep Read: Science Doesn't Lack Data — It Lacks People Who Assemble It

发布于 2026-10-07Published 2026-10-07

今日深读Today's Deep Read

今日深读:科学不缺数据,缺的是组装数据的人Today's Deep Read: Science Doesn't Lack Data — It Lacks People Who Assemble It

2025 年,全球发表了大约 700 万篇学术论文,平均每天一万九千篇。按理说,人类对世界的了解应该前所未有地清晰。可公众每天读到的却是互相打架的标题:这周说喝咖啡延寿,下周说喝咖啡伤身;这批研究说补充维生素有益,那批说完全无效。问题不出在任何单项研究上——大部分研究都是认真做的。问题在于,每一篇论文都只回答一个极小的问题,而没有人把它们拼成一张完整的图。我们生产知识的速度,远远超过了消化知识的速度。In 2025, the world published roughly 7 million academic papers — about 19,000 every day. By rights, humanity should understand the world more clearly than ever. Yet the public gets a daily dose of contradictory headlines: this week coffee extends life, next week it kills; these studies say the supplement works, those say it does nothing. The problem isn't any individual study — most of them were done carefully. The problem is that every paper answers one tiny question, and nobody assembles them into a complete picture. We produce knowledge far faster than we can digest it.

Helen Pearson 讲了这个困境的来历,也讲了它最有名的一次破解。故事的起点是 1976 年,旧金山的一场学术会议。教育统计学家 Gene Glass 上台提出了一个当时听来近乎古怪的想法:别再盯着单项研究的结果了,去研究「研究本身」。他把这个方法叫做「meta-analysis」——对分析的分析。核心工具是一个叫「效应量」的东西:把每一项研究发现的「效果有多大」统一折算到同一把尺子上。样本不同、量表不同、人群不同,都不重要了——换成同一个货币,几百项研究的结果就可以直接相加、比较、平均。Helen Pearson tells where this predicament came from — and about its most famous repair. The story starts in 1976, at a conference in San Francisco, where educational statistician Gene Glass proposed what sounded like a bizarre idea at the time: stop studying the world and start studying the studies. He called it meta-analysis — an analysis of analyses. The key tool was the 'effect size': convert whatever each study found into a common scale of 'how big was the effect.' Different samples, different questionnaires, different populations — all irrelevant once everything is converted into the same currency. Hundreds of results can then be pooled, compared, and averaged.

这个想法在当时没有被立刻采纳,一晾就是十几年。真正把它变成改变千万人命运的实践的,是流行病学家 Iain Chalmers。他在牛津散步时想到了产科:过去几十年里,医生们做了上百项随机对照试验,试验做了就该有结论——可产房里的实际操作,几十年几乎没变过,医生们依然凭着习惯和直觉接生。为什么不把每一个干预措施——每一种药、每一种手法——的全部试验证据拼成一张表,并且随着新研究不断公开更新?这个念头长成了 Cochrane 协作网,它做的「系统综述」重塑了整个循证医学。最著名的例子是产前类固醇:它能显著降低早产儿的死亡率,相关证据早在十几年前就已散落在一篇篇论文里,却几乎没有救到一个孩子——因为没有人把证据拼起来。不是没人知道,而是没有人组装。The idea sat on the shelf for more than a decade. What turned it into a practice that changed millions of lives was epidemiologist Iain Chalmers — and a walk in Oxford. He noticed that obstetrics had run hundreds of randomized trials over the decades, yet delivery rooms had barely changed: doctors still worked from habit and intuition. Why not assemble every trial ever done on each intervention — every drug, every technique — into one publicly maintained table, updated as new studies arrive? That thought grew into the Cochrane Collaboration, whose 'systematic reviews' reshaped evidence-based medicine. The classic example is antenatal corticosteroids: they dramatically cut premature-baby deaths, and the evidence had been scattered across papers for over a decade — yet the drug saved almost no one, because nobody had put the evidence together. It wasn't ignorance. It was the absence of assembly.

Pearson 的真正洞察在这里:组装科学的障碍从来不是技术,而是激励。学术体制奖励「发表新的研究」,不奖励「把旧研究算清楚」——做综合分析在职称评审里算「无贡献」;媒体奖励「新发现」的耸动标题,不奖励「综合 43 项研究之后,答案仍然不确定」这种诚实但无聊的结论。于是每个环节都在生产零件,整个系统却没有装配车间。科学是世界上最擅长制造知识的制度,同时也是最不善装知识的制度。Pearson's real insight is this: the barrier to assembling science was never technical — it's incentive. Academia rewards publishing new studies, not making old ones add up; synthesis counts for little at tenure review. Media rewards the headline of a 'new finding,' not the honest, boring conclusion of 43 pooled studies that 'we still can't be sure.' Every station in the system manufactures parts, and the whole enterprise has no assembly plant. Science is the institution best at producing knowledge — and among the worst at fitting it together.

这个视角对程序员几乎是直白的隐喻。我们每天都在做同样的事:加新服务,而不是理清旧系统;写新文档,而不是维护那张「系统到底如何咬合」的图;攒下海量数据,却没有人去算跨数据集的「效应量」。当生产信息的成本趋近于零,瓶颈就整体迁移到组装那一步。下一个真正稀缺的能力,也许不是提出新答案,而是把已有的答案当成原材料,装配成一幅能指导行动的完整图景——像 Glass 换尺子,像 Chalmers 拼证据,像散步时突然想明白「缺的不是试验,是表」的那个人。For programmers, the metaphor is almost too direct. We do exactly this every day: add new services instead of clarifying the old system; write new documents instead of maintaining the one map of how the pieces mesh; hoard data nobody converts into effect sizes. Once producing information becomes nearly free, the bottleneck migrates wholesale to assembling it. The rare skill ahead may not be proposing new answers, but treating the answers we already have as raw material — and assembling them into a picture good enough to act on. Like Glass with his common yardstick. Like Chalmers on his walk, realizing the trials weren't missing — the table was.

AI 思考AI Thoughts

数学之美The Beauty of Math

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

为什么 $8k+7$ 的数不是三个平方数之和Why Numbers of the Form $8k+7$ Are Never a Sum of Three Squares

对任意整数 $a$、$b$、$c$、$k$,都有 $a^2 + b^2 + c^2 \neq 8k + 7$。换句话说:$7, 15, 23, 31, \dots$ 这些「8 的倍数加 7」的数,永远不能写成三个整数的平方和。For any integers $a$, $b$, $c$, $k$, the sum $a^2 + b^2 + c^2$ is never equal to $8k + 7$. In other words, the numbers $7, 15, 23, 31, \dots$ — the '8 times something plus 7' crowd — can never be written as the sum of three integer squares.

这是完整的高斯-勒让德三平方定理的入门特例:一个正整数不能表示为三个平方数之和,当且仅当它形如 $4^a(8b+7)$。今天的题是它「$a = 0$ 那一层」的核心——模 8 的障碍。This is the entry-level special case of the full Gauss–Legendre three-square theorem: a positive integer is not a sum of three squares exactly when it has the form $4^a(8b+7)$. Today's puzzle is the core obstruction of that theorem — the modulo 8 barrier.

在 Lean 里,定理对整数($a\ b\ c\ k : \mathbb{Z}$)陈述。证明思路:先看清单个平方数模 8 长什么样,再把三个平方数的和逐个组合穷举。In Lean the theorem is stated over the integers ($a\ b\ c\ k : \mathbb{Z}$). The plan: first see what a single square looks like modulo 8, then exhaust all combinations of three squares.

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

-- level: 3
import Mathlib
/-! Prove no number of the form $8k + 7$ is a sum of three perfect squares — for example, $7$, $15$, $23$ are not. (Idea: squares are $0, 1,$ or $4 \pmod 8$.) -/
theorem not_sum_three_squares (a b c k : ℤ) : a ^ 2 + b ^ 2 + c ^ 2 ≠ 8 * k + 7 := by
  sorry

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

提示Hint

先证一个小引理:任何整数的平方除以 8,余数只能是 0、1 或 4(把 $x$ 按模 8 的八个余数分类验证)。然后看三个这样的余数相加,和能取到哪些值——7 在不在里面?First prove a small lemma: any square modulo 8 is congruent to 0, 1 or 4 (check the eight residue classes of $x$ mod 8). Then add three such residues: which sums are possible — and is 7 one of them?

答案与讲解Solution & walkthrough
  1. 第一步(数学):平方数模 8 只能是 0、1 或 4。任何整数模 8 余 0 到 7,逐个平方:$0^2$ 与 $4^2$ 给 0;$1^2$、$3^2$、$5^2$、$7^2$ 给 1;$2^2$ 与 $6^2$ 给 4。(Lean 里的引理 `sq_mod_eight` 正是这么做的:用 `omega` 穷举 $x \bmod 8$ 的八种情况,再 `simp [pow_two, Int.mul_emod]` 逐格算平方。)Step 1 (math): A square modulo 8 is always 0, 1 or 4. An integer is congruent to 0 through 7 mod 8, and squaring each case: $0^2, 4^2 \equiv 0$; $1^2, 3^2, 5^2, 7^2 \equiv 1$; $2^2, 6^2 \equiv 4$. (The Lean lemma `sq_mod_eight` does exactly this: `omega` enumerates the eight residue classes of $x \bmod 8$, then `simp [pow_two, Int.mul_emod]` squares each one.)
  2. 第二步(数学):三个平方数之和模 8 只能落在 $\{0,1,2,3,4,5,6\}$:把 0、1、4 任取三个相加(含重复)——0、1、2、3、4、5、6、8≡0、9≡1、12≡4——永远凑不出 7。(Lean 里对 a、b、c 各套一次 `rcases sq_mod_eight`,$3\times3\times3$ 种余数组合自动展开成子目标。)Step 2 (math): A sum of three squares mod 8 can only land in $\{0,1,2,3,4,5,6\}$. Add any three residues from {0, 1, 4}, repeats allowed — you get 0, 1, 2, 3, 4, 5, 6, and 8≡0, 9≡1, 12≡4; never 7. (In Lean, `rcases sq_mod_eight` for a, b and c in turn splits the $3\times3\times3$ residue combinations into subgoals.)
  3. 第三步(数学):而 $8k+7$ 模 8 恰好等于 7。如果 $a^2+b^2+c^2 = 8k+7$ 成立,两边模 8 就要求 7 等于一个「永远不是 7」的和——矛盾。(Lean 里 `intro h` 假设等式成立,分完情况之后每个子目标由 `omega` 用模算术直接关掉——计算机最擅长的正是这种「有限的穷举」。)Step 3 (math): But $8k+7$ is exactly 7 modulo 8. Assuming $a^2+b^2+c^2 = 8k+7$ would force 7 to equal a sum that can never be 7 — contradiction. (Lean's `intro h` assumes the equality; after the case split, `omega` closes every subgoal with modular arithmetic — the machine's favorite game is exhausting finite cases.)
-- level: 3
import Mathlib
/-! Prove no number of the form $8k + 7$ is a sum of three perfect squares — for example, $7$, $15$, $23$ are not. (Idea: squares are $0, 1,$ or $4 \pmod 8$.) -/
lemma sq_mod_eight (x : ℤ) : x ^ 2 % 8 = 0 ∨ x ^ 2 % 8 = 1 ∨ x ^ 2 % 8 = 4 := by
  have h : x % 8 = 0 ∨ x % 8 = 1 ∨ x % 8 = 2 ∨ x % 8 = 3 ∨ x % 8 = 4 ∨ x % 8 = 5 ∨
      x % 8 = 6 ∨ x % 8 = 7 := by omega
  rcases h with h | h | h | h | h | h | h | h <;> simp [pow_two, Int.mul_emod, h]
theorem not_sum_three_squares (a b c k : ℤ) : a ^ 2 + b ^ 2 + c ^ 2 ≠ 8 * k + 7 := by
  intro h
  rcases sq_mod_eight a with ha | ha | ha <;> rcases sq_mod_eight b with hb | hb | hb <;>
    rcases sq_mod_eight c with hc | hc | hc <;> omega

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

人的思考A human's take

Legendre's three-square theorem — Wikipedia — Wikipedia

词条陈述的完整定理:自然数 $n$ 能写成三个整数的平方和 $n = x^2 + y^2 + z^2$,当且仅当 $n$ 不形如 $4^a(8b+7)$。注意障碍不止「$8b+7$」,还要先把因子 4 剥干净——这是今天的模 8 论证到完整定理之间隔的那一步。The full theorem: a natural number $n$ is a sum of three squares $n = x^2 + y^2 + z^2$ exactly when $n$ is not of the form $4^a(8b+7)$. Note the obstruction isn't just '$8b+7$' — you must first strip all factors of 4. That's the step separating today's mod-8 argument from the full theorem.

页面给过一个漂亮的几何推论:把单位立方体的顶点两两连线,用勾股定理,出现的所有距离是 $\sqrt{1}$ 到 $\sqrt{6}$ 的平方根,唯独没有 $\sqrt{7}$——因为 7 根本不是三个平方数之和。一个数论定理,就这样锁住了一把尺子能量出的长度。The page offers a lovely geometric corollary: connect the vertices of a double unit cube pairwise, and by the Pythagorean theorem the distances that appear are square roots of 1 through 6 — but never $\sqrt{7}$, because 7 is not a sum of three squares at all. A theorem of number theory, capping what a ruler can measure.

读这个词条的收获是看清「障碍」的分量:三个平方和不能覆盖的数只有形如 $4^a(8b+7)$ 的这一族,其余全部可表——勒让德(1798)证明了必要性,充分性高斯在《算术研究》里补完。今天我们做的那一半(必要性、模 8 部分),正是两个人共用的一把钥匙。What the article teaches is how narrow the exceptions are: the only numbers that are not sums of three squares form the family $4^a(8b+7)$; every other number is one. Legendre proved the necessity (1798); Gauss completed the sufficiency in the Disquisitiones. The half we do today — necessity via mod 8 — is the key both men shared.

AI 随想An AI's reflection

以下由 AI 撰写。Written by AI.

这道题是「模算术是一台筛子」最好的入门教材。想知道某个数能不能写成三个平方和,不必去试哪三个平方数——只需要看它除以 8 的余数。余 7 一族全部出局,其余的先存疑再细查。一台只用「余数」两字的小机器,就否定了无穷多个数。This puzzle is the best available introduction to 'modular arithmetic as a sieve.' To learn whether a number is a sum of three squares, you don't hunt for the squares — you just read the number mod 8. The whole residue-7 family is excluded; the survivors are checked later. A tiny machine built from one word, 'remainder,' denies infinitely many numbers at once.

证明的骨架也值得记:先分类(平方数只有三种脸孔),再穷举(三个余数的全部组合是 27 个,去重后更少)。这是数学里最古老的「笨办法」,笨到可以放心交给机器——Lean 里 `omega` 关掉每一个子目标的样子,像极了人类数学家说「剩下的逐一检查,略」。形式化证明与数学直觉之间,在这一题上严丝合缝。The proof's skeleton deserves memorizing: classify first (squares have only three faces modulo 8), then exhaust (27 combinations of three residues, fewer up to symmetry). It's mathematics' oldest 'dumb method' — dumb enough to hand to a machine. Watching Lean's `omega` close each subgoal is like watching a human mathematician write 'the remaining cases are checked one by one: omitted.' On this problem, formalization and intuition fit together with no daylight.

往深处想一步:为什么障碍恰好是 8?因为平方数模 $2^3$ 的行为已经稳定下来。高斯和勒让德把「4 的幂」也拦下来时,真正的分水岭已经出现——三个平方和的完整刻画需要比模算术更深的工具(二次型)。一道 ★3 的题,其实是通往这座山的山脚路标:先学会看余数,再学会敬畏那个 $4^a$。Push one step further: why is the barrier exactly 8? Because squares modulo $2^3$ have settled into their final behavior. When Gauss and Legendre also barred the powers of 4, the real watershed appeared — the full description of three-square sums needs tools deeper than modular arithmetic (quadratic forms). A ★3 puzzle is a trailhead sign on that mountain: first learn to read remainders; later, learn to fear the $4^a$.

✓ 已通过 Lean 编译验证(无 sorry,无额外公理)✓ Verified by Lean (no sorry, no extra axioms) · 题目来自本站题库Problem from this site's puzzle bank · Lean v4.35.0-rc3 · Mathlib dd56d02

程序员思考Programmer Thinking

哲学时刻Philosophy

工具角Tool Corner