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 \mathbb{R} contains many of the numbers which are missing from \mathbb{Q}.

Example 1.44.

We first show that \mathbb{R} contains 2\sqrt{2}: that is, there exists some element ss\in\mathbb{R} such that s2=2s^{2}=2 (so we have filled in at least one hole in comparison with the rationals).

Consider the set A:={a:a2<2}A:=\{a\in\mathbb{R}:a^{2}<2\}; this is a variant of the set we encountered in Example 1.14. Since AA\subseteq\mathbb{R} is nonempty (for instance, 1A1\in A) and bounded above (for instance, 22 is an upper bound), the completeness axiom (1.15) says that AA has a least upper bound in \mathbb{R}. That is, the real number s:=supAs:=\sup A exists.

We claim that s=2s=\sqrt{2}; that is, s2=2s^{2}=2. We prove the claim using a Goldilocks approach: we show s22s^{2}\not>2 (not too hot) and s22s^{2}\not<2 (not too cold), so we must have s2=2s^{2}=2 (just right).

  • Suppose s2>2s^{2}>2. We want to show that this leads to a contradiction: our strategy is to find an upper bound for AA that is smaller than ss (which is supposed to be the least upper bound). Our candidate is a number of the form s1/ns-1/n, and we want to choose a value for nn so that (s1/n)2>2(s-1/n)^{2}>2, since that will mean that for all aAa\in A, (s1/n)2>2>a2(s-1/n)^{2}>2>a^{2}, and so s1/n>as-1/n>a.

    Since s22>0s^{2}-2>0, we can choose nn\in\mathbb{N} with 0<1/n<(s22)/2s0<1/n<(s^{2}-2)/2s (this choice is based on some rough work: see Exercise 1.45). Then we have

    (1.6) (1.6) (s1/n)2=s22s/n+1/n2s22s/n>2,(s-1/n)^{2}=s^{2}-2s/n+1/n^{2}\geq s^{2}-2s/n>2,

    where the second step (“\geq”) is due to the fact that 1/n201/n^{2}\geq 0, and the final step is due to our choice of nn. From (1.6) and the definition of AA, it follows that s1/n>as-1/n>a for all aAa\in A. Hence s1/ns-1/n is an upper bound for AA and s1/n<ss-1/n<s. This contradicts the fact that ss is the least upper bound for AA, and so s22s^{2}\not>2.

  • Now suppose s2<2s^{2}<2. Here our strategy for deriving a contradiction is to find some aAa\in A which is larger than ss, which is supposed to be an upper bound for AA. Our candidate is s+1/ns+1/n for a suitable choice of nn.

    Since 2s2>02-s^{2}>0, we can choose nn\in\mathbb{N} with 0<1/n<(2s2)/(2s+1)0<1/n<(2-s^{2})/(2s+1). Thus,

    (1.7) (1.7) (s+1/n)2=s2+2s/n+1/n2s2+(2s+1)/n<2,(s+1/n)^{2}=s^{2}+2s/n+1/n^{2}\leq s^{2}+(2s+1)/n<2,

    where the second step is similar to that in (1.6), this time using 1/n21/n1/n^{2}\leq 1/n for n1n\geq 1, and the final step is due to our choice of nn. From (1.7) and the definition of AA, it follows that s+1/nAs+1/n\in A and clearly s+1/n>ss+1/n>s. However, this contradicts the fact ss is an upper bound for AA, and so s22s^{2}\not<2.

Thus we have shown that s=supA=2s=\sup A=\sqrt{2}.

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.

Exercise 1.45.

Complete the rough work needed to show that (s1/n)2>2(s-1/n)^{2}>2 follows from choosing 1/n<(s22)/2s1/n<(s^{2}-2)/2s.

Exercise 1.46.

By carrying out the following steps, show that for every xx\in\mathbb{R} with x>0x>0 there exists some ss\in\mathbb{R} with s0s\geq 0 such that s2=xs^{2}=x. In particular, x\sqrt{x} exists in \mathbb{R} for every x>0x>0.

  1. (i)

    Show that the set A:={a:a2<x}A:=\{a\in\mathbb{R}:a^{2}<x\} is nonempty and bounded above. Conclude that s:=supAs:=\sup A exists and s>0s>0. Hint: you may wish to think about the cases x1x\leq 1 and x>1x>1 separately.

  2. (ii)

    Adapt the argument of Example 1.44 to show that s2=xs^{2}=x.

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.

Example 1.47.

Let ×:={0}\mathbb{R}^{\times}:=\mathbb{R}\setminus\{0\} be the punctured real line. Intuitively, we shall think of ×\mathbb{R}^{\times} as a version of the number line which has a hole. Because of the presence of this hole, the completeness axiom fails for ×\mathbb{R}^{\times} in the following sense: there exists a nonempty set A×A\subseteq\mathbb{R}^{\times} which is bounded above in ×\mathbb{R}^{\times} for which there is no least upper bound in ×\mathbb{R}^{\times}. Indeed, we can take (,0)×(-\infty,0)\subset\mathbb{R}^{\times}.

Finally, we return to Example 1.14, where we investigated the set S:={a:a2<2}S:=\{a\in\mathbb{Q}:a^{2}<2\}. In that example, we claimed that SS does not have a supremum in \mathbb{Q} (and therefore the completeness axiom also fails for \mathbb{Q}), but we did not provide a full justification of this. Using the observations from Example 1.44, we may now complete the proof.

Exercise 1.48.

Let S:={a:a2<2}S:=\{a\in\mathbb{Q}:a^{2}<2\}. Using the ideas from Example Example 1.44, show that SS\subset\mathbb{Q} is nonempty and bounded above in \mathbb{Q}, but there exists no least upper bound for SS in \mathbb{Q}.

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 xx by rationals.

Lemma 1.49.

For all xx\in\mathbb{R} and all ε>0\varepsilon>0 there exists some yy\in\mathbb{Q} such that |xy|<ε|x-y|<\varepsilon.

Lemma 1.49 is another statement involving multiple quantifiers, so let’s take some time to digest its meaning. Given a real number xx\in\mathbb{R}, our goal is to approximate xx by some rational number: we want to find some yy\in\mathbb{Q} such that the difference |xy||x-y| is small, say |xy|<ε|x-y|<\varepsilon. We should think of ε>0\varepsilon>0 as a measurement of precision: it tells us how close yy is from the true value of xx. 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.

Example 1.50.

This informal example involves decimal expansions of real numbers which you saw in IMU.

Suppose we wish to approximate x=2x=\sqrt{2} by rationals. We could consider the rational arising from the decimal expansion of 2\sqrt{2}:

1,1.4=1410,1.41=141100,1.414=14141000,1.4142=1414210000,.1,\quad 1.4=\frac{14}{10},\quad 1.41=\frac{141}{100},\quad 1.414=\frac{1414}{1% 000},\quad 1.4142=\frac{14142}{10000},\dots.

If we choose our precision parameter ε\varepsilon to be given by ε:=0.01\varepsilon:=0.01, then 1.411.41 approximates 2\sqrt{2} with the required precision: |1.412|=0.0042<0.01|1.41-\sqrt{2}|=0.0042\dots<0.01. However, if we choose ε:=0.0001\varepsilon:=0.0001, then we need to use a longer decimal such as 1.41421.4142 to approximate 2\sqrt{2} with the specified precision: our original choice 1.411.41 no longer works since |1.412|=0.0042>0.0001|1.41-\sqrt{2}|=0.0042\dots>0.0001, but the longer decimal 1.41421.4142 does work since |1.41422|=0.000013<0.0001|1.4142-\sqrt{2}|=0.000013\dots<0.0001.

Lemma 1.49 tells us that, no matter how tiny the precision parameter ε\varepsilon is,44 4 For instance, we could take ε:=1010100\varepsilon:=10^{-10^{100}} which, if you think about it, is a really tiny number (if you try to write it down in the form 0.0000010.0000\dots 01, then there would be nowhere near enough space for the number in the observable universe, even if each 0 was just the size of an atom). we can always find a rational which approximates 2\sqrt{2} with the required degree of precision. Intuitively, by travelling far enough down the decimal expansion, we can get as close as we like to 2\sqrt{2}.

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.

Proof (of Lemma 1.49).

Let xx\in\mathbb{R} and ε>0\varepsilon>0 be given. Let nn\in\mathbb{N} satisfy n>1εn>\frac{1}{\varepsilon}, so that 1/n<ε1/n<\varepsilon. Now consider {in:i}\big{\{}\frac{i}{n}\,:\,i\in\mathbb{Z}\big{\}}, which you could think of as the markings on a ruler along the real line (instead of every centimetre, the markings are every 1/n1/n). There is a unique kk\in\mathbb{Z} so that

k/nx<(k+1)/n.k/n\leq x<(k+1)/n.

So, choosing y:=k/ny:=k/n\in\mathbb{Q} we have |xy|<1/n<ε|x-y|<1/n<\varepsilon. Since xx\in\mathbb{R} and ε>0\varepsilon>0 were arbitrary, this shows how to approximate any real number (xx), with any degree of precision (ε\varepsilon), by a rational number (yy). ∎

Exercise 1.51.

This exercise is designed to again highlight the importance of the order of quantifiers. Suppose xx\in\mathbb{R} satisfies the condition:

there exists some yy\in\mathbb{Q} such that for all ε>0\varepsilon>0 we have |xy|<ε|x-y|<\varepsilon.

What can we say about xx? 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.

Definition 1.52.

We say a set AA\subseteq\mathbb{R} is dense in \mathbb{R} if for all xx\in\mathbb{R} and for all ε>0\varepsilon>0 there exists some yAy\in A such that |xy|<ε|x-y|<\varepsilon.

Thus, in the language of Definition 1.52, we can succinctly rewrite Lemma 1.49 as: the rationals \mathbb{Q} are dense in \mathbb{R}. Another important example of a dense set is the irrational numbers.

Lemma 1.53.

The irrational numbers \mathbb{R}\setminus\mathbb{Q} are dense.

Proof.

We shall prove this in Worksheet 2. ∎

Exercise 1.54.

Show that the following sets are dense in \mathbb{R}:

  1. (i)

    \mathbb{R};

  2. (ii)

    ×:={0}\mathbb{R}^{\times}:=\mathbb{R}\setminus\{0\};

  3. (iii)

    \mathbb{R}\setminus\mathbb{Z}.

Exercise 1.55.

Show that the following sets are not dense in \mathbb{R}:

  1. (i)

    [0,1][0,1];

  2. (ii)

    \mathbb{Z}.