1.6 Consequences of the completeness axiom
Existence of radicals
At the beginning of the section, we described the completeness axiom as a way of ensuring that the real numbers forms a continuum: that our number line contains no holes. We now demonstrate this by using the completeness axiom to show that contains many of the numbers which are missing from .
We first show that contains : that is, there exists some element such that (so we have filled in at least one hole in comparison with the rationals).
Consider the set ; this is a variant of the set we encountered in Example 1.14. Since is nonempty (for instance, ) and bounded above (for instance, is an upper bound), the completeness axiom (1.15) says that has a least upper bound in . That is, the real number exists.
We claim that ; that is, . We prove the claim using a Goldilocks approach: we show (not too hot) and (not too cold), so we must have (just right).
-
•
Suppose . We want to show that this leads to a contradiction: our strategy is to find an upper bound for that is smaller than (which is supposed to be the least upper bound). Our candidate is a number of the form , and we want to choose a value for so that , since that will mean that for all , , and so .
Since , we can choose with (this choice is based on some rough work: see Exercise 1.45). Then we have
(1.6) (1.6)where the second step (“”) is due to the fact that , and the final step is due to our choice of . From (1.6) and the definition of , it follows that for all . Hence is an upper bound for and . This contradicts the fact that is the least upper bound for , and so .
-
•
Now suppose . Here our strategy for deriving a contradiction is to find some which is larger than , which is supposed to be an upper bound for . Our candidate is for a suitable choice of .
Thus we have shown that .
Example 1.44 is very important: it demonstrates that the completeness axiom distinguishes the real number system from the rationals. We can also use the same argument to deduce the existence of many other numbers which are missing from the rationals.
Complete the rough work needed to show that follows from choosing .
By carrying out the following steps, show that for every with there exists some with such that . In particular, exists in for every .
-
(i)
Show that the set is nonempty and bounded above. Conclude that exists and . Hint: you may wish to think about the cases and separately.
-
(ii)
Adapt the argument of Example 1.44 to show that .
Holes destroy completeness
To further illustrate the relationship between holes and the completeness axiom, we observe that the completeness axiom fails whenever we poke a hole in our number line.
Let be the punctured real line. Intuitively, we shall think of as a version of the number line which has a hole. Because of the presence of this hole, the completeness axiom fails for in the following sense: there exists a nonempty set which is bounded above in for which there is no least upper bound in . Indeed, we can take .
Finally, we return to Example 1.14, where we investigated the set . In that example, we claimed that does not have a supremum in (and therefore the completeness axiom also fails for ), but we did not provide a full justification of this. Using the observations from Example 1.44, we may now complete the proof.
Let . Using the ideas from Example Example 1.44, show that is nonempty and bounded above in , but there exists no least upper bound for in .
The above observations support the idea that the completeness axiom rules out any holes in the real number line. This will be a recurring theme throughout the whole course.
Density of the rationals
Although there are many, many more real numbers than rationals (in particular, the rationals are countable whilst the reals are uncountable), it is nevertheless always possible to closely approximate any real number by rationals.
For all and all there exists some such that .
Lemma 1.49 is another statement involving multiple quantifiers, so let’s take some time to digest its meaning. Given a real number , our goal is to approximate by some rational number: we want to find some such that the difference is small, say . We should think of as a measurement of precision: it tells us how close is from the true value of . Lemma 1.49 tells us that we can always approximate any real number by a rational to any specified precision. We illustrate this in the following (informal) example.
This informal example involves decimal expansions of real numbers which you saw in IMU.
Suppose we wish to approximate by rationals. We could consider the rational arising from the decimal expansion of :
If we choose our precision parameter to be given by , then approximates with the required precision: . However, if we choose , then we need to use a longer decimal such as to approximate with the specified precision: our original choice no longer works since , but the longer decimal does work since .
Lemma 1.49 tells us that, no matter how tiny the precision parameter is,44 4 For instance, we could take which, if you think about it, is a really tiny number (if you try to write it down in the form , then there would be nowhere near enough space for the number in the observable universe, even if each was just the size of an atom). we can always find a rational which approximates with the required degree of precision. Intuitively, by travelling far enough down the decimal expansion, we can get as close as we like to .
Although Example 1.50 illustrates the idea of Lemma 1.49 using the language of decimal digits, we do not take this route in the proof.
Let and be given. Let satisfy , so that . Now consider , which you could think of as the markings on a ruler along the real line (instead of every centimetre, the markings are every ). There is a unique so that
So, choosing we have . Since and were arbitrary, this shows how to approximate any real number (), with any degree of precision (), by a rational number (). ∎
This exercise is designed to again highlight the importance of the order of quantifiers. Suppose satisfies the condition:
there exists some such that for all we have .
What can we say about ? Compare this with the statement of Lemma 1.49 and the informal discussion in Example 1.50.
The rationals are not the only subset of the reals which have this approximation property. To study this concept further, we introduce the following definition.
We say a set is dense in if for all and for all there exists some such that .
Thus, in the language of Definition 1.52, we can succinctly rewrite Lemma 1.49 as: the rationals are dense in . Another important example of a dense set is the irrational numbers.
The irrational numbers are dense.
We shall prove this in Worksheet 2. ∎
Show that the following sets are dense in :
-
(i)
;
-
(ii)
;
-
(iii)
.
Show that the following sets are not dense in :
-
(i)
;
-
(ii)
.