📚 Proof by Contradiction: Logic and Proof Techniques | 反证法：逻辑推理与证明技巧
Proof by contradiction is one of the most powerful and elegant methods in mathematics. It works by assuming the opposite of what we want to prove, then showing that this assumption leads to a logical absurdity. This contradiction forces us to conclude that the original statement must be true.
反证法是数学中最有力、最优雅的方法之一。它的思路是：先假设我们要证明的命题不成立，然后从这个假设出发，推演出一个逻辑上的荒谬结论。这个矛盾迫使我们承认：原命题必然为真。
1. Logical Foundations: Propositions and Negations | 逻辑基础：命题与否定
A proposition is a statement that is either true or false, but not both. For example, “2 is an even number” is a true proposition, while “3 is even” is false. The negation of a proposition P, written as ¬P, is the statement “P is false”. In proof by contradiction, we begin with the negation of the target proposition.
命题是一个要么为真、要么为假、但不能同时既真又假的陈述。例如“2是偶数”是真命题，而“3是偶数”是假命题。命题P的否定记作¬P，表示“P为假”。在反证法中，我们首先假设目标命题的否定成立。
It is crucial to formulate the negation correctly. For a proposition of the form “for all x, P(x)”, the negation is “there exists an x such that ¬P(x)”. For “there exists x such that P(x)”, the negation is “for all x, ¬P(x)”. Misunderstanding quantifiers is a common source of error.
正确写出否定形式至关重要。对于“对所有x，P(x)”这样的命题，其否定是“存在某个x，使得¬P(x)”。而对于“存在x，使得P(x)”，其否定是“对所有x，¬P(x)”。对量词理解错误是常见的失误来源。
2. The Principle of Proof by Contradiction | 反证法的原理
The underlying principle is the law of excluded middle: every proposition is either true or false, with no middle ground. If we assume ¬P and derive a contradiction — a statement that is both true and false — then ¬P cannot be true. Therefore, P must be true.
反证法的基本原理是排中律：任何命题要么为真、要么为假，不存在中间状态。如果我们假设¬P，并由此推出矛盾——即一个既真又假的陈述——那么¬P就不可能为真。因此，P必然为真。
Formally, to prove P, we suppose ¬P. Then we use logical deductions to reach a statement R such that R ∧ ¬R (R and not R both hold). Since this is impossible, our initial supposition ¬P must be false. Hence P is true.
形式上，为了证明P，我们假设¬P。然后通过逻辑演绎得到一个陈述R，使得R和¬R同时成立。既然这不可能，那么初始假设¬P必然为假，因此P为真。
3. Steps for Constructing a Proof by Contradiction | 反证法的证明步骤
Step 1: Clearly identify the statement P to be proved. Step 2: Assume the negation ¬P is true. Step 3: Reason logically from ¬P, using definitions, known theorems, and algebraic manipulations. Step 4: Derive a contradiction, such as 0 = 1, or a statement that violates a known fact. Step 5: Conclude that the assumption ¬P was false, so P is true.
第一步：明确要证明的命题P。第二步：假设其否定¬P为真。第三步：从¬P出发进行逻辑推理，运用定义、已知定理和代数运算。第四步：推出矛盾，例如0=1，或某个违反已知事实的结论。第五步：断定假设¬P是假的，因此P为真。
This structure resembles a “trial” in mathematics: the assumption is the defendant, the contradiction is the decisive evidence, and the conclusion is the verdict. The proof ends when the contradiction is explicit, and no further work is needed.
这种结构如同数学中的“审判”：假设是被告，矛盾是决定性证据，结论是判决。当矛盾明确出现时，证明即告完成，无需再做额外的推导。
4. Classic Example: √2 Is Irrational | 经典例一：√2是无理数
This is the most famous proof by contradiction in all of mathematics. We want to prove that √2 cannot be written as a fraction a/b where a and b are integers with no common factor and b ≠ 0.
这是整个数学中最著名的反证法证明。我们要证明：√2不能写成a/b的形式，其中a、b是互质的整数，且b≠0。
Assume the opposite: suppose √2 = a/b, where a and b are coprime integers. Squaring both sides gives 2 = a²/b², so a² = 2b². This means a² is even. If a² is even, then a must be even (we will prove this lemma shortly). So let a = 2k for some integer k.
假设反面：设√2 = a/b，其中a和b是互质整数。两边平方得2 = a²/b²，因此a² = 2b²。这意味着a²是偶数。如果a²是偶数，那么a必定是偶数（我们稍后会证明这个引理）。于是设a = 2k，其中k是整数。
Substitute a = 2k into a² = 2b²: we get 4k² = 2b², so b² = 2k². Hence b² is even, so b is even. Now both a and b are even, which contradicts the assumption that a and b are coprime. Therefore our initial assumption is false: √2 is irrational.
将a = 2k代入a² = 2b²，得4k² = 2b²，所以b² = 2k²。因此b²是偶数，b也是偶数。现在a和b都是偶数，这与a和b互质的假设矛盾。因此最初的假设是假的：√2是无理数。
5. Classic Example: The Infinitude of Prime Numbers | 经典例二：质数有无穷多个
Euclid’s theorem states that there are infinitely many prime numbers. The proof is a brilliant example of proof by contradiction.
欧几里得定理指出：质数有无穷多个。该证明是反证法的绝佳范例。
Suppose the opposite: there are only finitely many primes. List them all as p₁, p₂, p₃, …, pₙ. Now consider the number N = p₁ × p₂ × p₃ × … × pₙ + 1. When divided by any prime pᵢ in the list, N leaves a remainder of 1. So N is not divisible by any of the listed primes.
假设反面：质数只有有限多个。把它们全部列出：p₁, p₂, p₃, …, pₙ。现在考虑数N = p₁ × p₂ × p₃ × … × pₙ + 1。N除以列表中的任意质数pᵢ，都余1。因此N不能被列表中的任何质数整除。
But every positive integer greater than 1 has a prime factor. Hence N itself has a prime factor, which must be either a new prime not in the list, or N itself is prime. In either case, this contradicts the assumption that the list contained all primes. Therefore there must be infinitely many primes.
但每个大于1的正整数都有质因数。因此N本身必有一个质因数，这个质因数要么是不在列表中的新质数，要么N本身就是质数。无论哪种情况，都与“列表包含所有质数”的假设矛盾。因此质数必定有无穷多个。
6. Proving a Lemma: If n² Is Even, Then n Is Even | 证明引理：若n²为偶数，则n为偶数
In the √2 proof, we used the lemma that if n² is even, then n is even. This lemma itself can be proved by contradiction or by its contrapositive.
在√2的证明中，我们用到了一个引理：如果n²是偶数，那么n是偶数。这个引理本身可以用反证法，也可以用逆否命题来证明。
Contradiction proof: Assume n is odd. Then n = 2k + 1 for some integer k. Squaring gives n² = 4k² + 4k + 1 = 2(2k² + 2k) + 1. This is of the form 2m + 1, so n² is odd. This contradicts the assumption that n² is even. Hence n cannot be odd; so n is even.
反证法证明：假设n是奇数。那么n = 2k + 1，其中k为整数。平方得n² = 4k² + 4k + 1 = 2(2k² + 2k) + 1。这是2m + 1的形式，所以n²是奇数。这与n²是偶数的假设矛盾。因此n不能是奇数，故n是偶数。
Alternatively, the contrapositive statement “if n is odd then n² is odd” is easier to prove directly. Notice that the contrapositive is logically equivalent to the original statement, which is another connection between proof methods.
另一种方法是直接证明逆否命题“若n是奇数，则n²是奇数”。注意逆否命题与原命题逻辑等价，这也体现了不同证明方法之间的联系。
7. Applying Contradiction to Inequalities and Limits | 反证法在不等式与极限中的应用
Proof by contradiction is also useful in real analysis, particularly when proving uniqueness of limits. Suppose a sequence (aₙ) converges to two different limits L and M, with L ≠ M. Then for ε = |L − M|/2 > 0, the sequence must eventually be within ε of both L and M.
反证法在实数分析中同样很有用，特别是在证明极限的唯一性时。假设一个数列(aₙ)收敛于两个不同的极限L和M，且L≠M。取ε = |L − M|/2 > 0，那么数列最终必须同时落在L和M的ε邻域内。
But the distance between L and M is 2ε, so a single term cannot be within ε of both L and M at the same time. This is an impossibility, contradicting the convergence assumption. Therefore L = M, and the limit is unique.
但L和M之间的距离是2ε，所以同一个项不可能同时落在L和M的ε邻域内。这是一个不可能的情况，与收敛假设矛盾。因此L=M，极限唯一。
This pattern — assume two distinct values, construct a small ε, and derive a geometric contradiction — is a common technique in analysis and demonstrates the versatility of contradiction.
这种模式——假设两个不同的值，构造一个足够小的ε，并推出几何上的矛盾——是分析中的常用技巧，展示了反证法的广泛适用性。
8. Indirect Proof in Geometry: The Parallel Postulate | 几何中的间接证明：平行公设
In geometry, proof by contradiction often involves assuming a configuration that violates a theorem, then showing that lengths or angles become inconsistent. For example, consider the theorem: if two lines are parallel, then alternate interior angles are equal.
在几何中，反证法常常通过假设一个违反定理的图形结构，然后推出线段长度或角度不一致。例如，考虑定理：如果两条直线平行，则内错角相等。
Assume the alternate interior angles are not equal. Let angle α be greater than angle β. Then the two lines, when extended, would meet on the side where the angles are smaller. But the parallel lines never meet by definition, so this is a contradiction. Hence the angles must be equal.
假设内错角不相等。设角α大于角β。那么两条直线延长后，会在角度较小的一侧相交。但根据定义，平行线永不相交，矛盾。因此角度必然相等。
This proof relies on the parallel postulate itself, so it is valid in Euclidean geometry. It illustrates how contradiction can turn a defining property (parallel lines never meet) into a rigorous angle relationship.
这个证明依赖于平行公设本身，因此在欧氏几何中成立。它展示了反证法如何将定义性性质（平行线永不相交）转化为严格的角度关系。
9. Common Mistakes and Pitfalls | 常见错误与注意事项
One major pitfall is incorrectly negating the statement. For example, the negation of “all primes are odd” is not “all primes are even”, but “there exists at least one prime that is even”. The latter is true (2 is prime and even), which shows the original statement is false.
一个主要陷阱是错误地写出命题的否定。例如，“所有质数都是奇数”的否定不是“所有质数都是偶数”，而是“至少存在一个质数是偶数”。后者确实为真（2是质数且是偶数），这正好说明原命题是假的。
Another mistake is stopping after showing a consequence is unlikely or unfamiliar, rather than deriving an actual contradiction. A proof by contradiction requires a formal contradiction such as P ∧ ¬P, or a direct violation of a known theorem or definition.
另一个错误是：仅仅得出一个看似不可能或不常见的结论就停止，而不是推出真正的矛盾。反证法需要形式上的矛盾，如P∧¬P，或直接违反已知的定理或定义。
Finally, avoid overusing contradiction when a direct proof is simpler. For example, proving “if x is even, then x² is even” via contradiction is longer than a direct substitution x = 2k. Mathematicians value elegance; choose the clearest method.
最后，当直接证明更简单时，避免过度使用反证法。例如，证明“若x是偶数，则x²是偶数”，直接代入x = 2k比反证法简洁得多。数学家重视优雅性；应选择最清晰的方法。
10. Practice Problems and Self-Test | 练习与自我检测
Problem 1: Prove that there is no largest integer. (Hint: assume N is the largest integer, then consider N + 1.)
练习1：证明不存在最大的整数。（提示：假设N是最大整数，然后考虑N+1。）
Problem 2: Prove that if a, b, and c are real numbers and a + b + c = 0, then at least one of a, b, c is non-negative. (Hint: suppose all three are negative, then consider their sum.)
练习2：设a、b、c为实数，且a + b + c = 0。证明a、b、c中至少有一个是非负数。（提示：假设三个都是负数，考虑它们的和。）
Problem 3: Prove that log₂ 3 is irrational. (Hint: suppose log₂ 3 = p/q with integers p and q, then take powers and derive a divisibility contradiction.)
练习3：证明log₂3是无理数。（提示：设log₂3 = p/q，其中p、q为整数，然后取幂并推导出整除性矛盾。）
Try these before reading solutions. The key is to clearly state the assumption, reason step by step, and identify the exact contradiction. Review each proof to check whether the negation was formed correctly.
请先尝试完成这些练习再看解答。关键是清晰地陈述假设，逐步推理，并找出确切的矛盾。每次证明后都要检查否定形式是否写对。
11. Summary: Why Contradiction Matters | 总结：反证法为何重要
Proof by contradiction is not just a trick; it is a fundamental mode of mathematical thought. It allows us to prove existence and uniqueness results, establish irrationality, and handle statements whose direct proof is difficult or elusive.
反证法不仅是一种技巧，更是数学思维的基本模式。它使我们能够证明存在性和唯一性结论，建立无理数性质，并处理那些直接证明困难甚至无从下手的命题。
In A-Level mathematics, mastery of contradiction often appears in number theory, sequences, and proof questions. It also builds transferable reasoning skills: the ability to hold a hypothesis, explore its consequences, and recognize inconsistency is valuable far beyond the exam.
在A-Level数学中，反证法的掌握常出现在数论、数列和证明题中。它同时培养了可迁移的推理能力：提出假设、探索其后果并识别矛盾，这种能力在考试之外同样宝贵。
Remember the essential structure: assume the opposite, derive a contradiction, conclude the original. With practice, you will be able to spot when contradiction is the right tool — often when you need to prove that something “cannot” happen or that something “must” exist.
牢记核心结构：假设反面，推出矛盾，得出结论。通过练习，你将能够识别何时该用反证法——通常是在需要证明某事“不可能发生”或某事“必定存在”的时候。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply