next next up down toc toc mail

8.3.  Mathematical Induction

Definition 7.2 (Induction)

Assume that the universe of discourse is given by the set of the natural numbers, and let P(n) be any property of natural numbers. In this case we can use the following rule of inference.
P(0)
for all n ( P(n) ) -> P( s(n) )
------------------------------------
for all n P(n)

P(0) is called the inductive base or the basis of induction.

The expression [right for all n( P(n) ) [larr] P( s(n) )[left is called the inductive step.

Hence, the inductive base and the inductive step together imply that P(n) is true for all n.

This leads us to the following method which is called strong induction:

Inductive base:         Establish P(0)
Inductive hypothesis:   Assume P(0), P(1), P(2), ... P(n)
Inductive step:         prove P(n+1)
Conclusion:             The basis of induction and the inductive step
                        allow one to conclude that P(n) is true for all n.

Examples:


back next up down toc toc mail


Created by unroff & hp-tools. © by Hans-Peter Bischof. All Rights Reserved (1998).

Last modified: 27/July/98 (12:14)