The Real Numbers R

MA313 Online 2.1 Algebraic Properties of R

2 The Real Numbers R

2.1 Algebraic Properties of R

Axiomatic Foundation of R
The set R comes equipped with two binary operations denoted by + (addition) and ·
(multiplication). Let a, b,and c be real numbers. Note that R is closed under the two
binary operations, i.e. a + b ∈ R and ab ∈ R. Further, the above operations satisfy the
following properties.

A1. Associativity of Addition. a + (b + c) = (a + b) + c.

A2. Commutativity of Addition. a + b = b + a.

A3. Existence of an Additive Identity 0. a + 0 = a.

A4. Existence of an Additive Inverse. There exists −a ∈ R such that a + (−a) = 0; −a

is called the additive inverse of a.

M1. Associativity of Multiplication. a · (b · c) = (a · b) · c.

M2. Commutativity of multiplication. a · b = b · a.

M3. Existence of a Multiplicative Identity 1. a · 1 = a.

M4. Existence of an multiplicative Inverse. If a 6= 0, then there exists a−1 ∈ R such that
a · a−1 = 1; a−1 is called the multiplicative inverse of a.

DL. (Left) Distributive Property. a · (b + c) = a · b + a · c.

When the context is clear, we write ab to consistently mean a · b.

Theorem 2.1 Let a, b, u, and z be real numbers with b 6= 0.

(a) If z, a ∈ R with z + a = a, then z = 0.

(b) Let u, b ∈ R with b 6= 0. If u · b = b, then u = 1.

(c) If a ∈ R, then a · 0 = 0.

Proof. We prove (a). Using A3, A4, A2, and the hypothesis z + a = a, and A4, we have

z = z + 0 = z + (a + (−a)) = (z + a) + (−a) = a + (−a) = 0.

We leave (b) and (c) as exercises. 

16 RSH20150131012100
 The Real Numbers R
MA313 Online 2.1 Algebraic Properties of R

Theorem 2.2 Let a and b be real numbers.

(a) If a 6= 0 such that a · b = 1, then b = 1/a.

(b) If a · b = 0, then either a = 0 or b = 0.

Proof. We prove (a). Using M3, M4, M2, the hypothesis ab = 1, and M3, we get

b = 1 · b = ((1/a) · a) · b = (1/a) · (a · b) = (1/a) · 1 = 1/a.

We leave (b) as an exercise. 

The set P of positive real numbers is a subset of R with the following properties.

(i) If a, b ∈ P, then a + b ∈ P.

(ii) If a, b ∈ P, then ab ∈ P.

(iii) If a ∈ R, then (a ∈ P or a = 0 or −a ∈ P).

Properties (i) and (ii) are closure properties, i.e. the sum and product of positive real numbers
are positive. The last property simply says that for any real number, it is either positive, zero,
or ‘non–positive and is normally referred to as the Trichotomy Property.

The following are more properties of R which you should be familiar with.

Theorem 2.3 Let a, b, c ∈ R. Then:

(i) If a + c = b + c, then a = b. (iv) (−a)(−b) = ab

(ii) a0 = 0 (v) If ac = bc with c 6= 0, then a = b.

(iii) (−a)b = −ab (vi) If ab = 0, then a = 0 or b = 0.

Proof. We prove the first two and leave the rest as exercises.

(i)

a+c = b+c
a + c + (−c) = b + c + (−c)
a + (c + (−c)) = b + (c + (−c)) by A1
a+0 = b + 0 by A4
a = b

17 RSH20150131012100
 The Real Numbers R
MA313 Online 2.2 Ordering in R

(ii) First note that

a0 = a(0 + 0) = a0 + a0 by A3 and DL
Again by A3, a0 = a0 + 0 and hence

a0 + 0 = a0 + a0

Therefore, by (i), a0 = 0. 

EXERCISE 2.1 Do the following.

1. If x, y ∈ R, prove the following.

(a) If x + y = 0, then x = −y. (c) (−1)x = −x.

(b) −(−x) = x. (d) (−1)(−1) = 1.

2. Solve the following equations, justifying each step by referring to an appropriate property
or theorem.

(a) 3x − 6 = 9. (c) x2 − 3 = 1.
(b) x2 = 4x. (d) (x − 3)(x + 2) = 0.

3. Prove: If x ∈ R is such that xx = x, then either x = 0 or x = 1.

1 1

1
4. Prove: If x 6= 0 and y 6= 0, then xy = x y .

2.2 Ordering in R

Now that we have a ‘vague’ idea what the set of real numbers is, let us give it some sense of
ordering.

We write a ≤ b and read ‘a is less than or equal to b’ (or ‘b is greater than or equal
to a’) to mean that ‘b − a ∈ P ∪ {0}’.

If a ∈ P ∪ {0}, then we write a ≥ 0 and say that a is nonnegative. If a ∈ P, we write

a > 0 and say that a is strictly positive.

If −a ∈ P ∪ {0}, we write a ≤ 0 and say that a is nonpositive. If −a ∈ P, we write a < 0

and say that a is strictly negative.

18 RSH20150131012100
 The Real Numbers R
MA313 Online 2.2 Ordering in R

Ordering Axioms in R
Let a, b, c ∈ R. The set Q, and hence R, has an order structure ≤ satisfying the following.

O1. Either a ≤ b or b ≤ a.

O2. If a ≤ b and b ≤ a, then a = b.

O3. If a ≤ b and b ≤ c, then a ≤ c.

O4. If a ≤ b, then a + c ≤ b + c.

O5. If a ≤ b and 0 ≤ c, then ac ≤ bc.

The following properties should be familiar.

Theorem 2.4 Let a, b, c ∈ R.

(i) If a ≤ b, then −b ≤ −a. (v) 0 < 1.

(ii) If a ≤ b and c ≤ 0, then bc ≤ ac.
(vi) If 0 < a, then 0 < a−1 .
(iii) If 0 ≤ a and 0 ≤ b, then 0 ≤ ab.
(iv) 0 ≤ a2 . (vii) If 0 < a < b, then 0 < b−1 < a−1 .

Proof. We prove the first three and leave the rest as exercises.

(i) Here we make use of O4 and apply associativity of addition.

a ≤ b
a + [(−a) + (−b)] ≤ b + [(−a) + (−b)]
[a + (−a)] + (−b) ≤ [b + (−b)] + (−a)
0 + (−b) ≤ 0 + (−a)
−b ≤ −a

(ii) In the following, since c ≤ 0, we have −c ≥ 0. Making use of O5 we proceed as follows.

a ≤ b
(−c)a ≤ (−c)b
−(ac) ≤ −(bc)
bc ≤ ac by (i)

(iii) Let a = 0 in O5, then the required conclusion follows. 

EXERCISE 2.2 Do the following.

19 RSH20150131012100
 The Real Numbers R
MA313 Online 2.3 Absolute Value

1. Prove the following statements.

(a) If a ∈ R and a 6= 0, then a2 > 0.

(b) 1 > 0
(c) If n ∈ N, then n > 0.

2. Prove: If a ∈ R is such that 0 ≤ a < ǫ for every ǫ > 0, then a = 0.

3. Let ab > 0. Show that either

(i) a > 0 and b > 0, or

(ii) a < 0 and b < 0.
1 1
4. (a) Show that if x > 0, then x
> 0 and 1/x
= x.
(b) Show that x < y, then x < 21 (x + y) < y.

5. If x > 0, y > 0, and n ∈ N, show that x < y if and only if xn < yn .

Hint: Use Mathematical Induction.

2.3 Absolute Value

Next, we wish to speak of the distance between two real numbers.

The absolute value of a real number x is the function


−x if x < 0.
|x| =
x if x ≥ 0

The distance between real numbers a and b is the absolute value |a − b| or |b − a|.

R
a b
|b − a| = |a − b|

Thus |x| = |0 − x| = |x − 0| is how far x and −x are from 0.

The next result gives basic properties of the absolute value function.

Theorem 2.5 Let a, b ∈ R.

(i) |a| ≥ 0

20 RSH20150131012100
 The Real Numbers R
MA313 Online 2.3 Absolute Value

(ii) |ab| = |a||b|

(iii) |a + b| ≤ |a| + |b| (Triangle Inequality)

Proof. The proof of (i) is direct from the definition whereas the last two are routine computa-
tions.

(i) If a ≤ 0, then |a| = −a ≥ 0. If a > 0, then |a| = a > 0.

(ii) There are four cases to consider.

Case 1: If a ≥ 0 and b ≥ 0, then |a| = a, |b| = b, and |ab| = ab. Hence

|ab| = ab = |a||b|.

Case 2: If a ≥ 0 and b ≤ 0, then |a| = a, |b| = −b, and |ab| = −ab. Hence

|ab| = −ab = a(−b) = |a||b|.

Case 3: If a ≤ 0 and b ≥ 0, then |a| = −a, |b| = b, and |ab| = −ab. Hence

|ab| = −ab = (−a)b = |a||b|.

Case 4: If a ≤ 0 and b ≤ 0, then |a| = −a, |b| = −b, and |ab| = ab. Hence

|ab| = ab = (−a)(−b) = |a||b|.

This completes the proof.

(iii) First note that

−|a| ≤ a ≤ |a| and − |b| ≤ b ≤ |b|.
So

−|a| − |b| ≤ a + b ≤ |a| + |b|

−(|a| + |b|) ≤ a + b ≤ |a| + |b|

This means that

a + b ≤ |a| + |b| and − (a + b) ≤ |a| + |b|.
Since 
−(a + b) if a + b < 0
|a + b| = ,
a+b if a + b ≥ 0
we conclude |a + b| ≤ |a| + |b|. 

Corollary 2.6 Let a, b ∈ R.

(i) ||a| − |b|| ≤ |a − b|

21 RSH20150131012100
 The Real Numbers R
MA313 Online 2.3 Absolute Value

(ii) |a − b| ≤ |a| + |b|

Proof. We proceed as follows.

(i) Write a = a − b + b and by the Triangle Inequality

|a| ≤ |a − b| + |b| ⇒ |a| − |b| ≤ |a − b|
Similarly,
|b| ≤ |b − a| + |a| ⇒ −|a − b| = −|b − a| ≤ |a| − |b|.
Combining the two together gives the result.
(ii) Replace b in the Triangle Inequality by −b to get
|a − b| ≤ |a| + | − b|
and the result follows since | − b| = |b|. 

Corollary 2.7 If a1 , a2, . . . , an are real numbers, then

|a1 + a2 + · · · + an | ≤ |a1 | + |a2 | + · · · + |an | .

Proof. Exercise. 

Let a ∈ R and ǫ > 0. Then the ǫ–neighbourhood of a is the set

Vǫ (a) = {x ∈ R : |x − a| < ǫ} = {x ∈ R : −ǫ < x − a < ǫ} = {x ∈ R : a − ǫ < x < a + ǫ}.

Theorem 2.8 Let a ∈ R. If x belongs to the neighbourhood Vǫ (a) for all ǫ > 0, then x = a.

Proof. Exercise. 

EXERCISE 2.3 Do the following.

1. Let x, y ∈ R with y 6= 0. Prove the following.

√  
 x  |x|
(a) |x| = x2 . (b)   = .
y |y|

2. Find all x ∈ R that satisfy the following inequalities.

 
(a) |4x − 5| ≤ 10. (b) x2 − 1 ≤ 5.

3. Find all x ∈ R that satisfy the equation |x + 1| + |x − 2| = 7.

4. Determine and sketch the set of pairs (x, y) in R × R that satisfy the following.

22 RSH20150131012100
 The Real Numbers R
MA313 Online 2.3 Completeness in R

(a) |x| = |y|. (c) |xy| ≤ 2.

(b) |x| + |y| = 1. (d) |x| − |y| ≥ 2.

5. (a) Prove that |x + y + z| ≤ |x| + |y| + |z| for all x, y, z ∈ R.

Hint: Apply the Triangle Inequality twice. Do not consider eight cases.
(b) Use induction to prove

|x1 + x2 + · · · + xn | ≤ |x1 | + |x2 | + · · · + |xn |

for all x1 , x2 , . . . , xn ∈ R.

6. Let ǫ > 0, δ > 0, and x ∈ R. Show that Vǫ (x) ∩ Vδ (x) and Vǫ (x) ∪ Vδ (x) are γ–
neighbourhoods of x for some appropriate values of γ.

2.4 Completeness of R

In this section we introduce and discuss the well known ‘Completeness Axiom’ which is one of
the most important principles in real analysis but first we need some definitions and preliminary
notes.

The set S in R is said to be:

• bounded from above if there exists a real number M such that

s≤M for all s ∈ S;

the number M is called an upper bound of S.

• bounded from below if there exists a real number m such that

m≤s for all s ∈ S;

the number m is called a lower bound of S.

• bounded if it is bounded both from above and from below.

• unbounded if it is not bounded.

If S is nonempty and finite, then S is bounded; among the members of S there must be
a largest, denoted by max{S}, the maximum of S, and smallest, denoted by min{S}, the
minimum of S. Both the maximum and minimum of S are in S. Infinite sets may or may
not have a maximum and/or minimum.

23 RSH20150131012100
 The Real Numbers R
MA313 Online 2.3 Completeness in R

Let S ⊂ R be bounded from above. A real number a is the least upper bound , or
supremum, for S if a is an upper bound for S having the property that if b is an upper
bound for S, then a ≤ b; we write

lub S = a or sup S = a.

Let S ⊂ R be bounded from below. A real number a is the greatest lower bound , or
infimum, for S if a is lower bound for S having the property that if b is a lower bound
for S, then a ≥ b; we write

glb S = a or inf S = a.

Example 2.1 Let A = [0, 2], B = (0, 2), C = [0, +∞), and D = (−∞, 0]. Then:

• min A = min C = 0;

• max A = 2, max D = 0;

• lub A = lub B = 2;

• lub D = 0, glbA = glbB = glb C = 0;

• C does not have a maximum and a least upper bound;

• and D does not have a minimum and a greatest lower bound. ,

Example 2.2 It is not hard to see that b = lub(a, b) = lub[a, b] and a = inf(a, b) = inf[a, b]
for any open interval (a, b) and closed interval [a, b]. ,

Example 2.3 For the set of natural numbers N, inf N = 1 and sup N = +∞. ,

Example 2.4 Consider the set

 
n+2 3 4 5 6
S= :n∈N = , , , ,... .
3n − 1 2 5 8 11
Clearly,
n+2 1
→ as n → ∞.
3n − 1 3
1
Therefore inf S = 3
and sup S = 23 . ,

Note if M is an upper bound for S then any number greater than M is also an upper bound.
Similarly if m is a lower bound for S then any number less than m is also a lower bound.

Lemma 2.9 A number u is the supremum of a nonempty subset S of R if and only if u satisfies
the conditions:

24 RSH20150131012100
 The Real Numbers R
MA313 Online 2.3 Completeness in R

(i) s ≤ u for all s ∈ S,

(ii) If v < u, then there exists s ′ ∈ S such that v < s ′ .

Proof. Exercise. 

Lemma 2.10 The following conditions are equivalent.

(i) An upper bound u of a nonempty set S ⊂ R is the supremum of S.

(ii) If for every ε > 0 there exists sε ∈ S such that u − ε < sε .

Proof. (i)⇒(ii)

u = sup S, ε > 0 ⇒ u − ε not upper bound of S since u − ε < u

⇒ ∃sε such that u − ε < sε

(i)⇐(ii) Suppose u is an upper bound of S satisfying (ii).

v<u ⇒ ε=u−v >0

⇒ ∃sε ∈ S such that v = u − ε < sε
⇒ v not upper bound of S
⇒ u = sup S

This completes the proof. 

Theorem 2.11 Let S be a subset of R.

(i) If S has a smallest element, then this smallest element is the infimum of S.

(ii) If S has a greatest element, then this greatest element is the supremum of S.

Proof. (i) Let m be the smallest element of S. Then m is a lower bound of S since m ≤ s for
all s ∈ S. Suppose that m ′ is a lower bound of S. Then m ′ ≤ s for all s ∈ S. Thus m ′ ≤ m and
hence m = inf S.

We leave the proof of (ii) as exercise. 

We now state one of the most fundamental properties of R which is normally adopted as an
axiom. It is is also known as the Least Upper Bound Principle.

The Completeness [Supremum] Property of R: Every nonempty set of real numbers that
has an upper bound also has a supremum.

Theorem 2.12 The least upper bound, if it exists, of S ⊂ R is unique.

25 RSH20150131012100
 The Real Numbers R
MA313 Online 2.3 Completeness in R

Proof. For if b and b ′ are two distinct suprema of S, then, assuming without loss of generality
that b ′ < b, we see, from the fact that b is a supremum of S, that there exists s ∈ S with s > b ′ ,
contradicting the fact that b ′ is a supremum of S. Thus we may properly refer to “the” supremum
of a set S if that supremum exists. 

Theorem 2.13 If S ⊂ R is a nonempty and is bounded below, then it has a unique greatest lower
bound.

Proof. Write T = {−x : x ∈ S}. Let m be a lower bound for S. For each x ∈ S we have x ≥ m
and therefore −x ≤ −m; so −m is an upper bound for T . By the least–upper–bound principle,
T has a least upper bound, say b. We claim that

(i) −b is a lower bound for S, and

(ii) if y > −b, then y is not a lower bound of S.

To prove (i), observe that for each x ∈ S we have −x ≤ b and therefore x ≥ −b. To prove (ii),
given y > −b, we have −y < b, so, by the definition of supremum, there exists z ∈ T such that
z > −y. Then −z ∈ S and −z < y; whence y is not a lower bound for S.

Taken together, (i) and (ii) show that −b is an infimum of S. The uniqueness of the infimum of
S follows from that of the supremum of T . 

EXERCISE 2.4 Do the following.

1. For each set below that is bounded from above, list three upper bounds for the set. Other-
wise write “NOT BOUNDED ABOVE” or “NBA”.

(a) [0, 1] (e) n1 : n ∈ N (i) ∪∞n=1 [2n, 2n + 1]
1
(b) (0, 1) (f) {0} (j) n : n ∈ N, n is prime

(k) cos nπ


(c) {2, 7} (g) [0, 1] ∪ [2, 3] 3
:n∈N
 1 1

(l) sin nπ


(d) {π, e} (h) ∩∞ n=1 − n , 1 + n 3
:n∈N

2. Repeat Exercise 1 for lower bound.

3. For each se in Exercise 1, give its supremum if it has one. Otherwise write “NO sup”.

4. Repeat Exercise 3 for infima.

5. Let S1 = {x ∈ R : x ≥ 0}. Show in details that the set S1 has lower bounds, but no upper
bounds. Show that inf S1 = 0.

6. Let S2 = {x ∈ R : x > 0}. Does S2 have lower bounds? Doe S2 have upper bounds? Does
inf S2 exist? Does sup S2 exist? Prove your statements.

26 RSH20150131012100
 The Real Numbers R
MA313 Online 2.5 Applications of the Supremum Property

7. Let S4 = {1 − (−1)n /n : n ∈ N}. Find inf S4 and sup S4 .

8. Let S be a nonempty subset of R that is bounded below. Prove that inf S = − sup{s : s ∈ S}.

9. Show that if A and B are bounded subsets of R, then A ∪ B is a bounded set. Show that
sup(A ∪ B) = sup{sup A, sup B}.

2.5 Applications of the Supremum Property

In the following proofs, study them carefully and try to find out where does the Supremum
Property is being applied.

Theorem 2.14 Let S ⊂ R be nonempty and write a + S = {a + s : s ∈ S}. Then

sup(a + S) = a + sup S.

In the proof to come, we make use of the property x = y if and only if x ≤ y and y ≤ x. This is
just a fancy way of taking about ‘equality’ of two real numbers.

Proof. We need to show that:

(i) sup(a + S) ≤ a + sup S.

u = sup S ⇒ s ≤ u for all s ∈ S

⇒ a + s ≤ a + u for all s ∈ S
⇒ a + u is an upper bound for a + S
⇒ sup(a + S) ≤ a + u = a + sup S.

(ii) show that sup(a + S) ≥ a + sup S.

v any upper bound of a + S ⇒ a + s ≤ v for all s ∈ S

⇒ s ≤ v − a for all s ∈ S
⇒ v − a upper bound of S
⇒ u = sup S ≤ v − a
⇒ a+u≤v
⇒ a + u ≤ sup(a + S).

This completes the proof.

Note that in the preceding proof, we make use of the ordering property of real numbers that if
x ≤ y and y ≥ x, then x = y.

27 RSH20150131012100
 The Real Numbers R
MA313 Online 2.5 Applications of the Supremum Property

Theorem 2.15 Let A and B be nonempty subsets of R with the property that

a≤b for all a ∈ A and all b ∈ B.

Then sup A ≤ inf B.

Proof.

For any given b ∈ B ⇒ a ≤ b for all a ∈ A

⇒ b upper bound of A
⇒ sup A ≤ b for all b ∈ B
⇒ sup A lower bound of B
⇒ sup A ≤ inf B

This completes the proof. 

Let f : D → R be a function. We say that f is:

• bounded from above if f(D) is bonded from above in R.

• bounded from below if f(D) is bounded from below in R.

• bounded if f(D) is bounded from above and from below in R.

Example 2.5 Let f, g be real–valued bounded functions with common domain D ⊆ R.

(a) If f(x) ≤ g(x) for all x ∈ D, then sup f(x) ≤ sup g(x).
Note that for all x ∈ D,

f(x) ≤ g(x) ≤ sup g(D) ⇒ sup g(D) upper bound for f(D)
⇒ sup f(D) ≤ sup g(D).

What about sup f(D) and inf g(D)?

(b) Take f(x) = x2 and g(x) = x in D = {x : 0 ≤ x ≤ 1}; f(x) ≤ g(x) for all x ∈ D. Then

f(D) = {x : 0 ≤ x ≤ 1} and g(D) = {x : 0 ≤ x ≤ 1}.

Here sup f(D) ≤ sup g(D), so (a) is OK but sup f(D) ≥ inf g(D).
Note that the assumption in (a) says that “f(x) ≤ g(x) for all x ∈ D”, and it does not say
anything about the relationship between sup f(D) and inf g(D).

(c) If f(x) ≤ g(y) for all x, y ∈ D, then sup f(D) ≤ inf g(D). ,

Theorem 2.16 (Archimedean Property) If x ∈ R, then there exists n ∈ N such that x < n.

28 RSH20150131012100
 The Real Numbers R
MA313 Online 2.5 Applications of the Supremum Property

Proof. (Contradiction) We give a sketch of the actual proof. Suppose that n ≤ x for all n ∈ N.
Then x is an upper bound of N. By the Completeness Property, N has a supremum u ∈ R.
Hence u − 1 (being less than u) cannot be an upper bound. So there exists m ∈ N such that
u − 1 < m < u. Thus, u < m + 1 ∈ N, a contradiction. 

A variation of the Archimedean Property also states that: If a and b be positive real numbers,
then there exists n ∈ N such that na > b.

We now state consequences of the Archimedean Properties.

1
Corollary 2.17 (a) For any real number t > 0, there exists n ∈ N so that 0 < < t.
n

1
(b) If S = : n ∈ N , then inf S = 0.
n
(c) If y > 0, then there exists n ∈ N such that −n ≤ y ≤ n.

Proof. Exercise. 

The proof of the next result is an illustration of how the Completeness Axiom could be used to
establish that there is real number whose square is 2.

Theorem 2.18 There is a real number x such that x2 = 2.

Proof. The actual proof is quite involved but we give a sketch of the main idea and how the
Completeness Axiom comes into the picture.

Consider the set S = s ∈ R : s ≥ 0, s2 < 2 . Clearly the set is nonempty since 1 ∈ S. Further,
S is bounded from above by 2 because if t > 2, then t2 > 4 so that t ∈ / S. Therefore, by the
Completeness Axiom, the supremum x = sup S exists; clearly x > 1. The rest of the proof is
basically to show that x2 = 2 by ruling out the other two possibilities x2 < 2 and x2 > 2. 

We now prove that the set of rational numbers is dense in the set of real numbers. In other words,
between any two real numbers, there is always a rational number.

Theorem 2.19 (Density) Let x, y ∈ R be such that x < y. Then there exists q ∈ Q such that
x < q < y.

Proof. There are three cases to consider.

(i) 0 < x < y

(ii) x < y < 0

(iii) x < 0 < y

29 RSH20150131012100
 The Real Numbers R
MA313 Online 2.5 Applications of the Supremum Property

(i) Assume 0 < x < y. Then, by Corollary (a) to the Archimedean Property, there exists n ∈ N
such that
1
0 < < y − x ⇒ 0 < nx < ny − 1. (1)
n
Furthermore, there exists m ∈ N such that
m
m − 1 ≤ nx < m ⇒ x< . (2)
n
Finally, by (1) and (2),
m
m − 1 < ny − 1 ⇒ < y. (3)
n
m
Therefore, by (2) and (3), x < < y.
n
(ii) Note that 0 < −y < −x. Then apply (i) to conclude there exists a rational number q such
that 0 < −y < q < −x which in turn x < −q < y < 0.

(iii) Considering 0 being a rational number would do, i.e. x < 0 < y. 

EXERCISE 2.5 Do the following.


1. Show that sup 1 − n1 : n ∈ N = 1.

2. If S = n1 − m1 : m, n ∈ N , find inf S and sup S.

3. Let S be a nonempty bounded set in R.

(a) Let a > 0, and let aS = {as : s ∈ S}. Prove that inf(aS) = a inf S and sup(aS) =
a sup S.
(b) Let b < 0 and let bS = {bs : s ∈ S}. Prove that inf(bS) = b sup S and sup(bS) =
b inf S.

4. Let A and B be bounded nonempty subsets of R, and let A + B = {a + b : a ∈ A, b ∈ B}.

Prove that sup(A + B) = sup A + sup B and inf(A + B) = inf A + inf B.

5. Let X = Y = {x ∈ R : 0 < x < 1}. Define h : X × Y → R by h(x, y) = 2x + y.

(a) For each x ∈ X, find f(x) = sup{h(x, y) : y ∈ Y}; then find inf{f(x) : x ∈ X}.
(b) For each y ∈ Y, find g(y) = inf{h(x, y) : x ∈ X}; then find sup{g(y) : y ∈ Y}. Compare
with result found in part (a).

6. Prove Corollary 2.17.

7. Prove: If x, y ∈ Q with x < y, then there exists an irrational number z such that x < z < y.
Hint: Apply the Density Theorem.

30 RSH20150131012100
 The Real Numbers R
MA313 Online 2.5 Applications of the Supremum Property

8. A subset C of R is complete if every nonempty bounded subset of C has both a supremum

and an infimum in C.
Show that the rational numbers are not complete.

√ 
Hint: Use a contradiction argument based on the set A = x ∈ Q : 0 < x < 2 ⊂ Q.

9. Show that if ‘the’ supremum of a set exists, then it is unique.

31 RSH20150131012100