Module 3 - Relations and Functions
Module 3 - Relations and Functions
Functions
Exploring one of many fundamentals
of Mathematics
Learning Objectives
• define and give examples of relations
• define a function between sets and the image and inverse image of
subsets of the domain and codomain, resp.
• determine domain and range of a relation/function
• prove statements combining the concepts of the image and inverse
image of subsets of the domain and codomain, and composition of, or
injective, surjective, or bijective functions.
Introduction
1. f(x) = x2
2. f(x) = 2x + 3
3. f(x) = x3
4. f(x) = 2x + 3
5. f(x) = x + 5
Relation
It is a subset of the Cartesian product, consisting of a
set of ordered pairs. In simpler terms, a relation
between two sets is a collection of ordered pairs,
where each pair consists of one element from each set.
Example: {(−2,1),(4,3),(7,−3)}
typically represented in set notation using curly
brackets.
Types of Relations
Empty Relations
Universal Relations
Identity Relations
Inverse Relations
Reflexive Relations
Symmetric Relations
Transitive Relations
Types of Relations
Empty Relation
If no element of set X is related or mapped to any
element of Y, the relation R in A is called an empty
relation or void relation, meaning R=∅.
Types of Relations
Empty Relation
Example: Let A={1, 2, 3}.
The relation R on A is empty if: R=∅.
No pairs (x,y) exist in R.
Example in real life: A relation "is a parent of" on a set
of students in the same class (students can't be parents
of each other).
Types of Relations
Universal Relation
If no element of set X is related or mapped to any
element of X, the relation R in A is called an empty
relation or void relation, meaning R=∅.
Types of Relations
Universal Relation
Example: Let A={1,2,3}.
The universal relation is: R={(1,1),(1,2),(1,3),(2,1),(2,2),
(2,3),(3,1),(3,2),(3,3)} Example in real life: The relation
"is less than or equal to" (≤) on the set of all real
numbers.
Types of Relations
Identity Relation
If every element of set A is related to itself only, it is
called Identity relation.
I={(A, A), ∈ a}.
Types of Relations
Identity Relation
Example: If A={1,2,3},
the identity relation is: R={(1,1),(2,2),(3,3)
Example in real life: The relation "is the same person
as" in a group of people.
Types of Relations
Inverse Relation
If R is a relation from set A to set B i.e., R ∈ A X B. The
relation R-1= {(b,a):(a,b) ∈ R}.
Types of Relations
Inverse Relation
Example:Let R={(1,2),(3,4)}, then the inverse is:
R−1={(2,1),(4,3)}
Example in real life: If "is the parent of" is a relation,
the inverse relation is "is the child of."
Types of Relations
Reflexive Relation
A relation is a reflexive relation iIf every element of set
A maps to itself, i.e for every a ∈ A, (a, a) ∈ R.
Types of Relations
Reflexive Relation
Example: Let A={1,2,3}, the reflexive relation must
include: R={(1,1),(2,2),(3,3),(1,2),(2,3)}(at least self-
pairs)
Example in real life: "is equal to" (===) on a set of
numbers.
Types of Relations
Symmetric Relation
A symmetric relation is a relation R on a set A if (a, b) ∈
R then (b, a) ∈ R, for all a & b ∈ A.
Types of Relations
Symmetric Relation
Example: Let R={(1,2),(2,1),(3,3)}, since for every (a,b)
(a,b)(a,b) there is (b,a)(b,a)(b,a), it is symmetric.
Example in real life: "is a sibling of" (if A is a sibling of B,
then B is a sibling of A).
Types of Relations
Transitive Relation
If (a, b) ∈ R, (b, c) ∈ R, then (a, c) ∈ R, for all a,b,c ∈ A
and this relation in set A is transitive.
Types of Relations
Transitive Relation
Example: Let R={(1,2),(2,3),(1,3)}.
Since (1,2)(1,2)(1,2) and (2,3)(2,3)(2,3) lead to (1,3)(1,3)
(1,3), it is transitive.
Example in real life: "is an ancestor of" (if A is an
ancestor of B, and B is an ancestor of C, then A is an
ancestor of C).
Types of Relations
Equivalence Relation
If a relation is reflexive, symmetric and transitive, then
the relation is called an equivalence relation.
Types of Relations
Equivalence Relation
Example: Let A={1,2,3}, and define relation R as: R={(1,1),(2,2),
(3,3),(1,2),(2,1)
Reflexive: (1,1),(2,2),(3,3)(1,1), (2,2), (3,3)(1,1),(2,2),(3,3) are
present.
Symmetric: (1,2)(1,2)(1,2) implies (2,1)(2,1)(2,1), so it is
symmetric.
Transitive: (1,2)(1,2)(1,2) and (2,1)(2,1)(2,1) lead to (1,1)(1,1)
(1,1), maintaining transitivity.
Example in real life: "is congruent to" in geometry, where two
triangles being congruent satisfies all three conditions.
Sample Problem
1. Let A={ 1, 2, 3, 4 }. A relation R is defined on A such that:
R={ ( x, y) ∣ x + y = 10, x, y ∈ A }.
Determine whether R is an empty relation and justify your answer.
Example 3
r(x) = x3 − 4. Find the domain and range of the function.
Inverse of a function
An inverse function or an anti function is defined as a
function, which can reverse into another function. In simple
words, if any function “f” takes x to y then, the inverse of “f”
will take y to x.