10 The real numbers
It remains to show that M is the least upper bound, which we do by contradiction.
Suppose y is an upper bound for A [ B and y < M . Relabelling A and B if necessary (the
statement we are trying to prove is symmetric in A and B), we can assume that sup A
sup B. So M = sup A. Therefore, y is not an upper bound for A, and so there exists a 2 A
with y < a. But since a 2 A [ B, this also implies that y is not an upper bound for A [ B.
This contradiction completes the proof.
1.3.9. Suppose A is a nonempty set of real numbers and r > 0. Let B = {ra : a 2 A}.
Show that sup A exists if and only sup B exists. Furthermore, if they exist, show that
sup B = r sup A.
Suppose sup A exists. Then
a 2 A =) a sup A =) ra r sup A.
So B is bounded above by r sup A. Thus sup B exists. Now suppose sup B exists, since
⇢
b
A= :b2B ,
r
the above argument also shows that sup A exists (just replace r by 1/r).
Now suppose that sup A and sup B exist. Let M = sup A. By the above, rM is an upper
bound for B. To show that sup B = r sup A = rM , it remains to show that it is the least
upper bound. Suppose y < rM . We will show that y is not an upper bound for B. We have
y
r
< M . Since M is the least upper bound for A, this implies that yr is not an upper bound
for A. Thus, there exists a 2 A such that a > yr . But then ra 2 B and ra > y. So y is not
an upper bound for B, as desired.
Bounds and the completeness axiom 11
1.3.10 ([TBB, Ex. 1.6.17]). Suppose A ✓ R. Show that x is the supremum of A if and only
if a x for all a 2 A and for every " > 0 there is an element a0 2 A such that x " < a0 .
Similarly, show that y is the infimum of A if and only if y a for all a 2 A and for every
" > 0 there is an element a0 2 A such that a0 < y + ".
12 The real numbers
1.3.11. Suppose A and B are nonempty sets of real numbers, and that sup A and sup B
exist. Define
C = {a + b : a 2 A, b 2 B}.
Show that sup C exists and that sup C = sup A + sup B.
13
1.4
1.4.1.
1.4.2. Suppose A ✓ R and that inf A and sup A both exist. Prove the following:
(a) sup{a b : a, b 2 A} = sup A inf A.
(b) inf{a b : a, b 2 A} = inf A sup A.
(See Exercise 1.6.7 for a continuation of this exercise.)
14 The real numbers
1.4.3 ([TBB, Ex. 1.7.4]). Let x 2 R. Show that there is a unique m 2 Z such that
m x < m + 1.
This m is often denoted bxc and is called the integer part of x. The function x 7! bxc is
called the floor function.
15
1.4.4. Suppose a, b 2 R and b a 1. Prove that there exists an integer n such that
a < n b.
16 The real numbers
1.4.5. Find the infimum and supremum of the set
⇢
1
{3, 5} [ : x 2 R, x 1
2x
or show that they do not exist. Remember to justify your answer.
17
1.4.6. Find the infimum and supremum of the set
⇢
1
3+ :n2N
n
or show that they do not exist.
18 The real numbers
1.4.7. Prove that n
X 1 1
=1 for all n 2 N.
i=1
i(i + 1) n+1
1.4.8. Show that every finite nonempty set has a maximum. Hint: Use induction on the size
of the set.
19
1.5
1.6
1.6.1.
1.6.2 ([TBB, Ex. 1.10.5]). Show that |x| |y| |x y| for all x, y 2 R.
20 The real numbers
1.6.3 ([TBB, Ex. 1.10.3]). Suppose x, a, " 2 R and " > 0. Show that the inequalities
|x a| < " and a "<x<a+"
are equivalent.
21
1.6.4. Suppose x 2 R and |x 2| < 2. Prove that |x + 1| > 1.
22 The real numbers
1.6.5. Suppose x 2 R and |x| 1. Prove that |x2 4| 3|x 2|.
23
1.6.6 ([TBB, Ex. 1.10.8]). Show that
|x1 + x2 + · · · + xn | |x1 | + |x2 | + · · · + |xn |
for all x1 , x2 , . . . , xn 2 R.
24 The real numbers
1.6.7. This exercise is a continuation of Exercise 1.4.2. Suppose A ✓ R and that inf A and
sup A both exist. Prove that
sup{|a b| : a, b 2 A} = sup A inf A.