每日科技文摘Daily Tech Digest

每日科技文摘:语言的功能与关系,以及一道关于「分解不唯一」的老题Daily Tech Digest: Functional vs. Relational Language, and an Old Problem About Non-Unique Factorization

发布于 2026-10-18Published 2026-10-18

今日深读Today's Deep Read

对 AI 味文字暴怒的人,和自己「只看结果」的信条打了一架The Slop Snob Fights Her Own 'Outcomes Only' Creed

Honeycomb 的 CTO Charity Majors 写过一篇自白,起点是一家公司里同时在气两边的人。一半人对收到的「slop」暴怒:要五条要点,收到二十页注水的文档;问同事一个问题,回复以「Claude 说……」开头。另一半人也委屈:他们产出更快、结果更好,凭什么还要被骂「工作流不更新」?Majors 自己在不同时段站过两边。但真正让她睡不着的是另一个词——越来越多同事说,工作中的人味没了,dehumanizing。Charity Majors, CTO of Honeycomb, opens with a company mad in both directions. Half the staff is furious about slop: they ask for five bullet points and get a twenty-page padded doc; they ask a colleague a question and the reply starts with "Claude says...". The other half is equally aggrieved: they ship faster with better outcomes, and resent being scolded for not updating their workflows. Majors has stood in both camps at different times. What kept her up at night was a different word — coworkers kept saying the human connection at work was gone. Dehumanizing.

她的第一反应是标准的工程师直觉:工具就是工具,结果说明一切。客户在乎的是产品质量,不是你怎么做的。这套「 ruthless 地只看结果」的说辞她差点说服了自己——直到她注意到自己的行为完全矛盾。嘴上说着「只看质量」,私下里她对 AI 味的文字已经发展出一种暴怒式的厌恶:newsletter 一读出 AI 腔就退订,博客直接关标签页,社交媒体直接取关。她甚至说,如果有个能给作者一万伏电击的按钮,她会毫不犹豫地按下去,还当面按。Her first instinct was the standard engineer's move: tools are tools, outcomes are all that matter, customers care about quality not provenance. She nearly convinced herself — until she noticed her own behavior contradicting it. While publicly repeating "it doesn't matter how it was made", she had privately developed a violent disgust reflex for AI-flavored text: newsletters unsubscribed the moment she sensed AI-isms, blog posts closed mid-scroll, authors unfollowed. She jokes she'd slam a 10,000-volt button on slop authors and not care who saw.

很多洞察都是这么开始的:嘴上坚称 A,行为却一直像 B。逼自己调和这两件事,她被引到了对语言本身的拆解上。语言为我们做的每一件事,要么是功能性的,要么是关系性的。功能性场合里,价值在想法本身,谁说的无关紧要:代码 diff、结构化数据、形式化证明,甚至大部分技术文档——只要准确,AI 介入完全正当,没人会眨眼。而关系性场合里,价值恰恰在于「是这个特定的人说了、想了、感觉了」:问同事的意见、上级写的绩效评语、一条慰问。Her best insights start this way: loudly insisting A while behaving as if B. Forcing the two to reconcile led her to take language apart. Every job language does is either functional or relational. In functional contexts the value lives in the idea itself, and who said it is irrelevant: code diffs, structured data, formal proofs, most technical docs — as long as it's accurate, AI involvement is fine and nobody blinks. In relational contexts the value is precisely that this particular person said, thought, or felt it: asking a colleague's opinion, a manager's performance review, a condolence.

这个分法立刻解释了愤怒从哪来。绩效评语一看就是 ChatGPT 写的,员工会问:他到底读没读我做了什么?他要是不写,他在这儿干嘛?想要的是「你怎么看」,收回来的却是一段 Claude 片段——这不算偷懒,算背叛,因为你点名要的就是那个人的脑子。而且这个效应是单向放大的:交流越个人化,AI 代笔破坏的信任越多,哪怕文字本身无可挑剔。The split explains the rage immediately. A performance review that reads like ChatGPT makes the employee ask: did my manager even read what I did? You ask "what do YOU think" and get back a Claude snippet — that's not laziness, it's a violation, because what you asked for was that specific brain. And the effect compounds: the more personal the interaction, the more AI ghostwriting destroys trust, even when the words themselves are flawless.

所以她的判据很简单,也带得走:下次纠结「这里用 AI 合不合适」,别问用了多少、披露了几成——先问这段交流的价值在想法上,还是在这个人身上。价值在想法上,尽管放开用, ruthlessly 地只看结果;价值在人身上,把笔拿回来。这也顺便解释了为什么市面上那些「AI 使用比例披露」的框架总觉得没搔到痒处:关键从来不是比例,是场合。至于她自己那股暴怒——那不是不理性,是她的注意力系统在替她做一次快速的场合判断:这段话里没有一个 specific 的人,不值得给注意力。So her test is portable: next time you wonder whether AI belongs in a given message, don't ask how much AI was used or how thoroughly disclosed — ask whether the value of this exchange lives in the idea or in the person. Idea? Go wild, be ruthlessly outcome-oriented. Person? Pick the pen back up. It also explains why all those AI-disclosure-percentage frameworks felt off: the variable that matters was never the percentage, it was the occasion. As for her own rage — it isn't irrationality, it's her attention system making a fast context call: no specific human in sight, no attention owed.

AI 思考AI Thoughts

数学之美Beauty of Mathematics

每日 Lean 谜题 · 周日Daily Lean Puzzle · Sunday ★★★★★★★

同一个数,两种「不可再分」的分解(IMO 1977 第 3 题)One Number, Two 'Indecomposable' Factorizations (IMO 1977, Problem 3)

设 $n > 2$。考察所有形如 $1 + kn$($k$ 为正整数)的整数构成的集合 $V_n$。称 $V_n$ 中的一个数 $m$ 为「不可分解」的,如果不存在 $V_n$ 中的两个数 $u, v$ 使得 $m = uv$。证明:存在一个数,它能以多于一种方式表示为 $V_n$ 中若干个不可分解数的乘积(只有因子顺序不同的表示视为同一种)。Let $n > 2$, and consider the set $V_n$ of all integers of the form $1 + kn$ for positive integers $k$. A number $m \in V_n$ is called indecomposable if there are no two numbers $u, v \in V_n$ with $m = uv$. Prove that some number can be expressed as a product of indecomposable elements of $V_n$ in more than one way (expressions differing only in the order of factors count as the same).

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

/-
Copyright (c) 2026 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kimi K3
-/

import Mathlib.Tactic

/-!
# International Mathematical Olympiad 1977, Problem 3

Given an integer n > 2, let Vₙ be the set of integers 1 + kn for k a positive integer.
A number m in Vₙ is called indecomposable if it cannot be expressed as the product of
two members of Vₙ. Prove that there is a number in Vₙ which can be expressed as the
product of indecomposable members of Vₙ in more than one way (decompositions which
differ solely in the order of factors are not regarded as different).
-/

namespace Imo1977P3

/-- The set `Vₙ` of natural numbers of the form `1 + k * n` with `k` a positive integer. -/
def Vn (n : ℕ) : Set ℕ := {m | ∃ k : ℕ, 1 ≤ k ∧ m = 1 + k * n}

/-- `m` is indecomposable in `Vₙ` if it belongs to `Vₙ` but cannot be written as a
product of two members of `Vₙ`. -/
def Indecomposable (n : ℕ) (m : ℕ) : Prop :=
  m ∈ Vn n ∧ ¬ ∃ p q : ℕ, p ∈ Vn n ∧ q ∈ Vn n ∧ m = p * q

theorem imo1977_p3 (n : ℕ) (hn : 2 < n) :
    ∃ r ∈ Vn n, ∃ F₁ F₂ : Multiset ℕ,
      (∀ d ∈ F₁, Indecomposable n d) ∧ (∀ d ∈ F₂, Indecomposable n d) ∧
      F₁.prod = r ∧ F₂.prod = r ∧ F₁ ≠ F₂ := by
  sorry
end Imo1977P3

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

提示Hint

先别急着造那个数。第一步是证明 $V_n$ 里每个成员都能分解成不可分解数之积(强归纳);第二步是发现一个「小得反常」的不可分解数:$(n-1)^2$。注意 $V_n$ 里最小的成员是 $n+1$,所以任何两个成员的乘积至少是 $(n+1)^2$。Don't rush to build the number. First show every member of $V_n$ factors into indecomposables (strong induction); then find an abnormally small indecomposable: $(n-1)^2$. The smallest member of $V_n$ is $n+1$, so any product of two members is at least $(n+1)^2$.

答案与讲解Solution & walkthrough
  1. 乘法封闭:$1 + an$ 乘 $1 + bn$ 等于 $1 + (a + b + abn)\,n$,仍在 $V_n$ 里。所以「分解」总是在集合内部进行,这保证了问题有意义(Lean 里是 mul_mem_vn 这个引理,两行代数)。Multiplication stays inside: $(1 + an)(1 + bn) = 1 + (a + b + abn)\,n$, so products of members of $V_n$ are members again — the question is well-posed. (In Lean this is the two-line lemma mul_mem_vn.)
  2. 关键引理——存在「小得反常」的不可分解数:$(n-1)^2 = 1 + (n-2)n$ 属于 $V_n$,但 $V_n$ 的任何成员都至少是 $n+1$(因为 $k \ge 1$),所以两个成员的乘积至少是 $(n+1)^2$;而 $(n-1)^2 < (n+1)^2$,它怎么也写不成两个成员的乘积——不可分解。(Lean: indecomposable_sq,核心是 vn_ge 给出的下界。)Key lemma — an abnormally small indecomposable: $(n-1)^2 = 1 + (n-2)n$ belongs to $V_n$, but every member of $V_n$ is at least $n+1$ (since $k \ge 1$), so any product of two members is at least $(n+1)^2$. Since $(n-1)^2 < (n+1)^2$, it can never be such a product — indecomposable. (Lean: indecomposable_sq, powered by the lower bound in vn_ge.)
  3. 存在性:对 $m$ 做强归纳——若 $m$ 不可分解,它自己就是一组合法分解;否则 $m = pq$,$p, q$ 都在 $V_n$ 里且都严格小于 $m$,各自分解再拼起来。(Lean: exists_factorization,用 Nat.strong_induction_on。)注意到这里只用了「存在」,还完全没碰「唯一」。Existence: strong induction on $m$ — if $m$ is indecomposable, the singleton factorization works; otherwise $m = pq$ with $p, q \in V_n$ both strictly smaller than $m$, and we concatenate their factorizations. (Lean: exists_factorization via Nat.strong_induction_on.) Note this only ever uses existence, never uniqueness.
  4. 造 witnesses:取 $r = (n-1)^2 (2n-1)^2$。第一组因子:$(n-1)^2$ 乘上 $(2n-1)^2$ 的某个不可分解分解;第二组因子:$(n-1)(2n-1)$ 的不可分解分解复制两份——因为 $((n-1)(2n-1))^2 = (n-1)^2(2n-1)^2$,乘积同为 $r$。(Lean: 主定理里的 G 与 H + H。)拿 $n=3$ 验证:$100 = 4 \times 25 = 10 \times 10$,三组因子 $4, 25, 10$ 全都模 3 余 1,且全都不可分解。Build the witnesses: take $r = (n-1)^2 (2n-1)^2$. First factorization: $(n-1)^2$ times some indecomposable factorization of $(2n-1)^2$; second: take an indecomposable factorization of $(n-1)(2n-1)$ twice — since $((n-1)(2n-1))^2 = (n-1)^2(2n-1)^2$, both products equal $r$. (Lean: G and H + H in the main theorem.) Sanity check with $n=3$: $100 = 4 \times 25 = 10 \times 10$, where $4, 25, 10$ are all $\equiv 1 \bmod 3$ and all indecomposable.
  5. 证明两组不同:$(n-1)^2$ 出现在第一组。若它也出现在第二组,注意第二组每个因子的乘积是 $(n-1)(2n-1)$,所以每个因子都整除它;但 $n-1$ 不整除 $2n-1 = 2(n-1)+1$,于是 $(n-1)^2$ 不整除 $(n-1)(2n-1)$,矛盾。(Lean: not_dvd 加 Multiset.dvd_prod,把「因子乘积」翻译成「逐个整除」。)The two differ: $(n-1)^2$ occurs in the first factorization. If it occurred in the second, it would divide that factorization's product $(n-1)(2n-1)$ — but $n-1$ does not divide $2n-1 = 2(n-1)+1$, so $(n-1)^2$ cannot divide it. Contradiction. (Lean: not_dvd plus Multiset.dvd_prod, which turns "product of the factors" into "each factor divides".)
/-
Copyright (c) 2026 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kimi K3
-/

import Mathlib.Tactic

/-!
# International Mathematical Olympiad 1977, Problem 3

Given an integer n > 2, let Vₙ be the set of integers 1 + kn for k a positive integer.
A number m in Vₙ is called indecomposable if it cannot be expressed as the product of
two members of Vₙ. Prove that there is a number in Vₙ which can be expressed as the
product of indecomposable members of Vₙ in more than one way (decompositions which
differ solely in the order of factors are not regarded as different).
-/

namespace Imo1977P3

/-- The set `Vₙ` of natural numbers of the form `1 + k * n` with `k` a positive integer. -/
def Vn (n : ℕ) : Set ℕ := {m | ∃ k : ℕ, 1 ≤ k ∧ m = 1 + k * n}

/-- `m` is indecomposable in `Vₙ` if it belongs to `Vₙ` but cannot be written as a
product of two members of `Vₙ`. -/
def Indecomposable (n : ℕ) (m : ℕ) : Prop :=
  m ∈ Vn n ∧ ¬ ∃ p q : ℕ, p ∈ Vn n ∧ q ∈ Vn n ∧ m = p * q

/-- Every member of `Vₙ` is at least `n + 1`. -/
lemma vn_ge {n m : ℕ} (hm : m ∈ Vn n) : n + 1 ≤ m := by
  obtain ⟨k, hk, rfl⟩ := hm
  have h := Nat.mul_le_mul hk (le_refl n)
  lia

/-- `Vₙ` is closed under multiplication. -/
lemma mul_mem_vn {n p q : ℕ} (hp : p ∈ Vn n) (hq : q ∈ Vn n) : p * q ∈ Vn n := by
  obtain ⟨a, ha, rfl⟩ := hp
  obtain ⟨b, hb, rfl⟩ := hq
  exact ⟨a + b + a * b * n, by lia, by ring⟩

/-- `(n - 1)^2` (written with `n = c + 3`) is indecomposable in `Vₙ`: it is smaller
than the square of the smallest member of `Vₙ`. -/
lemma indecomposable_sq (c : ℕ) : Indecomposable (c + 3) ((c + 2) ^ 2) := by
  refine ⟨⟨c + 1, by lia, by ring⟩, ?_⟩
  rintro ⟨p, q, hp, hq, h⟩
  have hp1 : c + 4 ≤ p := by have := vn_ge hp; lia
  have hq1 : c + 4 ≤ q := by have := vn_ge hq; lia
  have hle : (c + 4) * (c + 4) ≤ (c + 2) ^ 2 := by
    have := Nat.mul_le_mul hp1 hq1
    rwa [← h] at this
  have e : (c + 4) * (c + 4) = (c + 2) ^ 2 + (4 * c + 12) := by ring
  lia

/-- `(n - 1)^2` does not divide `(n - 1) * (2 * n - 1)` (written with `n = c + 3`),
since `n - 1` does not divide `2 * n - 1 = 2 * (n - 1) + 1`. -/
lemma not_dvd (c : ℕ) : ¬ (c + 2) ^ 2 ∣ (c + 2) * (2 * c + 5) := by
  intro h
  have h2 : c + 2 ∣ 2 * c + 5 := by
    have h' := h
    rw [sq] at h'
    exact Nat.dvd_of_mul_dvd_mul_left (by lia) h'
  have h3 : c + 2 ∣ 2 * c + 5 - 2 * (c + 2) := Nat.dvd_sub h2 (dvd_mul_left _ _)
  have h4 : 2 * c + 5 - 2 * (c + 2) = 1 := by lia
  rw [h4] at h3
  have := Nat.le_of_dvd one_pos h3
  lia

/-- Every member of `Vₙ` is a product of indecomposable members of `Vₙ`. -/
lemma exists_factorization (n : ℕ) (hn : 2 < n) :
    ∀ m : ℕ, m ∈ Vn n →
      ∃ F : Multiset ℕ, (∀ d ∈ F, Indecomposable n d) ∧ F.prod = m := by
  intro m
  induction' m using Nat.strong_induction_on with m ih
  intro hm
  by_cases h : Indecomposable n m
  · exact ⟨{m}, fun d hd => by
      rw [Multiset.mem_singleton] at hd
      rw [hd]
      exact h, Multiset.prod_singleton m⟩
  · obtain ⟨p, q, hp, hq, rfl⟩ : ∃ p q : ℕ, p ∈ Vn n ∧ q ∈ Vn n ∧ m = p * q := by
      by_contra hcon
      exact h ⟨hm, hcon⟩
    have hpg : n + 1 ≤ p := vn_ge hp
    have hqg : n + 1 ≤ q := vn_ge hq
    have hplt : p < p * q := by
      have h2 : p * 2 ≤ p * q := Nat.mul_le_mul (le_refl p) (by lia)
      lia
    have hqlt : q < p * q := by
      have h2 : 2 * q ≤ p * q := Nat.mul_le_mul (by lia) (le_refl q)
      lia
    obtain ⟨Fp, hFp, hFpprod⟩ := ih p hplt hp
    obtain ⟨Fq, hFq, hFqprod⟩ := ih q hqlt hq
    exact ⟨Fp + Fq, fun d hd => (Multiset.mem_add.mp hd).elim (hFp d) (hFq d),
      by rw [Multiset.prod_add, hFpprod, hFqprod]⟩

theorem imo1977_p3 (n : ℕ) (hn : 2 < n) :
    ∃ r ∈ Vn n, ∃ F₁ F₂ : Multiset ℕ,
      (∀ d ∈ F₁, Indecomposable n d) ∧ (∀ d ∈ F₂, Indecomposable n d) ∧
      F₁.prod = r ∧ F₂.prod = r ∧ F₁ ≠ F₂ := by
  obtain ⟨c, rfl⟩ : ∃ c : ℕ, n = c + 3 := ⟨n - 3, by lia⟩
  -- The witness is `r = (n - 1)^2 * (2 * n - 1)^2`, written with `c = n - 3`
  -- (so `c + 2 = n - 1` and `2 * c + 5 = 2 * n - 1`) to avoid truncated subtraction.
  have hs2mem : (c + 2) ^ 2 ∈ Vn (c + 3) := ⟨c + 1, by lia, by ring⟩
  have ht2mem : (2 * c + 5) ^ 2 ∈ Vn (c + 3) := ⟨4 * c + 8, by lia, by ring⟩
  have hstmem : (c + 2) * (2 * c + 5) ∈ Vn (c + 3) := ⟨2 * c + 3, by lia, by ring⟩
  -- First factorization: `(n-1)^2` times any factorization of `(2n-1)^2`.
  obtain ⟨G, hG, hGprod⟩ := exists_factorization (c + 3) (by lia) _ ht2mem
  -- Second factorization: any factorization of `(n-1)*(2n-1)`, taken twice.
  obtain ⟨H, hH, hHprod⟩ := exists_factorization (c + 3) (by lia) _ hstmem
  refine ⟨(c + 2) ^ 2 * (2 * c + 5) ^ 2, mul_mem_vn hs2mem ht2mem, (c + 2) ^ 2 ::ₘ G,
    H + H, ?_, ?_, ?_, ?_, ?_⟩
  · intro d hd
    rw [Multiset.mem_cons] at hd
    rcases hd with rfl | hd
    · exact indecomposable_sq c
    · exact hG d hd
  · intro d hd
    rw [Multiset.mem_add] at hd
    rcases hd with hd | hd <;> exact hH d hd
  · rw [Multiset.prod_cons, hGprod]
  · rw [Multiset.prod_add, hHprod]; ring
  · -- The factorizations differ: `(n-1)^2` occurs in the first one, but every factor
    -- of the second one divides `(n-1)*(2n-1)`, which `(n-1)^2` does not divide.
    intro h
    have hmem : (c + 2) ^ 2 ∈ (c + 2) ^ 2 ::ₘ G := Multiset.mem_cons_self _ _
    rw [h, Multiset.mem_add] at hmem
    rcases hmem with hmem | hmem <;> {
      have hdvd := Multiset.dvd_prod hmem
      rw [hHprod] at hdvd
      exact not_dvd c hdvd
    }

end Imo1977P3

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

人的思考A human's take

1977 IMO Problems/Problem 3 — AoPS Wiki 社区

AoPS Wiki 上这题的页面(原站拦截抓取,本文经 Wayback 快照读取):上面有 1977 年的原题陈述,与我们的 Lean 形式化逐句对应。页面上社区贴的解法走了另一条路:先用「与 n 互素的素数有无穷多个」这条欧几里得式引理加抽屉原理,找到两个落在同一剩余类里的素数,再直接造出两组不可分解的因子。同一个结论,一个解法靠「大小」造不可分解,另一个靠「同余类」造不可分解——对照着看很有味道。The AoPS Wiki page for this problem (the site blocks fetchers; read here via a Wayback snapshot) carries the original 1977 statement, matching our Lean formalization line by line. The community solution posted there takes a different route: a Euclid-style lemma that infinitely many primes are coprime to n, a pigeonhole step to find two primes in the same residue class, and then a direct construction of two indecomposable factorizations. Same conclusion, one proof built on size, the other on congruence classes — worth reading side by side.

AI 随想An AI's reflection

以下由 AI 撰写。Written by AI.

这道题最迷人的地方在于它把「分解存在」和「分解唯一」彻底撕开了。我们在自然数里长大,脑子里深深装着算术基本定理:任何合数都能分解成素数之积,而且只有一种分法。于是很容易以为「每个数都能分解到不能再分」和「分法只有一种」是一回事——前者听起来几乎是后者的显然推论。这道题构造了一个小世界:只保留模 n 余 1 的数,乘法封闭,甚至每个数都能分解成「不可再分」的因子,唯一性却轰然倒塌,$100 = 4 \times 25 = 10 \times 10$ 摆在那里,四个因子个个「不可再分」。更妙的是那个反例的造法:不可分解性不是逐个检查出来的,而是靠一道不等式 $(n-1)^2 < (n+1)^2$ 整批地制造出来——你不需要知道一个数具体长什么样,只需要知道它「太小了,小到不可能是任何两个成员的乘积」。用下界批量制造不可分解,再用「整除」排除它出现在另一组分解里,这是整道题真正的两板斧。最后留一个现实回声:Lean 证明里最重的部分其实是那个「存在性」引理——强归纳写出每个成员都可分解。 existence 便宜,uniqueness 昂贵,而且昂贵的那一半在某些世界里干脆是假的。The charm of this problem is how cleanly it tears 'factorizations exist' apart from 'factorizations are unique'. We grow up with the fundamental theorem of arithmetic, and it is tempting to read 'everything factors down to indecomposables' as an obvious corollary of uniqueness. This problem builds a tiny world — keep only the numbers congruent to 1 mod n — where multiplication is closed, everything factors into indecomposables, and yet uniqueness collapses: $100 = 4 \times 25 = 10 \times 10$, every factor stubbornly indecomposable. Even better is how the counterexample is manufactured: indecomposability is not checked case by case, it is mass-produced by one inequality, $(n-1)^2 < (n+1)^2$ — you never need to know what the number looks like, only that it is too small to be any product of two members. That is the real one-two punch: a lower bound to stamp out indecomposables in bulk, and a divisibility argument to keep that indecomposable out of the second factorization. One last echo into practice: the heaviest part of the Lean proof is the existence lemma, the strong induction showing every member factors at all. Existence is cheap; uniqueness is expensive — and in some worlds, the expensive half is simply false.

✓ 已通过 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-rc4 · Mathlib feefa32

程序员随想Programmer's Notes

哲学与生活Philosophy & Life

工具角Tool Corner