Proof by Contradiction | 反证法

📚 Proof by Contradiction | 反证法

Proof by contradiction, also known as indirect proof, is a cornerstone of mathematical reasoning. The idea is simple yet elegant: to prove a statement true, we temporarily assume the opposite and show that this assumption inevitably leads to a logical impossibility. Since a contradiction cannot hold, our original statement must be true. In the IB Mathematics: Analysis and Approaches course, proof by contradiction is an explicit topic, tested through classic examples such as the irrationality of √2, the infinitude of primes, and parity arguments.

反证法，又称间接证明，是数学推理的基石。其思想简洁而优美：为了证明一个命题为真，我们暂时假设它的反面成立，并证明这一假设必然导致逻辑上的不可能。由于矛盾不可能成立，因此原命题必然为真。在 IB 数学：分析与方法课程中，反证法是一个明确的知识点，常通过诸如 √2 的无理性、素数的无穷性以及奇偶性论证等经典例子进行考查。

1. What is Proof by Contradiction? | 什么是反证法？

Proof by contradiction is a deductive argument in which we start by assuming the negation of the statement we wish to prove. We then use valid logical steps to derive a contradiction—typically two mutually exclusive facts, such as a number being both even and odd, or an equation like 1 = 0. Because a contradiction cannot exist in a consistent mathematical system, the initial assumption must be false, and consequently, the original statement is true. This technique is especially powerful when a direct proof is cumbersome or not obvious.

反证法是一种演绎论证，我们首先假设欲证命题的否定成立，然后通过有效的逻辑步骤推导出一个矛盾——通常表现为两个互斥的事实，例如一个数既是偶数又是奇数，或者像 1 = 0 这样的等式。因为在一致的数学体系中矛盾不可能存在，所以初始假设必然为假，从而原命题为真。当直接证明繁琐或不明显时，这一技巧尤为有力。

2. The Logical Foundation | 逻辑基础

The logical backbone of proof by contradiction is the law of non-contradiction, which states that a proposition and its negation cannot both be true simultaneously. Symbolically, to prove a statement P, we assume ¬P and derive both Q and ¬Q (or any absurd consequence). The only escape from this absurdity is to reject ¬P, hence accepting P. This form of reasoning is equivalent to the tautology (¬P ⇒ (Q ∧ ¬Q)) ⇒ P. It is fully rigorous and widely accepted in all areas of mathematics.

反证法的逻辑支柱是矛盾律，即一个命题与其否定不能同时为真。用符号表示，要证明命题 P，我们假设 ¬P 成立，并推导出 Q 与 ¬Q 同时成立（或任何荒谬推论）。摆脱这一荒谬的唯一出路是否定 ¬P，从而接受 P。这种推理形式等价于重言式 (¬P ⇒ (Q ∧ ¬Q)) ⇒ P。它在数学的所有领域都被认为是完全严格的并被广泛接受。

3. General Steps | 一般步骤

1. Identify the statement P that you need to prove.
2. Assume the opposite, that is, ¬P, and state this assumption clearly.
3. Use logical deductions, algebra, known theorems, and the assumption ¬P to work towards a contradiction.
4. The contradiction could be: a number is both rational and irrational, an integer is both even and odd, 0 = 1, or a violation of a fundamental property.
5. Conclude that ¬P is impossible; therefore, by contradiction, P is true. Always write a concluding sentence to wrap up the proof.

1. 明确需要证明的命题 P。
2. 假设其反面，即 ¬P，并清晰陈述这一假设。
3. 运用逻辑推导、代数运算、已知定理以及假设 ¬P，逐步推出一个矛盾。
4. 矛盾可以表现为：一个数既是有理数又是无理数，一个整数既是偶数又是奇数，0 = 1，或者违背某个基本性质。
5. 断定 ¬P 不可能成立；因此，根据反证法，P 为真。务必写一句总结性陈述来收束证明。

4. Classic Example 1: The Irrationality of √2 | 经典示例1：√2 是无理数

Assume, for the sake of contradiction, that √2 is rational. Then we can write √2 = a/b, where a and b are positive integers with no common factors (the fraction is in lowest terms). Squaring both sides yields:

为了导出矛盾，假设 √2 是有理数。那么我们可以写成 √2 = a/b，其中 a 与 b 是互质的正整数（即分数已约至最简）。两边平方得：

2 = a² / b² → a² = 2b²

This shows that a² is an even number. If a² is even, then a must be even (as proved in a later example). Hence we can write a = 2k for some integer k. Substituting back:

这表明 a² 为偶数。若 a² 为偶，则 a 必为偶数（随后示例将证明）。因此可令 a = 2k，其中 k 为整数。代回得：

(2k)² = 2b² → 4k² = 2b² → b² = 2k²

Thus b² is even, and so b is even. Now both a and b are even, meaning they share a common factor of 2. This contradicts the original premise that a/b is in lowest terms. The contradiction forces us to reject the assumption that √2 is rational; therefore, √2 is irrational.

因此 b² 为偶数，进而 b 也为偶数。至此 a 和 b 均为偶数，这意味着它们有公因数 2。这与原假设 a/b 为最简分数矛盾。这一矛盾迫使我们否定 √2 为有理数的假设；因此，√2 是无理数。

5. Classic Example 2: Infinitude of Primes | 经典示例2：素数有无穷多个

Euclid’s celebrated proof. Suppose, to the contrary, that there are only finitely many prime numbers. List them as p₁, p₂, …, pₙ. Now construct the number N = p₁ × p₂ × … × pₙ + 1. Clearly N > 1, so N must be divisible by at least one prime. However, if we divide N by any prime pᵢ from our list, the remainder is 1, because N = (product of all pⱼ) + 1. Therefore, no prime from the list divides N. This means that N itself is a prime not in the list, or N has a prime factor not among the pᵢ. Either way, we have discovered a prime outside the supposedly exhaustive list, which contradicts the assumption that the list contained all primes. Hence, there are infinitely many primes.

欧几里得著名的证明。假设相反，只有有限个素数。列出它们：p₁, p₂, …, pₙ。现在构造数 N = p₁ × p₂ × … × pₙ + 1。显然 N > 1，故 N 必能被至少一个素数整除。然而，若用列表中任一素数 pᵢ 去除 N，余数均为 1，因为 N = (全部 pⱼ 的乘积) + 1。因此，列表中没有任何素数能整除 N。这意味着 N 本身是一个不在列表中的素数，或者 N 有一个不在 pᵢ 中的素因子。无论哪种情况，我们都发现了列表之外的新素数，这与列表包含所有素数的假设矛盾。因此，素数有无穷多个。

6. Supporting Lemma: If a² is Even then a is Even | 辅助引理：若 a² 为偶则 a 为偶

This small but crucial result is often proved by contradiction within larger proofs. Assume the contrary: a is an integer, a² is even, but a is odd. An odd integer can be expressed as a = 2k + 1 for some integer k. Squaring gives:

这个小而关键的结论常在更大的证明中通过反证法确立。假设相反：a 为整数，a² 为偶数，但 a 为奇数。奇数可表为 a = 2k + 1，其中 k 为整数。平方得：

a² = (2k + 1)² = 4k² + 4k + 1 = 2(2k² + 2k) + 1

The expression 2(2k² + 2k) + 1 is clearly odd. This contradicts the given fact that a² is even. Therefore, our contrary assumption must be false: a cannot be odd; it must be even. This lemma is used, for instance, in the proof that √2 is irrational.

式子 2(2k² + 2k) + 1 明显是奇数。这与 a² 为偶数的已知事实矛盾。因此，我们的相反假设必为假：a 不能是奇数，只能是偶数。该引理可用于 √2 为无理数的证明等情境。

7. Example 3: No Integer Solutions for x² − 4y = 2 | 示例3：方程 x² − 4y = 2 无整数解

Let us prove by contradiction that there do not exist integers x and y satisfying x² − 4y = 2. Assume such integers exist. Then we can rewrite the equation as x² = 4y + 2 = 2(2y + 1). The right-hand side is even, so x² is even. By the previous lemma, x must be even. Write x = 2k for some integer k. Substitute:

我们用反证法证明不存在整数 x, y 满足 x² − 4y = 2。假设这样的整数存在。那么可将方程改写为 x² = 4y + 2 = 2(2y + 1)。右边为偶数，故 x² 为偶数。根据前述引理，x 必为偶数。设 x = 2k，k 为整数。代入：

(2k)² − 4y = 2 → 4k² − 4y = 2 → 4(k² − y) = 2

This implies 2 = 4(k² − y), so k² − y = 1/2. But k and y are integers, so k² − y is an integer. An integer cannot equal 1/2—a contradiction. Therefore, no such integers x and y exist. This example illustrates how parity and divisibility contradictions can be forced out of a simple Diophantine equation.

这意味着 2 = 4(k² − y)，于是 k² − y = 1/2。但 k 与 y 皆为整数，故 k² − y 是整数。整数不可能等于 1/2——这就产生了矛盾。因此，不存在这样的整数 x 和 y。这个例子展示了如何从简单的丢番图方程中逼出奇偶性与整除性的矛盾。

8. Common Pitfalls and How to Avoid Them | 常见陷阱与避免方法

Many students stumble by not stating the contradiction explicitly. Always pinpoint the exact conflict: ‘This contradicts the fact that a and b are coprime’, or ‘The assumption leads to 0 = 1, which is impossible’. Another common mistake is using circular reasoning, where the conclusion is hidden within the assumption. Ensure your deduction is logically sound and each step follows from the last. When negating a statement involving quantifiers, remember that ‘for all’ becomes ‘there exists’, and vice versa. Practice writing clear, step-by-step proofs to build confidence.

许多学生因未明确陈述矛盾而失分。必须精确指出冲突所在：”这与 a、b 互质矛盾”，或”该假设导致 0 = 1，这是不可能的”。另一个常见错误是使用循环论证，即结论已隐藏在假设之中。请确保推导逻辑严密，每一步都从上一步合理推出。在否定包含量词的命题时，记住”所有”的否定是”存在”，反之亦然。通过练习书写清晰、分步的证明来建立信心。

9. Proof by Contradiction in IB Exams | IB 考试中的反证法

In the IB Mathematics: Analysis and Approaches syllabus, proof by contradiction is specifically listed under Topic 1. In exams, you may be asked directly to ‘Prove by contradiction that √3 is irrational’ or ‘Use proof by contradiction to show that there are infinitely many primes’. Marks are allocated for correctly writing the assumption, performing valid algebraic manipulations, reaching a contradiction, and providing a conclusion. Even if you get stuck, stating the assumption and the aim can earn method marks. It is also useful to recognise when a problem is best tackled by contradiction, such as when proving non-existence or irrationality.

在 IB 数学：分析与方法大纲中，反证法被明确列入主题 1。考试中可能直接要求”用反证法证明 √3 是无理数”，或”使用反证法证明素数有无穷多个”。得分点包括正确写出假设、进行有效的代数操作、得出矛盾以及给出结论。即使卡住，写出假设与目标也可能得到方法分。识别何时最适合使用反证法也很有用，例如证明不存在性或无理数时。

10. Practice and Further Thoughts | 练习与深入思考

To master proof by contradiction, attempt to prove that √3 is irrational, that log₂5 is irrational, or that there is no rational number whose square is 5. Explore more advanced scenarios: prove that there are no positive integer solutions to a² + b² = 3c² using modulo 3 arguments. Each successful proof builds an intuition for when contradictions naturally arise. Remember, contradiction is not just a trick—it is a fundamental mode of mathematical thinking that sharpens your logical precision and problem-solving skills.

要掌握反证法，请尝试证明 √3 是无理数，log₂5 是无理数，或不存在平方为 5 的有理数。探索更高级的情境：运用模 3 论证证明 a² + b² = 3c² 无正整数解。每次成功的证明都会培养你对矛盾自然涌现的直觉。请记住，反证法不仅仅是一种技巧——它是数学思维的基本模式，能磨砺你的逻辑严谨性与解题能力。

Published by TutorHao | 数学 Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）