Essential Methods of Mathematical Proof | 数学证明的基本方法

📚 Essential Methods of Mathematical Proof | 数学证明的基本方法

Mathematics is not merely a collection of formulas and computations; at its heart lies the concept of proof. A proof is a logical argument that establishes the truth of a statement beyond any doubt, using previously accepted facts, definitions, and axioms.

数学不仅仅是公式与计算的集合，其核心在于”证明”这一概念。证明是一种逻辑论证，它通过已被接受的事实、定义和公理，毫无疑义地确立某个命题的真确性。

For students preparing for A-Level examinations, mastering the basic methods of proof is not an optional skill — it is a fundamental requirement. This article systematically introduces the most essential proof techniques, each accompanied by worked examples that illustrate the underlying logic in action.

对于备考A-Level的学生而言，掌握基本的证明方法并非可有可无的技能，而是一项根本性的要求。本文将系统介绍最核心的证明技巧，并通过具体实例展示每种方法背后的逻辑运作。

1. Direct Proof | 直接证明法

Direct proof is the most straightforward method. To prove a statement of the form “If P, then Q”, we assume P is true and use logical deductions, definitions, and known theorems to arrive at Q.

直接证明法是最为直观的方法。要证明”若P，则Q”形式的命题，我们假设P成立，然后运用逻辑推演、定义和已知定理，最终得出Q成立。

Consider the following example: Prove that if n is an even integer, then n² is also even.

请看下面的例子：证明若n是偶数，则n²也是偶数。

n = 2k (k ∈ ℤ) → n² = 4k² = 2(2k²) → n² is even | n = 2k (k ∈ ℤ) → n² = 4k² = 2(2k²) → n² 是偶数

Here, we began with the definition of an even number (n = 2k), substituted it into the expression n², and factored out a 2. This demonstrates that n² satisfies the definition of an even number. The entire argument flows forward in a single logical chain — no detours, no assumptions beyond the original premise.

这里，我们从偶数的定义出发（n = 2k），将其代入n²的表达式中，并提取公因子2。这表明n²满足偶数的定义。整个论证沿一条逻辑链单向推进——没有迂回，除了原前提之外没有任何额外假设。

Direct proof is often the first method students encounter. Its power lies in its simplicity: each step follows clearly from the previous one. However, direct proof is not always the most convenient route; sometimes a statement is far easier to prove using an indirect approach.

直接证明法是学生最早接触的方法。其力量在于简洁：每一步都清晰地从前一步推出。然而，直接证明并非在所有情况下都是最便捷的路径；有时采用间接方法反而更加容易。

2. Proof by Contradiction | 反证法

Proof by contradiction rests on a simple logical principle: if assuming a statement is false leads to an impossible consequence, then the statement must be true. In formal logic, this is often called reductio ad absurdum.

反证法基于一个简洁的逻辑原理：如果假设某命题为假会导出不可能的结论，那么该命题必为真。在形式逻辑中，这种方法常被称为”归谬法”。

The classic example which every A-Level student should know is the proof that √2 is irrational.

每个A-Level学生都应知道的一个经典例子是：证明√2是无理数。

Assume, for contradiction, that √2 is rational. Then it can be written as a fraction in lowest terms: √2 = a/b, where a and b are coprime integers (no common factor). Squaring both sides gives 2 = a²/b², hence a² = 2b². This implies a² is even, so a must be even; let a = 2k. Substituting back, (2k)² = 2b² → 4k² = 2b² → b² = 2k². Thus b² is even, so b is also even. But this contradicts the assumption that a and b are coprime — both cannot be even. Therefore, our original assumption must be false, and √2 is irrational.

假设√2是有理数。那么它可以写成最简分数：√2 = a/b，其中a和b是互质的整数（无公因子）。两边平方得 2 = a²/b² ，因此 a² = 2b²。这意味着a²是偶数，所以a必为偶数；令a = 2k。代回原式，(2k)² = 2b² → 4k² = 2b² → b² = 2k²。因此b²也是偶数，从而b也为偶数。但这与a和b互质的假设相矛盾——两者不可能同为偶数。因此，我们最初的假设必定错误，√2是无理数。

Notice how the contradiction arises: from the single assumption “√2 is rational”, we derived that both a and b share a factor of 2, undermining the “lowest terms” condition. This logical explosion is the hallmark of a successful contradiction proof.

注意矛盾是如何产生的：从”√2是有理数”这一假设出发，我们推导出a和b都含有因子2，从而破坏了”最简分数”的条件。这种逻辑上的”爆发”正是反证法成功的标志。

When is contradiction most useful? Typically, when proving negative statements (“there is no…”), or statements about irrationality, or when a direct constructive approach seems impossible. It is also invaluable for proving statements involving uniqueness.

反证法在何时最为得力？通常用于证明否定性命题（”不存在……”）、涉及无理数的命题，或当直接构造性方法看似不可能时。它对于证明涉及唯一性的命题也极为有用。

3. Proof by Contrapositive | 逆否命题法

The contrapositive of “If P, then Q” is “If not Q, then not P”. A statement and its contrapositive are logically equivalent — proving one proves the other. Sometimes the contrapositive is far easier to prove than the original.

命题”若P，则Q”的逆否命题是”若非Q，则非P”。一个命题与其逆否命题在逻辑上等价——证明其中一个就等于证明了另一个。有时逆否命题比原命题容易证明得多。

Let us examine a typical problem: Prove that if n² is odd, then n is odd.

我们来看一个典型问题：证明若n²是奇数，则n是奇数。

Instead of attempting a direct proof (which requires more cleverness), we prove the contrapositive: if n is even, then n² is even. This is exactly the direct proof from Section 1! Since n even → n² even is true, the contrapositive tells us that n² odd → n odd is also true.

我们不必尝试直接证明（那需要更多技巧），而是证明其逆否命题：若n是偶数，则n²是偶数。这正是第1节中的直接证明！既然”n为偶数 → n²为偶数”成立，那么由逆否命题等价性可知”n²为奇数 → n为奇数”也成立。

This example shows how various proof methods intertwine. The contrapositive method is particularly attractive when the original statement contains negations, or when proving something about a property (like oddness) which has a natural alternative description (evenness).

这个例子展示了各种证明方法如何相互交织。当原命题包含否定，或者当所涉及的性质（如奇数性）有自然的反面描述（偶数性）时，逆否命题法特别有吸引力。

It is essential not to confuse the contrapositive with the converse. The converse of “P → Q” is “Q → P”, which is NOT logically equivalent. A common student mistake is to assume a statement and its converse are both true or both false — this is a serious logical error.

务必不要将逆否命题与逆命题混淆。命题”P → Q”的逆命题是”Q → P”，这在逻辑上不等价。学生常见的一个错误是认为一个命题与其逆命题同真或同假——这是严重的逻辑谬误。

4. Proof by Mathematical Induction | 数学归纳法

Mathematical induction is a powerful technique for proving statements that depend on the natural numbers ℕ. It is based on the well-ordering principle: every non-empty set of natural numbers has a least element.

数学归纳法是一种强有力的技巧，用于证明依赖于自然数ℕ的命题。它建立在良序原理之上：自然数的每一个非空子集都有最小元素。

Induction proceeds in two steps. First, we prove the base case: the statement holds for the smallest value (usually n = 1). Second, we prove the inductive step: if the statement holds for n = k, then it holds for n = k + 1. Together, these two steps establish the statement for ALL natural numbers.

归纳法分两步进行。第一步是证明基础情形：命题对最小取值成立（通常为n = 1）。第二步是证明归纳步骤：若命题对n = k成立，则它对n = k + 1也成立。两步结合即可确立命题对一切自然数成立。

Let us prove the famous summation formula: 1 + 2 + 3 + … + n = n(n+1)/2 for all n ≥ 1.

我们来证明著名的求和公式：1 + 2 + 3 + … + n = n(n+1)/2 对一切n ≥ 1成立。

Base case: When n = 1, the left-hand side equals 1, and the right-hand side equals 1(1+1)/2 = 1. The formula holds.

基础情形：当n = 1时，左边等于1，右边等于1(1+1)/2 = 1。公式成立。

Inductive step: Assume the formula holds for n = k, i.e., 1 + 2 + … + k = k(k+1)/2. Now consider n = k + 1:

归纳步骤：假设公式对n = k成立，即 1 + 2 + … + k = k(k+1)/2。现在考虑n = k + 1的情形：

1 + 2 + … + k + (k+1) = k(k+1)/2 + (k+1) = (k+1)(k/2 + 1) = (k+1)(k+2)/2

This is exactly the formula with n = k + 1. Therefore, by the principle of mathematical induction, the formula holds for all natural numbers n.

这正是n = k + 1时的公式。因此，根据数学归纳法原理，公式对一切自然数n成立。

The key insight: the inductive step does not prove the statement directly for k+1 on its own; rather, it relies on the assumption that the statement is already true for k. This “domino effect” — if one domino falls, the next falls too, and the first domino falls, so all fall — is captured elegantly in this method.

关键洞察在于：归纳步骤并非独立地直接证明k + 1时的命题；而是依赖于命题对k已经成立的假设。这种”多米诺效应”——若一块骨牌倒下，下一块也跟着倒下，而第一块已经倒下，所以全部倒下——被这种方法优雅地捕捉。

5. Proof by Exhaustion / Case Analysis | 穷举法 / 分情况讨论

When a statement can be naturally divided into a finite number of cases, we may prove each case separately. This is called proof by exhaustion, or proof by cases. Each case must be fully covered, and the cases together must cover every possibility.

当一个命题可以自然地划分为有限种情形时，我们可以分别证明每一种情形。这称为穷举法，或称分情况讨论。每一种情形都必须完整证明，且所有情形合在一起必须覆盖全部可能。

A classic A-Level example: Prove that n² + n is always even for any integer n.

一个经典的A-Level例子：证明对任意整数n，n² + n总是偶数。

Consider two cases. Case 1: n is even. Then n² is even, and the sum of two even numbers is even. Case 2: n is odd. Then n² is odd, and the sum of two odd numbers is even. In both cases, n² + n is even. This covers all integers, so the statement is proven.

考虑两种情形。情形1：n是偶数。则n²也是偶数，两个偶数之和为偶数。情形2：n是奇数。则n²也是奇数，两个奇数之和为偶数。两种情形下，n² + n都是偶数。这覆盖了所有整数，命题得证。

Alternatively, we could factor n² + n = n(n+1). Since n and n+1 are consecutive integers, one of them must be even; hence their product is even. This is a more elegant single-argument proof, but the case analysis approach is equally valid and often more generalisable.

另外，我们也可以因式分解：n² + n = n(n+1)。由于n和n + 1是连续整数，其中必有一个是偶数；因此它们的乘积为偶数。这是更优雅的单一论证证明，但分情况讨论同样有效，且往往更具可推广性。

Exhaustion is particularly useful when dealing with modular arithmetic, inequalities with absolute values, or any situation where a small number of logical branches exhausts all possibilities. A common pitfall is missing a case or incorrectly assuming cases are mutually exclusive. Be rigorous about dividing the universe of possibilities.

穷举法在以下情形特别有用：处理模运算、含绝对值的不等式，或任何逻辑分支较少且能穷尽所有可能性的情况。一个常见陷阱是遗漏情形，或错误地假设各情形互斥。务必严谨地对所有可能进行划分。

6. Constructive Proof | 构造性证明

A constructive proof demonstrates the existence of a mathematical object by explicitly showing how to build or find it. This is in contrast to non-constructive proofs, which might rely on arguments like the pigeonhole principle or the axiom of choice to assert existence without producing an example.

构造性证明通过明确展示如何构建或寻找某一数学对象来证明其存在性。这与非构造性证明形成对比——后者可能依赖鸽笼原理或选择公理等论证来断言存在性，而无需给出具体实例。

An easy example: Prove that there exists an irrational number between 0 and 1.

一个简单的例子：证明在0和1之间存在一个无理数。

While one could argue abstractly about the density of irrationals in the reals, the most convincing proof is constructive: consider x = 1/√2. This value lies between 0 and 1 (since √2 > 1) and is irrational (since 1/√2 = √2/2, a product of irrational √2 and rational 1/2, which remains irrational). We have explicitly exhibited the object, completing a constructive proof.

虽然可以从实数中无理数的稠密性进行抽象论证，但最有说服力的证明是构造性的：考虑 x = 1/√2。该值位于0和1之间（因为√2 > 1），且是无理数（因为 1/√2 = √2/2，是无理数√2与有理数1/2之积，仍为无理数）。我们明确地找到了这个对象，完成了构造性证明。

In many mathematical contexts — particularly in analysis and algebra — constructive proofs give deeper insight because they reveal the mechanism behind existence. However, sometimes a constructive proof is enormously difficult, and a non-constructive argument is the only practical route.

在许多数学领域中——尤其是分析和代数——构造性证明能带来更深刻的洞见，因为它揭示了存在背后的机制。但有时构造性证明极其困难，非构造性论证是唯一可行的途径。

7. Proving Uniqueness | 证明唯一性

A statement may assert that an object with a certain property exists AND is unique. The standard strategy is a two-part proof: first, show existence (often constructively); second, assume two such objects exist and prove they must be identical.

有些命题断言具有某一性质的对象存在且唯一。标准策略是分两步证明：首先证明存在性（通常采用构造性方法）；其次，假设存在两个这样的对象，并证明它们必然相同。

For example: Prove that the equation 2x + 3 = 7 has a unique solution.

例如：证明方程 2x + 3 = 7 有唯一解。

Existence: solving algebraically gives x = 2. This solves the equation, so a solution exists. Uniqueness: suppose both x₁ and x₂ are solutions. Then 2x₁ + 3 = 7 and 2x₂ + 3 = 7. Subtracting gives 2(x₁ – x₂) = 0, hence x₁ = x₂. Therefore the solution is unique.

存在性：代数求解得到 x = 2。它满足方程，因此解存在。唯一性：假设x₁和x₂都是解。则 2x₁ + 3 = 7 且 2x₂ + 3 = 7。相减得 2(x₁ – x₂) = 0，从而 x₁ = x₂。因此解是唯一的。

The uniqueness part of a proof often mirrors the structure of the existence part. In differential equations and linear algebra, uniqueness theorems play a central role. Common techniques for the uniqueness step include: assuming two objects disagree at some minimal point, or subtracting the two candidate objects and showing the difference must vanish.

唯一性部分的证明在结构上常与存在性部分相呼应。在微分方程和线性代数中，唯一性定理扮演核心角色。唯一性步骤的常用技巧包括：假设两个对象在某最小点处不一致，或者将两个候选对象相减并证明其差必须为零。

8. Common Logical Fallacies | 常见逻辑谬误

At A-Level, examiners are increasingly keen to test whether students can identify flawed arguments. Understanding these fallacies will help you avoid them in your own proofs and catch them in problem-solving contexts.

在A-Level考试中，考官日益倾向于考查学生能否识别有缺陷的论证。理解这些谬误将帮助你在自己的证明中避免它们，并在解题情境中发现它们。

The most common fallacy in mathematical writing is affirming the consequent. Given that “P → Q” is true, one may NOT conclude P from Q. For instance, from “it is raining → the ground is wet” and “the ground is wet”, we cannot deduce “it is raining” — the ground may be wet for another reason, such as a sprinkler.

数学写作中最常见的谬误是”肯定后件”。已知”P → Q”为真，绝不能由Q推出P。例如，由”天下雨 → 地面湿”以及”地面湿”，我们不能推出”天下雨”——地面可能因其他原因而湿，比如洒水器。

Another frequent error is circular reasoning, where the conclusion is assumed within the proof. A proof of the Pythagorean theorem that uses the theorem itself is circular and proves nothing. A subtle form of this fallacy occurs when a statement is “proven” using a theorem that is equivalent to it — something that should be checked carefully.

另一个常见错误是循环论证，即证明中预设了待证结论本身。用勾股定理本身去证明勾股定理就是循环论证，等于什么也没有证明。这种谬误的微妙形式出现在使用与待证命题等价的定理来”证明”该命题时——这一点需要仔细审视。

Begging the question, confusing necessary and sufficient conditions, and incorrect quantifier handling (swapping ∀ and ∃ without justification) are also frequently seen. Learning to identify these patterns sharpens your mathematical judgment substantially.

预设结论、混淆必要与充分条件，以及量词处理不当（无根据地交换∀和∃）也是常见问题。学会识别这些模式将显著提升你的数学判断力。

9. Choosing the Right Method | 如何选择合适的证明方法

With multiple tools available, which should you choose? Here is a practical decision guide for tackling A-Level proof problems.

既然有多种工具可用，你应该选择哪一种？以下是一份应对A-Level证明题的实用决策指南。

Start with the definitions. Write down what you are given and what you need to show in precise definitional form. The gap between these two often reveals the method.
先写下定义。将已知条件和待证结论以严谨的定义形式写出。这两者之间的差距往往揭示了应采用的方法。
If the statement is “there exists” or “there is exactly one”, construct the object explicitly or prove uniqueness after establishing existence.
若命题为”存在”或”存在唯一”，请明确构造出对象，或在确立存在性后证明唯一性。
If the statement involves a universal claim over all integers or is recursive in nature, strong candidates are induction or exhaustion.
若命题涉及对所有整数成立的普遍性断言，或本质上是递推的，归纳法或穷举法是强有力的候选。
If a direct proof fails or appears impossibly convoluted after a few minutes of attempting, try contradiction or contrapositive — these indirect methods often dissolve deadlocks.
若直接证明尝试几分钟后失败或显得极其迂回，请尝试反证法或逆否命题法——这些间接方法往往能化解僵局。
Write the final proof in clear, precise English (or mathematical symbols). Each step must follow previous steps; each variable must be introduced; each case must be verbatim, airtight.
以清晰、精确的英文（或数学符号）写出最终证明。每一步都必须从前面步骤推出；每个变量都必须引入说明；每种情形都必须完整、无懈可击。

There is no single “best” method in general. Different proofs shine in different contexts. Proficiency comes from solving many problems and observing patterns across them.

一般来说不存在唯一的”最佳”方法。不同的证明在不同情境下各有优势。熟练来自于解决大量问题并观察其中的模式。

10. Practice and Habit Formation | 练习与习惯养成

Reading proofs is different from writing them. Just as one learns to swim by swimming, one learns to prove by proving. It is not enough to follow the worked examples in this article; you must reproduce them from memory, then attempt new problems with increasing difficulty.

阅读证明与撰写证明是两回事。正如游泳是在水中学会的，证明是在书写中学会的。仅仅跟读本文的例子是不够的；你必须凭记忆复现它们，然后尝试难度递增的新问题。

For A-Level mathematics, maintain a “proof journal” in which you record: the problem, the method used, the key insight that unlocked the proof, and any mistakes you initially made. Review this journal before examinations; it is a personalised, powerful revision resource.

对于A-Level数学，建议你维护一本”证明日志”，在其中记录：问题、所用方法、解锁证明的关键洞察，以及你最初犯过的错误。考前复习这本日志——它是高度个性化的强力复习资料。

Here are a few suggested practice problems:

以下是一些建议的练习题：

Prove that the sum of two odd integers is even, by direct proof.
用直接证明法证明：两个奇数之和为偶数。
Prove that √3 is irrational, by contradiction.
用反证法证明：√3是无理数。
Prove that if n² is even, then n is even, by contrapositive.
用逆否命题法证明：若n²是偶数，则n也是偶数。
Prove 1² + 2² + … + n² = n(n+1)(2n+1)/6, by induction.
用归纳法证明：1² + 2² + … + n² = n(n+1)(2n+1)/6。
Prove that there is no largest integer, by contradiction.
用反证法证明：不存在最大的整数。

As you work on each problem, consciously ask yourself: “What method naturally fits here? What would happen if I tried the contrapositive? Is a case split productive?” This metacognitive questioning is the hallmark of a maturing mathematician.

在练习每个问题时，有意识地自问：”哪种方法天然适合这里？如果我试试逆否命题会怎样？分情况讨论是否有成效？”这种元认知式的追问正是成熟的数学思维者特征。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Essential Methods of Mathematical Proof | 数学证明的基本方法