Proof by Induction Extended to Other Areas of Mathematics | 数学归纳法在其他数学领域的应用

📚 Proof by Induction Extended to Other Areas of Mathematics | 数学归纳法在其他数学领域的应用

Proof by induction is one of the most powerful and elegant techniques in A-level mathematics. While it first appears in the context of proving results about natural numbers, its true strength lies in its versatility. It can be applied to sums of sequences, divisibility, inequalities, recurrence relations, matrices, and even complex numbers. This article explores how the method of induction extends far beyond simple integer statements, showing you how to adapt the same core logic to a wide range of mathematical problems.

数学归纳法是A-level数学中最强大且优雅的技巧之一。尽管它最初出现在关于自然数的证明中，但它的真正力量在于其多功能性。它可以应用于数列求和、整除性、不等式、递推关系、矩阵乃至复数。本文将探讨归纳法如何超越简单的整数命题，向你展示如何将相同的核心逻辑应用于各种数学问题。

1. The Principle of Mathematical Induction | 数学归纳法原理

Mathematical induction rests on a single logical idea: if a statement about a positive integer n is true for a starting value (usually n = 1), and if assuming it is true for n = k allows you to prove it is true for n = k + 1, then the statement must be true for all positive integers from the starting value onward. This is like a chain of dominoes – you knock down the first one, and each domino knocks down the next.

数学归纳法基于一个简单的逻辑思想：如果一个关于正整数n的命题在起始值（通常是n=1）成立，并且假设它在n=k成立时能推出它在n=k+1也成立，那么这个命题从起始值开始对所有正整数都成立。这就像一条多米诺骨牌链——你推倒第一张，然后每张骨牌都会推倒下一张。

The method consists of two main steps:

该方法包含两个主要步骤：

Base case: Verify the statement for the initial value, usually n = 1.
Inductive step: Assume the statement is true for some positive integer k (the inductive hypothesis), then use this assumption to prove it is true for k + 1.

基础步骤：验证命题在初始值（通常为n=1）时成立。
归纳步骤：假设命题对某个正整数k成立（归纳假设），然后利用该假设证明它对k+1也成立。

Once both steps are complete, the conclusion follows by the principle of mathematical induction.

一旦这两个步骤都完成，就可以根据数学归纳法原理得出结论。

2. Induction for Sums of Series | 数列求和的归纳证明

A classic application of induction is proving formulas for the sum of the first n terms of a series. For example, consider the sum of the first n natural numbers:

归纳法的一个经典应用是证明数列前n项和的公式。例如，考虑前n个自然数的和：

1 + 2 + 3 + … + n = n(n + 1)/2

To prove this by induction, we start with the base case n = 1. The left-hand side is 1, and the right-hand side is 1(1+1)/2 = 1, so the statement is true. Now assume the statement holds for n = k:

要用归纳法证明，我们先从基础步骤n=1开始。左边是1，右边是1(1+1)/2=1，因此命题成立。现在假设命题对n=k成立：

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

We then add (k+1) to both sides:

然后我们在两边加上(k+1)：

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

This is exactly the formula with n = k+1. Hence the statement holds for all positive integers n. This same pattern can be used for sums of squares, cubes, and geometric series.

这正是n=k+1时的公式。因此命题对所有正整数n都成立。同样的模式可用于平方和、立方和以及等比数列求和。

3. Induction for Divisibility | 整除性的归纳证明

Induction is also excellent for proving statements about divisibility. For instance, show that for every positive integer n, 5ⁿ − 1 is divisible by 4.

归纳法也非常适合证明整除性命题。例如，证明对于每个正整数n，5ⁿ − 1可以被4整除。

Base case: n = 1 gives 5¹ − 1 = 4, which is divisible by 4. Assume the statement is true for n = k, i.e. 4 divides 5ᵏ − 1. Then we write:

基础步骤：n=1时，5¹ − 1 = 4，能被4整除。假设命题对n=k成立，即4整除5ᵏ − 1。然后我们写：

5ᵏ⁺¹ − 1 = 5 · 5ᵏ − 1 = 5(5ᵏ − 1) + 4

Since 4 divides 5ᵏ − 1 (by the inductive hypothesis) and 4 divides 4, it follows that 4 divides the whole expression. Hence 5ᵏ⁺¹ − 1 is divisible by 4. The key trick is to create a multiple of the inductive hypothesis and a constant that is obviously divisible by 4.

因为4整除5ᵏ − 1（由归纳假设）且4整除4，所以4整除整个表达式。因此5ᵏ⁺¹ − 1能被4整除。关键技巧是构造一个归纳假设的倍数以及一个显然能被4整除的常数。

4. Induction for Inequalities | 不等式的归纳证明

Inequalities involving powers and factorials often require induction. For example, prove that for all integers n ≥ 5, 2ⁿ > n².

涉及幂和阶乘的不等式通常需要归纳法。例如，证明对所有整数n ≥ 5，有2ⁿ > n²。

Here the base case is n = 5, since the statement may fail for smaller n. We check 2⁵ = 32 > 25 = 5². Assume 2ᵏ > k² for some k ≥ 5. We need to show 2ᵏ⁺¹ > (k+1)². Starting from the assumption:

这里基础步骤是n=5，因为该命题对更小的n可能不成立。我们验证2⁵ = 32 > 25 = 5²。假设对某个k ≥ 5有2ᵏ > k²。我们需要证明2ᵏ⁺¹ > (k+1)²。从假设出发：

2ᵏ⁺¹ = 2 · 2ᵏ > 2k²

It remains to show 2k² > (k+1)² for k ≥ 5. Expanding gives 2k² > k² + 2k + 1, i.e. k² − 2k − 1 > 0, which certainly holds for k ≥ 3. Therefore the inductive step works. This example shows that sometimes the base case is not n = 1 but a later starting point.

剩下的需要证明在k ≥ 5时2k² > (k+1)²。展开得2k² > k² + 2k + 1，即k² − 2k − 1 > 0，这显然在k ≥ 3时成立。因此归纳步骤成立。这个例子表明有时基础步骤不是n=1，而是更晚的起始点。

5. Induction for Recurrence Relations | 递推关系的归纳证明

Recurrence relations define a sequence in terms of previous terms. Induction can be used to prove a closed-form formula for the n-th term. For example, define a sequence by a₁ = 1 and aₙ₊₁ = 2aₙ + 3. Guess a formula: aₙ = 2ⁿ⁺¹ − 3.

递推关系用前几项定义序列。归纳法可用于证明第n项的通项公式。例如，定义数列a₁ = 1，aₙ₊₁ = 2aₙ + 3。猜测通项公式：aₙ = 2ⁿ⁺¹ − 3。

Base case: n = 1 gives 2² − 3 = 1, which matches a₁. Assume aₖ = 2ᵏ⁺¹ − 3. Then:

基础步骤：n=1时，2² − 3 = 1，与a₁相符。假设aₖ = 2ᵏ⁺¹ − 3。那么：

aₖ₊₁ = 2aₖ + 3 = 2(2ᵏ⁺¹ − 3) + 3 = 2ᵏ⁺² − 6 + 3 = 2ᵏ⁺² − 3

This is exactly the formula for n = k+1. Thus the closed form is proved. Notice how the inductive hypothesis is substituted directly into the recurrence relation.

这正是n=k+1的公式。因此通项公式得证。注意归纳假设是如何被直接代入递推关系中的。

6. Induction for Matrix Powers | 矩阵幂的归纳证明

Matrix algebra provides another fertile ground for induction. Suppose we wish to prove that for the matrix A = [ [1, 1], [0, 1] ], the n-th power is Aⁿ = [ [1, n], [0, 1] ].

矩阵代数为归纳法提供了另一片肥沃的土壤。假设我们要证明对于矩阵A = [ [1, 1], [0, 1] ]，其n次幂为Aⁿ = [ [1, n], [0, 1] ]。

Base case: n = 1 gives A¹ = [ [1, 1], [0, 1] ], which is correct. Assume for k that Aᵏ = [ [1, k], [0, 1] ]. Then:

基础步骤：n=1时，A¹ = [ [1, 1], [0, 1] ]，是正确的。假设对k有Aᵏ = [ [1, k], [0, 1] ]。那么：

Aᵏ⁺¹ = Aᵏ · A = [ [1, k], [0, 1] ] · [ [1, 1], [0, 1] ] = [ [1, k+1], [0, 1] ]

Matrix multiplication confirms the pattern continues. It is essential to compute the product carefully and state that the entries follow the desired form. Induction works naturally because the exponent increases by one, just like in scalar powers.

矩阵乘法确认了这个模式继续成立。关键在于仔细计算乘积，并说明各元素符合期望的形式。归纳法之所以自然有效，是因为指数每次增加1，与标量幂的情形类似。

7. Induction for Complex Numbers (de Moivre’s Theorem) | 复数中的归纳法（棣莫弗定理）

Induction can even be extended to complex numbers. De Moivre’s theorem states that for any real number θ and any positive integer n:

归纳法甚至可以推广到复数。棣莫弗定理指出，对于任意实数θ和任意正整数n：

(cos θ + i sin θ)ⁿ = cos(nθ) + i sin(nθ)

Base case: n = 1 gives cos θ + i sin θ = cos(1·θ) + i sin(1·θ), which is trivially true. Assume the statement for n = k. Multiply both sides by (cos θ + i sin θ):

基础步骤：n=1时，cos θ + i sin θ = cos(1·θ) + i sin(1·θ)显然成立。假设命题对n=k成立。两边乘以(cos θ + i sin θ)：

(cos θ + i sin θ)ᵏ⁺¹ = (cos(kθ) + i sin(kθ))(cos θ + i sin θ)

Expanding using trigonometric identities gives:

利用三角恒等式展开得到：

= cos(kθ)cos θ − sin(kθ)sin θ + i( sin(kθ)cos θ + cos(kθ)sin θ ) = cos((k+1)θ) + i sin((k+1)θ)

This proves the inductive step. De Moivre’s theorem is a beautiful extension of induction because the algebra is the same as for real powers, but it relies on angle addition formulas.

这证明了归纳步骤。棣莫弗定理是归纳法的一个优美扩展，因为其代数运算与实数幂相同，但依赖于角的加法公式。

8. Strong Induction and Multiple Base Cases | 强归纳法和多个基础步骤

Sometimes the inductive hypothesis for n = k alone is insufficient; you need the statement to be true for several earlier values. This is called strong induction. For example, the Fibonacci sequence defined by F₁ = 1, F₂ = 1, and Fₙ₊₂ = Fₙ₊₁ + Fₙ can be shown to satisfy Fₙ ≤ (7/4)ⁿ using strong induction.

有时仅使用n=k的归纳假设是不够的；你需要命题对若干更早的值也成立。这称为强归纳法。例如，斐波那契数列定义为F₁ = 1，F₂ = 1，Fₙ₊₂ = Fₙ₊₁ + Fₙ，可以用强归纳法证明Fₙ ≤ (7/4)ⁿ。

In strong induction, you assume the statement is true for all j ≤ k, not just for j = k. For the Fibonacci example, you need both Fₖ and Fₖ₋₁ to progress. Strong induction also allows multiple base cases, which is vital when the recurrence depends on two previous terms.

在强归纳法中，你假设命题对所有j ≤ k都成立，而不仅仅是j = k。对于斐波那契例子，你需要Fₖ和Fₖ₋₁来推进。强归纳法还允许有多个基础步骤，这在递推依赖于前两项时至关重要。

9. Common Pitfalls and Exam Tips | 常见陷阱与考试提示

Many students lose marks in proof by induction questions due to avoidable mistakes. First, always state clearly where you are using the inductive hypothesis – examiners look for that critical line. Second, never skip the base case, even if it seems obvious. Third, be careful with inequalities: you often need to prove an auxiliary inequality, as shown in Section 4.

许多学生在归纳法证明题中因可避免的错误而失分。首先，始终清楚地说明你在哪里使用了归纳假设——考官会寻找那个关键的步骤。其次，绝不要跳过基础步骤，即使它看起来很明显。第三，处理不等式时要小心：你经常需要证明一个辅助不等式，如第4节所示。

Write down the conclusion: End with “Therefore, by the principle of mathematical induction, the statement is true for all n ≥ …”
Use consistent notation: Keep k and k+1 clearly separated.
Check the base case carefully: Verify both sides of an equation or inequality numerically.

写出结论：以“因此，由数学归纳法原理，命题对所有n ≥ …成立”结尾。
使用一致的符号：明确区分k和k+1。
仔细检验基础步骤：代入数值验证方程或不等式的两边。

10. Extended Example: A Complete AQA-Style Proof | 扩展例题：一个完整的AQA风格证明

Let us combine several ideas in one final example. Prove that for all positive integers n, 9ⁿ − 2ⁿ is divisible by 7.

让我们在一个最终例子中综合几个思想。证明对所有正整数n，9ⁿ − 2ⁿ能被7整除。

Base case: n = 1 gives 9 − 2 = 7, which is divisible by 7.

基础步骤：n=1时，9 − 2 = 7，能被7整除。

Inductive hypothesis: Assume for some k ≥ 1, 9ᵏ − 2ᵏ is divisible by 7.

归纳假设：假设对某个k ≥ 1，9ᵏ − 2ᵏ能被7整除。

Inductive step: Consider 9ᵏ⁺¹ − 2ᵏ⁺¹. Rewrite it as:

归纳步骤：考虑9ᵏ⁺¹ − 2ᵏ⁺¹。将其改写为：

9 · 9ᵏ − 2 · 2ᵏ = 9(9ᵏ − 2ᵏ) + 7 · 2ᵏ

By the inductive hypothesis, 7 divides 9ᵏ − 2ᵏ, so 7 divides the first term. Obviously 7 divides 7 · 2ᵏ. Therefore 7 divides the whole sum. Hence the statement holds for n = k+1.

由归纳假设，7整除9ᵏ − 2ᵏ，所以7整除第一项。显然7整除7 · 2ᵏ。因此7整除整个和。所以命题对n=k+1成立。

Conclusion: By induction, 9ⁿ − 2ⁿ is divisible by 7 for all positive integers n.

结论：由归纳法，9ⁿ − 2ⁿ对所有正整数n都能被7整除。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Proof by Induction Extended to Other Areas of Mathematics | 数学归纳法在其他数学领域的应用