MATH

SETS & FUNCTIONS

Grade 10 | Topic 5

SETS
A set is a well-defined collection of objects with common
SETS 𝐴 = {1, 2, 3, 4, … }
properties and is denoted by capital letters.
The union of two sets 𝐴 and 𝐵 , denoted by 𝐴 Ս 𝐵 , is the set 𝐴 Ս 𝐵 = {𝑥|𝑥 ∈ 𝐴 𝑜𝑟 𝑥 ∈ 𝐵 𝑜𝑟 𝑥 ∈
UNION OF SETS
containing elements which either belong to 𝐴 or to 𝐵 or to both. 𝐴 𝑎𝑛𝑑 𝐵 𝑏𝑜𝑡ℎ}
INTERSECTION The intersection of two sets 𝐴 and 𝐵, denoted by 𝐴 Ո 𝐵, is the
𝐴 Ո 𝐵 = {𝑥|𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥 ∈ 𝐵}
OF SETS set of common elements of both 𝐴 and 𝐵.
DIFFERENCE OF The set difference of 𝐴 and 𝐵, denoted by 𝐴 − 𝐵, is the set of all
𝐴 − 𝐵 = {𝑥|𝑥 ∈ 𝐴 𝑥 ∉ 𝐵}
SETS those elements of 𝐴 that do not belong to 𝐵 .
The complement of a set 𝐴 with respect to the universal set 𝑈 is
COMPLEMENT
denoted by 𝐴𝑐 = 𝐴′ = 𝑈– 𝐴. It contains all those elements of 𝑈 𝐴𝑐 = 𝐴′ = 𝑈– 𝐴
OF SETS
that do not belong to 𝐴.
The cartesian product of two non-empty sets 𝐴 and 𝐵. denoted
CARTESIAN
by 𝐴 × 𝐵, consists of all ordered pairs (𝑥, 𝑦) such that 𝑥 ∈ 𝐴 and 𝐴×𝐵
PRODUCT
𝑦 ∈ 𝐵.

PROPERTIES OF UNION AND INTERSECTION OF SETS

COMMUTATIVE PROPERTY OF UNION 𝐴Ս𝐵 = 𝐵Ս𝐴

COMMUTATIVE PROPERTY OF INTERSECTION 𝐴Ո𝐵 = 𝐴Ո𝐵

ASSOCIATIVE PROPERTY OF UNION (𝐴 Ս 𝐵) Ս 𝐶 = (𝐴 Ս 𝐵) Ս 𝐶

ASSOCIATIVE PROPERTY OF INTERSECTION (𝐴 Ո 𝐵) Ո 𝐶 = (𝐴 Ո 𝐵) Ո 𝐶

DISTRIBUTIVE PROPERTY OF UNION OVER INTERSECTION 𝐴 Ս (𝐵 Ո 𝐶) = (𝐴 Ս 𝐵) Ո (𝐴 Ս 𝐶)

DISTRIBUTIVE PROPERTY OF INTERSECTION OVER UNION 𝐴 Ո (𝐵 Ս 𝐶) = (𝐴 Ո 𝐵) Ս (𝐴 Ո 𝐶)

DE MORGAN’S LAW (𝐴 Ս 𝐵)′ = 𝐴′ Ո 𝐵 ′ and (𝐴 Ո 𝐵)′ = 𝐴′ Ս 𝐵′

VENN DIAGRAMS

DISJOINT SETS SUBSET

Venn diagrams
can be used to
prove
commutative,
associative,
distributive,
OVERLAPPING COMPLEMENT and
SETS De Morgan’s
laws.

Page 1/2
SETS & FUNCTIONS
Grade 10 | Topic 5

FUNCTION
Th domain of a relation, denoted by Dom 𝑅, is the set consisting
DOMAIN Dom 𝑅
of all the first elements of each ordered pair in the relation.
The range of a relation, denoted by Rang 𝑅, is the set consisting
RANGE Rang 𝑅
of all the second elements of each ordered pair in the relation.
BINARY If 𝐴 and 𝐵 are any two non-empty sets, then a non-empty subset
𝐴 Ո 𝐵 = {𝑥|𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥 ∈ 𝐵}
RELATION 𝑅 ⊆ 𝐴 × 𝐵 is called a binary relation from set 𝐴 into set 𝐵.
If 𝐴 and 𝐵 are two non-empty sets, then relation 𝑓: 𝐴 → 𝐵 is
FUNCTION called a function if Dom 𝑓 = set 𝐴 and every 𝑥 ∈ 𝐴 appears in one 𝐴 − 𝐵 = {𝑥|𝑥 ∈ 𝐴 𝑥 ∉ 𝐵}
and only one ordered pair ∈ 𝑓.

TYPES OF FUNCTIONS

The function 𝑓: 𝐴 → 𝐵 is called an into function if at

INTO FUNCTION least one element in 𝐵 is not an image of some element
of set 𝐴 i.e. the range of 𝑓 ∈ 𝐵.

Thr function 𝑓: 𝐴 → 𝐵 is called an onto function if

ONTO FUNCTION every element of 𝐵 is an image of at least one
element of set 𝐴 i.e. the range of 𝑓 = 𝐵.

The function 𝑓: 𝐴 → 𝐵 is called a one-one function

ONE-ONE
if all the distinct elements of 𝐴 have distinct images
FUNCTION
in 𝐵.

BIJECTIVE The function 𝑓: 𝐴 → 𝐵 is called a bijective function if

FUNCTION and only if function 𝑓 is both onto and one-one.

Page 2/2