CHAPTER 1

Analysis-Exercises

1. Quantifiers,
Exercise 1.1. Let A, B be subsets of a set E. Using the quantifiers ∃ and ∀,
express that
a) A ⊂ B
b) A 6⊂ B
c) E = A ∪ B
d) E = A ∩ B
e) A ∩ B 6= ∅.
Exercise 1.2. If {Ai }i∈I is a family of subsets of E, complete the following
lines:
a) Ac1 = {x ∈ E : · · · }
b) ∩i∈I Ai = {x ∈ E : · · · }
c) ∪i∈I Ai = {x ∈ E : · · · }
c
d) (∩i∈I Ai ) = {x ∈ E : · · · }
c
e) (∪i∈I Ai ) = {x ∈ E : · · · }
Exercise 1.3. Let Pi (x) be a boolean expression concerning x (i.e. for any
point x in E the expression Pi (x) is either True or False.) Let Pi denote the set
Pi := {x ∈ E : Pi (x) is True}. Express first using quantifiers, then using the sets
P1 , P2 that
a) P1 implies P2 .
b) P1 does not implies P2 .
If P3 (x) is the boolean expression P1 (x) =⇒ P2 (x), express P3 in terms of P1 , P2 .
Exercise 1.4. Which of the following claims is True. (Explain why)
a) ∃n ∈ N : ∀m ∈ N : m > n
b) ∃n ∈ N : ∀m ∈ N : m < n
c) ∀m ∈ N : ∃n ∈ N : m > n
d) ∀m ∈ N : ∃n ∈ N : m < n
e) ∃m ∈ N : ∃n ∈ N : m < n
Exercise 1.5. Let E and F be two sets and f : E → F be a function from E
to F .
a) Define the graph graph(f ) of f .
b) Let G ⊂ E × F . What property must be satisfied by G for this set to be the graph
of a function?
c) Prove that f and g are identical if graph(f ) = graph(g).
d) Express that f is onto F .
e) Express that f is one to one.

1
2 1. ANALYSIS-EXERCISES

Exercise 1.6. If f : E → F , and A ⊂ F , the set f −1 (A) is defined as

−1
f (A) := {x ∈ E : f (x) ∈ A}. Prove that
a) f −1 (Ac ) := (f −1 (A))c .
b) f −1 (A ∪ B) = f −1 (A) ∪ f −1 (B)
c) f −1 (A ∩ B) = f −1 (A) ∩ f −1 (B)
d) f (f −1 (A)) = f (E) ∩ A.
e) If C ⊂ E, f −1 (f (C)) = C
Exercise 1.7. A set A is countable iif there exists an onto map f : N → A.
a) Prove that if A is countable and B ⊂ A then B is countable.
b) Prove that if A and B are countable, then so is A ∪ B.
c)(difficult) Let {Ai }i∈N be a family of countable sets. Prove that A := ∪i∈N Ai is
countable. Prove that Q is countable.
d)(difficult) Prove that E := {0, 1}N is not a countable set.
e) Let F be F := {{xn }n∈N ∈ E : ∃N : ∀n ≥ N : xn = 1}. Prove that F is
countable. Prove that E − F is not countable.
f ) A number x ∈ [0, 1] may have two binary expressions. As an example: 0, 10000000 · · · =
0, 011111111 · · · . Prove that there is a one to one map between [0, 1] and E − F .
Conclude that [0, 1] is not countable.
Exercise 1.8. For a non empty set A ⊂ R define a is the max of A.
a) Prove that a set has at most one maximal element. (When it exists, it will be
denoted max(A).
b) Prove that, if two sets A and B have a max, then their union A ∪ B has also a
max.
c) The set A :=]0, 1[ has no maximum. However 1 could ”play the same role”
as max(A). We will write 1 = sup(A). Intuitively 1 dominates A, but among the
numbers that dominates A, 1 is the smallest one. For a generic set A define sup(A)
using quantifiers. Prove that there exists at most one supremum in a set A. There
is an axiom in the definition of R that states that any bounded set A has a sup.
d) Prove that if A has a max then max(A) = sup(A).
e) Prove that if A ⊂ B are bounded sets then sup(A) ≤ sup(B).
Exercise 1.9. Intuitively, a sequence {xn }n∈N of real numbers converges to
a ∈ R if as n becomes very large, xn gets closer to a. This does not mean that
|xn − a| decreases with n, but instead it is required that |xn − a| is as small as we
would like provide n is large enough.
a) Give a precise definition of {xn }n∈N converges to a using quantifiers.
b) Prove that a sequence {xn }n∈N has at most one limit in R.
1
c) Using the definition in a), prove that the sequence xn := 1 + n+1 converges to 1.

d) Prove that a bounded increasing sequence has always a limit.

e) Let A be a bounded set. Prove that there exists an A-valued sequence {xn }n∈N
that converges to sup(A).
f ) Let {xn }n∈N be a bounded sequence of real numbers. Define gn := sup({xk : k ≥
n}) and hn := inf({xk : k ≥ n}). Prove that gn and hn are respectively decreasing
and increasing in n.
g) Define next lim sup xn := inf({gn : n ∈ N}) and lim inf xn := sup({hn : n ∈ N}).
Prove that lim sup xn ≥ lim inf xn .
h) Prove that there exists a sub-sequence of {xn }n∈N that converges to lim sup xn .
 1. QUANTIFIERS, 3

i) If {yn }n∈N is a subsequence of {xn }n∈N , prove that

lim sup xn ≥ lim sup yn ≥ lim inf yn ≥ lim inf xn
j) Prove that the sequence {xn }n∈N converges to a iif
a = lim sup xn = lim sup xn .
Exercise 1.10. We will say that a sequence {xn }n∈N has the property O iif
limn→∞ |xn+1 − xn | = 0.
Prove that a converging sequence has always the property O.
Find a non-converging sequence that has the O property.
Compare the definition of the O property with that of Cauchy sequence.