6.9: Infinite descent
In this final section we touch upon an important variation on mathematical induction. This variation is well-illustrated by the next (probably familiar) problem.
Problem 267 Write out for yourself the following standard proof that is irrational.
(i) Suppose to the contrary that is rational. Then for some positive integers m , n . Prove first that m must be even.
(ii) Write , where is also an integer. Show that n must also be even.
(iii) How does this lead to a contradiction?
Problem 267 . has the classic form of a proof which reaches a contradiction by infinite descent .
- We start with a claim which we wish to prove is true. Often when we do not know how to begin, it makes sense to ask what would happen if the claim were false . This then guarantees that there must be some counterexample , which satisfies the given hypothesis, but which fails to satisfy the asserted conclusion.
- Infinite descent becomes an option whenever each such counterexample gives rise to some positive integer parameter n (such as the denominator in Problem 267 .(i)).
- Infinite descent becomes a reality , if one can prove that the existence of the initial counterexample leads to a construction that produces a counterexample with a smaller value of the parameter n , since repeating this step then gives rise to an endlessly decreasing sequence of positive integers, which is impossible (since such a chain can have length at most n ).
- Hence the initial assumption that the claim was false must itself be false – so the claim must be true (as required).
Proof by “infinite descent” is an invaluable tool. But it is important to realise that the method is essentially a variation on proof by mathematical induction. As a first step in this direction it is worth reinterpreting Problem 267 . as an induction proof.
Problem 268 Let be the statement:
“ cannot be written as a fraction with positive denominator ”.
(i) Explain why is true.
(ii) Suppose that is true for some . Use the proof in Problem 267 . to show that must then be true as well.
(iii) Conclude that is true for all , whence must be irrational.
Problem 268 . shows that, in the particular case of Problem 267 . one can translate the standard proof that “ is irrational” into a proof by induction. But much more is true. The contradiction arising in step 3. above is an application of an important principle, namely
The Least Element Principle : Every non-empty set S of positive integers has a smallest element.
The Least Element Principle is equivalent to The Principle of Mathematical Induction which we stated at the beginning of the chapter:
The Principle of Mathematical Induction: If a subset S of the positive integers
then S contains all positive integers.
- contains the integer “1”, and has the property that
- whenever an integer k is in the set S , then the next integer is always in S too,
Problem 269
(a) Assume the Least Element Principle . Suppose a subset T of the positive integers contains the integer “1”, and that whenever k is in the set T , then is also in the set T . Let S be the set of all positive integers which are not in the set T . Conclude that S must be empty, and hence that T contains all positive integers.
(b) Assume the Principle of Mathematical Induction . Let T be a non-empty set of positive integers, and suppose that T does not have a smallest element. Let S be the set of all positive integers which do not belong to the set T . Prove that “1” must belong to S , and that whenever the positive integer k belongs to S , then so does . Derive the contradiction that T must be empty, contrary to assumption. Conclude that T must in fact have a smallest element.
To round off this final chapter you are invited to devise a rather different proof of the irrationality of .
Problem 270
This sequence of constructions presumes that we know – for example, by Pythagoras' Theorem – that, in any square
“diagonal: side” .
Let
(i) Explain why . Construct the point to complete the square .
(ii) Join . Explain why .
(iii) Suppose . Conclude that .
(iv) Prove that , and hence that , .
(v) Explain how, if m , n can be chosen to be positive integers, the above sequence of steps sets up an “infinite descent” – which is impossible.