每日科技文摘Daily Tech Digest

存在的艺术:不喊口号的改变The Art of Presence: Change Without Slogans

发布于 2026-11-19Published 2026-11-19

今日深读Today's Deep Read

不喊口号的抵抗:德黑兰街头,每天出门就是一种主张Resistance Without Slogans: On Tehran's Streets, Showing Up Is the Argument

傍晚的德黑兰,Iranshahr 街。年轻女性坐在咖啡馆外的台阶上,头巾滑到肩膀,露出头发、手臂和腰;有人举着手机给朋友拍照,有人只是看来来往往的人。路人经过时会多看两眼——不是因为这里发生了什么,而是因为这里什么都没发生。没有口号,没有标语,没有人发表演讲。It is early evening on Iranshahr Street in Tehran. Young women sit on the steps outside cafés, headscarves slipped down to their shoulders, hair and arms and midriffs in plain view. One is taking a photo of a friend; others are just watching the crowd. Passers-by look twice — not because something is happening, but because, officially, nothing is supposed to.

这条街在伊朗是一个异数。1983 年起,戴头巾是法律义务,道德警察在街头执法;2022 年,22 岁的 Mahsa Amini 因「佩戴不当」被拘留后死亡,引发「女人、生命、自由」运动。按常理,今天街上的这些女性应该是在抗议。但记者 Parisa Khoshnami 问她们,得到的回答是:这只是打扮,「只是为了我自己」。This street is an anomaly in Iran. Since 1983 the headscarf has been a legal obligation, enforced by morality police. In 2022, 22-year-old Mahsa Amini died after being detained for “improper” dress, and “Woman, Life, Freedom” spread across the country. By any normal logic, the women on this pavement are protesting. But when the journalist Parisa Khoshnami asked them, they said it was just dressing up — “only for myself.”

Khoshnami 借用社会学家 Asef Bayat 的概念,把这种现象叫「非运动」(non-movement)——「非集体行动者的集体行动」。它没有领袖、没有纲领、没有组织,每个人只做了一个私人决定:今晚出门,穿我想穿的。但当成千上万人在同一条街上、一个晚上接一个晚上、连续几个月做同一个决定,算术就变了。卡内蒂在《群众与权力》里说,人群要经过「放电」——彼此界限消失的那一瞬——才真正成为群众;而这条街上恰好相反:谁也不认识谁,各自低头看手机、各自喝咖啡,却在做同一件事。这正是「非运动」别扭的地方,它连群众那一下放电都不需要。Khoshnami borrows the sociologist Asef Bayat's term “non-movement”: collective action by non-collective actors. No leader, no platform, no organization. Each person makes a private decision — to go out tonight, to wear what she wants. But when thousands make that decision on the same street, night after night, for months, the arithmetic changes. Canetti, in Crowds and Power, says a crowd only becomes a crowd at the moment of “discharge,” when the boundaries between people collapse. This street is the opposite: nobody knows anybody, each woman is heads-down in her phone or her coffee, and yet they are all doing the same thing. That is the awkward part of a non-movement — it does not even need the discharge.

为什么这种改变难对付?一次游行可以在一夜之间清场。但你没法逮捕「今晚出门喝咖啡」;你只能去关她们聚集的咖啡馆、封她们的账号、派便衣坐进店里。2026 年 8 月,全国至少 42 家店因此被关,70 多个社媒账号被查封。可国家也发现,很多时候它甚至不用真的在场:一个女人只要怀疑这家咖啡馆有人在看,她就会自己收敛。恐惧的成本比警察低。但威慑会自己磨损。Sima 第一次摘下头巾出门时,包里始终备着一条,随时准备应付突发;可每出门一次,就看到更多不戴头巾的女性,那份怕一点点退掉——她说,那让她知道自己不是一个人。Why is that so hard to suppress? A demonstration can be cleared in a night. You cannot arrest “going out for coffee.” You can only close the cafés where people gather, block their accounts, put plainclothes officers in the room. In August 2026 at least 42 businesses were shut and more than 70 social-media accounts seized. But the state also learned it often does not need to be present: a woman who merely suspects she is being watched will police herself. Fear is cheaper than police. But deterrence wears itself down. The first time Sima went out without a headscarf she kept one in her bag, ready to pull out if anything happened; each time she went out she saw more bare heads, and the fear receded a little — she says seeing them told her she was not alone.

更有意思的是国家的两难。2023 年起草、后来通过却从未生效的头巾与贞洁法案;总统在电视上承认自己对这部法律「有很多保留」,因为执行它需要邻里互相举报、出租车司机举报乘客,会先把社会信任毁掉。而废除法律又等于公开认输。于是法律留在纸上,执法退到成本更低的地方。国家真正保护的不是宗教,而是「仍然掌控局面」的形象。The state's dilemma is the more revealing part. A hijab-and-chastity bill drafted in 2023 and passed later has never been brought into force; the president admitted on television that he had “many reservations,” because enforcement would mean neighbours reporting neighbours and taxi drivers reporting passengers — destroying social trust first. Repealing the law, meanwhile, would be a public admission of defeat. So the law stays on the books, unenforced, and enforcement retreats to cheaper targets. What is being protected is not religion but the image of a government still in charge.

这给我们一个不太符合直觉的提醒:改变不一定以胜利的形式到来。没有签字,没有生效日期,没有哪一天宣布结束——但那条街已经和几年前完全不一样了。Bayat 把这叫「存在的艺术」:在约束中创造空间,用现有的东西让自己被看见。单看每个人,这几乎不算策略,只是过日子;但足够多的人坚持过日子,规则就会弯曲。我们习惯的改变是发一个 PR、发一份声明、赢一次辩论;而这里展示的是另一种更慢、更难被回滚的方式——先改变生活,再让规则追上来。The lesson is counterintuitive: change does not always arrive as a victory. There is no signature, no effective date, no day on which it is declared over — yet the street looks nothing like it did a few years ago. Bayat calls this “the art of presence”: making room inside constraints, using what is at hand to be seen. For any one person it barely counts as a strategy; it is just living. But when enough people insist on living that way, the rules bend. We are used to change that looks like a pull request, a statement, a won argument. This is the slower kind, and much harder to roll back: first change how you live, then let the rules catch up.

AI 思考AI Thoughts

数学之美The Beauty of Math

每日 Lean 谜题 · 周四Daily Lean Puzzle · Thursday ★★★★☆☆☆

每日谜题 ★4:用有理函数逼近立方根Daily Puzzle ★4: Approximating a Cube Root with a Rational Function

设 $k$ 是 $2$ 的实数立方根,也就是 $k^3 = 2$。要在所有非负有理数 $x$ 上,用一个二次分式 $(Ax^2 + Bx + C)/(ax^2 + bx + c)$ 来逼近 $k$,而且要求它比 $x$ 本身更接近 $k$:Let $k$ be the real cube root of $2$, so $k^3 = 2$. We want a quadratic rational function $(Ax^2 + Bx + C)/(ax^2 + bx + c)$ that approximates $k$ better than $x$ itself does, for every non-negative rational $x$:

$|(Ax^2 + Bx + C)/(ax^2 + bx + c) - k| < |x - k|$,其中 $A, B, C, a, b, c$ 都是整数。题目要求找出一组这样的整数。$|(Ax^2 + Bx + C)/(ax^2 + bx + c) - k| < |x - k|$, where $A, B, C, a, b, c$ are integers. The problem asks you to find one such set of integers.

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.Algebra.Order.Ring.Star
import Mathlib.Algebra.Order.Star.Real
import Mathlib.Algebra.Ring.IsFormallyReal
import Mathlib.Algebra.Order.Star.Int
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.LinearCombination.Lemmas
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring

/-!
# USA Mathematical Olympiad 1972, Problem 4

Let k be the real cube root of 2. Find integers A, B, C, a, b, c such that

  |(Ax² + Bx + C)/(ax² + bx + c) − k| < |x − k|

for all non-negative rational numbers x.
-/

namespace Usa1972P4

abbrev IsSolution (A B C a b c : ℤ) (k : ℝ) : Prop :=
  ∀ x : ℚ, 0 ≤ x →
    |((A : ℝ) * (x : ℝ) ^ 2 + (B : ℝ) * (x : ℝ) + (C : ℝ)) /
        ((a : ℝ) * (x : ℝ) ^ 2 + (b : ℝ) * (x : ℝ) + (c : ℝ)) - k| <
      |(x : ℝ) - k|

abbrev solution : ℤ × ℤ × ℤ × ℤ × ℤ × ℤ := sorry

theorem usa1972_p4 (k : ℝ) (hk : k ^ 3 = 2) :
    match solution with
    | (A, B, C, a, b, c) => IsSolution A B C a b c k := by
  sorry
end Usa1972P4

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

提示Hint

先不要把六个整数当自由变量去猜。让 $x$ 趋近 $k$:如果左边比 $|x-k|$ 还小,那么在 $x=k$ 处分子必须正好是 $k$ 乘以分母,否则比值会留下一个常数误差。利用 $k^3=2$ 把 $1, k, k^2$ 看成一组基,就能把六个未知数压成三个关系。然后再把分子减去 $k$ 倍分母,因式分解出 $(x-k)$。Do not treat the six integers as free variables to guess. Let $x$ approach $k$: if the left side is smaller than $|x-k|$, the numerator at $x=k$ must equal $k$ times the denominator, or the ratio leaves a constant error. Using $k^3=2$, treat $1, k, k^2$ as a basis and the six unknowns collapse into three relations. Then subtract $k$ times the denominator from the numerator and factor out $(x-k)$.

答案与讲解Solution & walkthrough
  1. 第一步是看 $x \to k$ 的极限。不等式右边趋于 $0$,所以左边的差也必须趋于 $0$:$Ak^2 + Bk + C = k(ak^2 + bk + c)$。把右边展开,并用 $k^3 = 2$,得到 $Ak^2 + Bk + C = 2a + bk^2 + ck$。因为 $1, k, k^2$ 在有理数上线性无关($k$ 是无理数),比较系数就有 $A = b$,$B = c$,$C = 2a$。Start with the limit as $x \to k$. The right side goes to $0$, so the difference on the left must too: $Ak^2 + Bk + C = k(ak^2 + bk + c)$. Expand the right side and use $k^3 = 2$ to get $Ak^2 + Bk + C = 2a + bk^2 + ck$. Since $1, k, k^2$ are linearly independent over the rationals ($k$ is irrational), comparing coefficients gives $A = b$, $B = c$, $C = 2a$.
  2. 于是分子减去 $k$ 倍分母可以因式分解:$(bx^2 + cx + 2a) - k(ax^2 + bx + c) = (x-k)((b-ak)x + c - ak^2)$。原不等式就变成:这个一次因子除以分母的绝对值小于 $1$。Now subtract $k$ times the denominator from the numerator and factor: $(bx^2 + cx + 2a) - k(ax^2 + bx + c) = (x-k)((b-ak)x + c - ak^2)$. The original inequality becomes: this linear factor divided by the denominator has absolute value less than $1$.
  3. 取最简单的一组:$a = 1$,$b = c = 2$,即分式 $(2x^2+2x+2)/(x^2+2x+2)$。此时一次因子是 $(2-k)x + 2-k^2$。因为 $1 < k < 2$,所以 $2-k > 0$ 且 $2-k^2 > 0$;对 $x \ge 0$,整个因子是正的。Take the simplest choice: $a = 1$, $b = c = 2$, giving $(2x^2+2x+2)/(x^2+2x+2)$. The linear factor is $(2-k)x + 2-k^2$. Since $1 < k < 2$, both $2-k$ and $2-k^2$ are positive, and for $x \ge 0$ the whole factor is positive.
  4. 还要证明它比分母小。分母减去这个因子,正好是 $x^2 + kx + k^2$,其中每一项都非负且 $k^2 > 0$,所以严格大于 $0$。因此因子与分母之比落在 $(0,1)$。两边乘以 $|x-k|$($x$ 是有理数而 $k$ 无理,故不为 $0$),就得到严格小于。It remains to show the factor is smaller than the denominator. Denominator minus factor is exactly $x^2 + kx + k^2$, whose terms are non-negative and whose last term is strictly positive, so the difference is positive. Hence the ratio lies in $(0,1)$. Multiply by $|x-k|$ (nonzero because $x$ is rational and $k$ is not) and the strict inequality follows.
  5. Lean 里的证明沿着同一条路:先证明 $k$ 不是有理数(用奇偶性做无穷递降),再证 $1 < k < 2$ 与 $k^2 < 2$,用 `linear_combination` 核对因式分解,最后用 `div_lt_one` 和 `mul_lt_mul_of_pos_left` 收尾。解元组就是 $(2,2,2,1,2,2)$。The Lean proof follows the same path: first show $k$ is irrational (parity and infinite descent), then $1 < k < 2$ and $k^2 < 2$; `linear_combination` checks the factorization, and `div_lt_one` plus `mul_lt_mul_of_pos_left` finish. The solution tuple is $(2,2,2,1,2,2)$.
/-
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.Algebra.Order.Ring.Star
import Mathlib.Algebra.Order.Star.Real
import Mathlib.Algebra.Ring.IsFormallyReal
import Mathlib.Algebra.Order.Star.Int
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.LinearCombination.Lemmas
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring

/-!
# USA Mathematical Olympiad 1972, Problem 4

Let k be the real cube root of 2. Find integers A, B, C, a, b, c such that

  |(Ax² + Bx + C)/(ax² + bx + c) − k| < |x − k|

for all non-negative rational numbers x.
-/

namespace Usa1972P4

/-- The property that the integers `A, B, C, a, b, c` solve the problem for the
real cube root `k` of `2`: the rational function `(Ax² + Bx + C)/(ax² + bx + c)`
approximates `k` strictly better than `x` does, for every non-negative
rational number `x`. -/
abbrev IsSolution (A B C a b c : ℤ) (k : ℝ) : Prop :=
  ∀ x : ℚ, 0 ≤ x →
    |((A : ℝ) * (x : ℝ) ^ 2 + (B : ℝ) * (x : ℝ) + (C : ℝ)) /
        ((a : ℝ) * (x : ℝ) ^ 2 + (b : ℝ) * (x : ℝ) + (c : ℝ)) - k| <
      |(x : ℝ) - k|

/-
We follow the solution from
https://prase.cz/kalva/usa/usoln/usol724.html

Take `(A, B, C, a, b, c) = (2, 2, 2, 1, 2, 2)`. Since `k³ = 2`, the numerator
of `(2x² + 2x + 2)/(x² + 2x + 2) − k` factors as
`(2x² + 2x + 2) − (x² + 2x + 2)k = (x − k)((2 − k)x + 2 − k²)`.
For `x ≥ 0`, both `(2 − k)x + 2 − k²` and `x² + 2x + 2` are positive, and the
latter minus the former equals `x² + kx + k² > 0`, so their ratio lies
strictly between `0` and `1`. Multiplying by `|x − k| > 0` (note that `x ≠ k`
because `∛2` is irrational) yields the claim.
-/

/-- There is no rational number whose cube equals `2`. -/
lemma rat_cube_ne_two (q : ℚ) : q ^ 3 ≠ 2 := by
  intro hq
  have hdq : (q.den : ℚ) ≠ 0 := by exact_mod_cast q.den_nz
  rw [← Rat.num_div_den q, div_pow, div_eq_iff (pow_ne_zero 3 hdq)] at hq
  -- `hq` states `q.num ^ 3 = 2 * q.den ^ 3`, over `ℚ`.
  have h2 : q.num ^ 3 = 2 * (q.den : ℤ) ^ 3 := by exact_mod_cast hq
  -- Hence the numerator is even.
  have hEvenNum : Even q.num := by
    rcases Int.even_or_odd q.num with hE | hO
    · exact hE
    · exfalso
      have hO3 : Odd (q.num ^ 3) := hO.pow
      rw [h2] at hO3
      obtain ⟨r, hr⟩ := hO3
      obtain ⟨s, hs⟩ := (⟨(q.den : ℤ) ^ 3, by ring⟩ : Even (2 * (q.den : ℤ) ^ 3))
      lia
  have h2dvdnum : (2 : ℤ) ∣ q.num := even_iff_two_dvd.mp hEvenNum
  obtain ⟨m, hm⟩ := hEvenNum
  -- Hence the denominator is even as well.
  have hEvenDenZ : Even (q.den : ℤ) := by
    rcases Int.even_or_odd (q.den : ℤ) with hE | hO
    · exact hE
    · exfalso
      have h8 : (q.den : ℤ) ^ 3 = 4 * m ^ 3 := by
        have hh : (m + m) ^ 3 = 2 * (q.den : ℤ) ^ 3 := by rwa [← hm]
        have h8m : (m + m) ^ 3 = 8 * m ^ 3 := by ring
        rw [h8m] at hh
        linarith
      have hO3 : Odd ((q.den : ℤ) ^ 3) := hO.pow
      rw [h8] at hO3
      obtain ⟨r, hr⟩ := hO3
      obtain ⟨s, hs⟩ := (⟨2 * m ^ 3, by ring⟩ : Even (4 * m ^ 3))
      lia
  have hEvenDen : Even q.den := by exact_mod_cast hEvenDenZ
  -- But the numerator and denominator of a rational number are coprime.
  have hdvd : (2 : ℕ) ∣ Nat.gcd q.num.natAbs q.den := by
    refine Nat.dvd_gcd ?_ (even_iff_two_dvd.mp hEvenDen)
    have h' : (2 : ℤ) ∣ (q.num.natAbs : ℤ) := Int.dvd_natAbs.mpr h2dvdnum
    exact_mod_cast h'
  rw [q.reduced.gcd_eq_one] at hdvd
  norm_num at hdvd

/-- A rational number is never equal to the real cube root of `2`. -/
lemma ratCast_ne_of_cube_eq_two {k : ℝ} (hk : k ^ 3 = 2) (q : ℚ) : (q : ℝ) ≠ k := by
  rintro rfl
  have h1 : ((q ^ 3 : ℚ) : ℝ) = 2 := by
    push_cast
    exact hk
  exact rat_cube_ne_two q (by exact_mod_cast h1)

/-- The key factorization, using `k³ = 2`:
`(2x² + 2x + 2) − (x² + 2x + 2)k = (x − k)((2 − k)x + 2 − k²)`. -/
lemma cube_eq_two_factor {k x : ℝ} (hk : k ^ 3 = 2) :
    2 * x ^ 2 + 2 * x + 2 - (x ^ 2 + 2 * x + 2) * k =
      (x - k) * ((2 - k) * x + 2 - k ^ 2) := by
  linear_combination -hk

lemma one_lt_of_cube_eq_two {k : ℝ} (hk : k ^ 3 = 2) : 1 < k := by
  have h3 : Odd 3 := ⟨1, rfl⟩
  rw [← h3.pow_lt_pow, one_pow, hk]
  norm_num

lemma lt_two_of_cube_eq_two {k : ℝ} (hk : k ^ 3 = 2) : k < 2 := by
  have h3 : Odd 3 := ⟨1, rfl⟩
  rw [← h3.pow_lt_pow, hk]
  norm_num

lemma sq_lt_two_of_cube_eq_two {k : ℝ} (hk : k ^ 3 = 2) : k ^ 2 < 2 := by
  have hk1 : 1 < k := one_lt_of_cube_eq_two hk
  have hkpos : 0 < k := zero_lt_one.trans hk1
  have h3 : k ^ 3 = k ^ 2 * k := by ring
  have hk2eq : k ^ 2 = 2 / k := by
    rw [eq_div_iff hkpos.ne', ← h3]
    exact hk
  rw [hk2eq]
  exact div_lt_self (by norm_num) hk1

/-- With `(A, B, C, a, b, c) = (2, 2, 2, 1, 2, 2)`, the required inequality
holds for every non-negative rational number `x`. -/
lemma main_inequality {k : ℝ} (hk : k ^ 3 = 2) (x : ℚ) (hx : 0 ≤ x) :
    |(2 * (x : ℝ) ^ 2 + 2 * (x : ℝ) + 2) / ((x : ℝ) ^ 2 + 2 * (x : ℝ) + 2) - k| <
      |(x : ℝ) - k| := by
  have hkpos : 0 < k := zero_lt_one.trans (one_lt_of_cube_eq_two hk)
  have hk2 : k < 2 := lt_two_of_cube_eq_two hk
  have hk2sq : k ^ 2 < 2 := sq_lt_two_of_cube_eq_two hk
  have hxr : (0 : ℝ) ≤ (x : ℝ) := by exact_mod_cast hx
  -- The denominator is positive.
  have hD : 0 < (x : ℝ) ^ 2 + 2 * (x : ℝ) + 2 := by
    have hsq := sq_nonneg (x : ℝ)
    linarith
  -- The second factor of the factored numerator is positive.
  have hN : 0 < (2 - k) * (x : ℝ) + 2 - k ^ 2 := by
    have h1 : 0 ≤ (2 - k) * (x : ℝ) := mul_nonneg (by linarith) hxr
    linarith
  -- ... and smaller than the denominator, since their difference is
  -- `x² + kx + k² > 0`.
  have hNltD : (2 - k) * (x : ℝ) + 2 - k ^ 2 < (x : ℝ) ^ 2 + 2 * (x : ℝ) + 2 := by
    have hkx : 0 ≤ k * (x : ℝ) := mul_nonneg hkpos.le hxr
    have hsq := sq_nonneg (x : ℝ)
    have hk2pos : 0 < k ^ 2 := pow_pos hkpos 2
    linarith
  have habs : 0 < |(x : ℝ) - k| :=
    abs_pos.mpr (sub_ne_zero.mpr (ratCast_ne_of_cube_eq_two hk x))
  have hDne : (x : ℝ) ^ 2 + 2 * (x : ℝ) + 2 ≠ 0 := hD.ne'
  rw [div_sub' hDne, cube_eq_two_factor hk, abs_div, abs_mul, abs_of_pos hN,
    abs_of_pos hD, mul_div_assoc]
  have h1 : ((2 - k) * (x : ℝ) + 2 - k ^ 2) / ((x : ℝ) ^ 2 + 2 * (x : ℝ) + 2) < 1 :=
    (div_lt_one hD).mpr hNltD
  exact (mul_lt_mul_of_pos_left h1 habs).trans_eq (mul_one _)

abbrev solution : ℤ × ℤ × ℤ × ℤ × ℤ × ℤ := (2, 2, 2, 1, 2, 2)

theorem usa1972_p4 (k : ℝ) (hk : k ^ 3 = 2) :
    match solution with
    | (A, B, C, a, b, c) => IsSolution A B C a b c k := by
  intro x hx
  simp only [Int.cast_ofNat, Int.cast_one, one_mul]
  exact main_inequality hk x hx

end Usa1972P4

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

人的思考A human's take

USAMO 72/4 solution — John Scholes (Kalva archive)

John Scholes 的解法只有几行,但每一步都在减少未知数。他先让 $x$ 趋于 $k$,由不等式右边趋于零,推出 $(Ak^2+Bk+C) = k(ak^2+bk+c)$,于是 $A=b$、$B=c$、$C=2a$——六个整数一下子只剩三个。John Scholes's solution is only a few lines, but every line removes unknowns. He first lets $x$ approach $k$; since the right side of the inequality goes to zero, $(Ak^2+Bk+C) = k(ak^2+bk+c)$, which gives $A=b$, $B=c$, $C=2a$ — six integers reduced to three.

接着他把分子减去 $k$ 倍分母,因式分解成 $(x-k)((b-ak)x + c - ak^2)$,问题变成「这个一次式要比分母小」。他写道,满足它的方法有很多,随手取 $a=1$、$b=c=2$:此时 $(b-ak)x$ 对正 $x$ 是正的且小于 $bx$,常数项 $c-ak^2$ 也是正的且小于 $c$,不等式自然成立。He then subtracts $k$ times the denominator from the numerator and factors it as $(x-k)((b-ak)x + c - ak^2)$, so the problem becomes making that linear factor smaller than the denominator. There are many ways, he notes; take $a=1$, $b=c=2$. Then $(b-ak)x$ is positive for positive $x$ and smaller than $bx$, while the constant $c-ak^2$ is positive and smaller than $c$, so the inequality holds.

AI 随想An AI's reflection

以下由 AI 撰写。Written by AI.

这道题看上去像在六个整数里碰运气,实际的第一击是「取极限」:不等式强迫分子在 $x=k$ 处正好抵消,六个自由度立刻塌成三个。很多人做这类题时急着构造,真正省力的动作却是先问「如果它成立,端点上必须发生什么」。The problem looks like a lucky search over six integers, but the first move is a limit: the inequality forces the numerator to cancel exactly at $x=k$, and six degrees of freedom collapse to three. In problems like this it is tempting to start constructing; the cheaper move is to ask what must happen at the endpoint if the claim is true.

第二步才是构造,而构造之所以容易,是因为已经把「差」因式分解成了一个一次式乘 $(x-k)$。剩下要证的只是这个一次式比二次分母小,而它们的差恰好是 $x^2+kx+k^2$——一个永远为正的配方。这也顺带解释了为什么二次刚好够:差里只剩一个一次因子,分母只要增长得比它快,比值就会被压进 $(0,1)$。这种「先用端点把形状钉死,再挑参数」的顺序,在别处也反复出现——先让边界和对称性说话,剩下的才是算术。Only then comes the construction, and it is easy because the difference has already been factored into a linear term times $(x-k)$. What remains is to show that this linear term is smaller than the quadratic denominator, and their difference is exactly $x^2+kx+k^2$ — a sum that is always positive. It also explains why quadratic is just enough: the difference leaves a single linear factor, and as long as the denominator grows faster the ratio is pinned inside $(0,1)$. This order of work — let the endpoint fix the shape, then choose parameters — shows up elsewhere too: let boundaries and symmetry speak first, and what is left is arithmetic.

Lean 形式化最花力气的不是这些代数,而是 $k$ 不是有理数:没有它,$|x-k|$ 可能为零,严格不等式就不成立。人写解答时常常一句「显然」带过,机器会逼你把那个「显然」真的证出来。这也是我喜欢看形式化版本的原因:它把证明里被省略的承重墙标了出来。The hard work in the Lean formalization is not the algebra but the irrationality of $k$: without it, $|x-k|$ could be zero and the strict inequality would fail. Human solutions wave this away with “obviously”; the machine makes you prove the obvious. That is why I like reading the formal version: it marks the load-bearing walls that the prose left out.

✓ 已通过 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.36.0-rc2 · Mathlib a906e4e

程序员随想Programmer Reflections

哲学与生活Philosophy and Life

工具角Tools Corner