Pr.

Lebri Nemira
Applied Mathematics Laboratory,
Department of Mathematics,
Setif 1-University, 19000, Algeria.

Chapter 2

Sets, relations and maps:

‫ العــالقــات و التـطـبـيـقــات‬،‫المـجـمــوعــات‬
 I. SETS ‫المـجـمــوعــات‬
Definitions:
1. A set is the mathematical model for a collection of different things; we denote it
with capital letters: A, B, C, D, E…
2. A set contains elements or members, we denote it with minuscule letters: a, b, c,
d, e…
3. The relation between a set and it elements is a belonging relation which means
the element either belongs to the set,
If B is a set and x is an element of B, this is written in shorthand as x ∈ B, which can also be
read as "x belongs to B", or "x is in B". The statement "y is not an element of B" is written as
y ∉ B, which can also be read as "y is not in B" .
4. The set either denoted by mentioning all of its elements, or by mentioning the
propriety that unites these elements.

Example:
A = {-2, -1, 0, 1, 2} = {𝑥 ∈ ℤ: |𝑥| ≤ 2}
5. The empty set (or null set) is the unique set that has no elements. It is
denoted ∅ or { }.
The relation between sets:
1. The inclusion: we say that B includes A if every element 𝑥 from A belongs to the set B,
we write: A⊂B which means:
𝐴 ⊂ 𝐵 ⇔ (∀𝑥: 𝑥 ∈ 𝐴 ⟹ 𝑥 ∈ 𝐵)

Note: To approve that A⊄B it is enough to find an element 𝑥 from A that not belongs to
the set B.

Result: The empty set is a subset of every set, and every set is a subset of itself:

∅ ⊆ A , A ⊆ A.
2. The equality: If the set A is a sub from the set B, and the set B a sub from the set A in this
case we say that A and B are equal, we write A=B which means:
𝐴 = 𝐵 ⇔ (𝐴 ⊂ 𝐵 ∧ 𝐵 ⊂ 𝐴)
Basic operation:
Given any two sets A and B,

 their union is the set of all things that are members of A or B or both, we denoted
A∪B.

A ∪ B = {𝑥: 𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵}
 their intersection is the set of all things that are members of both A and B, we
denoted A ∩ B . If A ∩ B = ∅, then A and B are said to be disjoint.

Properties:

A ∩ B = {𝑥: 𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵}

A∩B⊂𝐴∧A∩B⊂B

𝐴⊂A∪B∧B⊂A∪B

A∩A=A ∪A=A

A∪∅=A∧A∩∅=∅

𝐴∪𝐵=𝐵∪𝐴∧𝐴∩𝐵=𝐵∩A

Which means union and intersection are commutative operations:

(𝐴 ∪ 𝐵) ∪ 𝐶 = 𝐴 ∪ (𝐵 ∪ 𝐶) ∧ (𝐴 ∩ 𝐵) ∩ 𝐶 = 𝐴 ∩ (𝐵 ∩ 𝐶)

Which means union and intersection are associative operations:

𝐴 ∩ (𝐵 ∪ 𝐶) = (𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶) ∧ 𝐴 ∪ (𝐵 ∩ 𝐶) = (𝐴 ∪ 𝐵) ∩ (𝐴 ∪ 𝐶)

And union distributes over the intersection and vice versa.

 The set difference is the set of all things that belong to A but not B. Especially
when B is a subset of A, we denoted A \ B (also written A − B).

A − B = {𝑥: 𝑥 ∈ 𝐴 ∧ 𝑥 ∉ 𝐵}

 The symmetric difference is the set of all things that belongs to 𝐴 ∪ 𝐵 and not
belongs to 𝐴 ∩ 𝐵, we denoted A Δ B .

A∆B = (A − B) ∪ (𝐵 − 𝐴) = (𝐴 ∪ 𝐵) − (𝐴 ∩ 𝐵)

Properties:

𝐴 − (𝐴 − 𝐵) = 𝐴 ∩ 𝐵

𝐴−𝐵=∅⇔𝐴⊂𝐵

𝐴−𝐴=∅

𝐴∆(𝐵∆𝐶) = (𝐴∆𝐵)∆𝐶

𝐴∆∅ = ∅∆𝐴 = 𝐴 ∧ 𝐴∆𝐴 = ∅

 A∆B = B∆A

The complement:

Let be E a set and A is a subset of E.

The complement of A is the set of all elements of E that not belongs to the A, we denoted A c or
CEA, we write:

𝐶𝐸𝐴 = {𝑥: 𝑥 ∈ 𝐸 ∧ 𝑥 ∉ 𝐴}

Properties:

𝐶𝐸 (𝐶𝐸𝐴) = 𝐴

𝐶 𝐸𝐸 = ∅ ∧ 𝐶𝐸∅ = 𝐸

𝐴 ⊂ 𝐵 ⇔ 𝐶 𝐸𝐵 ⊂ 𝐶𝐸 𝐴

𝐶𝐸 (𝐴 ∩ 𝐵) = 𝐶𝐸𝐴 ∪ 𝐶𝐸𝐵 ∧ 𝐶𝐸 (𝐴 ∪ 𝐵) = 𝐶𝐸𝐴 ∩ 𝐶𝐸B

Subsets of a Set:
Let be E a set, then the set that contains all the subsets of E called subsets of a set E, we
denoted 𝒫(𝐸), which means:
𝒫(𝐸) = {𝑋: 𝑋 ⊂ 𝐸}

Example:

𝐸 = {𝑎, 𝑏, 𝑐}

𝒫(𝐸) = {∅, 𝐸,{𝑎},{𝑏},{𝑐},{𝑎, 𝑏},{𝑎, 𝑐},{𝑏, 𝑐}}

Note: subsets of a set is not empty ((𝐸)≠ ∅) because it contains at least the empty set.

The Cartesian product:

The Cartesian product of two sets E, F we denoted E ×F is the set of all ordered pairs (x,
y) where x is in E and y is in F which means:
𝐸 × 𝐹 = {(𝑥, 𝑦): 𝑥 ∈ 𝐸 and 𝑦 ∈ 𝐹}

Note: the Cartesian product is not commutative which means: 𝐸 × 𝐹 ≠ 𝐹 × 𝐸 and in case
of equality:
𝐸×𝐹=𝐹×𝐸⇔𝐸=𝐹

Properties:
𝐴⊂𝐸∧𝐵⊂𝐹⇔𝐴×𝐵⊂𝐸×𝐹
𝐴 × (𝐵 ∪ 𝐶) = (𝐴 × 𝐵) ∪ (𝐴 × 𝐶) ∧ 𝐴 × (𝐵 ∩ 𝐶) = (𝐴 × 𝐵) ∩ (𝐴 × 𝐶)
 𝐴×𝐵=∅⇔𝐴=∅∨𝐵=∅
𝐴×𝐵≠∅⇔𝐴≠∅∧𝐵≠∅
Note: if we have 𝐸 = 𝐹 then we put: 𝐸 × 𝐹 = 𝐸 × 𝐸 = 𝐸2

Generalization:
The Cartesian product can be generalized to a finite number of sets, if we have 𝐸1, 𝐸2 …,
𝐸n then:
∏𝑛𝑖=1 Ei= 𝐸1 × 𝐸2 × … × 𝐸𝑛 = {(𝑥1, 𝑥2, … , 𝑥𝑛 ): 𝑥1 ∈ 𝐸1 and 𝑥2 ∈ 𝐸2 … ∧ 𝑥𝑛 ∈ 𝐸𝑛 }

Cardinality:
The cardinality of a set E is the number of members of E, we denoted Card(E).
If Card(E) was infinite we say that E is infinite, and if Card(E) was not infinite we say
that E is not infinite.
Properties:
Card(A∪ 𝐵) = Card(A) + Card(B) − Card(A ∩ 𝐵)
Card(A × 𝐵) = Card(A) × Card(B)
𝐴 ⊂ 𝐵 ⟹ Card(A) < Card(B)
Card(A) = 𝑛 ⟹ Card (𝒫(𝐴)) = 2𝑛
II Relations: ‫العــالقــات‬
Definition:
Given a set X, a relation G over X is a set of ordered pairs of elements from X, formally: G ⊆ {(x,y):
x,y ∈ X}.
The statement (x, y) ∈ R reads "x is R-related to y" and is written as xℜy.

Example:
Let be ℜ a relation defined with:
∀𝑥, 𝑦 ∈ ℝ: 𝑥ℜ𝑦 ⇔ 𝑥 + 𝑦 = 0
then: G = {(𝑥, −𝑥)\𝑥 ∈ ℝ}
Properties of relations:
Some important properties that a relation ℜ over a set 𝐸 may have are:
Reflexive :
for all 𝑥 ∈ E, 𝑥ℜ𝑥. For e𝑥ample, “≥” is a reflexive relation but “>” is not.
Symmetric :
for all 𝑥, 𝑦 ∈ 𝐸, if 𝑥ℜ𝑦 then 𝑦ℜ𝑥 (∀𝑥, 𝑦 ∈ 𝐸: 𝑥ℜ𝑦 ⟹ 𝑦ℜ𝑥).
Antisymmetric :
for all 𝑥, 𝑦 ∈ 𝐸, if 𝑥ℜ𝑦 and 𝑦ℜ𝑥 then 𝑥 = 𝑦, which means:
∀𝑥, 𝑦 ∈ 𝐸: 𝑥ℜ𝑦 ∧ 𝑦ℜ𝑥 ⟹ 𝑥 =𝑦.
For example, “≥” is an antis𝑦mmetric relation.
Transitive :
for all 𝑥, 𝑦, z ∈ 𝐸, if 𝑥ℜ𝑦 and 𝑦ℜz then 𝑥ℜz , which means:
∀𝑥, 𝑦 ∈ 𝐸: 𝑥ℜ𝑦 ∧ 𝑦ℜ𝑧 ⟹ 𝑥ℜ𝑦
Example:
Let be 𝐸 ≠ ∅ and 𝒫 (𝐸) sub-sets of the set 𝐸 we defined the relation ℜ with:
∀𝐴, 𝐵 ∈ 𝒫 (𝐸): 𝐴ℜ𝐵 ⇔ 𝐴 ⊆ B
1. ℜ is reflexive relation:
∀𝐴 ∈ 𝒫(𝐸): 𝐴ℜ𝐴 ⇔ 𝐴 ⊆ 𝐴
2. ℜ is an antisymmetric relation:
∀𝐴, 𝐵 ∈ 𝒫(𝐸): 𝐴ℜ𝐵 ∧ 𝐵ℜ𝐴 ⟹ 𝐴 = 𝐵?
𝐴ℜ𝐵 ⇔ 𝐴 ⊆ 𝐵 … … … (1)
𝐵ℜ𝐴 ⇔ 𝐵 ⊆ 𝐴 … … … (2)
from (1) and (2): 𝐴 = 𝐵
3. ℜ is a transitive relation because the inclusion is transitive:
∀𝐴, 𝐵, 𝐶 ∈ 𝒫(𝐸): 𝐴ℜ𝐵 ∧ 𝐵ℜ𝐶 ⟹ 𝐴ℜ𝐶?
𝐴ℜ𝐵 ⇔ 𝐴 ⊆ 𝐵 … … … (1)
𝐵ℜ𝐶 ⇔ 𝐵 ⊆ 𝐶 … … … (2)
from (1) and (2): 𝐴 ⊆ 𝐵 ⊆ 𝐶 then 𝐴 ⊆ 𝐶 so 𝐴ℜ𝐶
Equivalence Relation:
Definition:
A binary relation ℜ defined over a set E is an equivalence relation if and only if it is
 ℜ reflexive.
  ℜ symmetric.

 ℜ transitive.

Example1:
Let be ℜ a relation defined :
∀𝑥, 𝑦 ∈ ℝ ∶ 𝑥ℜ𝑦 ⇔ 𝑥2 − 𝑥 = 𝑦2 – 𝑦
this is an equivalence relation because:
 ℜ is reflexive:
∀𝑥 ∈ ℝ ∶ 𝑥2 − 𝑥 = 𝑥2 – 𝑥.
 ℜ is symmetric :
∀𝑥, 𝑦 ∈ ℝ ∶ 𝑥ℜ𝑦 ⟹ 𝑦ℜ𝑥?
𝑥ℜ𝑦 ⇔ 𝑥2 − 𝑥 = 𝑦2 − 𝑦 ⇔ 𝑦2 − 𝑦 = 𝑥2 − 𝑥
⇔ 𝑦ℜ𝑥
 ℜ is transitive:
∀𝑥, 𝑦, 𝑧 ∈ ℝ ∶ 𝑥ℜ𝑦 ∧ 𝑦ℜ𝑧 ⟹ 𝑥ℜ𝑧?
𝑥ℜ𝑦 ⇔ 𝑥2 − 𝑥 = 𝑦2 − 𝑦 … … . (1)
𝑦ℜ𝑧 ⇔ 𝑦2 − 𝑦 = 𝑧2 − 𝑧 … … . (2)
By collecting (1) and (2) we find:
𝑥2 − 𝑥 = 𝑧2 − 𝑧 ⇔ 𝑥ℜ𝑧
Example2:
Over the set ℤ set of integers we defined the relation:
𝑥ℜ𝑦 ⇔ ∃𝑘 ∈ ℤ: 𝑥 − 𝑦 = 3𝑘

We approve that it is an equivalence relation:

 ℜ is reflexive:

∀𝑥 ∈ ℤ: 𝑥ℜ𝑥?

∀𝑥 ∈ ℤ: 𝑥 − 𝑥 = 0 = 3 × 0

 ℜ is symmetric :
∀𝑥, 𝑦 ∈ ℤ: 𝑥ℜ𝑦 ⟹ 𝑦ℜ𝑥?

𝑥ℜ𝑦 ⇔ ∃𝑘 ∈ ℤ: 𝑥 − 𝑦 = 3k ⇔ (𝑦 − 𝑥) = −3𝑘 = 3𝑘′ / 𝑘′=−𝑘∈ ℤ

⇔ 𝑦ℜ𝑥

 ℜ is transitive:
∀𝑥, 𝑦, 𝑧 ∈ ℤ: 𝑥ℜ𝑦 ∧ 𝑦ℜ𝑧 ⟹ 𝑥ℜ𝑧?

𝑥ℜ𝑦 ⇔ ∃𝑘 ∈ ℤ: 𝑥 − 𝑦 = 3k … … . (1)

𝑦ℜ𝑧 ⇔ ∃𝑘′ ∈ ℤ: 𝑦 − 𝑧 = 3𝑘′ … … . (2)

By collecting (1) and (2) we find:
𝑥 − 𝑦 + 𝑦 − 𝑧 = 3𝑘 + 3𝑘′ = 3(𝑘 + 𝑘′) = 3𝑘′′

𝑥 − 𝑧 = 3𝑘′′ (𝑘′′ ∈ ℤ) ⇔ 𝑥ℜ𝑧

Equivalence class:
Formally, given a set E and an equivalence relation ℜ over E, the equivalence class of an
element a in E denoted by [a] is the set:
[a] = {𝑥 ∈ S: 𝑥 ℜ a}

Order Relation:
Definition:
A binary relation ℜ defined over a set E is an order relation if and only if it is
 ℜ reflexive.

 ℜ antisymmetric.

 ℜ transitive.

Example:
1. (ℝ, ≤) is an order relation.
2. Let be E a set, ((𝐸), ⊂) is an order relation.

Partial-order relation and Total-order relation:

1. A relation over a set A is called a Total order relation if it is an order relation and
for all two elements from the set A, 𝑥,𝑦∈ A are comparable, which means::
∀𝑥,𝑦 ∈ 𝐸: 𝑥 ℜ 𝑦 ∨ 𝑦 ℜ 𝑥
Otherwise, the relation ℜ it is a partial ordering.
Example:
a. (ℝ, ≤) is a total order relation because it is obvious that any two numbers can be
compared with the relation ≤.
b. (𝒫(𝐸), ⊂) is a partial-order relation because there is 𝐴, 𝐵 ∈𝒫(𝐸) where: 𝐴⊄𝐵 ∧ 𝐵⊄𝐴
For example:
𝐸 ={𝑎, 𝑏, 𝑐}, 𝒫(𝐸)={∅, {𝑎}, {𝑏}, {𝑐}, {𝑏, 𝑐}, {𝑎, 𝑐}, {𝑎, 𝑏}, {𝑎, 𝑏, 𝑐}}
(𝐸, ⊂) is a partial-order relation because: {𝑎} ⊄ {b, c} ∧ {b, c} ⊄ {a}
 III- Maps: ‫التـطـبـيـقــات‬

Definition:

A mapping from a set E to a set F is a binary relation on E×F which associates each element of E with
exactly one element of F.
In other words:
𝑓 is a map ⇔ ∀𝑥 ∈ E; ∃! 𝑦 ∈ F: 𝑦 = 𝑓 (𝑥)
Example:
Let be the two maps:

𝑓: ℝ ⟶ ℝ and g: ℝ+ ⟶ ℝ+

𝑥 ⟼ 2𝑥 + 1 𝑥 ⟼ √𝑥
The graph of a map:

Let 𝑓: E⟶F be a map

So the set:
G = {(𝑥, 𝑦) ∈ 𝐸 × 𝐹: (𝑥) = 𝑦} ⊂ 𝐸 × F
Is called the graph of the map 𝑓.
Definitions:
Let be 𝑓: E⟶F and: g: E′⟶F′
1. if E=F and ∀ 𝑥∈E: 𝑓(𝑥) = 𝑥 then this map is called the identity map, we denote it Id E
then 𝑓= IdE.
2. if : ∀ 𝑥 ∈ 𝐸: 𝑓(𝑥) = C / C is a constant, then this map is called the constant map.
3. if E=E′ and F=F′ and ∀𝑥∈ 𝐸: 𝑓(𝑥) = g(𝑥) in this case we say that 𝑓 equal g and we
write 𝑓≡ g.
4. let A⊂E, the restriction of 𝑓 to A is the mapping 𝑓/A: ∀𝑥 ∈ 𝐴: 𝑓/A (𝑥) -=𝑓(𝑥).
The composite mapping:
Let 𝑓: E→F and g: F→G be two maps, such that the domain of g is the same set as the
codomain of 𝑓.
The composite mapping g∘𝑓 is defined as:
∀ 𝑥∈E: (g∘𝑓) (𝑥): =g (𝑓 (𝑥))
Eg: let be two maps:
𝑓: ℝ ⟶ ℝ and g: ℝ ⟶ ℝ
𝑥 ⟼ 𝑥2 𝑥⟼𝑥−5
The two maps 𝑔𝑜𝑓, 𝑓𝑜𝑔 can be defended from set ℝ to set ℝ by:
(𝑔𝑜𝑓)(𝑥) =g (f(𝑥)) =g (𝑥2) = 𝑥2 – 5
(𝑓𝑜𝑔)(𝑥) = g (f(𝑥)) = 𝑓 (𝑥 − 5) = (𝑥 − 5)2
We notice that: 𝑔𝑜𝑓≠𝑓𝑜𝑔
Note:
If it was E=F in this case we denote 𝑓𝑜𝑓 with 𝑓2 then 𝑓2= 𝑓𝑜𝑓.
The classes of maps:
The injective map:
A map 𝑓: E → F is an injective map, injection, if every element 𝑦 of F is the image of at most
one element 𝑥 of E. A map is an injective map which means:
∀𝑥1, 𝑥2 ∈ 𝐸: 𝑥1 ≠ 𝑥2 ⟹ 𝑓 (𝑥1) ≠ 𝑓 (𝑥2)

Or:
∀𝑥1, 𝑥2 ∈ 𝐸: 𝑓 (𝑥1) = 𝑓 (𝑥2) ⟹ 𝑥1 = 𝑥2
Note: to approve that 𝑓 is not an injection it`s enough to find two elements 𝑥1, 𝑥2 from E such
𝑥1≠𝑥2 and 𝑓 (𝑥1) = (𝑥2)
Example 1: let be:
𝑓: ℝ ⟶ ℝ
𝑥⟼𝑥−1

This map is an injection because:

∀𝑥1, 𝑥2 ∈ ℝ: 𝑓 (𝑥1) = 𝑓 (𝑥2) ⟹ 𝑥1 − 1 = 𝑥2 − 1 ⟹ 𝑥1 = 𝑥2
Example 2:
𝑓: ℝ ⟶ ℝ
2
𝑥 ⟼ 𝑒𝑥
This map is not an injection because:
𝑒 = 𝑓 (−1) = 𝑓 (1) but 1 ≠ −1
The surjection map:
A map 𝑓: E → F is a surjective map, or just a surjection if every element 𝑦 of F is the
image of at least one element 𝑥 of E which means:
∀𝑦 ∈ 𝐹; ∃𝑥 ∈ 𝐸: 𝑓 (𝑥) = y
Note: to approve that a map is not a surjection it is enough to find y from F that has no
precedent x from E so the proof here with the counter-example.
Example 1:
𝑓: ℝ*⟶ ℝ
1
𝑥 ⟼𝑥

It is not a surjection map because y = 0 from F that has no precedent x in E.

Example 2:
𝑓:]0, +∞ [ ⟶ ℝ
𝑥 ⟼ 𝑙𝑛x
It is a surjection because:
∀𝑦 ∈ ℝ; ∃𝑥 ∈ ]0, +∞ [: 𝑦 = 𝑙𝑛x
The bijection map:
A map 𝑓: E → F is a bijection if it is a surjective and an injective which means:
∀𝑦 ∈ 𝐹; ∃! 𝑥 ∈ 𝐸: 𝑓(𝑥) = 𝑦
Example 1:
𝑠𝑖𝑛: ℝ ⟶ ℝ
It is not a bijection because:
𝑥1 = 0, 𝑥2 = 𝜋; 𝑥1 ≠ 𝑥2
Instead that we have:
sin(𝑥1) = 𝑠𝑖𝑛(𝑥2) = 0
Therefore, it is not a bijection, but the application defined is as follows

𝜋𝜋
𝑠𝑖𝑛: [− 2 , 2 ] → [−1,1] Is a bijection.

Example 2: let be:

𝑓: ℝ+ ⟶ ℝ+

𝑥 ⟼ √𝑥
This map is a bijection because:
∀𝑦 ∈ ℝ+; ∃! 𝑥 =𝑦 2 ∈ ℝ+: 𝑦 = √𝑥
The inverse mapping:
Let 𝑓: E→F and g: F→E be two maps.
Such as:
g∘𝑓=IE and 𝑓∘g=IF.
Then:
g is the inverse mapping of 𝑓 we denoted 𝑓-1
f is the inverse mapping of g we denoted g-1
Theorem:
Let 𝑓: E→F be map.
If f is bijective then it has an inverse mapping.
Example: Let 𝑓 be a map such as:
𝑓: ℝ ⟶ ℝ
𝑥 ↦ 𝑥3 – 1
It is a bijection (the student must approve it) therefore it has an inverse mapping we can
find it by put
y= 𝑓 (𝑥)
3
⇔ y= 𝑥3 – 1 ⇒ 𝑥= √𝑥 + 1
In the end we write:
𝑓-1: ℝ ⟶ ℝ

𝑥 ↦ 3√(𝑥 + 1)

The direct image:

1. The image of a mapping 𝑓: E→F is the set:
Img(𝑓)= {𝑦 ∈F: ∃ 𝑥 ∈E: 𝑓 (𝑥)=𝑦} = {𝑓(𝑥): 𝑥 ∈ E}
Let A⊂E:
2. We called this set: 𝑓(𝐴) = {𝑓(𝑥): 𝑥 ∈ 𝐴} the direct image of the set A.
Result:
Img𝑓= F ⇔ 𝑓 is surjective.
Example:
𝑓: ℝ ⟶ ℝ
𝑥⟼2–𝑥
1
Find the direct image of the set A= [0, 2]
1
𝑓 (𝐴) = { 𝑓 (𝑥): 𝑥 ∈ [0, ]}
2

We have:
 1 3 3
0 ≤ 𝑥 ≤2⇒2≤ 2 − 𝑥 ≤ 2 ⇒ 𝑓 (𝐴) = [2, 2]

5.the inverse image:

Let B⊂F we called this set: 𝑓−1(𝐵) = {𝑥 ∈ 𝐸: 𝑓(𝑥) ∈ 𝐵} the inverse image of the set B.
Example:
Let be the map:
𝑓: ℝ ⟶ ℝ
𝑥 ⟼ (𝑥 − 1)2
find the inverse image of these sets:
𝐴 = {0}, 𝐵 = ]0,1[.
𝑓−1(𝐴) = {𝑥 ∈ ℝ: 𝑓(𝑥) = 0} = {1}.
𝑓−1(𝐵) = {𝑥 ∈ ℝ: 𝑓(𝑥) ∈ 𝐵} = {𝑥 ∈ ℝ: 0 < (𝑥 − 1)2 < 1}.

Solve of the inequality:

0 < (𝑥 − 1)2 < 1
⟹ 0 < (𝑥 − 1)2 < 1 ⟹ (𝑥 − 1)2 > 0 ∧ (𝑥 − 1)2 − 1 < 0
⟹ (𝑥 − 1)2 > 0 ∧ 𝑥 (𝑥 − 2) < 0
⟹ 𝑥 ≠ 1 ∧ 𝑥 ∈ ]0,2[
⟹ 𝑥 ∈ ]0,1[ ∪ ]1,2[
Then: 𝑓−1(𝐵)= ]0,1[∪]1,2[.
Theorems:
Let 𝑓: E⟶F be a map, we have A, 𝐴′ two sets from E and B, B′ two sets from F then:
A ⊂ A′ ⟹ 𝑓 (𝐴) ⊂ (A′)
𝑓(𝐴 ∪ 𝐴′) = 𝑓(𝐴) ∪ 𝑓(𝐴′)
𝑓(𝐴 ∩ 𝐴′) ⊂ 𝑓(𝐴) ∩ 𝑓(𝐴′)
In the last relation if the map is an injection, then the equality is right (the student must
approve it)
B ⊂ B′ ⟹ 𝑓−1(𝐵) ⊂ 𝑓−1(B′)
𝑓−1(𝐵 ∪ 𝐵′) = 𝑓−1(𝐵) ∪ 𝑓−1(𝐵′)
𝑓−1(𝐵 ∩ 𝐵′) = 𝑓−1(𝐵) ∩ 𝑓−1(𝐵′)
𝑓−1(𝐶𝐹𝐵) = 𝐶𝐸𝑓−1(𝐵)