UNIVERSITÉ LIBANAISE MATH 1102 (F)

FACULTÉ DE SCIENCES Année : 2017-2018

SECTION II, FANAR Second Semestre

Corrigé du TD 1

Exercice 1 — ∀ n ∈ N, An 6= ∅ car n ∈ An (puisque |n| = n).

— ∀ n, m ∈ N tels que n 6= m, on a An ∩ Am = ∅ car sinon, c-à-d si An ∩ Am 6= ∅, il existerait
a ∈ Z tel que a ∈ An ∩ Am . Par suite, a ∈ An et a ∈ Am , donc |a| = n et |a| = m, d’où
m = n, contradiction.
[
— On a évidemment An ⊂ Z (car ∀ n ∈ N, An ⊂ Z).
n∈N [
D’autre part, si m ∈ Z alors ∃ n = |m| ∈ N tel que m ∈ An . Par suite, Z ⊂ An .
[ n∈N
D’où, An = Z.
n∈N

Exercice 2 E 6= ∅, ∅ =
6 A ( E, (Fi )i∈I ⊂ P(E). On pose
! ! !
[ \ [
A1 = A ∩ Fi et A2 = A ∩ {E Fi = A ∩ {E Fi .
i∈I i∈I i∈I

On suppose que A1 6= ∅ et A1 6= A.
Montrons que {A1 , A2 } réalise une partition de A.
— A1 6= ∅ (par hypothèse). !
[ [
Supposons que A2 = ∅ =⇒ A ∩ {E Fi = ∅ =⇒ A ⊂ Fi =⇒ A1 = A ce qui
i∈I i∈I
" A2 6=!∅.
est absurde. Donc !#
[ [
— A1 ∩ A2 = A ∩ Fi ∩ {E Fi = ∅.
i∈I i∈I
| {z }
" !# =∅" !# " ! !#
[ [ [ [
— A1 ∪ A2 = A ∩ Fi ∪ A ∩ {E Fi =A∩ Fi ∪ {E Fi = A.
i∈I i∈I i∈I i∈I
| {z }
=E

Exercice 3 E 6= ∅, ∅ =
6 A ( E, (Fi )i∈I ⊂ P(E).
!
[ [
1. x ∈ Fi − A ⇐⇒ x ∈ Fi et x 6∈ A ⇐⇒ (∃ i ∈ I, x ∈ Fi ) et x 6∈ A ⇐⇒ ∃ i ∈
i∈I i∈I [
I, (x ∈ Fi et x 6∈ A) ⇐⇒ ∃ i ∈ I, x ∈ Fi − A ⇐⇒ x ∈ (Fi − A).
i∈I
2. ∀ i ∈ I, on pose Hi = Fi − A et on suppose que Hi 6= ∅.
Montrons que : [(Fi )i∈I réalise une partition de E =⇒ (Hi )i∈I réalise une partition de
{E A].
— ∀ i ∈ I, Hi 6= ∅ (par hypothèse).
— ∀ i, j ∈ I tels que i 6= j, montrons que Hi ∩ Hj = ∅.
On sait qu’il existe Fi , Fj tels que Hi = Fi − A et Hj = Fj − A avec Fi ∩ Fj = ∅ car
 i 6= j et (Fi )i∈I réalise une partition de E.
Par l’absurde, si Hi ∩ Hj 6= ∅ alors ∃ x ∈ Hi ∩ Hj donc x ∈ Hi et x ∈ Hj ainsi, x ∈ Fi
et x ∈ Fj donc x ∈ Fi ∩ Fj ce qui est contradictoire avec Fi ∩ Fj = ∅.
ou bien Hi ∩ Hj = (Fi − A) ∩ (Fj − A) = (Fi ∩ {E A) ∩ (Fj ∩ {E A) = (Fi ∩ Fj ) ∩ {E A = ∅
car Fi ∩ Fj = ∅. !
[ [ [
— Hi = (Fi − A) = Fi − A = E − A = {E A.
i∈I i∈I i∈I

Exercice 4 A et B deux ensembles non vides et F une famille non vide de parties de A.
!
[ [
1. F ×B = (F × B) ?
F ∈F F ∈F
!
[ [
(x, y) ∈ F ×B ⇐⇒ x∈ F et y ∈ B
F ∈F F ∈F
⇐⇒ (∃ F ∈ F/ x ∈ F ) et y ∈ B
⇐⇒ ∃ F ∈ F/ (x ∈ F et y ∈ B)
⇐⇒ ∃ F ∈ F/[(x, y) ∈ F × B
⇐⇒ (x, y) ∈ (F × B)
F ∈F

2. On note H = {H ∈ P(A × B) / ∃ F ∈ F, H = F × B}.

Montrons que : [F réalise une partition de A] =⇒ [H réalise une partition de A × B].
— ∀ H ∈ H, H 6= ∅. ?
Soit H ∈ H. Donc, il existe F ∈ F tel que H = F × B. Or F 6= ∅ et B 6= ∅, il suit que
H = F × B 6= ∅.
— Soient H, H 0 ∈ H tels que H 6= H 0 .
Montrons que H ∩ H 0 = ∅.
H, H 0 ∈ H =⇒ ∃ F, F 0 ∈ F/ H = F × B et H 0 = F 0 × B avec F 6= F 0 puisque H 6= H 0 .
H 0 = (F × B) ∩
Ainsi, H ∩ [ 0 0
[(F × B) = (F[∩ F ) × B = ∅ car F ∩ F = ∅.
0

— A×B =( F) × B = (F × B) = H.
F ∈F F ∈F H∈H

Exercice 5 We define over Z the binary relation R by

∀ x, y ∈ Z, xR y ⇐⇒ x + y is even.

1. Show that R is an equivalence relation over Z.

— R is reflexive, ∀ x ∈ Z, x + x = 2x is even thus xRx.
— R is symmetric, ∀ x, y ∈ Z, xRy =⇒ x + y is even =⇒ y + x is even =⇒ yRx
— R is transitive , ∀ x, y, z ∈ R, [xRy and yRz] =⇒ [x+y is even and y+z is even ] =⇒
[x + 2y + z is even , 2y is even ] =⇒ x + z = (x + 2y + z) − 2y is even =⇒ xRz.
2. The equivalence classes 0and 1.
0 = {x ∈ Z/0Rx} = {x ∈ Z/x is even }.
1 = {x ∈ Z/1Rx} = {x ∈ Z/1 + x is even} = {x ∈ Z/x is odd }
Z/R = {x/x ∈ Z} = {0, 1} because
— if x is even then xR0 =⇒ x = 0,
— if x is odd then xR1 =⇒ x = 1.

Exercice 6 We consider the plan (P ) related to a system of axes (x0 Ox) et (y 0 Oy). We define
over (P ) the binary relation R by

∀ M (x, y), M 0 (x0 , y 0 ) ∈ (P ), M R M 0 ⇐⇒ x − y = x0 − y 0 .

 1. Show that R is an equivalence relation over (P ).
— R is reflexive, ∀ M (x, y) ∈ (P ), x − y = x − y thus M RM .
— R is symmetric, ∀ M (x, y), M 0 (x0 , y 0 ) ∈ (P ), M RM 0 =⇒ x − y = x0 − y 0 =⇒ x0 − y 0 =
x − y =⇒ M 0 RM
— R is transitive, ∀ M (x, y), M 0 (x0 , y 0 ), M 00 (x00 , y 00 ) ∈ (P ), [M RM 0 and M 0 RM 00 ] =⇒
[x − y = x0 − y 0 and x0 − y 0 = x00 − y 00 ] =⇒ x − y = x00 − y 00 =⇒ M RM 00 .
2. Determine the equivalence class of the point A(1, 2). What is its geometrical nature ?
A = {M (x, y) ∈ (P )/ M RA} = {M (x, y) ∈ (P )/x − y = 1 − 2} = {M (x, y) ∈ (P )/x − y =
−1}. It is the line y = x + 1.
3. Describe geometrically the set-quotient (P )/R. Let B(a, b) ∈ (P ). B = {M (x, y) ∈
(P )/ M RB} = {M (x, y) ∈ (P )/x − y = a − b}.
It is the line y = x + (b − a).
Conversely, any line of equation y = x + c, is the class equivalence of the point C(0, c). So,
(P )/R is therefore the set of all the lines of the plane (P ) of slope 1.

Exercice 7 Let (Fi )i∈I be a family of subsets of E, indexed by a non-empty set I. We assume
that (Fi )i∈I is a partition of E. We define over E the binary relation R by

∀ x, y ∈ E, x R y ⇐⇒ ∃ i ∈ I / x ∈ Fi et y ∈ Fi

1. Show that R is an equivalence relation over E.

— R is reflexive : [ [
∀ x ∈ E, we have x ∈ Fi (Since (Fi )i∈I is a partition of E so in particular E = Fi )
i∈I i∈I
=⇒ ∀ x ∈ E, ∃ i ∈ I / x ∈ Fi =⇒ ∀ x ∈ E, ∃ i ∈ I / x ∈ Fi and x ∈ Fi =⇒ ∀ x ∈
E, x R x.
— R is symmetric :
∀ x, y ∈ E, x R y =⇒ ∃ i ∈ I / x ∈ Fi and y ∈ Fi =⇒ ∃ i ∈ I / y ∈ Fi and x ∈ Fi =⇒
y R x.
— R is transitive :
∀ x, y, z ∈ E,

x R y et y R z =⇒ (∃ i ∈ I / x ∈ Fi et y ∈ Fi ) and (∃ j ∈ I / y ∈ Fj and z ∈ Fj )
=⇒ y ∈ Fi ∩ Fj =⇒ Fi ∩ Fj 6= ∅ =⇒ i = j
=⇒ ∃ i ∈ I / x ∈ Fi and z ∈ Fi
=⇒ x R z.

2. Show that if x ∈ Fi for some i ∈ I then x = Fi .

— ⊂ ? y ∈ x =⇒ xRy =⇒ ∃ j ∈ I; x ∈ Fj et y ∈ Fj =⇒ x ∈ Fi ∩ Fj =⇒ Fi ∩ Fj 6=
∅ =⇒ i = j =⇒ y ∈ Fi .
— ⊃ ? If y ∈ Fi where x ∈ Fi then xRy and consequently y ∈ x.

Exercice 8 Let E be a set and A ⊂ E. W define over E the binary relation R by

∀ x, y ∈ E, xR y ⇐⇒ (x ∈ A and y ∈ A) or (x 6∈ A and y = x).

1. Show that R is an equivalence relation over E

— R is reflexive because ∀ x ∈ E, we have two cases : x ∈ A or x 6∈ A.
If x ∈ A then x ∈ A and x ∈ A thus xR x.
If x 6∈ A then x 6∈ A and x = x thus xR x.
 — R is symmetric because ∀ x, y ∈ E, xRy =⇒ (x ∈ A and y ∈ A) or (x 6∈ A and y =
x) =⇒ (y ∈ A and x ∈ A) or (y 6∈ A and x = y) =⇒ yRx
— R is transitive because ∀ x, y, z ∈ R,

[xRy and yRz] =⇒ [(x ∈ A and y ∈ A) or (x 6∈ A and y = x)] and [(y ∈ A and z ∈ A) or (y 6∈ A and z
=⇒ [(x ∈ A and y ∈ A) and (y ∈ A and z ∈ A)]
or [(x ∈ A and y ∈ A) and (y 6∈ A and z = y)]
| {z }
contradiction
or [(x 6∈ A and y = x)] and [(y ∈ A and z ∈ A)]
| {z }
contradiction
[(x 6∈ A et y = x) et (y 6∈ A et z = y)]
=⇒ [(x ∈ A and z ∈ A) or (x 6∈ A and z = x)]
=⇒ xRz

2. Let x ∈ E. We have two cases : x ∈ A or x 6∈ A.

If x ∈ A then x = {y ∈ E; xRy} = {y ∈ E; y ∈ A} = A.
If x 6∈ A then x = {y ∈ E; xRy} = {y ∈ E; y = x} = {x}.

Exercice 9 Let E = {a, b, c, d, e} and R the order relation defined on E by the Hasse diagram
below
e

b c d

a
(this diagram contains neither the reflexivity nor the transitivity).
Let A = {b, c}, B = {b, d} and C = {a, b, e}. Find, when they exist, the remarkable elements of
the sets A, B, C and E.

UppE SupE GE max Elts

A = {b, c} {e} e does not exist b and c
B = {b, d} ∅ does not exist does not exist b and d
C = {a, b, e} {e} e e e
E ∅ does not exist does not exist e and d

LowE InfE SE min Elts

A = {b, c} {a} a does not exist b and c
B = {b, d} {a} a does not exist b and d
C = {a, b, e} {a} a a a
E {a} a a a

Exercice 10 We define over N∗ the binary relation R by

∀ x, y ∈ N∗ , xR y ⇐⇒ ∃ n ∈ N∗ / y = xn .

1. Show that R is an order relation over N∗ .

— R is reflexive, ∀ x ∈ N∗ , ∃ n = 1 ∈ N∗ such that x = xn , thus xRx.
 — R is skew-symmetric since

∀ x, y ∈ N∗ , xR y and yR x =⇒ ∃ n ∈ N∗ / y = xn and ∃ m ∈ N∗ / x = y m
=⇒ x = y m = (xn )m = xnm
=⇒ x(1 − xnm−1 ) = 0
x6=0
=⇒ xnm−1 = 1
=⇒ x = 1 or nm = 1
=⇒ x = 1 or n = m = 1
=⇒ x = y.

— R is transitive since

∀ x, y, z ∈ N∗ , xR y and yR z =⇒ ∃ n ∈ N∗ / y = xn and ∃ m ∈ N∗ / z = y m
=⇒ ∃ n, m ∈ N∗ / z = y m = (xn )m = xnm
=⇒ ∃ p = nm ∈ N∗ / z = xp
=⇒ xR z
2. The (N∗ , R) is it partially or totally ordered set ? Justify.
(N∗ , R) is a partially ordered set for x = 2 and y = 3, xRy and y Rx because otherwise,
this means that 2 divides 3 or 3 divides 2 which is absurd.
3. Let A = {2, 4, 8, 16}. Find, when they exist, the remarkable elements of A.

16

4 8

a is an upper born of A ⇐⇒ 2Ra, 4Ra, 16Ra and 8Ra

⇐⇒ 16Ra et 8Ra
⇐⇒ ∃ n, m ∈ N∗ ; a = 16m = 8n
⇐⇒ ∃ n, m ∈ N∗ ; a = 24m = 23n
⇐⇒ a = 212k with k ∈ N∗

So
— UppE (A) = {212k avec k ∈ N∗ }
— SupE (A) = 212
— GE(A) does not exist
— Maximal elements : 16 and 8.
— LowE (A) = {2}
— InfE (A) = 2
— SE(A) = 2
— Minimal element : 2.

Exercice 11 We define over N∗ × N∗ the binary relation R by

∀ (x1 , y1 ), (x2 , y2 ) ∈ N∗ × N∗ , (x1 , y1 )R (x2 , y2 ) ⇐⇒ x1 ≤ x2 and y1 ≤ y2 .

 1. Show that R is an order relation over N∗ × N∗ :
— R is reflexive, ∀ (x, y) ∈ N∗ × N∗ , we have x ≤ x and y ≤ y thus (x, y)R(x, y).
— R is skew-symmetric since ∀ (x1 , y1 ), (x2 , y2 ) ∈ N∗ × N∗ ,

(x1 , y1 )R (x2 , y2 ) and (x2 , y2 )R (x1 , y1 ) =⇒ (x1 ≤ x2 and y1 ≤ y2 ) and (x2 ≤ x1 and y2 ≤ y1 )
=⇒ (x1 ≤ x2 and x2 ≤ x1 ) and (y1 ≤ y2 and y2 ≤ y1 )
=⇒ x1 = x2 and y1 = y2
=⇒ (x1 , y1 ) = (x2 , y2 )

— R is transitive since ∀ (x1 , y1 ), (x2 , y2 ), (x3 , y3 ) ∈ N∗ × N∗ ,

(x1 , y1 )R (x2 , y2 ) and (x2 , y2 )R (x3 , y3 ) =⇒ (x1 ≤ x2 and y1 ≤ y2 ) et (x2 ≤ x3 and y2 ≤ y3 )

=⇒ (x1 ≤ x2 and x2 ≤ x3 ) and (y1 ≤ y2 and y2 ≤ y3 )
=⇒ x1 ≤ x3 and y1 ≤ y3
=⇒ (x1 , y1 )R (x3 , y3 )

2. Is this order total ? Justify.

No, because (1, 2)R(2, 1) and (2, 1)R(1, 2). Thus, (1, 2) and (2, 1) are not comparables.
3. Let A = {(1, 2), (2, 1), (2, 2), (2, 3)}. Find, when they exist, the remarkable elements of A.

(2, 3)

(2, 2)

(1, 2) (2, 1)

(x, y) is an upper born of A ⇐⇒ (1, 2)R(x, y), (2, 1)R(x, y), (2, 2)R(x, y) and (2, 3)R(x, y)
⇐⇒ (2, 3)R(x, y)
⇐⇒ x ≥ 2 et y ≥ 3
(x, y) is a Lower born of A ⇐⇒ (x, y)R(1, 2), (x, y)R(2, 1), (x, y)R(2, 2) and (x, y)R(2, 3)
⇐⇒ (x, y)R(1, 2) and (x, y)R(2, 1)
⇐⇒ (x ≤ 1 and x ≤ 2) and (y ≤ 1 and y ≤ 2)
⇐⇒ x ≤ 1 et y ≤ 1
⇐⇒ (x, y) = (1, 1)

So,
— UppE (A) = {(x, y) ∈ N∗ × N∗ / x ≥ 2 and y ≥ 3}
— SupE (A) = (2, 3)
— GE(A) = (2, 3)
— Maximal elements : (2, 3).
— LowE (A) = {(1, 1)}
— InfE (A) = (1, 1)
— SE(A) n’existe pas.
— Minimal elements : (1, 2) and (2, 1).

Exercice 12 Let E be a nonempty set.

 1. Show that the inclusion relation in P(E)

∀ X, Y ∈ P(E), XRY ⇐⇒ X ⊂ Y

is an order relation.
— R is reflexive : ∀ X ∈ P(E), we have X ⊂ X. Thus, ∀ X ∈ P(E), we have XRX.
— R is skew-symmetric : ∀ X, Y ∈ P(E), XRY et Y RX =⇒ X ⊂ Y and Y ⊂ X =⇒
X = Y.
— R is transitive : ∀ X, Y, Z ∈ P(E), XRY et Y RZ =⇒ X ⊂ Y and Y ⊂ Z =⇒
X ⊂ Z =⇒ XRZ.
2. Show that this order is partial when E contains at least two separate elements.
If E contains at least two separate elements a and b, then this order is partial because
∃ X = {a} ∈ P(E) and Y = {b} ∈ P(E) such that X RY and Y RX.
3. Show that P(E) admits a greatest element and a smallest element for this relation.
E is the greatest element for (P(E), ⊂) because E ∈ P(E) and ∀ X ∈ P(E), we have
X ⊂ E.
∅ is the smallest element for (P(E), ⊂) because ∅ ∈ P(E) and ∀ X ∈ P(E), we have ∅ ⊂ X.
4. Let A, B ∈ P(E). Show that InfP(E) ({A, B}) = A ∩ B.
— A ∩ B is a lower born of {A, B} in P(E) because A ∩ B ⊂ A and A ∩ B ⊂ B.
— Let G be a lower born of {A, B} in P(E), then G ⊂ A and G ⊂ B, and consequently,
G ⊂ A ∩ B.
Similarly, we show that SupP(E) ({A, B}) = A ∪ B.
— A ∪ B is a upper born of {A, B} in P(E) because A ⊂ A ∪ B and B ⊂ A ∪ B.
— Soit G be a upper born of {A, B} in P(E), because A ⊂ G and B ⊂ G, and conse-
quently, A ∪ B ⊂ G.

Exercice 13 Let E 6= ∅ and (F, ≤) be a non-empty orderd set. Let Ω = {f : E −→ F application}.

we define over Ω the binary relation R by

∀ f, g ∈ Ω, f Rg ⇐⇒ (∀ x ∈ E, f (x) ≤ g(x)).

1. Show that R is an order relation over Ω :

— R is reflexive car ∀ f ∈ Ω, we have f Rf since ∀ x ∈ E, f (x) ≤ f (x) because ≤ is
reflexive.
— R is skew-symmetric because ∀ f, g ∈ Ω,

f Rg and gRf =⇒ (∀ x ∈ E, f (x) ≤ g(x)) and (∀ x ∈ E, g(x) ≤ f (x))

=⇒ ∀ x ∈ E, (f (x) ≤ g(x) et g(x) ≤ f (x))
=⇒ ∀ x ∈ E, f (x) = g(x) because ≤ is skew-symmetric
=⇒ f = g.

— R is transitive because ∀ f, g, h ∈ Ω,

f Rgand gRh =⇒ (∀ x ∈ E, f (x) ≤ g(x)) and (∀ x ∈ E, g(x) ≤ h(x))

=⇒ ∀ x ∈ E, (f (x) ≤ g(x) and g(x) ≤ h(x))
=⇒ ∀ x ∈ E, f (x) ≤ h(x) because ≤ is transitive
=⇒ f Rh.
2. Let m be a fixed element of F . We consider the application
fm : E −→ F
x 7−→ fm (x) = m.
 (a) Show that [m ge of (F, ≤) =⇒ fm ge of (Ω, R)] :
— fm ∈ Ω.
— Letı́s show that ∀ f ∈ Ω, we have f Rfm , i.e., ∀ f ∈ Ω, ∀ x ∈ E, f (x) ≤ fm (x) = m.
Let f ∈ Ω and x ∈ E then f (x) ∈ F . But m ge of (F, ≤) then f (x) ≤ m = fm (x).
So, [∀ x ∈ E, we have f (x) ≤ fm (x) = m] =⇒ f Rfm and this for all f ∈ Ω.
Thus, fm is the ge of (Ω, R).
(b) Show that [m maximal element of (F, ≤) =⇒ fm maximal element of (Ω, R)] :
Letı́s show that ∀ f ∈ Ω ; fm Rf =⇒ fm = f .
Let f ∈ Ω.

fm Rf =⇒ ∀ x ∈ E, fm (x) ≤ f (x)
=⇒ ∀ x ∈ E, m ≤ f (x)
=⇒ ∀ x ∈ E, m = f (x) (because m is a maximal element of F )
=⇒ ∀ x ∈ E, fm (x) = f (x)
=⇒ fm = f.

Exercice 14 Let Ω be the set of application from [0, 1] to R. We consider over Ω the order
relation R defined by

∀ f, g ∈ Ω, f Rg ⇐⇒ (∀ x ∈ [0, 1], f (x) ≤ g(x)).

Let f1 , f2 , f3 ∈ Ω defined respectively by f1 (x) = x, f2 (x) = x2 and


 x2 1
si 0≤x<

f3 (x) = 2
3 1
 − x if
 ≤ x ≤ 1.
2 2

∀ f, g ∈ Ω, f Rg ⇐⇒ ∀ x ∈ [0, 1], f (x) ≤ g(x).

⇐⇒ Le graphe de f is below the graph of g over [0, 1]

1. Represent graphically f1 and f2 . Do we have f1 Rf2 or f2 Rf1 ?

The graph of f2 is everywhere below the graph of f1 thus f2 Rf1 .
2. Same questions for f1 and f3 .
3 1
f1 Rf3 because ∃ x = 1 ∈ [0, 1] such that f1 (x) = 1 > f3 (x) = − 1 = . And, f3 Rf1
2 2
1 3 1 1
because ∃ y = ∈ [0, 1] such that f3 (y) = − = 1 > f1 (y) = .
2 2 2 2
3. The order R is it total ?
This order is partial because f1 and f3 are not comparable.
4. Let A = {f1 , f2 }. Is A have a greatest element ? a least upper bound ?
Since f2 Rf1 , f1 is the greatest element of A, which is also the least upper bound of A.
5. Same questions for B = {f1 , f3 }.
f3 cannot be the ge of B because f1 Rf3 , and f1 cannot be the ge of B because f3 Rf1 .
Therefore, B does not have a largest element.
On the other hand, B has a least upper bound which is the function f4 over [0, 1] defined
 by
1


 x if 0 ≤ x <
2








3 1 3

f4 (x) = − x if ≤x≤


 2 2 4





 3
x if < x ≤ 1.


4
Letı́s show hthat hf4 is an upper bound of B, i.e., f1 Rf4 and f3 Rf4 . In fact,
1
— for x ∈ 0, , f1 (x) = x ≤ f4 (x) = x and f3 (x) = x2 ≤ f4 (x) = x.
2
h1 3i 1 3 3 3
— for x ∈ , , ≤ f1 (x) = x ≤ ≤ f4 (x) = − x ≤ 1 and f3 (x) = − x ≤ f4 (x) =
2 4 2 4 2 2
3
− x.
2 i3 i 3 3
— for x ∈ , 1 , f1 (x) = x ≤ f4 (x) = x and f3 (x) = − x ≤ ≤ f4 (x) = x.
4 2 4
So, ∀ x ∈ [0, 1], f1 (x) ≤ f4 (x) and f3 (x) ≤ f4 (x). This implies f1 Rf4 and f3 Rf4 .
Now let’s show that f4 is the least upper bound of B.
Let g be an upper bound of B, then f1 Rg and f3 Rg, i.e., ∀ x ∈ [0, 1], f1 (x) ≤ g(x) and
f3 (x) ≤ g(x).
Let’s show hthat hf4 Rg.
1
— for x ∈ 0, , f4 (x) = x = f1 (x) ≤ g(x)
h1 3i2
3
— for x ∈ , , f4 (x) = − x = f3 (x) ≤ g(x).
i 23 4i 2
— for x ∈ , 1 , f4 (x) = x = f1 (x) ≤ g(x).
4
So, ∀ x ∈ [0, 1], f4 (x) ≤ g(x) thus, f4 Rg.
6. Let D = {f ∈ Ω; ∀ x ∈ [0, 1], 1 < f (x) < 2}.
D is the set of applications of Ω whose graph is strictly between the two horizontal lines
of equations y = 1 and y = 2.
(a) Show that UppΩ (D) = {g ∈ Ω; ∀ x ∈ [0, 1], g(x) ≥ 2}.
⊃ ? Let g ∈ Ω such that ∀ x ∈ [0, 1], g(x) ≥ 2. Let f ∈ D. On a ∀ x ∈ [0, 1], f (x) < 2
but 2 ≤ g(x) thus f (x) ≤ g(x). therefore, f Rg.
⊂ ? Let g be an upper bound D, i.e., ∀ f ∈ D, f Rg (i.e., ∀ f ∈ D, ∀ x ∈ [0, 1],
f (x) ≤ g(x)).
This implies that 1 < g(x), ∀ x ∈ [0, 1].
Let’s show that ∀ x ∈ [0, 1], g(x) ≥ 2.
By the absurd, suppose there is a x0 ∈ [0, 1] such that g(x0 ) < 2. Let b such that
g(x0 ) < b < 2. We have 1 < b < 2. Consider the application f defined by f (x) = b
for all x ∈ [0, 1]. We have f ∈ D but f Rg because ∃ x = x0 such that f (x) > g(x),
which contradicts the fact that g is an upper bound of D.
(b) The set D does it have a least upper bound ? a greatest element ?
SupΩ (D) = h where h(x) = 2, ∀ x ∈ [0, 1] and GEΩ (D) doesn’t exist because h 6∈ D.
(c) Determine MinΩ (D). The set D does it have a greatest lower bound ? a lowest ele-
ment ?
MinΩ (D) = {g ∈ Ω; ∀ x ∈ [0, 1], g(x) ≤ 1}, InfΩ (D) = k où k(x) = 1, ∀ x ∈ [0, 1] and
SEΩ (D) does not exist.
(d) Show that D does not have minimals elements.
Let’s show that ∀ f ∈ D, f is not a minimal element of D, i.e., let’s show ∃ g ∈ D
such that gRf and g 6= f.
Let f ∈ D, then ∀ x ∈ [0, 1], 1 < f (x) < 2. In particular 1 < f (1). Let b ∈ R such
that 1 < b < f (1). Letı́s consider the function

f (x) if x ∈ [0, 1[
g(x) =
b if x = 1

we have g ∈ D and gRf but g 6= f (because g(1) 6= f (1)).