University of Batna 2

Faculty of Mathematics and Computer Science

Departement of Mathematics

Chapter 02: Sets and Maps

By : Brahimi Mahmoud

𝐴 = {2, 3, 5, 7, 9} 𝐵 = {2, 5, 10, 11, 12}

𝐴 ∩ 𝐵 = {2, 5} 𝐴 ∪ 𝐵 = {2, 3, 5, 7, 9, 10, 11, 12} 𝐴 − 𝐵 = {3, 5, 7, 9}

Academic year 2024/2025

I. Sets
Definition
A set is a collection of elements.
We denote the set by the symbol, 𝐴, 𝐵, 𝐶, 𝐸, 𝐹, …

Examples:
 {1, 5, 8}, {𝑎, 𝑏, 𝑐, 𝑑}, {Pen, ruler, eraser}.
 {𝑥 ∈ ℝ; |𝑥 − 1| < 5}
 {𝑥 ∈ ℝ; |𝑥| < 5} = ]−5, 5[
 {𝑧 ∈ ℂ; 𝑧 3 = 1 + 𝑖}

Remarks
 The empty set, denoted ∅ which is the set containing no elements.
 If 𝑥 is an element of 𝐸 we note 𝑥 ∈ 𝐸 and 𝑥 ∉ 𝐸 otherwise.

Definitions
1) Inclusion: 𝐴 ⊂ 𝐵 if every element of 𝐴 is also an element of 𝐵. In other words:
∀𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵). We then say that 𝐴 is a subset of 𝐵 or a part of 𝐵.
 Example: {1, 2, 3} ⊂ {−1, 0, 1, 2, 3, 9}.
 Equality. 𝐴 = 𝐵 if and only if 𝐴 ⊂ 𝐵 and 𝐵 ⊂ 𝐴.

2) Set of parts: The set of parts of a set 𝐸, is the set of all possible subsets of
𝐸 including the empty set and 𝐸 itself. It is denoted by 𝒫(𝐸).
 Example: 𝐸 = {2, 5, 7}, 𝒫 (𝐸) = {∅, {2}, {5}, {7}, {2, 5}, {2, 7}, {5, 7}, {2, 5, 7} }
 The number of subsets of a set 𝐴 with 𝑛 elements is given by 2𝑛
3) Union: The union of two sets 𝐴 and 𝐵 is the set that contains all the elements that
are in either 𝐴, 𝐵, or both. It is denoted by 𝑨 ∪ 𝑩.

𝐴⋃𝐵 = {𝑥; 𝑥 ∈ 𝐴 or 𝑥 ∈ 𝐵} That’s to say ∀𝒙 ∈ 𝑨 ∪ 𝑩 ⟺ (𝒙 ∈ 𝑨)⋁(𝒙 ∈ 𝑩)

 Example: 𝑨 = {𝟏, 𝟐, 𝟑}, 𝑩 = {−𝟏, 𝟎, 𝟏, 𝟔, 𝟕}; 𝑨⋃𝑩 = {−𝟏, 𝟎, 𝟏, 𝟐, 𝟑, 𝟔, 𝟕}

4) Intersection: The intersection of two sets 𝐴 and 𝐵 is the set that contains all the
elements that are common to both sets. It is denoted by 𝑨 ∩ 𝑩.

𝐴 ∩ 𝐵 = {𝑥; 𝑥 ∈ 𝐴 and 𝑥 ∈ 𝐵} That’s to say ∀𝒙 ∈ 𝑨 ∩ 𝑩 ⟺ (𝒙 ∈ 𝑨)⋀(𝒙 ∈ 𝑩)

 Example: 𝑨 = {𝟏, 𝟐, 𝟑}, 𝑩 = {−𝟏, 𝟎, 𝟏, 𝟐, 𝟕}; 𝑨 ∩ 𝑩 = { 𝟏, 𝟐}

𝒙 ∉ 𝑨 ∪ 𝑩 ⟺ (𝒙 ∉ 𝑨)⋀(𝒙 ∉ 𝑩), 𝒙 ∉ 𝑨 ∩ 𝑩 ⟺ (𝒙 ∉ 𝑨)⋁(𝒙 ∉ 𝑩)

 5) Difference between two sets: The difference between two sets 𝐴 and 𝐵 is the set of
elements that are in 𝐴 but not in 𝐵. This is often denoted as 𝑨 − 𝑩.

𝐴 − 𝐵 = {𝑥; 𝑥 ∈ 𝐴 and 𝑥 ∉ 𝐵} That’s to say ∀𝒙 ∈ 𝑨 − 𝑩 ⟺ (𝒙 ∈ 𝑨)⋀(𝒙 ∉ 𝑩)

 Example: 𝑨 = {𝟏, 𝟐, 𝟑, 𝟕}, 𝑩 = {−𝟏, 𝟎, 𝟏, 𝟐, 𝟕}; 𝑨 − 𝑩 = {𝟑}, 𝑩 − 𝑨 = {−𝟏, 𝟎}

6) Symmetric difference: The symmetric difference of two sets 𝐴 and 𝐵 is the set of
elements that are in either of the sets, but not in their intersection. It can be denoted
as 𝑨 △ 𝑩.

𝑨 △ 𝑩 = ( 𝑨 − 𝑩) ∪ (𝑩 − 𝑨) or 𝑨 △ 𝑩 = ( 𝑨 ∪ 𝑩) − (𝑩 ∩ 𝑨)

 Example: 𝑨 = {𝟏, 𝟐, 𝟑, 𝟕}, 𝑩 = {−𝟏, 𝟎, 𝟏, 𝟐, 𝟕}; 𝑨 − 𝑩 = {𝟑}, 𝑩 − 𝑨 = {−𝟏, 𝟎}

𝑨 △ 𝑩 = {𝟑}⋃{−𝟏, 𝟎} = {−𝟏, 𝟎, 𝟑}

7) Complementary: The complement of a set 𝐴 relative to a universal set 𝐸

̅ or 𝑨𝒄
(𝑨 ⊂ 𝑬) consists of all elements in 𝐸 that are not in 𝐴. It is often denoted as 𝑨
𝑨
or 𝑪𝑬 .

𝑪𝑨𝑬 = {𝒙 ∈ 𝑬; 𝒙 ∉ 𝑨} = 𝑬 − 𝑨 that’s to say ∀𝒙 ∈ 𝑪𝑨𝑬 ⟺ (𝒙 ∈ 𝑬)⋀(𝒙 ∉ 𝑨)

 Example: 𝐸 = {−2, 7,8, 11, 16, 20}, 𝐴 = {−2, 16}, 𝐴̅ = 𝐶𝐸𝐴 = {7,8, 11, 20}

8) Cartesian product: The Cartesian product, denoted 𝐴 × 𝐵, is the set of pairs

(𝑥, 𝑦) where 𝑥 ∈ 𝐴 and 𝑦 ∈ 𝐵.

 Example: 𝐴 = {1, 3}, 𝐵 = { 2, 7}: 𝐴 × 𝐵 = {(1, 2), (1, 7), (3, 2), (3, 7)}

̅ , 𝑨 ∪ 𝑩, 𝑨 ∩ 𝑩, 𝑨 − 𝑩 𝒂𝒏𝒅 𝑩 − 𝑨
𝑪𝑨𝑬 = 𝑨

Properties
Let 𝐴, 𝐵, 𝐶 be parts of a set 𝐸, we have the following properties:
1) 𝐴∩𝐵 =𝐵∩𝐴
2) 𝐴∪𝐵 =𝐵∪𝐴
3) 𝐴 ∩ (𝐵 ∩ 𝐶) = (𝐴 ∩ 𝐵) ∩ 𝐶 = 𝐴 ∩ 𝐵 ∩ 𝐶
4) 𝐴 ∩ ∅ = ∅, 𝐴 ∪ ∅ = 𝐴
5) 𝐴 ∩ 𝐴 = 𝐴, 𝐴 ∪ 𝐴 = 𝐴
6) 𝐴 ⊂ 𝐵 ⟺ 𝐴 ∩ 𝐵 = 𝐴 and 𝐴 ∪ 𝐵 = 𝐵
 7) 𝐴 ∪ (𝐵 ∪ 𝐶) = (𝐴 ∪ 𝐵) ∪ 𝐶 = 𝐴 ∪ 𝐵 ∪ 𝐶
8) 𝐴 ∩ (𝐵 ∪ 𝐶) = (𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶)
9) 𝐴 ∪ (𝐵 ∩ 𝐶) = (𝐴 ∪ 𝐵) ∩ (𝐴 ∪ 𝐶)
10) 𝐴̿ = 𝐴
11) 𝐴 ⊂ 𝐵 ⟺ 𝐵̅ ⊂ 𝐴̅
12) ̅̅̅̅̅̅̅
𝐴 ∩ 𝐵 = 𝐴̅ ∪ 𝐵̅
13) ̅̅̅̅̅̅̅
𝐴 ∪ 𝐵 = 𝐴̅ ∪ 𝐵̅

II. Maps
Definition
A map 𝑓 ∶ 𝐸 → 𝐹, is a relation between two sets 𝐸, 𝐹, for which each element 𝐸 is linked
to a unique element 𝐹 denoted 𝑓 (𝑥).
𝑓: 𝐸 ⟶ 𝐹, 𝑥 ⟼ 𝑓(𝑥)

Example: 𝑓: ℝ ⟶ ℝ, 𝑥 ⟼ 𝑓(𝑥) = 𝑒 𝑥
Definitions
1) Equality: Two maps 𝑓 , 𝑔 ∶ 𝐸 → 𝐹 are equal if and only if
∀𝑥 ∈ 𝐸, 𝑓 (𝑥) = 𝑔(𝑥), we then denote 𝑓 = 𝑔.
2) The graph of 𝑓 ∶ 𝐸 → 𝐹 is the set Γ𝑓 where Γ𝑓 = {(𝑥, 𝑓(𝑥)) ∈ 𝐸 × 𝐹; 𝑥 ∈ 𝐸}.

3) Composition: Let 𝑓 ∶ 𝐸 → 𝐹 and 𝑔 ∶ 𝐹 → 𝐺 then 𝑔 ∘ 𝑓 ∶ 𝐸 → 𝐺 is the map

defined by 𝑔 ∘ 𝑓(𝑥) = 𝑔(𝑓(𝑥)).

 Example: If 𝑓, 𝑔: ℝ ⟶ ℝ, 𝑓(𝑥) = 2𝑥 − 3, 𝑔(𝑥) = 3𝑥 + 2 then

𝑓 ∘ 𝑔(𝑥) = 𝑓(𝑔(𝑥)) = 𝑓(3𝑥 + 2) = 2(3𝑥 + 2) − 3 = 6𝑥 + 1
𝑔 ∘ 𝑓(𝑥) = 𝑔(𝑓(𝑥)) = 𝑔(2𝑥 − 3) = 3(2𝑥 − 3) + 2 = 6𝑥 − 7
𝑓 ∘ 𝑓(𝑥) = 𝑓(𝑓(𝑥)) = 𝑓(2𝑥 − 3) = 2(2𝑥 − 3) − 3 = 4𝑥 − 15
 4) Restriction: Let 𝑓 ∶ 𝐸 → 𝐹 and 𝐴 ⊂ 𝐸 then the restriction of 𝑓 to 𝐴 is the map
𝑓|𝐴 where 𝑓|𝐴 ∶ 𝐴 ⟶ 𝐹, 𝑥 ⟼ 𝑓(𝑥).

5) Extension: Let 𝑓 ∶ 𝐴 → 𝐹 and 𝐴 ⊂ 𝐸, we call extension of 𝑓 to a map 𝑔: 𝐸 ⟶ 𝐹

such that 𝑔|𝐴 = 𝑓, that’s to say 𝑔(𝑥) = 𝑓(𝑥) if 𝑥 ∈ 𝐴.

6) Identify map: The identity map is defined by id𝐸 ∶ 𝐸 → 𝐸, id𝐸 (𝑥) = 𝑥.

Injection, surjection, bijection

Definitions
Let 𝐸, 𝐹 be two sets and 𝑓 ∶ 𝐸 → 𝐹 be a map.
1) We say that 𝑓 is injective if for all 𝑥1 , 𝑥2 ∈ 𝐸 with , 𝑓(𝑥1 ) = 𝑓(𝑥2 ) then 𝑥1 = 𝑥2 ,
that's to say: ∀𝒙𝟏 , 𝒙𝟐 ∈ 𝑬, 𝒇(𝒙𝟏 ) = 𝒇(𝒙𝟐 ) ⟹ 𝒙𝟏 = 𝒙𝟐 .

 Examples: The map 𝑓: ℝ ⟶ ℝ, 𝑓(𝑥) = 5𝑥 + 6 is injective.

The map 𝑔: ℝ ⟶ ℝ, 𝑔(𝑥) = 𝑥 2 is not injective.

2) We say that 𝑓 is surjective if, for all 𝑦 ∈ 𝐹 there exists 𝑥 ∈ 𝐸 such that 𝑦 = 𝑓(𝑥)
That’s to say: ∀𝒚 ∈ 𝑭, ∃𝒙 ∈ 𝑬; 𝒚 = 𝒇(𝒙).

 Examples: The map 𝑓: ℝ ⟶ ℝ, 𝑓(𝑥) = 5𝑥 + 6 is surjective.

The map 𝑓: ℝ ⟶ ℝ+ , 𝑓(𝑥) = 𝑥 2 is surjective.

3) We say that 𝑓 is bijective if it is injective and surjective, this is equivalent to: for all
𝑦 ∈ 𝐹 there exists a unique 𝑥 ∈ 𝐸 such that 𝑦 = 𝑓 (𝑥).
That’s to say: ∀𝒚 ∈ 𝑭, ∃! 𝒙 ∈ 𝑬; 𝒚 = 𝒇(𝒙).
 6
 Example: The map 𝑓: ]− 5 , +∞[ ⟶ ℝ, 𝑓(𝑥) = ln(5𝑥 + 6) is bijective.

Proposition
Let 𝐸, 𝐹 be two sets and 𝑓 ∶ 𝐸 → 𝐹 be a map.

 The map 𝑓 is bijective if and only if there exists an application 𝑔: 𝐹 ⟶ 𝐸 such that
𝒇 ∘ 𝒈 = 𝐢𝐝𝑭 and 𝒈 ∘ 𝒇 = 𝐢𝐝𝑬 .

 If 𝑓 is bijective then the map 𝑔 is unique and it is also bijective. The map 𝑔 is called
the reciprocal bijection of 𝑓 and is denoted 𝒇−𝟏.

3
Example: 𝑓: ]2 , +∞[ ⟶ ℝ, 𝑓(𝑥) = ln(2𝑥 − 3)

Show that 𝑓 is a bijective map and find 𝑓 −1 the reciprocal bijection of 𝑓.

Direct image, reciprocal image

Definitions
Let 𝐸, 𝐹 be two sets.
1) Let 𝐴 ⊂ 𝐸 and 𝑓: 𝐸 ⟶ 𝐹 a map, the direct image of 𝐴 by 𝑓 is the set 𝒇(𝑨) such
that:
𝒇(𝑨) = {𝒇(𝒙); 𝒙 ∈ 𝑨} i.e 𝒚 ∈ 𝒇(𝑨) ⟺ 𝒚 = 𝒇(𝒙); 𝒙 ∈ 𝑨.

Example: 𝑓: ℝ ⟶ ℝ, 𝑓(𝑥) = 𝑥 2 + 1, 𝐴 = {−1, 0, 1}, 𝑓(𝐴) = {0, 2}

2) Let 𝐵 ⊂ 𝐸 and 𝑓: 𝐸 ⟶ 𝐹 a map, reciprocal image of 𝐵 by 𝑓 is the set 𝒇−𝟏 (𝑩) such
that:
𝒇−𝟏 (𝑩) = {𝒙 ∈ 𝑬; 𝒇(𝒙) ∈ 𝑩} i. e 𝒙 ∈ 𝒇−𝟏 (𝑩) ⟺ 𝒇(𝒙) ∈ 𝑩.

Example: 𝑓: ℝ ⟶ ℝ, 𝑓(𝑥) = 𝑥 2 + 1, 𝐵 = {1, 3}

𝑓 −1 (𝐵) = {𝑥 ∈ ℝ; 𝑓(𝑥) ∈ 𝐵} ⟹ 𝑓 −1 (𝐵) = {−√2, 0, √2}