Proof by Induction | 数学归纳法证明

📚 Proof by Induction | 数学归纳法证明

Proof by induction is a fundamental technique in IB Mathematics, especially in the Analysis and Approaches (AA) and Applications and Interpretation (AI) Higher Level courses. It allows us to prove that a statement is true for all natural numbers, or for a range of integers, by establishing a domino effect of logical implications. Understanding this method not only strengthens your logical reasoning but also equips you to handle a wide variety of problems involving sequences, divisibility, inequalities, and matrices.

归纳法证明是IB数学中一项基本技巧，尤其在分析与方法（AA）以及应用与解释（AI）的高阶课程中。它通过建立逻辑推理的多米诺骨牌效应，使我们能够证明某个命题对所有自然数或某个整数范围成立。掌握这种方法不仅能加强你的逻辑推理能力，还能让你处理涉及数列、整除性、不等式和矩阵的各类问题。

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

Mathematical induction is based on the well-ordered nature of the natural numbers. If we can prove that a statement P(n) holds for the smallest value (usually n=1), and that whenever P(k) is true, P(k+1) must also be true, then P(n) is true for all n ∈ ℕ.

数学归纳法基于自然数的良序性质。如果我们能证明命题 P(n) 对于最小值（通常是 n=1）成立，并且只要 P(k) 成立就能推出 P(k+1) 成立，那么 P(n) 对于所有 n ∈ ℕ 均成立。

This process is often likened to a line of falling dominoes: the base case knocks over the first domino, and the induction step ensures that each domino knocks over the next one. The beauty of induction is that it transforms an infinite check into two manageable pieces of work.

这个过程常被比作一排倒下的多米诺骨牌：基础情况推倒第一张牌，归纳步骤确保每一张牌都会推倒下一张牌。归纳法的美妙之处在于它将无限的验证转化为两项可操作的任务。

2. The Base Case | 基础情况

The base case verifies that the proposition P(n) is true for the initial integer n₀, which is often 1, but could be 0, 2, or any starting point depending on the statement. For example, to prove that 2ⁿ > n² for all n ≥ 5, you would first check n=5: 2⁵ = 32, 5² = 25, so 32 > 25, which is true.

基础情况验证命题 P(n) 对于初始整数 n₀ 成立，n₀ 通常为 1，但根据命题也可能为 0、2 或其他起点。例如，要证明对于所有 n ≥ 5 有 2ⁿ > n²，首先检验 n=5：2⁵ = 32，5² = 25，因此 32 > 25，成立。

Failure to verify the base case rigorously is a common pitfall; without it, the entire induction argument collapses. Always double-check that the base value satisfies the statement exactly as written.

未能严谨验证基础情况是一个常见陷阱；没有它，整个归纳论证就会崩塌。务必反复确认基础值完全满足命题所写的形式。

3. The Induction Hypothesis | 归纳假设

In this step, we assume that the statement P(k) is true for some arbitrary but fixed integer k greater than or equal to the base value. This assumption is called the induction hypothesis. It is crucial to state the assumption clearly, e.g., ‘Assume that for some k ≥ 1, 1+2+…+k = k(k+1)/2.’

在这一步中，我们假设命题 P(k) 对于某个任意但固定的整数 k（大于或等于基础值）成立。这个假设称为归纳假设。必须清楚地陈述该假设，例如，“假设对某个 k ≥ 1，有 1+2+…+k = k(k+1)/2。”

The hypothesis is not something we prove; it is a temporary working assumption. It allows us to bridge the gap between the known base case and the next integer. Without a well-formulated hypothesis, the induction step lacks a logical starting point.

归纳假设并不是我们需要证明的东西，而是一个临时的运作假设。它让我们能够在已知基础情况和下一个整数之间架起桥梁。如果没有清晰表述的假设，归纳步骤就会缺少逻辑起点。

4. The Induction Step | 归纳步骤

Using the induction hypothesis, we must prove that P(k+1) follows logically. This is the core of the proof and often involves algebraic manipulation, substitution, or inequality reasoning. The goal is to show that P(k) true ⇒ P(k+1) true.

利用归纳假设，我们必须证明 P(k+1) 在逻辑上成立。这是证明的核心，通常涉及代数运算、代入或不等式推理。目标是证明 P(k) 真 ⇒ P(k+1) 真。

Once this implication is established alongside the base case, the statement is proved for all natural numbers by the principle of induction. The induction step must hold for every k starting from the base value, so be careful not to rely on any hidden restrictions or special cases.

一旦建立了这个蕴含关系并在基础情况下成立，根据归纳法

Published by TutorHao | IB Mathematics Revision Series | aleveler.com

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