YEAR 10
Functions
10
PART 1 Cartesian Products
Cartesian Product: a set of all ordered pairs/n-tuples of the sets.
Definition 1 The Cartesian Product of Two Sets
Given two non-empty sets 𝐴 and 𝐵. The Cartesian product 𝐴 × 𝐵 is the
set of all ordered pairs of elements from 𝐴 and 𝐵,
𝐴 × 𝐵 = {(𝑎, 𝑏): 𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 }.
Exercise 1 Let 𝑃 be the set of grades in a school and let 𝑄 be the
sections for the grades,
𝑃 = {8, 9, 10} and 𝑄 = {𝐴, 𝐵, 𝐶, 𝐷 }.
So, 𝑃 × 𝑄 = ____________________________________________________ .
• 𝑛(𝑃 × 𝑄 ) = ____________ .
• 𝑛(𝑃) = _______ and 𝑛(𝑄) = _______ .
Property 1 If 𝑛(𝐴) = 𝑝 and 𝑛(𝐵) = 𝑞, then
𝑛(𝐴 × 𝐵) = 𝑝𝑞.
• When one or both the sets are empty, 𝐴 × 𝐵 = 𝜙.
• If anyone of the sets is infinite, even 𝐴 × 𝐵 is an infinite set.
Exercise 2 Find the Cartesian product of three sets
𝐴 = {1} , 𝐵 = {2, 3} and 𝐶 = {4, 5, 6}.
Exercise 3 Cartesian Plane
Cartesian Plane: a two-dimensional
coordinate plane formed by the
intersection of two perpendicular
lines.
PART 2 Relations
Relation: a relationship between two different sets of information. If two
sets are considered, the relation between them will be established if
there is a connection between the elements of two or more non-empty
sets.
1 a
2 c
5 m
7 n
𝐴 𝐵
𝐴 × 𝐵 = ________________________________________________________
_______________________________________________________ .
A relation is ____________________________________________________ .
Domain = _________________________________________________ .
Range = ___________________________________________________ .
Types of Relations
• Empty Relation or Void Relation: one in which there is no relation
between any elements of a set.
𝑅 = 𝜙 ⊂ 𝐴 × 𝐴.
• Universal Relation or Full Relation: a type of relation in which
every element of a set is related to each other.
𝑅 = 𝐴 × 𝐴.
• Identity Relation (𝐼): every element of a set is related to itself only.
𝐼 = {(𝑎, 𝑎), 𝑎 ∈ 𝐴}.
• Inverse Relation (𝑅 !" ): seen when a set has elements which are
inverse pairs of another set.
𝑅 !" = {(𝑏, 𝑎 ): (𝑎, 𝑏) ∈ 𝑅}.
• Reflexive Relation: the one in which every element maps to itself.
(𝑎, 𝑎) ∈ 𝑅
• Symmetric Relation: if (𝑎, 𝑏) ∈ 𝑅, then (𝑏, 𝑎) ∈ 𝑅.
• Transitive Relation: if (𝑎, 𝑏) ∈ 𝑅 and (𝑏, 𝑐) ∈ 𝑅, then (𝑎, 𝑐 ) ∈ 𝑅.
• Equivalence Relation: it is reflexive, symmetric and transitive at the
same time
Exercise 4 Show that the given relation 𝑅 is an equivalence relation,
which is defined by (𝑝, 𝑞 ) 𝑅 (𝑟, 𝑠 ) ⟹ (𝑝 + 𝑠) = (𝑞 + 𝑟).
PART 3 Functions
Function (𝑓(𝑥)): a special relationship among the inputs and their
outputs where each input has exactly one output, and the output can
be traced back to its input.
𝐴 𝐵
1 a
2 c
5 m
7 n
Vs
1 a
2 c
5 m
7 n
Exercise 5 Determine whether each relation is a function or not.
a) 𝑅 = {(0, 8), (1, 5), (2, 6), (5, 6), (6, 8)}
b) 𝑅 = {(2, 6), (3, 0), (4, 0), (6, 4), (6, 6), (9, 4)}
c) 𝑅 = {(2, 5), (8, 5), (9, 5)}
d) 𝑅 = {(0, 6), (1, 2), (4, 9), (9, 2), (9, 8)}
e) 𝑅 = {(1, 3), (2, 7), (4, 2), (5, 3), (9, 7)}
f) 𝑅 = {(1, 4), (2, 8), (8, 9)}
g) 𝑅 = {(0, 3), (2, 3), (4, 9), (7, 6)}
Types of Functions
• One-to-One Function or Injective Function: a function that maps
distinct elements of its domain to distinct elements of its
codomain.
Exercise 6 One to One Graph – Horizontal Line Test
Determine whether each function is one-to-one or not.
a) If 𝑓: ℝ → ℝ, then 𝑓 (𝑥 ) = 2𝑥.
b) If 𝑓: ℝ → ℝ, then 𝑓 (𝑥 ) = 2𝑥 + 1.
c) If 𝑓: ℝ → ℝ, then 𝑓 (𝑥 ) = 𝑥 # .
d) If 𝑓: ℝ → ℝ, then 𝑓 (𝑥 ) = 𝑥/2.
e) If 𝑓: ℝ → ℝ, then 𝑓 (𝑥 ) = 𝑥 $ .
• Onto Function or Surjective Function: any function states
surjection by limit its codomain to its range.
• Polynomial Function: a function that can be expressed in the form
of a polynomial.
• Inverse Function: a function returns the original value for which a
function gave the output.
• Even Function: 𝑓 (−𝑥) = 𝑓(𝑥).
• Odd Function: 𝑓 (−𝑥 ) = −𝑓(𝑥).