Sets: solved exercises

Exercise 1. Tell whether the following sets are bounded from below and/or from above, specifying
infimum, supremum and minimum and maximum, if they exist.
{ }
1
a) A = : n∈N .
2n + 1
{ }
1
b) B = : n∈Z .
2n + 1
{ }
1
c) C = n − : n ∈ N \ {0} .
n
{ }
(−1)n
d) D = 1 + : n∈N .
n+1
{ }
1
e) E = n ∈ N : ∈N .
2n + 1
{ }
n−1
f ) F = [1 + (−1)n ] : n ∈ N \ {0} .
n
{ }
1
g) G = : n ∈ N \ {0} .
1 − 2−n
h) H = {−n : n ∈ N}.
{ }
n2 + 3
i) I = n∈N: >1 .
3n + 1
{ }
1
j) J = 2 cos (nπ) + : n ∈ N \ {0} .
n

Exercise 2. Tell whether the following sets are bounded from below and/or from above, specifying
infimum, supremum and minimum and maximum, if they exist.
{ }
a) A = x ∈ R : x2 − |x| ≥ 0 .

b) B = {x ∈ R : x|x| < x + 2}.

{ √ }
c) C = x ∈ R : x2 ≤ |x| .

⃝
c 2017 Politecnico di Torino
2 Sets: solved exercises

d) D = {x ∈ R : | sin x| ≥ 1}.
{ }
e) E = x ∈ R : e−x − 1 ≤ 0 .
{ }
f ) F = x2 − |x| : x ∈ R .

g) G = {x|x| − x − 2 : x ∈ R}.
{√ }
h) H = x2 − |x| : x ∈ R .

i) I = {| sin x| − 1 : x ∈ R}.
{ }
j) J = e−x − 1 : x ∈ R .

Exercise 3. Let A, B ⊆ R two non-empty, bounded sets, such that A ⊆ B. Prove that

inf B ≤ inf A ≤ sup A ≤ sup B.

Exercise 4. Let A, B ⊆ R two non-empty, bounded sets. Prove that,

1) sup(A ∪ B) = max{sup A, sup B} and inf(A ∪ B) = min{inf A, inf B};

2) if A ∩ B ̸= ∅, then sup(A ∩ B) ≤ min{sup A, sup B} and inf(A ∩ B) ≥ max{inf A, inf B}.

⃝
c 2017 Politecnico di Torino
Sets: solved exercises 3

SOLUTIONS
Exercise 1.

1a) For all n ∈ N we have 2n + 1 ≥ 1 and

1
0< ≤ 1.
2n + 1

Therefore A is bounded from above and from below.

1
For n = 0, we have = 1. Therefore max A = sup A = 1.
2n + 1
We prove now that inf A = 0. Clearly 0 is a lower bound of A, and 0 ∈
/ A. We must prove
that 0 is the greatest of the lower bounds of A, that is, for all ε > 0 there exists n ∈ N such
that
1
< 0 + ε = ε,
2n + 1
1−ε
The solutions of the equation are the numbers n ∈ R such that n > . By Archimedean
2ε
1 − ε
property1 there exists n ∈ N such that n > . Therefore 0 = inf A. Since 0 ̸∈ A, min A
2ε
doesn’t exist.

1b) If n ∈ Z with n ≥ 0, then 2n + 1 ≥ 1 and

1
0< ≤ 1.
2n + 1

If n ∈ Z with n ≤ −1, then 2n + 1 ≤ −1 and

1
−1 ≤ < 0.
2n + 1
1
Therefore, for all n ∈ Z we have −1 ≤ ≤ 1; then B is bounded. Since for n = 0 we
2n + 1
1 1
have = 1, then 1 = max B = sup B. Since for n = −1 we have = −1, then
2n + 1 2n + 1
−1 = min B = inf B.
1 1
1c) For all n ∈ N \ {0}, we see that n − ≥ 0; since ≤ 1, we have
n n
1 1
∀n ≥ 1 : n− ≥ 1 − ≥ 0.
n n

Therefore C is bounded from below. Since for n = 1, n − 1

n = 0, we have 0 = min C = inf C.
1
Archimedean property. Let a, b ∈ R, a, b > 0. Then there exists n ∈ N such that n a > b.

⃝
c 2017 Politecnico di Torino
4 Sets: solved exercises

We show that C is not bounded from above. Actually, for all a > 0 there exists n ∈ N such
1 1
that n − > a, that is there exists a solution in N of the inequality n − > a. Actually, if
n n
n ∈ N is such that n > a + 1, then
1 1
n− > a + 1 − ≥ a.
n | {z n}
≥0

Therefore C is unbounded from above; in this case we write sup C = +∞.

1d) We have
 1


(−1)n 1 + n+1
if n is even
1+ =
n+1 
 1
 1− if n is odd.
n+1
Hence, for all n ∈ N we have
1 (−1)n 1
1− ≤1+ ≤1+ .
n+1 n+1 n+1
1
Let us remark that if n is even, we have 1 + ≤ 2 . If n is odd (therefore n ≥ 1) we have
n+1
1 1
1− ≥ . Therefore, for all n ∈ N,
n+1 2
1 (−1)n
≤1+ ≤ 2.
2 n+1
(−1)n
Hence D is bounded from above and from below. Since 1 + = 2 if n = 0, then
n+1
(−1)n 1 1
2 = max D = sup D. Since 1 + = if n = 1, then = min D = inf D.
n+1 2 2
1
1e) For all n ∈ N, 2n + 1 ≥ 1. Hence ∈ N if and only if 2n + 1 = 1, that is if and only if
2n + 1
n = 0. Hence E = {0}. Since E is a finite set, it is bounded from above and from below and
inf E = min E = sup E = max E = 0.

1f ) We have {
2 if n is even
1 + (−1)n =
0 if n is odd.
{ }
n−1
Hence F = {0} ∪ 2 · : n ∈ N \ {0}, n even . Since all even numbers may be written
n
as n = 2k, with k ∈ N, we have
{ } { }
2k − 1 1
F = {0} ∪ : k ∈ N \ {0} = {0} ∪ 2 − : k ∈ N, k ≥ 1 .
k k
1
For all k ≥ 1 we have 1 ≤ 2 − < 2. Hence F is bounded from above and from below.
k
Clearly 0 = min F = inf F .

⃝
c 2017 Politecnico di Torino
Sets: solved exercises 5

We show that 2 = sup F . Obviously 2 is an upper bound of F . We must prove that for all
ε > 0, there exists k ∈ N, k ≥ 1 such that

1
2− > 2 − ε.
k
1
The solutions of the inequality are the numbers k ∈ R such that k > . By Archimedean
ε
1
property (see footnote, page 3) there exists k ∈ N such that k > . Therefore 2 = sup F .
ε
Since 2 ̸∈ F , there is no max F .

1g) If n1 < n2 , then 2−n1 > 2−n2 . If n1 = 1, we have 1 − 2−1 < 1 − 2−n for all n ∈ N \ {0}. Then
1
≤ 1 − 2−n < 1 for all n ∈ N \ {0}, and
2
1
1< ≤ 2.
1 − 2−n

1
Hence G is bounded from above and from below. For n = 1 we have = 2; therefore
1 − 2−n
2 = max G = sup G.

We show now that 1 = inf G. Clearly 1 is a lower bound of G. We must prove that for all
ε > 0 there exists n ∈ N such that

1
< 1 + ε.
1 − 2−n

1+ε
The solutions of the inequality are the real numbers n such that n > log2 . By
ε
1+ε
Archimedean property (see footnote, page 3) there exists n ∈ N such that n > log2 .
ε
Hence 1 = inf G. Since 1 ̸∈ G, there is no min G.

1h) For all n ∈ N, −n ≤ 0. Hence H is bounded from above. For n = 0 we have −n = 0, hence
0 = max H = sup H.

Obviously H is unbounded from below; in this case we write inf H = −∞.

n2 + 3
1i) The set I contains the solutions in N of the inequality > 1. We have
3n + 1

n2 + 3 n2 + 3 n2 − 3n + 2
>1 ⇐⇒ −1>0 ⇐⇒ >0 ⇐⇒ n < 1, n > 2.
3n + 1 3n + 1 3n + 1

Hence I = {0} ∪ {n ∈ N : n ≥ 3}. Therefore I is bounded from below and unbounded from
above. Clearly 0 = inf I = min I.

⃝
c 2017 Politecnico di Torino
6 Sets: solved exercises

{ }
1
1j) We have cos (nπ) = (−1)n . Therefore J = 2(−1) + : n ∈ N \ {0} . For all n ∈ N \ {0}
n
n
we have 

2 +
1
1 if n is even
2(−1)n + = n
n  
−2 + 1
n if n is odd.
Therefore, for all n ∈ N \ {0} we have

1 1 1
−2 + ≤ 2(−1)n + ≤ 2 + .
n n n
1 5
If n is even, then n ≥ 2 and 2 + ≤ .
n 2
1
If n is odd, then −2 + > −2. Therefore, for all n ∈ N \ {0}
n
1 5
−2 < 2(−1)n + ≤ .
n 2

Hence F is bounded from above and from below.

1 5
For n = 2 we have 2(−1)n + = . Therefore sup J = max J = 52 .
n 2
We prove that −2 = inf J. We need to show that −2 is the greatest of the lower bounds of
J, that is, for all ε > 0 there exists n ∈ N such that

1
2(−1)n + < −2 + ε.
n

If n is even, 2(−1)n + 1
n = 2+ ≥ 2, therefore we may restrict the search for a solution
1
n
1
to the odd integer numbers. In this case we have to solve the inequality −2 + < −2 + ε.
n
1
The solutions of this inequality are the real numbers n such that n > . By Archimedean
ε
1
Property, there exists also n ∈ N such that n > .
ε
Therefore −2 = inf J. Since −2 ̸∈ J, there is no min J.

Exercise 2.

2a) A is the set of solutions of the inequality x2 − |x| ≥ 0. We have

x2 − |x| ≥ 0 ⇐⇒ x2 ≥ |x| ⇐⇒ x ≤ −1 ∨ x = 0 ∨ x ≥ 1.

Hence A = (−∞, −1] ∪ {0} ∪ [1, +∞). Therefore A is unbounded from above and from below.

⃝
c 2017 Politecnico di Torino
Sets: solved exercises 7

2b) B is the set of solutions of the inequality x|x| < x + 2. We have

{ {
x≥0 x<0
x|x| < x + 2 ⇐⇒ ∨ ⇐⇒ 0 ≤ x < 2.
x2 − x − 2 < 0 x2 + x + 2 > 0

Hence B = (−∞, 2). Therefore B is unbounded from below and bounded from above, with
sup B = 2. Since 2 ̸∈ B there is no max B.
√ √
2c) C is the set of solutions of the inequality x2 ≤ |x|. Since x2 = |x|, we have C = R. Hence
C is unbounded from above and from below.

2d) D is the set of solutions of the inequality | sin x| ≥ 1. Since | sin x| ≤ 1 for all x ∈ R, we have
π
| sin x| ≥ 1 if and only if | sin x| = 1. Moreover, | sin x| = 1 if and only if x = + kπ, for all
2
k ∈ Z. Hence { }
π
D= + kπ : k ∈ Z .
2
Therefore D is unbounded from above and from below.

2e) E is the set of solutions of the inequality e−x − 1 ≤ 0. We have

e−x − 1 ≤ 0 ⇐⇒ e−x ≤ 1 ⇐⇒ x ≥ 0.

Hence E = [0, +∞). Therefore E is bounded from below but not from above. inf E =
min E = 0.

2f ) Let us consider the function f (x) = x2 − |x|. Since f is even, that is f (−x) = f (x) for all
x ∈ R, we have
F = Im(f ) = {f (x) : x ∈ R} = {x2 − x : x ≥ 0}.
( ) [ )
1 1 1
The parabola y = x2 − x is concave up, with vertex at , − . Hence F = − , +∞ .
2 4 4
1
Therefore F is bounded from below but not from above. min F = inf F = − .
4
2g) Let us consider the function g(x) = x|x| − x − 2. We have G = Im(g). We have
{
g1 (x) = x2 − x − 2 if x ≥ 0
g(x) = x|x| − x − 2 =
g2 (x) = −x2 − x − 2 if x < 0.

( G =)Im(g) = Im(g1 ) ∪ Im(g ) parabola y = x − x − 2 is concave up, with vertex

Hence 2
[ 2 ). The
1 9 9
at , − . Hence Im(g1 ) = − , +∞ . The parabola y = −x2 − x − 2 is concave down,
2 4 ( ) 4 ( ]
1 7 7
with vertex at − , − . Hence Im(g2 ) = −∞, − . Therefore G = R is unbounded from
2 4 4
above and from below.

⃝
c 2017 Politecnico di Torino
8 Sets: solved exercises

√
2h) Since x2 = |x|, we have H = {0}. Since H contains a single point, it is bounded and
inf H = min H = sup H = max H = 0.

2i) Let us consider the function f (x) = | sin x| − 1. We have I = Im(f ). Since the image
of the function | sin x| is [0, 1], the image of f is I = [−1, 0]. Hence I is bounded and
inf I = min I = −1, sup I = max I = 0.

2j) Let us consider the function f (x) = e−x − 1. Since the image of the exponential function ex
is (0, +∞), also the image of e−x is (0, +∞). Therefore J = (−1, +∞). Hence J is bounded
from below and is unbounded from above, inf J = −1 and there is no min J.

Exercise 3. By definition inf A ≤ sup A. In order to prove that inf B ≤ inf A, we show that
the greatest of the lower bounds of B is smaller or equal to the greatest of the lower bounds of A
(similarly one can prove that sup A ≤ sup B).
Let m ∈ R be a lower bound of B, that is such that m ≤ b for all b ∈ B. Since A ⊆ B, m ≤ a
for all a ∈ A as well. Hence inf B, which is a lower bound of B, is also a lower bound of A, that is
inf B ≤ a for all a ∈ A. Hence inf B ≤ inf A.

Exercise 4.

4.1) We show that sup(A ∪ B) = max{sup A, sup B}. Similarly one can prove that inf(A ∪ B) =
min{inf A, inf B}.

Let x ∈ A ∪ B. If x ∈ A, then x ≤ sup A. If x ∈ B, then x ≤ sup B.

Hence x ≤ M = max{sup A, sup B}, therefore M is an upper bound of A ∪ B.

We show that M is the least of the upper bounds of A ∪ B, that is, for all ε > 0 there exists
x ∈ A ∪ B such that x > M − ε.

We assume M = sup A (similarly if M = sup B). Then there exists x ∈ A such that x > M −ε.
Hence x ∈ A ∪ B. Therefore M = sup(A ∪ B).

4.2) We show that sup(A ∩ B) ≤ min{sup A, sup B}. Similarly one can prove that inf(A ∩ B) ≥
max{inf A, inf B}.

Let x ∈ A ∩ B, that is x ∈ A and x ∈ B. Then x ≤ sup A and x ≤ sup B, that is

x ≤ M = min{sup A, sup B}.

⃝
c 2017 Politecnico di Torino
Sets: solved exercises 9

Remark If A ∩ B ̸= ∅, it is possible that sup(A ∩ B) < min{sup A, sup B} and/or that

inf(A ∩ B) > max{inf A, inf B}.

For instance, if A = {0, 1, 2} and B = {−1, 1, 3}, then A ∩ B = {1} and

1 = sup(A ∩ B) < min{sup A, sup B} = 2, 1 = inf(A ∩ B) > max{inf A, inf B} = 0.

⃝
c 2017 Politecnico di Torino