📚 Math Exam Prep: Complete Analysis of Common Proof Methods | 数学备考:常见证明方法题型全解析
Proof is the heart of mathematics. On A-level, IB, and other international exams, proof questions test not only your ability to find the correct answer, but also your capacity to construct logical, rigorous arguments. This guide breaks down the most common proof methods, explains when to use each one, and shows worked examples that reflect real exam questions.
证明是数学的核心。在 A-level、IB 等国际课程考试中,证明题不仅考查你找到正确答案的能力,更考查你构建逻辑严密论证的能力。本指南将全面解析最常见的证明方法,说明每种方法的适用时机,并展示贴合真实考题的例题。
1. Direct Proof | 直接证明法
Direct proof is the most straightforward method. You begin from known facts, definitions, and previously proved theorems, then apply logical steps to reach the conclusion. It is the default method for simple algebraic and number theory problems.
直接证明法是最基本的方法。你从已知事实、定义和已证定理出发,通过逻辑步骤一步步推出结论。它是解决简单代数与数论问题的默认方法。
Example: Prove that the sum of two even integers is even.
例题:证明两个偶数的和是偶数。
Let m = 2a and n = 2b, where a and b are integers. Then we calculate the sum:
设 m = 2a,n = 2b,其中 a 和 b 是整数。然后我们计算它们的和:
m + n = 2a + 2b = 2(a + b)
Because a + b is an integer, 2(a + b) is even by definition. The conclusion follows directly from the definition of an even number.
因为 a + b 是整数,所以 2(a + b) 根据定义是偶数。结论直接从偶数的定义推出。
2. Proof by Contradiction | 反证法
In a proof by contradiction, you assume that the statement you want to prove is false. You then show that this assumption leads to a logical impossibility, known as a contradiction. Since the assumption must be wrong, the original statement must be true.
在反证法中,你先假设要证明的命题为假,然后证明这个假设会导致一个逻辑上的不可能,即矛盾。因为假设必定是错的,所以原命题必定为真。
Classic example: Prove that √2 is irrational.
经典例题:证明 √2 是无理数。
Suppose √2 = p/q, where p and q are coprime integers with q ≠ 0. Squaring both sides gives p² = 2q², so p² is even, which forces p to be even. Write p = 2k; then 4k² = 2q², so q² = 2k², and therefore q is also even. But if both p and q are even, they share a common factor of 2, contradicting the assumption that they are coprime. Therefore no such p and q exist.
假设 √2 = p/q,其中 p 和 q 是互质的整数,且 q ≠ 0。两边平方得 p² = 2q²,因此 p² 是偶数,从而 p 必为偶数。设 p = 2k,则 4k² = 2q²,即 q² = 2k²,所以 q 也是偶数。但如果 p 和 q 都是偶数,它们就有公因数 2,与假设互质矛盾。因此这样的 p 和 q 不存在。
-
Always state the assumption clearly at the start.
开始时必须清楚陈述假设。
-
The contradiction must be explicit, not merely surprising.
矛盾必须是明确的,而不只是令人意外。
-
Common targets: irrationality, infinitude of primes, “no largest integer”.
常见目标:无理数、素数无穷多、”不存在最大整数”。
3. Proof by Contrapositive | 逆否命题法
For a conditional statement “If P, then Q”, the contrapositive is “If not Q, then not P”. A statement and its contrapositive are logically equivalent, so proving one proves the other. Sometimes the contrapositive is much easier to handle.
对于条件命题”若 P,则 Q”,其逆否命题是”若非 Q,则非 P”。原命题与逆否命题逻辑等价,因此证明其中一个就证明了另一个。有时逆否命题更容易处理。
Example: Prove that if n² is even, then n is even.
例题:证明若 n² 是偶数,则 n 是偶数。
The contrapositive is: if n is odd, then n² is odd. Let n = 2k + 1; then we expand:
其逆否命题是:若 n 是奇数,则 n² 是奇数。设 n = 2k + 1,展开得:
n² = (2k + 1)² = 4k² + 4k + 1 = 2(2k² + 2k) + 1
The expression 2(2k² + 2k) + 1 is odd. Hence the contrapositive is true, so the original statement is also true.
表达式 2(2k² + 2k) + 1 是奇数。因此逆否命题成立,原命题也成立。
4. Proof by Mathematical Induction | 数学归纳法
Mathematical induction is used for statements involving positive integers. It has two essential parts: the base case and the inductive step. If both are proved, the statement holds for every positive integer.
数学归纳法用于涉及正整数的命题。它由两个关键部分构成:基础情形和归纳递推。只要两者都成立,命题就对所有正整数成立。
Example: Prove that the sum of the first n odd numbers is n², that is, 1 + 3 + 5 + … + (2n − 1) = n².
例题:证明前 n 个奇数之和为 n²,即 1 + 3 + 5 + … + (2n − 1) = n²。
Base case: when n = 1, the left side is 1 and the right side is 1² = 1, so the statement holds.
基础情形:当 n = 1 时,左边为 1,右边为 1² = 1,命题成立。
Inductive step: assume the statement is true for n = k, so 1 + 3 + … + (2k − 1) = k². For n = k + 1, the left side becomes k² + (2k + 1) = (k + 1)², which is exactly the right side. By induction, the formula is true for all positive integers n.
归纳递推:假设命题对 n = k 成立,即 1 + 3 + … + (2k − 1) = k²。当 n = k + 1 时,左边变为 k² + (2k + 1) = (k + 1)²,恰好等于右边。由归纳法可知,该公式对所有正整数 n 成立。
-
Never skip the base case in an exam, even if it looks obvious.
考试中绝不能跳过基础情形,即使它看起来显而易见。
-
State clearly where you use the inductive assumption.
明确说明在哪里使用了归纳假设。
-
Induction is also common for proving divisibility and inequalities.
归纳法也常用于证明整除性和不等式。
5. Proof by Exhaustion and Cases | 穷举法与分类讨论
When a statement can be split into a finite number of separate cases, you can prove each case individually. This is called proof by exhaustion (or proof by cases). It works well for modular arithmetic, inequalities with absolute values, and piecewise functions.
当一个命题可以分成有限个独立情形时,你可以逐一证明每种情形。这称为穷举法(或分类讨论法)。它特别适用于模运算、含绝对值的不等式和分段函数。
Example: Prove that n² mod 3 is never 2 for any integer n.
例题:证明对任意整数 n,n² mod 3 永远不可能是 2。
Every integer n satisfies exactly one of n ≡ 0, 1, or 2 (mod 3). We examine each case:
任意整数 n 必满足 n ≡ 0、1 或 2 (mod 3) 之一。我们逐一检验:
-
If n ≡ 0, then n² ≡ 0 (mod 3).
若 n ≡ 0,则 n² ≡ 0 (mod 3)。
-
If n ≡ 1, then n² ≡ 1 (mod 3).
若 n ≡ 1,则 n² ≡ 1 (mod 3)。
-
If n ≡ 2, then n² ≡ 4 ≡ 1 (mod 3).
若 n ≡ 2,则 n² ≡ 4 ≡ 1 (mod 3)。
In every case n² leaves a remainder of 0 or 1 when divided by 3, so the statement is proved.
在每种情形下 n² 除以 3 的余数都是 0 或 1,命题得证。
6. Proving Inequalities | 不等式证明
Inequality proofs frequently appear in exams. The most powerful tools are the AM-GM inequality, the Cauchy-Schwarz inequality, and algebraic manipulation starting from squares, since any real square is non-negative.
不等式证明在考试中频繁出现。最有力的工具是均值不等式(AM-GM)、柯西-施瓦茨不等式,以及从平方出发的代数变形,因为任何实数的平方都非负。
Example: Prove that for a > 0, a + 1/a ≥ 2.
例题:证明当 a > 0 时,a + 1/a ≥ 2。
We start from the obvious fact that (a − 1)² ≥ 0 and expand:
我们从显然成立的事实 (a − 1)² ≥ 0 出发并展开:
a² − 2a + 1 ≥ 0 → a² + 1 ≥ 2a
Since a > 0, we may divide both sides by a without changing the direction of the inequality, obtaining a + 1/a ≥ 2. Equality holds exactly when a = 1.
因为 a > 0,我们可以两边同除以 a 而不改变不等号方向,得到 a + 1/a ≥ 2。当且仅当 a = 1 时取等号。
Alternatively, apply AM-GM directly: (a + 1/a)/2 ≥ √(a × 1/a) = 1.
另一种做法是直接使用均值不等式:(a + 1/a)/2 ≥ √(a × 1/a) = 1。
7. Geometric Proofs | 几何证明
Geometric proofs rely on circle theorems, congruence and similarity, angle rules, and the properties of triangles and polygons. A clear diagram with labelled angles and sides is essential for a rigorous argument.
几何证明依赖圆定理、全等与相似、角度法则以及三角形和多边形的性质。清晰标注角度和边长的图形是严谨论证的必要条件。
Example: Prove that the angle at the centre of a circle is twice the angle at the circumference standing on the same arc.
例题:证明圆周角等于同弧所对圆心角的一半(圆心角是圆周角的两倍)。
Let O be the centre and let A, B, C be points on the circle, with the angle at the centre ∠AOB and the angle at the circumference ∠ACB subtending the same arc AB. Draw the radius OC and extend it to meet the circle again at D. Using the isosceles triangles AOC and BOC:
设 O 为圆心,A、B、C 是圆上的点,圆心角 ∠AOB 与圆周角 ∠ACB 对应同一段弧 AB。连接半径 OC 并延长交圆于 D。利用等腰三角形 AOC 和 BOC:
-
In triangle AOC, OA = OC, so ∠OAC = ∠OCA.
在三角形 AOC 中,OA = OC,所以 ∠OAC = ∠OCA。
-
Exterior angle ∠AOD = ∠OAC + ∠OCA = 2∠OCA.
外角 ∠AOD = ∠OAC + ∠OCA = 2∠OCA。
-
Similarly ∠BOD = 2∠OCB.
同理 ∠BOD = 2∠OCB。
Adding the angles: ∠AOB = ∠AOD + ∠BOD = 2(∠OCA + ∠OCB) = 2∠ACB. Therefore the centre angle is twice the circumference angle.
将两式相加:∠AOB = ∠AOD + ∠BOD = 2(∠OCA + ∠OCB) = 2∠ACB。因此圆心角等于圆周角的两倍。
8. Trigonometric Identity Proofs | 三角恒等式证明
Trigonometric identities are proved by transforming one side of the equation into the other using known identities, such as the Pythagorean identity sin²θ + cos²θ = 1, the double-angle formulas, and the addition formulas.
三角恒等式通过利用已知公式(如毕达哥拉斯恒等式 sin²θ + cos²θ = 1、二倍角公式和和角公式)将等式的一边变形为另一边来证明。
Example: Prove that tan²θ + 1 = sec²θ for all θ where cos θ ≠ 0.
例题:证明对所有 cos θ ≠ 0 的 θ,有 tan²θ + 1 = sec²θ。
Start from the Pythagorean identity and divide every term by cos²θ:
从毕达哥拉斯恒等式出发,各项同时除以 cos²θ:
sin²θ + cos²θ = 1 → sin²θ/cos²θ + 1 = 1/cos²θ
Since sin θ/cos θ = tan θ and 1/cos θ = sec θ, we immediately obtain tan²θ + 1 = sec²θ. The division is valid precisely because we required cos θ ≠ 0.
因为 sin θ/cos θ = tan θ,1/cos θ = sec θ,所以立即得到 tan²θ + 1 = sec²θ。我们要求 cos θ ≠ 0,正是为了保证除法的合法性。
9. Disproof by Counterexample | 反例法
To disprove a universal statement of the form “for all x, P(x) is true”, it is enough to produce a single value of x for which P(x) is false. This is the fastest and most elegant form of disproof.
要否定一个形如”对所有 x,P(x) 成立”的全称命题,只需找出一个使 P(x) 为假的 x 值即可。这是最快、最简洁的否定方法。
Example 1: Disprove the statement “All prime numbers are odd.”
例 1:否定命题”所有素数都是奇数”。
The integer 2 is a prime number, and 2 is even. One counterexample is sufficient to show the statement is false.
整数 2 是素数,且 2 是偶数。一个反例就足以证明该命题为假。
Example 2: Disprove the statement “n² + n + 41 is prime for every positive integer n.”
例 2:否定命题”对每个正整数 n,n² + n + 41 都是素数”。
Take n = 41; then n² + n + 41 = 41² + 41 + 41 = 41(41 + 2) = 41 × 43, which is composite. The statement collapses under this single counterexample.
取 n = 41,则 n² + n + 41 = 41² + 41 + 41 = 41(41 + 2) = 41 × 43,这是一个合数。仅凭这一个反例,命题就崩溃了。
10. Limit Proofs Using ε-δ | 极限的 ε-δ 证明
At the advanced level, you may be asked to prove a limit using the formal ε-δ definition: for every ε > 0 there exists δ > 0 such that if 0 < |x − a| < δ, then |f(x) − L| < ε. The key is to express δ in terms of ε.
在进阶水平,你可能会被要求用严格的 ε-δ 定义证明极限:对任意 ε > 0,存在 δ > 0,使得当 0 < |x − a| < δ 时,有 |f(x) − L| < ε。关键在于把 δ 表示成 ε 的函数。
Example: Prove that lim (2x + 1) = 7 as x → 3.
例题:证明当 x → 3 时,lim (2x + 1) = 7。
Given any ε > 0, choose δ = ε/2. Suppose that 0 < |x − 3| < δ. Then we estimate:
给定任意 ε > 0,取 δ = ε/2。假设 0 < |x − 3| < δ,则有如下估计:
|(2x + 1) − 7| = |2x − 6| = 2|x − 3| < 2δ = ε
The inequality 2|x − 3| < ε is exactly what the definition requires. Since δ was chosen for an arbitrary ε, the limit is proved.
不等式 2|x − 3| < ε 恰好满足定义的要求。由于 δ 是对任意 ε 选取的,极限得证。
11. Exam Strategies and Common Pitfalls | 应试策略与常见错误
Strong proof-writing skills come from practice, but a few universal strategies will immediately improve your marks. Always read the question carefully to decide whether you must prove or disprove, and choose the appropriate method before you write anything.
扎实的证明写作能力来自练习,但几个通用策略能立刻提高你的分数。务必仔细审题,判断题目要求证明还是否定,并在动笔之前选择合适的方法。
-
State your method. Examiners reward clear structure: “We prove by contradiction…” or “We use induction on n…”.
说明方法。清晰的框架会加分:”我们用反证法证明……”或”我们对 n 用归纳法……”。
-
Define all variables. Introduce m, n, a, b, etc., with their domains, before using them.
定义所有变量。使用 m、n、a、b 等之前,先说明它们的取值范围。
-
Justify every step. Each line should follow from a definition, theorem, or previous line; avoid unjustified jumps.
每一步都要有依据。每一行都应来自定义、定理或前一行;避免不合理的跳跃。
-
Check boundary cases. Zero, negative numbers, fractions, and endpoints often break an otherwise valid proof.
检查边界情形。零、负数、分数和端点常常会使一个看似正确的证明失效。
-
Do not confuse converse with contrapositive. “If Q then P” is not equivalent to “If P then Q”; only the contrapositive is.
不要混淆逆命题与逆否命题。“若 Q 则 P”与”若 P 则 Q”不等价;只有逆否命题等价。
-
Write the conclusion. End with a clear statement such as “Therefore, the statement is true for all valid values.”
写出结论。以清晰的语句收尾,如”因此,该命题对所有有效取值均成立”。
Mastering these eleven proof techniques will allow you to recognise the structure of any proof question and attack it methodically. Practice each method on past-paper questions, and always mark where you used the key assumption or definition.
掌握以上十一种证明技巧,你就能识别任何证明题的结构并有条不紊地求解。请用真题逐一练习每种方法,并始终标注你使用关键假设或定义的位置。
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