CHAPTER – 01

RELATIONS & FUNCTIONS

RELATIONS
If set A has ‘p’ elements and set B has ‘q’ elements, then Number of reflexive and symmetric relations from A to A =
Number of elements in A× B = pq 𝐧(𝐧 𝟏)
𝟐 𝟐
Number of relations from A to B = 𝟐𝐩𝐪
The number of Maximum Number of equivalence relations on a
Number of non- empty relations from A to B = 𝟐𝐩𝐪 − 𝟏 set with 3 elements is 5
Number of Functions defined from A to B = 𝐪𝐩 . For a Set A = {1,2,3}
If Set A has ‘m’ elements then the number of reflexive relations Smallest Equivalence relation = {(1,1),(2,2),(3,3)}
from A to A = 𝟐𝐧(𝐧 𝟏) Largest Equivalence relation =
𝐧(𝐧 𝟏)
Number of symmetric relations from A to A= 𝟐 𝟐 {(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1),(2,3),(3,2)}

FUNCTIONS
DEFINITION
Let A and B be two non empty sets. A relation from A to B is called a function(or a mapping) from A to B, if
For every element of A there exists exactly one element in B. Number of functions from a
In other words, all elements of first set should be there and no element should repeat. set A with ‘m’ elements to a
A = {1,2,3} B = {4,5,6} set B with ‘n’ elements is
R1 = {(1,4), (1,5), (2,6),(3,6)} : R2 = {(1,5), (2,4), (3,6)} : R3 = {(1,5), (2,5), (3,6)} : R4 = {(1,4), (2,6)} given by 𝐧𝐦
Only R2 and R3 are considered as functions from A to B

TYPES OF FUNCTIONS
ONE- ONE (INJECTIVE)
ONTO (SURJECTIVE)
MANY - ONE
INTO FUNCTIONS

STUDY CENTRES AMAR COLONY GREATER KAILASH -2 KALKAJI MALVIYA NAGAR SARITA VIHAR
+91-9-61-62-63-64-5 +91-99-1927-1927 +91-99-714-89-880 +91-9999-148-223 +91-98-73-98-73-71
 RELATIONS & FUNCTIONS

ONE- ONE FUNCTIONS

A function f from X to Y is called one- one or injective if different elements of X have different images in Y.
f(x1)=f(x2)⇒ x1 =x2 ∀ x1 , x2 ∈ X
NUMBER OF ONE – ONE FUNCTIONS

If set A has n elements and set B has m elements, m≥n, then the
𝐦!
Number of injective functions or one to one function is given by. 𝐏(𝐦, 𝐧)=(𝐦
𝐧)!

ONTO / SURJECTIVE FUNCTIONS

A function from X to Y is called onto or surjective if each element of y is the image of at least one element of X i.e. codomain of f = range
of f i.e Y = 𝐟(𝐱).
NUMBER OF ONTO FUNCTIONS Range ⊂ 𝐂𝐨𝐝𝐨𝐦𝐚𝐢𝐧
If A has m elements and B has 2 elements,
then the number of onto functions is 2m-2

INTO FUNCTIONS
A function f from X to Y is called into. If there exists at least one element in Y
which is not the image of any element of X.
In other words, a function from X to Y is called into if it is not onto.

ILLUSTRATIVE EXAMPLES
𝟐
Example 1 : Consider f : R+→[-9,∞), f(x) = 𝟓𝐱 + 𝟔𝐱 − 𝟗, where R+ is the set of all non- negative real numbers. Prove that f is bijective
Solution :
One- one
Let x , x ∈ R (domain) such that f(x1) = f(x2) ⇒ (x − x )(5x + 5x + 6) = 0
⇒ 5x + 6x − 9 = 5x + 6x − 9 ⇒ (x − x ) = 0 [ ∵ 5x + 5x + 6 ≠ 0, 𝑎𝑠 x , x ∈ R ]
⇒ 5x − 5x + 6x − 6x = 0 ∴ f is one- one.
⇒ 5 (x − x )(x + x ) + 6(x − x ) = 0

STUDY CENTRES AMAR COLONY GREATER KAILASH -2 KALKAJI MALVIYA NAGAR SARITA VIHAR
+91-9-61-62-63-64-5 +91-99-1927-1927 +91-99-714-89-880 +91-9999-148-223 +91-98-73-98-73-71
 CHAPTER – 01
RELATIONS & FUNCTIONS
Onto
Let f(x) = y −6 ± 2 9 + 5(9 + y) 54 + 5𝑦 ≥ 3
⇒ 5x + 6x − 9= y ⇒x= 5y ≥ - 45
2(6)
⇒ 5x + 6x − 9- y = 0 y ≥ -9
−3 ± 9 + 5(9 + y)
−6 ± 36 − 4(5)(−9 − y) ⇒x= y∈ [−9, ∞)
⇒x= 2(6)
2(6) ∴ range (f) = codomain(f) = [−9, ∞)
)
as, x∈ R , ≥0 Hence, f is onto.
Thus, f is bijective.

Example 2 : Given A = {1,2,3,……9}.Prove that the relation R on the set A × A defined by (a,b)R (c,d) ⇔a+d = b+c for all (a,b), (c,d) ∈ A ×
A is an equivalence relation. Also, find the equivalence class [(2,5)].
Solution :
Reflexive : Let (a,b), (c,d) ∈ A × A such that (a,b) R( c,d)
⇒ a+d = b+c
Let (a,b)∈ A × A =c+b=d+a
Since, a + b = b + a [ Addition is commutative on N] ⇒ (c,d) R (a,b)
⇒ (a, b)R (a, b) ∀(a, b) ∈ A × A ∵ (a, b)R(c, d) ⟹ (c, d)R (a, b) ⟹∴ R is symmetric
∴ R is reflexive on ∈ A × A

Symmetric
Transitive
Let (a,b), (c,d) , (e,f) ∈ A × A such that (a,b) R( c,d) and (c,d) R (e,f) ⇒ (a, b) R (e, f)
⇒ a+d = b+c …. (1) and c + f = d + e ….. (2) ∵ (a, b)R(c, d) 𝑎𝑛𝑑(c, d) R (e, f) ⟹ (a, b) R (e, f)
Adding (1) & (2) ∴ R is transitive
=a+d+c+f=b+c+d+e Since, R being reflexive, symmetric and transitive
a+f = b+e ∴ R is an equivalence relation

Equivalence class
(2,5) R (x,y) ⇔ 2 + y = 5 + x
[(2,5)] = {(1,4),(2,5),(3,6),(4,7),(5,8),(6,9)}

Example 3: Let f : W→W be defined by

n - 1 , if n is odd
F(n) = n + 1 , if n is even . show that f is a bijection
STUDY CENTRES AMAR COLONY GREATER KAILASH -2 KALKAJI MALVIYA NAGAR SARITA VIHAR
+91-9-61-62-63-64-5 +91-99-1927-1927 +91-99-714-89-880 +91-9999-148-223 +91-98-73-98-73-71
 RELATIONS & FUNCTIONS

Solution : ⇒ n =n Case 1 : n is even

Case 3 : n1 is even and n2 is odd n+1=y
One – one ⇒ n +1=n −1 n=y–1
Let n1, n2 ∈ W (Domain) such that f(n1) = ⇒ n −n =2 y ∈ { 1,3,,5………}
f(n2) Since, difference between odd and even is Case 2 : n is odd
always odd. n-1=y
Case 1 : Both n1 and n2are odd Therefore, n − n ≠ 2 n=y+1
⇒ n −1=n −1 Thus, f(n1) = f(n2) = n = n y ∈ { 0,2,4………}
⇒ n =n ∴ f is one- one. Therefore, Range(f) = { 0,1,2,3,4……} = W
Case 2 : Both n1 and n2 are even = codomain(f)
⇒ n +1=n +1 Onto ⇒ f is onto and hence, f is invertible.
Let f(n) = y

Example 4 : Find the maximum number of equivalence relations on {1,2,3}.

Solution :
Maximum number of equivalence relations is 5
R1= { (1,1),(2,2),(3,3)} R5= { (1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1)}
R2= { (1,1),(2,2),(3,3), (1,2),(2,1)}
R3= { (1,1),(2,2),(3,3),(1,3),(3,1)}
R4= { (1,1),(2,2),(3,3),(2,3),(3,2)}
Example 5 :On the set Z of all integers, consider the relation R = {(a,b) : (a-b) is divisible by 3}. Show that R is an equivalence relation on Z.
Also, find the partioning of Z into mutually disjoint equivalence classes.
Reflexive ∴ (a,b) 𝜖 R⇒ (b, a)𝜖 R Thus, (a,b)𝜖R and (b,c) 𝜖 R⇒ (a,c) 𝜖R
So, R is symmetric So, R is transitive.
Let a𝜖 Z ∴ R is transitive relation on Z.
(a - a) = 0, which is divisible by 3 Transitive Equivalence Classes
∴ (a,a) 𝜖𝑅 ∀ a𝜖 Z Let a, b , c ϵ Z such that (a,b)𝜖R and (b,c) 𝜖 [0] = { ……-6,-3,0,3,6,9……}
So, R is reflexive. R [1] = { …..- 5, -2 , 1 , 4, ….}
Symmetric (a,b) 𝜖 R and (b,c) 𝜖 R ⇒ (a − b) is [2] = { ….-4, -1, 2,5, 8…..}
Let a, 𝑏 𝜖 Z such that (a,b) 𝜖 R divisible by 3 and (b-c) is divisible by 3 Z =[0]∪ [1] ∪ [2]
(a,b) 𝜖 R ⇒ (a-b) is divisible by 3 ⇒ [(a − b) + (b − c)] is divisible by 3
⇒ −(b − a)is divisble by 3 ⇒ (a − c) is divisible by 3
⇒ (b, a)𝜖 R

STUDY CENTRES AMAR COLONY GREATER KAILASH -2 KALKAJI MALVIYA NAGAR SARITA VIHAR
+91-9-61-62-63-64-5 +91-99-1927-1927 +91-99-714-89-880 +91-9999-148-223 +91-98-73-98-73-71