Mathematical Induction - Complete Induction

Another variant, called complete induction (or strong induction or course of values induction), says that in the second step we may assume not only that the statement holds for n = m but also that it is true for all n less than or equal to m.

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

where Fn is the nth Fibonacci number, φ = (1 + √5)/2 (the golden ratio) and ψ = (1 − √5)/2 are the roots of the polynomial x2 − x − 1. By using the fact that Fn + 2 = Fn + 1 + Fn for each nN, the identity above can be verified by direct calculation for Fn + 2 if we assume that it already holds for both Fn + 1 and Fn. To complete the proof, the identity must be verified in the two base cases n = 0 and n = 1.

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 prime numbers", and assume that for a given m > 1 it 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 = n1 n2, where neither of the factors is equal to 1; hence neither is equal to m, and so both are smaller than m. The induction hypothesis now applies to n1 and n2, so each one is a product of primes. Then m is a product of products of primes; i.e. a product of primes.

This generalization, complete induction, is equivalent to the ordinary mathematical induction described above. Suppose P(n) is the statement that we intend to prove by complete induction. Let Q(n) mean P(m) holds for all m such that 0 ≤ mn. Then Q(n) is true for all n if and only if P(n) is true for all n, and a proof of P(n) by complete induction is just the same thing as a proof of Q(n) by (ordinary) induction.

Read more about this topic:  Mathematical Induction

Famous quotes containing the words complete and/or induction:

    The history of any nation follows an undulatory course. In the trough of the wave we find more or less complete anarchy; but the crest is not more or less complete Utopia, but only, at best, a tolerably humane, partially free and fairly just society that invariably carries within itself the seeds of its own decadence.
    Aldous Huxley (1894–1963)

    One might get the impression that I recommend a new methodology which replaces induction by counterinduction and uses a multiplicity of theories, metaphysical views, fairy tales, instead of the customary pair theory/observation. This impression would certainly be mistaken. My intention is not to replace one set of general rules by another such set: my intention is rather to convince the reader that all methodologies, even the most obvious ones, have their limits.
    Paul Feyerabend (1924–1994)