2023/2024 Correction of Test 1 : 1h00

USTO Analysis 1

Correction of TEST 1
1. (1pt) We have B ⊂ A and ∀x ∈ A, ∃y ∈ B such that x ⩽ y .
(a) Since B ⊂ A then ∀y ∈ B , y ∈ A =⇒ y ⩽ sup A then B is upper bounded in R hence sup B exists.
(b) From (a), sup A is an upper bound of B then sup B ⩽ sup A since sup B is the least upper bound.
Assume by contradiction that sup B < sup A, then by denition, there exists x ∈ A such that
sup B < x ⩽ sup A
and by hypothesis on B , there exists y ∈ B such that
sup B < x ⩽ y
which yields a contradiction since y ∈ B =⇒ y ⩽ sup B . Conclusion : sup B = sup A.
2. (1pt) Let x, y ∈ R, show that :
(a) One has
|x| = |x − y + y| ⩽ |x − y| + |y| =⇒ |x| − |y| ⩽ |x − y|
|y| = |y − x + x| ⩽ |x − y| + |x| =⇒ |y| − |x| ⩽ |x − y|
=⇒ ||x| − |y|| ⩽ |x − y|.
(b) One has 
 x + y + (x − y)
x + y + |x − y|  = x if x ⩾ y
max{x, y} = = x + y −2(x − y) : True
2 
 = y if x < y
2

x + y − (x − y)
= y if x ⩾ y

x + y − |x − y| 
min{x, y} = = 2 : True
2  x + y + (x − y) = x if x < y

2
(c) =⇒ ) Evident. let us show that x = y ⇐= |x − y| < ε, ∀ε > 0. By contrapositive reasoning,
∃ε > 0 : |x − y| ⩾ ε =⇒ |x − y| > 0 =⇒ x ̸= y
thus the indirect implication is true too.
3. (1pt) A set I ⊂ R is an interval if and only if I contains at least 2 points and for all a, c ∈ I and b ∈ R
such that a < b < c, we have b ∈ I . Say (and justify) if the following sets are or are not intervals :
(0, 1], {0, 1}, (0, 1) ∩ Q, R⧹Q.
(a) (0, 1] contains1/2 and 1 and for all a, c ∈ (0, 1] such that a < c, (a, c) ⊂ (0, 1] thus (0, 1] is an interval of
R.
(b) {0, 1} is not an interval since it contains 0 and 1 but 0 < 1/2 < 1 and 1/2 ∈/ {0, 1}.
(c) (0, 1) contains1/4 and 1/2 and for all a, c ∈ (0, 1) such that a < c, (a, c) ⊂ (0, 1) thus (0, 1) is an interval
of R.
√ √
(d) (0, 1) ∩ Q is not an interval since it contains 1/4 and 1/2 but 1/4 < 2 − 1 < 1/2 and 2 − 1 ∈/ (0, 1) ∩ Q.
(e) R⧹Q is not an interval since it contains −π and π but −π < 0 < π and 0 ∈/ R⧹Q.
4. (1pt) For a < b reals, let f : (a, b] → (0, 1] dened by f (x) = αx + β such that f (x) tends to 0 as x → a
and f (b) = 1. Theses two relations yield
1 −a
αa + β = 0 and αb + β = 1 =⇒ α = and β = 1 − αb = .
b−a b−a
f is a bijection since for all y ∈ (0, 1], there exists a unique x ∈ (a, b] such that f (x) = y , in fact
 
y−β a
x= = (b − a) y + = a + y(b − a)
α b−a
We have x > a since y > 0 and b − a > 0, and on the other hand x ⩽ b since y ⩽ 1 and b − a > 0, thus
x ∈ (a, b] is uniquely determined in (a, b].
 5. (2pt) The sets (−1, 1) and R have the same cardinalty if one nds a bijection from R to (−1, 1). Many
examples can given : for example f : R → (−1, 1)
x
f (x) =
1 + |x|
f is a bijection, in fact : for all y ∈ (−1, 1),
(a) if y ∈ [0, 1) then
x
= y ⩾ 0 =⇒ x ⩾ 0
1 + |x|
x y
= y =⇒ x = ∈R
1+x 1−y
(b) if y ∈ (−1, 0) then
x
= y ⩾ 0 =⇒ x < 0
1 + |x|
x y
= y =⇒ x = ∈R
1−x 1+y
y
In both cases, x = exists and is uniquely determined such that f (x) = y , hence f is a bijection.
1 − |y|
Conclusion : |(−1, 1)| = |R|.
(−1)n
 
6. (1pt) is convergent and the limit is 0 by the ST theorem, since
n n⩾1

1 (−1)n 1
0←− ⩽ ⩽ →0
n n n
 
n
7. (1pt) xn := is monotone strictly increasing because ∀n ∈ N,
n+1 n⩾0

n+1 n 1
xn+1 − xn = − = >0
n+2 n+1 n+2
and is bounded since, ∀n ∈ N,
n
0 < xn = <1
n+1
Since {xn }n⩾0 is increasing then
inf{xn : n ⩾ 0} = min{xn : n ⩾ 0} = x0 = 0,

and since {xn }n⩾0 is bounded then by Bolzano-Weirestrass th.

sup{xn : n ⩾ 0} = lim xn = 1.
n→+∞

Finally, since n ̸= n + 1 for all integer n , then max{xn : n ⩾ 0} does not exists since for any integer n,
xn ̸= 1.
(−1)n n
 
8. (1pt) The sequence an := is not convergent because, there are two subsequences convergent
n+1 n⩾0
to dierent limits : 
2n
a2n =
 →1
2n + 1
2n + 1
a2n+1
 =− → −1 ̸= 1
2n + 3
9. (1pt) Let {xn }n a sequence of reals :
(a) True since |xn − 0| = |xn | = ||xn | − 0|, in other words :
|xn − 0| < ε ⇐⇒ ||xn | − 0| < ε

(b) xn = (−1)n , limn→+∞ |xn | = 1 but limn→+∞ xn does not exist.

10. (2pt) Let {xn }n⩾0 a sequence of non zero reals (i.e. xn ̸= 0, ∀n) such that the limit
xn+1
L := lim , exists.
n→+∞ xn
 (a) By contra positive reasoning, assume xn → l ̸= 0. Then, xn+1 → l and since xn ̸= 0, ∀n, and l ̸= 0 then
xn+1
→ 1 thus L = 1 is not less then 1.
xn
(b) Assume L > 1 then and by contradiction suppose {xn }n⩾0 is bounded. By assumption,
xn+1
L = lim
n→+∞ xn

Hence, for ε = L − 1 > 0, there exists an integer M such that for all n ⩾ M :
xn+1
L−ε< <L+ε
xn

that gives for all n ⩾ M :

xn+1
> 1 =⇒ |xn+1 | > |xn |
xn
thus {|xn |}n⩾M is monotone increasing. Since {|xn |}n⩾M is bounded then there exists a convergent
(monotone increasing) subsequence such that |xnk | → l = supk⩾M |xnk | ⩾ 0 and we have, since xn ̸=
0, ∀n,
l = sup |xnk | ⩾ |xnM | > 0.
k⩾M

xnk +1
On the other hand, one has L = limk→+∞ exists, then by contra-positive reasoning as in (a) :
xnk

l ̸= 0 =⇒ L = 1

which give a contradiction with the hypothesis L > 1.

11. (1pt) Let c > 0, prove that : (Hint : question 10.)
(a) if c < 1 then
xn+1 cn+1
L = lim = lim =c<1
n→+∞ xn n→+∞ cn
then limn→+∞ cn = 0.
(b) if c > 1 then
xn+1 cn+1
L = lim = lim =c>1
n→+∞ xn n→+∞ cn
hence the sequence {cn }n⩾0 is unbounded.
12. (1pt) Let n! := n(n − 1)...3.2.1 and 0! = 1. (Use question 10.)
2n+1
(n + 1)! 2
L = lim = lim = 0 < 1.
n→+∞ 2n n→+∞ n + 1
n!

then
2n
lim =0
n→+∞ n!

13. (1pt) Let x ⩾ 0 and n ∈ N : By induction :

(a) Initialization : for n = 0, (1 + x)0 = 1 ⩾ 1 + 0x , true.
(b) Induction step : Assume the property true for n and let us show it for n + 1.
(1 + x)n+1 = (1 + x)n (1 + x) ⩾ (1 + nx)(1 + x)
⩾ 1 + (n + 1)x + nx2 ⩾ 1 + (n + 1)x.

(c) Conclusion step : for all x ⩾ 0 and n ∈ N : (1 + x)n ⩾ 1 + nx.

14. (1pt) Let p > 0. For any ε > 0, let d = ε−1/p then for all n ⩾ d :
n−p ⩽ d−p = ε

hence the inequality is true for all n ⩾ M = [d] + 1 and we conclude that
lim n−p = 0
n→+∞

15. (2pt) Let p > 1 : then p n > 1 n =⇒ p n − 1 > 0 for all n ∈ N∗ . On the other hand, one has by question
1 1 1

13 :   1 n  1 
p = 1 + pn − 1 ⩾ 1 + n pn − 1

hence
1 p−1
0 < pn − 1 ⩽ ,
n
and we deduce by the ST theorem that
1 p−1 1
0 < pn − 1 ⩽ ⇁ 0 =⇒ p n − 1 → 0
n
1
=⇒ lim p n = 1
n→+∞

16. (2pt) Let {xn }n , {yn }n two convergent sequences of reals such that limn→+∞ |xn −yn | = 0. Let limn→+∞ xn =
x and limn→+∞ yn = y . Then for all ε > 0 , there exists M1 , M2 , M3 integers such that :
ε
∀n ⩾ M1 : |x − xn | <
3
ε
∀n ⩾ M2 : |xn − yn | <
3
ε
∀n ⩾ M3 : |yn − y| <
3
hence, for n = max(M1 , M2 , M3 ),
0 ⩽ |x − y| = |x − xn + xn − yn + yn − y|
ε ε ε
⩽ |x − xn | + |xn − yn | + |yn − y| ⩽ + + = ε
3 3 3
henceforth
(∀ε > 0 : |x − y| < ε) =⇒ |x − y| = 0 =⇒ x = y.