Proofs:Induction

Mathematical induction is a mathematical proof technique. It is essentially used to prove that a statement P(n) holds for every natural number n = 0, 1, 2, 3, . . . ; that is, the overall statement is a sequence of infinitely many cases P(0), P(1), P(2), P(3), . . . . Informal metaphors help to explain this technique, such as falling dominoes or climbing a ladder:

Mathematical induction proves that we can climb as high as we like on a ladder, by proving that we can climb onto the bottom rung (the basis) and that from each rung we can climb up to the next one (the step).

- Concrete Mathematics, page 3 margins.

A proof by induction consists of two cases. The first, the base case (or basis), proves the statement for n = 0 without assuming any knowledge of other cases. The second case, the induction step, proves that if the statement holds for any given case n = k, then it must also hold for the next case n = k + 1. These two steps establish that the statement holds for every natural number n. The base case does not necessarily begin with n = 0, but often with n = 1, and possibly with any fixed natural number n = N, establishing the truth of the statement for all natural numbers n ≥ N.

The method can be extended to prove statements about more general well-founded structures, such as trees; this generalization, known as structural induction, is used in mathematical logic and computer science. Mathematical induction in this extended sense is closely related to recursion. Mathematical induction is an inference rule used in formal proofs, and is the foundation of most correctness proofs for computer programs.

Although its name may suggest otherwise, mathematical induction should not be confused with inductive reasoning as used in philosophy (see Problem of induction). The mathematical method examines infinitely many cases to prove a general statement, but does so by a finite chain of deductive reasoning involving the variable n, which can take infinitely many values.

Description

The simplest and most common form of mathematical induction infers that a statement involving a natural number n (that is, an integer n ≥ 0 or 1) holds for all values of n. The proof consists of two steps:

The initial or base case: prove that the statement holds for 0, or 1. The induction step, inductive step, or step case: prove that for every n, if the statement holds for n, then it holds for n + 1. In other words, assume that the statement holds for some arbitrary natural number n, and prove that the statement holds for n + 1. The hypothesis in the inductive step, that the statement holds for a particular n, is called the induction hypothesis or inductive hypothesis. To prove the inductive step, one assumes the induction hypothesis for n and then uses this assumption to prove that the statement holds for n + 1.

Authors who prefer to define natural numbers to begin at 0 use that value in the base case; those who define natural numbers to begin at 1 use that value.

Examples

Sum of consecutive natural numbers

Mathematical induction can be used to prove the following statement P(n) for all natural numbers n.

P(n)\!:\ \ 0+1+2+\cdots +n\,=\,{\frac {n(n+1)}{2}}.

This states a general formula for the sum of the natural numbers less than or equal to a given number; in fact an infinite sequence of statements: $0={\tfrac {(0)(0+1)}{2}}$ , $0+1={\tfrac {(1)(1+1)}{2}}$ , $0+1+2={\tfrac {(2)(2+1)}{2}}$ , etc.

Proposition. For any $n\in \mathbb {N}$ , $0+1+2+\cdots +n={\tfrac {n(n+1)}{2}}.$

Proof. Let P(n) be the statement $0+1+2+\cdots +n={\tfrac {n(n+1)}{2}}.$ We give a proof by induction on n.

Base case: Show that the statement holds for the smallest natural number n = 0.

P(0) is clearly true: $0={\tfrac {0(0+1)}{2}}\,.$

Inductive step: Show that for any k ≥ 0, if P(k) holds, then P(k+1) also holds.

Assume the induction hypothesis that for a particular k, the single case n = k holds, meaning P(k) is true:

$0+1+\cdots +k\ =\ {\frac {k(k{+}1)}{2}}.$

It follows that:

(0+1+2+\cdots +k)+(k{+}1)\ =\ {\frac {k(k{+}1)}{2}}+(k{+}1).

Algebraically, the right hand side simplifies as:

{\begin{aligned}{\frac {k(k{+}1)}{2}}+(k{+}1)&\ =\ {\frac {k(k{+}1)+2(k{+}1)}{2}}\\&\ =\ {\frac {(k{+}1)(k{+}2)}{2}}\\&\ =\ {\frac {(k{+}1)((k{+}1)+1)}{2}}.\end{aligned}}

Equating the extreme left hand and right hand sides, we deduce that:

$0+1+2+\cdots +k+(k{+}1)\ =\ {\frac {(k{+}1)((k{+}1)+1)}{2}}.$

That is, the statement P(k+1) also holds true, establishing the inductive step.

Conclusion: Since both the base case and the inductive step have been proved as true, by mathematical induction the statement P(n) holds for every natural number n. ∎

A trigonometric inequality

Induction is often used to prove inequalities. As an example, we prove that $|\!\sin nx|\leq n|\!\sin x|$ for any real number $x$ and natural number $n$ .

At first glance, it may appear that a more general version, $|\!\sin nx|\leq n\,|\!\sin x|$ for any real numbers $n,x$ , could be proven without induction; but the case ${\textstyle n={\frac {1}{2}},\,x=\pi }$ shows it may be false for non-integer values of $n$ . This suggests we examine the statement specifically for natural values of $n$ , and induction is the readiest tool.

Proposition. For any $x\in \mathbb {R} ,n\in \mathbb {N}$ , $|\!\sin nx|\leq n\,|\!\sin x|$ .

Proof. Fix an arbitrary real number $x$ , and let $P(n)$ be the statement $|\!\sin nx|\leq n\,|\!\sin x|$ . We induct on $n$ .

Base case: The calculation $|\!\sin 0x|=0\leq 0=0\,|\!\sin x|$ verifies $P(0)$ .

Inductive step: We show the implication $P(k)\implies P(k{+}1)$ for any natural number $k$ . Assume the induction hypothesis: for a given value $n=k\geq 0$ , the single case $P(k)$ is true. Using the angle addition formula and the triangle inequality, we deduce:

{\begin{array}{rcll}|\sin(k{+}1)x|&=&|\sin kx\,\cos x+\sin x\,\cos kx\,|&{\text{(angle addition)}}\\&\leq &|\!\sin kx\,\cos x|+|\!\sin x\,\cos kx|&{\text{(triangle inequality)}}\\&=&|\!\sin kx|\,|\!\cos x|+|\!\sin x|\,|\!\cos kx|&\\&\leq &|\!\sin kx|+|\!\sin x|&(\,|\!\cos t|\leq 1)\\&\leq &k\,|\!\sin x|+|\!\sin x|&{\text{(induction hypothesis}})\\&\ =\ &(k{+}1)\,|\!\sin x|.&\end{array}}

The inequality between the extreme left hand and right-hand quantities shows that $P(k{+}1)$ is true, which completes the inductive step.

Conclusion: The proposition $P(n)$ holds for all natural numbers $n$ . ∎

Variants

In practice, proofs by induction are often structured differently, depending on the exact nature of the property to be proven. All variants of induction are special cases of transfinite induction.

Induction basis other than 0 or 1

If one wishes to prove a statement, not for all natural numbers, but only for all numbers $n$ greater than or equal to a certain number $b$ , then the proof by induction consists of the following:

Showing that the statement holds when $n = b$ .
Showing that if the statement holds for an arbitrary number $n \geq b$ , then the same statement also holds for $n + 1$ .

This can be used, for example, to show that $2 n \geq n + 5$ for $n \geq 3$ .

In this way, one can prove that some statement $P (n)$ holds for all $n \geq 1$ , or even for all $n \geq -5$ . This form of mathematical induction is actually a special case of the previous form, because if the statement to be proved is $P (n)$ then proving it with these two rules is equivalent with proving $P (n + b)$ for all natural numbers $n$ with an induction base case $0$ .

Example: forming dollar amounts by coins

Assume an infinite supply of 4- and 5-dollar coins. Induction can be used to prove that any whole amount of dollars greater than or equal to $12$ can be formed by a combination of such coins. Let $S (k)$ denote the statement " $k$ dollars can be formed by a combination of 4- and 5-dollar coins". The proof that $S (k)$ is true for all $k \geq 12$ can then be achieved by induction on $k$ as follows:

Base case: Showing that $S (k)$ holds for $k = 12$ is simple: take three 4-dollar coins.

Induction step: Given that $S (k)$ holds for some value of $k \geq 12$ (induction hypothesis), prove that $S (k + 1)$ holds, too:

Assume

S (k)

is true for some arbitrary

k \geq 12

. If there is a solution for

k

dollars that includes at least one 4-dollar coin, replace it by a 5-dollar coin to make

k + 1

dollars. Otherwise, if only 5-dollar coins are used,

k

must be a multiple of 5 and so at least 15; but then we can replace three 5-dollar coins by four 4-dollar coins to make

k + 1

dollars. In each case,

S (k + 1)

is true.

Therefore, by the principle of induction, $S (k)$ holds for all $k \geq 12$ , and the proof is complete.

In this example, although $S (k)$ also holds for ${\textstyle k\in \{4,5,8,9,10\}}$ , the above proof cannot be modified to replace the minimum amount of $12$ dollar to any lower value $m$ . For $m = 11$ , the base case is actually false; for $m = 10$ , the second case in the induction step (replacing three 5- by four 4-dollar coins) will not work; let alone for even lower $m$ .

Induction on more than one counter

It is sometimes desirable to prove a statement involving two natural numbers, n and m, by iterating the induction process. That is, one proves a base case and an inductive step for n, and in each of those proves a base case and an inductive step for m. See, for example, the proof of commutativity accompanying addition of natural numbers. More complicated arguments involving three or more counters are also possible.

Infinite descent

The method of infinite descent is a variation of mathematical induction which was used by Pierre de Fermat. It is used to show that some statement Q(n) is false for all natural numbers n. Its traditional form consists of showing that if Q(n) is true for some natural number n, it also holds for some strictly smaller natural number m. Because there are no infinite decreasing sequences of natural numbers, this situation would be impossible, thereby showing (by contradiction) that Q(n) cannot be true for any n.

The validity of this method can be verified from the usual principle of mathematical induction. Using mathematical induction on the statement P(n) defined as "Q(m) is false for all natural numbers m less than or equal to n", it follows that P(n) holds for all n, which means that Q(n) is false for every natural number n.

Prefix induction

The most common form of proof by mathematical induction requires proving in the inductive step that

\forall k(P(k)\to P(k+1))

whereupon the induction principle "automates" n applications of this step in getting from P(0) to P(n). This could be called "predecessor induction" because each step proves something about a number from something about that number's predecessor.

A variant of interest in computational complexity is "prefix induction", in which one proves the following statement in the inductive step:

\forall k(P(k)\to P(2k)\land P(2k+1))

or equivalently

\forall k\left(P\left(\left\lfloor {\frac {k}{2}}\right\rfloor \right)\to P(k)\right)

The induction principle then "automates" log n applications of this inference in getting from P(0) to P(n). In fact, it is called "prefix induction" because each step proves something about a number from something about the "prefix" of that number — as formed by truncating the low bit of its binary representation. It can also be viewed as an application of traditional induction on the length of that binary representation.

If traditional predecessor induction is interpreted computationally as an n-step loop, then prefix induction would correspond to a log-n-step loop. Because of that, proofs using prefix induction are "more feasibly constructive" than proofs using predecessor induction.

Predecessor induction can trivially simulate prefix induction on the same statement. Prefix induction can simulate predecessor induction, but only at the cost of making the statement more syntactically complex (adding a bounded universal quantifier), so the interesting results relating prefix induction to polynomial-time computation depend on excluding unbounded quantifiers entirely, and limiting the alternation of bounded universal and existential quantifiers allowed in the statement.

One can take the idea a step further: one must prove

\forall k\left(P\left(\left\lfloor {\sqrt {k}}\right\rfloor \right)\to P(k)\right)

whereupon the induction principle "automates" log log n applications of this inference in getting from P(0) to P(n). This form of induction has been used, analogously, to study log-time parallel computation.

Complete (strong) induction

Another variant, called complete induction, course of values induction or strong induction (in contrast to which the basic form of induction is sometimes known as weak induction), makes the inductive step easier to prove by using a stronger hypothesis: one proves the statement $P(m+1)$ under the assumption that $P(n)$ holds for all natural numbers $n$ less than $m+1$ ; by contrast, the basic form only assumes $P(m)$ . The name "strong induction" does not mean that this method can prove more than "weak induction", but merely refers to the stronger hypothesis used in the inductive step.

In fact, it can be shown that the two methods are actually equivalent, as explained below. In this form of complete induction, one still has to prove the base case, $P(0)$ , and it may even be necessary to prove extra-base cases such as $P(1)$ before the general argument applies, as in the example below of the Fibonacci number $F_{n}$ .

Although the form just described requires one to prove the base case, this is unnecessary if one can prove $P(m)$ (assuming $P(n)$ for all lower $n$ ) for all $m\geq 0$ . This is a special case of transfinite induction as described below, although it is no longer equivalent to ordinary induction. In this form the base case is subsumed by the case $m=0$ , where $P(0)$ is proved with no other $P(n)$ assumed; this case may need to be handled separately, but sometimes the same argument applies for $m=0$ and $m>0$ , making the proof simpler and more elegant. In this method, however, it is vital to ensure that the proof of $P(m)$ does not implicitly assume that $m>0$ , e.g. by saying "choose an arbitrary $n<m$ ", or by assuming that a set of m elements has an element.

Complete induction is equivalent to ordinary mathematical induction as described above, in the sense that a proof by one method can be transformed into a proof by the other. Suppose there is a proof of $P(n)$ by complete induction. Let $Q(n)$ mean " $P(m)$ holds for all $m$ such that $0\leq m\leq n$ ". Then $Q(n)$ holds for all $n$ if and only if $P(n)$ holds for all $n$ , and our proof of $P(n)$ is easily transformed into a proof of $Q(n)$ by (ordinary) induction. If, on the other hand, $P(n)$ had been proven by ordinary induction, the proof would already effectively be one by complete induction: $P(0)$ is proved in the base case, using no assumptions, and $P(n+1)$ is proved in the inductive step, in which one may assume all earlier cases but need only use the case $P(n)$ .

Example: Fibonacci numbers

Complete induction is most useful when several instances of the inductive hypothesis are required for each inductive step. For example, complete induction can be used to show that

F_{n}={\frac {\varphi ^{n}-\psi ^{n}}{\varphi -\psi }}

where $F_{n}$ is the nth Fibonacci number, ${\textstyle \varphi ={{1+{\sqrt {5}}} \over 2}}$ (the golden ratio) and ${\textstyle \psi ={{1-{\sqrt {5}}} \over 2}}$ are the roots of the polynomial $x^{2}-x-1$ . By using the fact that $F_{n+2}=F_{n+1}+F_{n}$ for each $n\in {\mathbb {N}}$ , the identity above can be verified by direct calculation for ${\textstyle F_{n+2}}$ if one assumes that it already holds for both ${\textstyle F_{n+1}}$ and ${\textstyle F_{n}}$ . To complete the proof, the identity must be verified in the two base cases: $n=0$ and ${\textstyle n=1}$ .

Example: prime factorization

Another proof by complete induction uses the hypothesis that the statement holds for all smaller $n$ more thoroughly. Consider the statement that "every natural number greater than 1 is a product of (one or more) prime numbers", which is the "existence" part of the fundamental theorem of arithmetic. For proving the inductive step, the induction hypothesis is that for a given $n>1$ the statement holds for all smaller $n>1$ . If $m$ is prime then it is certainly a product of primes, and if not, then by definition it is a product: $m=n_{1}n_{2}$ , where neither of the factors is equal to 1; hence neither is equal to $m$ , and so both are greater than 1 and smaller than $m$ . The induction hypothesis now applies to $n_{1}$ and $n_{2}$ , so each one is a product of primes. Thus $m$ is a product of products of primes, and hence by extension a product of primes itself.

Example: dollar amounts revisited

We shall look to prove the same example as above, this time with strong induction. The statement remains the same:

$S(n):\,\,n\geq 12\to \,\exists \,a,b\in \mathbb {N} .\,\,n=4a+5b$

However, there will be slight differences in the structure and the assumptions of the proof, starting with the extended base case:

Base case: Show that $S(k)$ holds for $k=12,13,14,15$ .

{\begin{aligned}4\cdot 3+5\cdot 0=12\\4\cdot 2+5\cdot 1=13\\4\cdot 1+5\cdot 2=14\\4\cdot 0+5\cdot 3=15\end{aligned}}

The base case holds.

Induction hypothesis: Given some $j>15$ , assume $S(m)$ holds for all $m$ with $12\leq m<j$ .

Inductive step: Prove that $S(j)$ holds.

Choosing $m=j-4$ , and observing that $15<j\to 12\leq j-4<j$ shows that $S(j-4)$ holds, by inductive hypothesis. That is, the sum $j-4$ can be formed by some combination of $4$ and $5$ dollar coins. Then, simply adding a $4$ dollar coin to that combination yields the sum $j$ . That is, $S(j)$ holds. Q.E.D.