Sukkur IBA University

Department of Mathematics, Basic Sciences and Humanities

Problem Set 1
Topic: Completeness Axiom of R

Course: Real Analysis (MAT-221) Class: BS-IV

Instructor: Irshaad Ahmed Date: February 3, 2025

1 Completeness Axiom of R

Let us recall the completeness axiom of R. We will also introduce some new terminology.

Definitions 1.1. Let A be a non-empty subset of R. A number b ∈ R is called an upper bound for A if
we have the following situation:
a ≤ b, for all a ∈ A.

In case such a b exists, we say A is bounded above.

Definitions 1.2. Let A be a non-empty bounded above subset of R. A number s ∈ R is called a least
upper bound for A if the following two conditions are met:

(i) s is an upper bound for A.

(ii) If b is an upper bound for A, then s ≤ b.

We also use, for the sake of brevity, the following terminology: s is a supremum of A and we write
s = sup A.

Completeness Axiom of R Let A be a non-empty bounded above subset of R. Then sup A ∈ R.

In a class-lecture, we established the following simple fact (using the Trichotomy Axiom for R).

Theorem 1.3. Let A be a non-empty bounded above subset of R. Then sup A is unique.

Making use of the Completeness Axiom of R, we established the following property of N.

Theorem 1.4. (Archimedean Property)

(i) If x ∈ R, then there exists an n ∈ N such that x < n.

1
(ii) If y ∈ R with y > 0, then there exists an n ∈ N such that n < y.

Remarks 1.5. (i) In the assertion (i) of the previous theorem, n depends on x: For a larger x, we have
to choose a larger n. A similar remark applies for assertion (ii): The closer (from right) y is to 0,
the larger n we have to choose.

Problem Set 1 Page 1 / 4

 (ii) An obvious implication of assertion (i) of the previous theorem: N is not a bounded above subset of
R.

(iii) One more implication of assertion (i): If there exists at least one upper bound of a non-empty subset
A of R, then there exist infinitely many upper bounds for A.

Definitions 1.6. Let A be a non-empty subset of R. A number b ∈ R is called a lower bound for A if we
have the following situation:
b ≤ a, for all a ∈ A.

In case such a b exists, we say A is bounded below.

Remark 1.7. Yet another implication of assertion (i) of Theorem 1.4: If there exists at least one lower
bound of a non-empty subset A of R, then there exist infinitely many lower bounds for A.

Definitions 1.8. Let A be a non-empty bounded below subset of R. A number s ∈ R is called a greatest
lower bound for A if the following two conditions are met:

(i) s is a lower bound for A.

(ii) If b is a lower bound for A, then b ≤ s.

We will use the following terminology: s is a infimum of A and we write s = inf A.

Definition 1.9. Let A be a non-empty subset of R. We say A is a bounded subset of R if A is both

bounded above and bounded below.

Definitions 1.10. Let A be a non-empty subset of R. A number a0 ∈ A is called a maximum element of

A if we have
a ≤ a0 , for all a ∈ A.

We write a0 = max A.

Definitions 1.11. Let A be a non-empty subset of R. A number a1 ∈ A is called a minimum element of

A if we have
a1 ≤ a, for all a ∈ A.

We write a1 = min A.

2 Problems

Problem 1 While defining upper bounds, lowers bounds, supremum, and infimum, we have insisted
that our set A should be non-empty. What goes wrong if we relax non-emptyness of A? More precisely,
assume A = ∅.

(i) Write down the set of all upper bounds of A.

(ii) Write down the set of all lower bounds of A.

(iii) What is sup A?

(iv) What is inf A?

Problem Set 1 Page 2 / 4

Problem 2 Let A be a non-empty bounded below subset of R. Let L be the set of all lower bounds of
A.

(i) Show that L is a non-empty bounded above subset of R.

(ii) Show that inf A = sup L.

(iii) Comment on the following: Let A be a non-empty bounded below subset of R. Then inf A ∈ R.

(iv) Comment on the following: Let A be a non-empty bounded below subset of R. Then inf A is unique.

Problem 3 Work out the following exercises from Stephen Abbott’s book Understanding Analysis (2nd
Ed.):

(i) Exercise 1.3.2

(ii) Exercise 1.3.5

(iii) Exercise 1.3.6 (a)-(c).

(iv) Exercise 1.3.7

(v) Exercise 1.3.8

(vi) Exercise 1.3.9

(vii) Exercise 1.3.11

Problem 4 Define  
n
A= :n∈N ,
n+1
and  
1
B= :n∈N .
n
Using Archimedean property, show that sup A = 1 and inf A = 0.

Problem 5 Let A be a non-empty subset of R. Show that A is bounded if and only if there exists an
M ≥ 0 such that
|a| ≤ M, for all a ∈ A.

Problem 6 Let A be a non-empty subset of R.

(i) Assume that A is bounded above and that sup A ∈ A Show that sup A = max A.

(ii) Comment on the following: If maximum of A exists, then it is unique.

(iii) Assume that A is bounded below and that inf A ∈ A. Show that inf A = min A.

(iv) Comment on the following: If minimum of A exists, then it is unique.

Problem Set 1 Page 3 / 4

Problem 7 Let A be a non-empty bounded subset of R. Show that inf A ≤ sup A. Comment on the
following situation: inf A = sup A.

Problem 8 Let A and B be a two non-empty bounded subsets of R such that A ⊂ B.

(i) Show that sup A ≤ sup B.

(ii) Show that inf B ≤ inf A.

Problem 9 Let A and B be a two non-empty subsets of R satisfying the following property:

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

(i) Explain why A is bounded above and B is bounded below.

(ii) Show that sup A ≤ inf B.

Problem 10 Let a ∈ A such that a ≥ 0. Assume that the following situation holds:

a < ϵ, for all ϵ > 0.

Conclude that a = 0.

Hint: Create a contradiction.

Problem Set 1 Page 4 / 4