🔀 反证法：假设相反，推出矛盾🔀 Proof by Contradiction: Assume the Opposite, Hit a Contradiction
上一片里，直接证明从前提一路排到结论，干净利落。可有些结论特别刺头——正面怎么推都推不动。小算盘机器人还有第二招：反着来。先假装结论不成立，看看这条路会通向哪里。Last leaf, direct proof marched from premises straight to the conclusion. But some conclusions are stubborn — pushing forward gets you nowhere. The little abacus robot has a second move: go the other way. Pretend the claim is false, and see where that road leads.
第 1 步：走上「假设相反」那条岔路Step 1: take the fork called “assume the opposite”
想证明 P，先看看它的反面会把我们带到哪儿。To prove P, first see where its opposite would carry us.
反证法的开头只有一句话：假设「P 不成立」（数学上写作「非 P」），然后把这个假设当成新的前提，照常用定义和已知往下推。注意：这不是瞎猜，而是一次有计划的试探——如果这条路自己撞了墙，就说明「P 不成立」根本站不住脚，那么 P 只能是真的。Contradiction begins with one sentence: assume “P is false” (written “not P”), then treat that assumption as a fresh premise and reason forward with definitions and known facts as usual. This is not random guessing — it is a planned probe: if this road crashes into a wall all by itself, then “P is false” cannot stand, so P must be true.
什么样的结果才算「撞墙」？So what counts as hitting a wall?
第 2 步：矛盾就是那堵墙Step 2: the contradiction is the wall
矛盾，就是推出了一对不可能同时成立的结论——比如「这个数既是偶数又是奇数」，或者「a 和 b 明明约到了最简，却又必须都是偶数」。矛盾一出现，矛头就指向最开始的那个假设：因为推理的每一步都没问题，出问题的只能是假设本身。假设被推翻，「非 P」不成立——于是 P 成立。记住这个转折：错的是起点，不是路。A contradiction is a pair of conclusions that cannot both be true — for example “this number is both even and odd”, or “a and b are in lowest terms, yet both must be even”. The moment it appears, the blame points back to the opening assumption: every reasoning step was fine, so the only thing that can be wrong is the assumption itself. The assumption collapses, “not P” fails — and therefore P holds. Remember the twist: it is the starting point that was wrong, not the road.
把这一招用在数学史上最有名的一个结论上。Now aim this move at one of the most famous conclusions in mathematics.
第 3 步：经典一战：√2 不是有理数Step 3: the classic battle: √2 is not rational
证明示意：① 假设相反：设 √2 是有理数，写成最简分数 √2 = a/b。② 两边平方：2 = a²/b²，即 a² = 2b²，所以 a² 是偶数，a 也是偶数。③ 设 a = 2k 代回去：4k² = 2b²，即 b² = 2k²，所以 b 也是偶数。④ 撞墙：a、b 都是偶数，和「已经是最简分数」矛盾！⑤ 结论：假设不成立，√2 不是有理数。∎ 同样的套路还能证明「没有最大的整数」「质数有无穷多个」。反证法是数学家的后门钥匙。Here is the sketch: (1) Assume the opposite: suppose √2 is rational, written in lowest terms as √2 = a/b. (2) Square both sides: 2 = a²/b², so a² = 2b² — hence a² is even, and so is a. (3) Write a = 2k and substitute: 4k² = 2b², so b² = 2k² — hence b is even too. (4) Wall: a and b are both even, contradicting “already in lowest terms”! (5) Conclusion: the assumption fails, so √2 is not rational. ∎ The same trick also proves “there is no largest integer” and “there are infinitely many primes”. Contradiction is the mathematician’s back-door key.
🎮 你来走两条路（1 分钟）🎮 Your turn: walk the two roads (1 minute)
下面有 4 个命题。每关沿着「假设相反」的路一步步往前走——撞到墙时，按下「矛盾！撞墙了」。Four claims below. In each level, walk step by step down the “assume the opposite” road — and when you hit the wall, press “Contradiction! Hit the wall”.
一句话记住它：反证法 = 假设相反 → 推到矛盾 → 所以原结论成立。Remember it in one line: contradiction = assume the opposite → push to a contradiction → so the original claim holds.
开头先反着假设：把「非 P」当成新前提Start by assuming the opposite: treat “not P” as a new premise中间照常用已知推理：一路推到不可能Reason forward as usual: push until something impossible appears撞墙后回头：错的是假设，所以 P 成立Turn around at the wall: the assumption was wrong, so P stands
内容参考 OpenStax 等公开教材，多来源核对 · AI 生成、人工审核 · 发现错误欢迎指正，帮这片叶子长得更好。Based on OpenStax and other open textbooks, cross-checked across sources · AI-generated, human-reviewed · Spotted a mistake? Tell us — help this leaf grow.
Back to tree
