📚 Methods of Proof | 证明方法
Proof is the backbone of mathematics. In your Edexcel A-Level course, constructing and understanding logical arguments is a key skill assessed across Pure Mathematics. This article explores the main methods of proof you need to master: direct proof, proof by contradiction, contrapositive, exhaustion, and mathematical induction. Each method is illustrated with clear examples and common pitfalls are highlighted so that you can approach proof questions with confidence.
证明是数学的支柱。在Edexcel A-Level课程中，建立和理解逻辑论证是纯数学部分考核的一项关键技能。本文介绍你需要掌握的主要证明方法：直接证明、反证法、逆否命题证明、穷举法和数学归纳法。每种方法都配有清晰的示例，并指出了常见陷阱，让你能自信应对证明题。
1. What is Proof? | 什么是证明？
A mathematical proof is a logical chain of reasoning that demonstrates a statement is universally true. Starting from agreed axioms or known facts, every step must be justified by a definition, a previously established theorem or an algebraic manipulation. In A-Level exams, you are often asked to prove simple number properties, inequalities or divisibility results.
数学证明是通过一系列逻辑推理来表明一个命题普遍成立的过程。从公认的公理或已知事实出发，每一步都必须由一个定义、一个先前建立的定理或代数运算来支撑。在A-Level考试中，你常被要求证明简单的数的性质、不等式或整除性结论。
A valid proof leaves no room for doubt; it must cover all cases and follow a clear progression. Understanding the difference between deductive reasoning (general to specific) and inductive reasoning (specific to general) helps you choose the right method for a given problem.
一个有效的证明不能留下任何疑问；它必须涵盖所有可能情况，并且推理层次清晰。理解演绎推理（由一般到特殊）和归纳推理（由特殊到一般）的区别，有助于你针对给定问题选择正确的方法。
2. Direct Proof | 直接证明
Direct proof is the most straightforward method: you start with a known fact and step by step derive the statement you want to prove. This is particularly useful when proving algebraic identities or properties of numbers, such as showing that the sum of two even numbers is even.
直接证明是最直观的方法：从一个已知事实出发，逐步推导出你想要证明的命题。在证明代数恒等式或数的性质时，这种方法特别有用，比如证明两个偶数之和仍为偶数。
+ 1, which is of the form 2m + 1, hence odd. Every step uses only basic algebra and the definition of odd.
例如，要证明奇数的平方仍是奇数，设奇数为2k + 1，其中k为整数。平方得：(2k + 1)² = 4k² + 4k + 1 = 2(2k² + 2k) + 1，这恰好是2m + 1的形式，因此是奇数。每一步仅使用了基本代数和奇数的定义。
Direct proofs are often used for 'if p then q' statements where a clear pathway exists from hypothesis p to conclusion q. Always state your assumptions clearly and show the algebraic flow.
直接证明常用于“若p则q”型的命题，且存在从假设p到结论q的清晰路径。务必清楚地陈述你的假设，并展示代数推导流程。
3. Proof by Contradiction | 反证法
Proof by contradiction begins by assuming the opposite of what you want to prove, and then shows this assumption leads to an impossible or absurd result – a contradiction. Since the opposite cannot be true, the original statement must be true.
反证法从假设你要证明的命题的反面出发，进而推出这个假设会导致一个不可能或荒谬的结果——即矛盾。由于反面不可能成立，原命题必然为真。
This method is powerful when direct reasoning is tricky. Classic A-Level examples include the irrationality of √2, the infinitude of primes, or proving that if n² is even then n is even. Always start by writing 'Assume, for contradiction, that the statement is false...' and clearly state the contradiction you reach.
当直接推理比较棘手时，这种方法非常有效。A-Level中经典的例子包括√2是无理数、素数有无穷多个，或证明若n²为偶数则n为偶数。一定要以“假设命题不成立，即……”开头，并清晰陈述你得到什么样的矛盾。
For instance, to prove there is no greatest integer, assume there is a greatest integer N. But N+1 is also an integer and N+1 > N, contradicting the assumption. This simple contradiction shows the statement holds.
例如，要证明不存在最大的整数，假设存在最大整数N。那么N+1也是整数且N+1 > N，这就与假设矛盾。这一简单矛盾便证明了原命题成立。
4. Proof by Contrapositive | 逆否命题证明
Instead of directly proving 'if p then q', you can prove its contrapositive: 'if not q then not p'. A statement and its contrapositive are logically equivalent, so proving one automatically proves the other. This is often easier than a direct approach.
与其直接证明“若p则q”，你可以证明它的逆否命题：“若非q则非p”。一个命题和它的逆否命题在逻辑上是等价的，因此证明了其中一个就自动证明了另一个。这往往比直接证明更容易。
is odd, then n is odd. The contrapositive is: if n is even, then n² is even. This is easy – n = 2k, then n² = 4k² = 2(2k²), which is even. The original statement follows immediately.
一个典型的例子：证明若n²是奇数，则n是奇数。其逆否命题为：若n是偶数，则n²是偶数。这很容易——设n = 2k，则n² = 4k² = 2(2k²)，为偶数。于是原命题立即得证。
When tackling an A-Level proof question, it can be helpful to ask yourself whether the contrapositive might be simpler to handle. This method is distinct from contradiction because you do not assume the premise p holds; you work solely on the negation of q.
在处理A-Level证明题时，不妨问问自己逆否命题是否更容易处理。这种方法与反证法不同，因为你并没有假设前提p成立，而是完全从非q出发进行推理。
5. Proof by Exhaustion | 穷举法
Proof by exhaustion works by checking every possible case individually. This is feasible when the domain under consideration is small and finite, for example, proving a statement for all integers from 1 to 10, or for a limited set of digit combinations.
穷举法通过对每一种可能的情况逐一进行验证来完成证明。当所讨论的定义域是小的有限集合时，这种方法是可行的，例如证明某个命题对于从1到10的所有整数成立，或对于一组有限的数字组合成立。
In an A-Level context, you might be asked to prove that a cubic expression is prime for small integer values, or that a number has a certain property by testing factors. You must list every case clearly and show that the statement holds for each one, leaving no gaps.
在A-Level中，你可能会被要求证明某个三次表达式对于小的整数值均为素数，或通过检验因数来证明一个数具有某种性质。你必须清晰地列出每一种情况，并显示命题在每一种情况下都成立，不能有任何遗漏。
For example, prove that for n ∈ =7 (odd), 3²+3+1=13 (odd), 4²+4+1=21 (odd). All cases checked, so the statement is proved.
例如，证明对于 n ∈ {1, 2, 3, 4}，表达式 n² + n + 1 总是奇数。逐一计算：1²+1+1=3（奇），2²+2+1=7（奇），3²+3+1=13（奇），4²+4+1=21（奇）。所有情况均已检验，命题得证。
6. Mathematical Induction | 数学归纳法
), the induction hypothesis (assume true for n = k), and the inductive step (prove true for n = k + 1 using the assumption). If all three steps succeed, the statement is true for all positive integers.
数学归纳法用于证明依赖于自然数n的命题。它有三个基本步骤：基础步骤（证明n = 1时命题成立）、归纳假设（假设n = k时命题成立）以及归纳递推步（利用该假设证明n = k + 1时命题也成立）。如果这三步都能完成，那么该命题对所有正整数都成立。
In A-Level exams, induction typically appears in proofs of summation formulas, divisibility results, or matrix powers. It is crucial to write the induction hypothesis explicitly and to show exactly how you use it to deduce the k+1 case.
在A-Level考试中，归纳法通常出现在求和公式、整除性结论或矩阵幂的证明中。明确写出归纳假设，并具体说明如何利用它推导k+1的情形，这一点至关重要。
Structure your proof with clear labels: 'Base case: n = 1', 'Assume true for n = k', 'Then for n = k + 1' the result holds for all n by induction. Many marks are awarded for this clear reasoning.
为你的证明标出清晰的结构：“基础情况：n = 1”、“假设n = k时成立”、“则对于n = k + 1”，最后得出结论：由归纳法可知该结果对所有n成立。这种清晰的推理可以帮你拿到很多分数。
7. Induction Example: Sum of First n Integers | 归纳法示例：前n个整数之和
Let us prove by induction that 1 + 2 + 3 + ... + n = n(n+1)/2 for all positive integers n.
我们来用归纳法证明，对所有正整数n，有 1 + 2 + 3 + ... + n = n(n+1)/2。
Base case: n = 1. Left-hand side = 1; right-hand side = 1×(1+1)/2 = 1. So true for n = 1.
基础情况：n = 1。左边 = 1；右边 = 1×(1+1)/2 = 1。因此n = 1时成立。
Induction hypothesis: Assume the formula holds for some arbitrary k ≥ 1, so 1 + 2 + ... + k = k(k+1)/2.
归纳假设：假设对于某个任意的k ≥ 1公式成立，即1 + 2 + ... + k = k(k+1)/2。
Inductive step: (k+1)(k+2)/2. This is exactly the original formula with n = k+1. Hence, true for n = k+1.
归纳递推：考虑n = k + 1。前k+1项的和为(1+2+...+k) + (k+1)。利用归纳假设，它等于 k(k+1)/2 + (k+1)。提取公因式(k+1)： (k+1)(k/2 + 1) = (k+1)(k+2)/2。这正好是n = k+1时的原公式。因此n = k+1时成立。
Conclusion: By mathematical induction, the statement is true for all positive integers n.
结论：由数学归纳法可知，该命题对所有正整数n均成立。
8. Contradiction Example: Irrationality of √2 | 反证法示例：√2是无理数
One of the most famous proofs at A-Level is that √2 is irrational. Assume the opposite: √2 is rational, so it can be written as a fraction p/q in its lowest terms, where p and q are integers with no common factors. Then √2 = p/q.
A-Level中最著名的证明之一便是√2是无理数。假设反面成立：√2是有理数，因此它可以写成一个最简分数p/q，其中p和q是没有公因数的整数。于是 √2 = p/q。
n, and therefore p must be even (as proved earlier). Write p = 2m. Substitute: (2m)² = 2q² ⇒ 4m² = 2q² ⇒ nd q have a common factor of 2, contradicting the assumption that p/q was in lowest terms.
两边平方得 2 = p²/q²，所以 p² = 2q²。这意味着p²是偶数，因此p也必须是偶数（如前所证）。设 p = 2m。代入：(2m)² = 2q² ⇒ 4m² = 2q² ⇒ q² = 2m²。于是q²为偶数，所以q也是偶数。但这样一来p和q就有了公因数2，与p/q是最简分数的假设矛盾。
This contradiction shows our initial assumption – that √2 is rational – must be false. Therefore √2 is irrational. The proof relies on elementary number properties and is a perfect illustration of contradiction.
这一矛盾表明我们最初的假设——√2是有理数——必定是错误的。因此√2是无理数。该证明依赖于基本的数的性质，是反证法的绝佳示例。
9. Exhaustion Example: Quadratic Expression | 穷举法示例：二次表达式
Prove that the expression n² − 3n + 2 is even for all integers n from 1 to 5. Since there are only five cases, exhaustion is suitable. Compute each:
证明表达式 n² − 3n + 2 对于从1到5的所有整数n均为偶数。因为只有五种情况，适合用穷举法。逐一计算：
| n | n² − 3n + 2 | Even? |
|---|---|---|
| 1 | 1 − 3 + 2 = 0 | Yes |
| 2 | 4 − 6 + 2 = 0 | Yes |
| 3 | 9 − 9 + 2 = 2 | Yes |
| 4 | 16 − 12 + 2 = 6 | Yes |
| 5 | 25 − 15 + 2 = 12 | Yes |
Since all five results are even, the statement is proved for the given set. In an exam, you must state clearly that every case has been examined and no others are needed because the set is finite.
由于五个结果均为偶数，该命题在给定集合上得证。在考试中，你必须明确说明已对所有情况进行了检验，并且因为集合是有限的，无需考虑其他值。
10. Common Errors in Proof | 常见证明错误
Many students lose marks by assuming the very statement they are trying to prove – a circular argument. For instance, starting with the conclusion and manipulating it until something true appears does not constitute a valid proof unless the steps are reversible. Always work from known truth towards the conclusion.
许多学生因为假设了正打算证明的命题而失分——这叫循环论证。例如，从结论出发，把它变形直到出现一个显然成立的式子，这并不构成有效证明，除非每一步都可逆。一定要从已知真理出发得出结论。
Another common mistake is insufficient justification. Every algebraic step should be accompanied by a reason, such as 'by expanding brackets' or 'using the induction hypothesis'. In proof by induction, forgetting to write the inductive hypothesis explicitly or failing to use it properly leads to a loss of structure marks.
另一个常见错误是缺乏足够的依据。每一个代数步骤都应配上理由，例如“利用展开”或“由归纳假设”。在数学归纳法中，忘记明确写出归纳假设，或者没有正确使用它，会导致结构分丢失。
In exhaustion proofs, omitting just one case makes the proof invalid. Similarly, in contradiction proofs, not stating the contradiction clearly can leave the argument hanging. Proofread your proof: does it follow a logical sequence from start to finish?
在穷举法证明中，哪怕漏掉一种情况也会使证明失效。同样，在反证法中，没有清晰陈述所得到的矛盾，会使论证不完整。重新审视你的证明：它从头到尾是否遵循了清晰的逻辑顺序？
11. Exam Tips for Proof Questions | 证明题考试技巧
Read the question carefully to identify which method is expected – the keyword 'contradiction' or 'induction' may be specified. If no method is hinted, choose the one that fits the statement: direct for algebraic identities, contrapositive for 'if n² is odd then n is odd', induction for statements with 'for all n', and exhaustion for small finite sets.
仔细审题以确定期望的证明方法——题干可能会明确要求“反证法”或“归纳法”。如果没有提示，则选择最适合命题的方法：代数恒等式用直接证明，“若n²为奇数则n为奇数”用逆否命题，“对所有n”的命题用归纳法，小的有限集合用穷举法。
Structure is everything. In induction, always label the base case, induction hypothesis and inductive step. In contradiction, begin with 'Assume' and end with 'This contradicts ... therefore ...'. Use clear language like 'Hence', 'Therefore', 'It follows that'. A well-structured proof is easier to mark and scores higher.
结构决定一切。在归纳法中，务必标明基础情况、归纳假设和归纳递推步。在反证法中，以“假设”开头，以“这与……矛盾，因此……”结尾。使用清晰的语言，如“因此”、“于是”、“从而”。结构清晰的证明更易评阅，分数也更高。
Finally, practise writing full proofs under timed conditions. The A-Level exam may require you to prove a result and then use it in a subsequent part. Keep your working neat and logical – even if you make a small algebraic slip, a clear structure can still earn the majority of marks.
最后，要在计时条件下练习书写完整的证明。A-Level考试可能要求你先证明一个结论，再在后续部分中使用它。保持你的解题过程整洁、合乎逻辑——即使你犯了一个小的代数错误，清晰的结构仍能帮你拿到大部分分数。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图