Re lat ion s and Fun cti on s

Relation Empty Relation, Universal Relation, Identity Relation

Refle xive, Symmetric, Transitive and Equivalence Relat ions
A relation in set A Is a subset of A x A. We also write It as R = {(a. b) e A x A I aRb} .
..__ I
+~- - ~ - ~i - - - - ~i
A relation R on set A is said to be an empty A relation R on set A is called a A relation R on set A is caled an Identity
relation or a void relation if no element of universal relation if each element relation if each element of A IS related
set A is related to any element of set A, i.e. of A is related to every element to itself only. i.e. aRa. v a e A. we write
R = q,. of A, i.e. R = A X A. R = IA

Reflexive Relation: Symmetric Relation: Transitive Relation:

A relation R in a set A is said to be reflexive, if A relation R in a set A is said to be symmetric , A relation R in a set A is said to be transitive,
(a. a) e R, tor every a e A or we say aRa, for if (a . b) e R ⇒ (b, a) E R, for all if (a . b) E R and (b. c) e R
every a e A.
Note: An identity relation is reflexive relation but a
a, b E A. We can also say aRb
tor a, b e A.
= bRa , ⇒ (a. c) e R, foc a, b, c e A.
We can also say
reflexive relation may or may not be identity relation.
aRb, bRc ⇒ aRc. for a, b, c e A.

Equivalence Relation:
J,
A relation R in a set A is said to be an equivalence relation if relation R is reflexive, symmetri
c and transitive.

7
Equivalence_Relation
---i- --
Equivalence relation on a non empty set A divides the set A into pairwise disjoint subsets called
equivalence classes whose collection is called a partition of the set A. The union of all equivalen
ce
classes is whole set A.
Note: 1. Let R be an equivalence relation on a non empty set A and let a E A, Then the set of
al
elements of set A which are related to a is called equivaJence class constituted by a and is denoted
by fa].
2. Two equivalence classes are either identical or disjoint
 --- ,. ·--·· - ····- -~--,1
.
On e-o ne (Injective) Functio (Surjective) fun ctio n
n, Ont~ '
Bijective Function
One-one OnJeC1tve) function· A f
A functlon f . A onto (surjecUve) rune•~~~: be onto (or surjective), 3 e-+ ----.---- B
images f dj . - B Is sa,d •. •
to be one-one (or injective). if the A function f : A 4 B Is_sat ?ma e of some element
In °
8 1 1 stinct elements of A under the rule fare distinct if every element of 8 ,s th e ~or ~very b e 8. there
5 -;----
• .e. or every a, b e A, a "' b =
t(a) "' f(b)
7
or we can also say that f(a) = f(b) =
a = b.
of_A under the rule f , ~e~uch that f(a) = b.
ex,sts an ele~ent_a e 'f nd only if range of f = 8.
9-r----
Note: A function ts onto ' a

j
( BIJecttv _
e) function: A function f : A ➔ B Is said to be bijective r ;
if f is both one-one and onto. ·e· injective and surjective

Rel atio n Empty Relation Universal Relation, Ide

ntity Relation
'
Ref lex ive Symmetric Transitive and Equivalen Iatio
• ns
' ce Re
'
MCQs Mult lple Cho ice Questions
----~ · <1 Mark)
l. Let A = {3, 5}. Then num ber of reflexive (a)
relati ons {(l, 1), (2, 3), (1, 2)}
on A is (b) {(3, 3), (3, 1), (1, 2)}
[CBS E 2023]
(a) 2 (b) 4 (c) {(l, 1), (3, 3), (3, 1), (2, 3)}
(c) 0 (d) 8
2. Let set X = {1, 2, 3} and a relat ion R (d) {(l, 1), (3, 3), (3, 1), (1, 2)}
is defin ed
in X as : R = {(1 , 3), (2, 2), (3, 2)}, then minim 3. If R = {(x, y) ; x, y E Z, x 2 + y 2 :-s; 4} is a relation in
um set Z , then doma in of R is
orde red pairs whic h shou ld be adde d in relati [CBS E 2021]
on R (a) {0, 1, 2} (b) {-2, -1, 0, 1, 2}
to mak e it refle xive and symm etric are [CBS
E 2021] (c) {0, -1, -2} (d) {-1 , 0, 1}

Very Sho rt Ans wer Type Questions

(2 Marks)
4 . Chec k if the relat ion R in the set IR of real
numb ers defin ed as R = {(a, b) : a < b} is
(i) symm etric , (ii) trans itive
[CBS E 2020)
5. If R = {(x, y) : x + 2y = 8} is a relat ion on N, write the range of R.
[CBS E 2014)
6 . Let R = {(a , a 3 ) : a is a prim e num ber Jess than 5} be a relati
on. Find the rang e of R.
[CBS E 2014]
SA Sho rt Ans wer Type Questions
(3 Marks)
7 _ Show that the relat ion Ron JR, the set of real numb
ers defin ed as R = {(a, b) : a $; b}, is refle xive,
but not symm etric . and transitive
B. Let A = {l, 2, 3, ... , 9~ and R b_e t he relat1 [CBS E 2019)
·o~ inAAlxA dbef~ed by (a, b) R (c, d) if a + d
in A xA. Prov e that R 1s an equ1v a 1ence re 1at1on
. so o tam the equiv alenc e class [( , )].
= b + c for (a , b), (c, d)
2 5 [CBS E 2014)
 (5 Marks)
Long Answer Type Questions

9. Show that the relation S in set R of real numbers 11. Let A = {x E Z : 0 $ x $ 12}. Show that
defined by R = {(a, b) : a, b EA , la -bl is divisible by 4} is an
S = {(a, b): a 5:b 3, aE R, bE R } equivalen ce relation. Find the se t of all elements
related to 1. Also write the equivalen ce class [21-
is neither reflexive, nor symmetric, nor transitive. [CBSE 2018]
[CBSE 2023 (C)]
in the set A = {1 , 2, 3, 12. Show that the relation R on the set Z of all integers
10. Let R be the relation defined
defined by (x, y) E R e::, (x - y) is divisible by 3 is an
5, 6, 7} by R = {(a, b): both a and bare either odd or
equivalen ce relation. [CBSE 2018(C)]
even}. Show that R is an equivalen ce relation. Hence,
find the elements of equivalen ce class [1]. 13. Let N denote the set of all natural numbers and R
.fs neither reflexive;-nt>r--symmetr-ic,B0i:-tr,ansitive:-- be the relation on N x N defined by (a, b) R (c, d) if
[CBSE 2023(C)] ad(b + c)= be (a + d). Show that R is an equivalen ce
relation. [CBSE 2015]

One-One (Injective) Function, Onto (Surjective)

Function, Bijective Function

e Multiple Choice Questions

(1 Mark)

14. Let X = {.x2 : xN} and the function /: N ➔ Xis defined by f(x) = x2, x e N. Then this function is [CBSE 2021]
E

(a) injective only (b) not bijective (c) surjective only (d) bijective
[CBSE 2021]
15. A function /: R➔ R defined by f(x) = 2 + x2 is
(a) not one-one (b) one-one (c) not onto (d) neither one-one nor onto

(2 Marks)
Very Short Answer Type Questions

16. Prove that the greatest integer function /: R ➔ R, given by f(x) = [x], is neither one-one nor onto.
[CBSE 2023(C)]

_ _ _ _S
I . (b ), n = number of elements in the set. 2 Hence, transitive as
Number of reflexive relations = 2" - " (a, b) ER, (b, c) ER ⇒ (a , c) ER
Here n =2 for all a, b, c E IR
22 2 5. R = {(x, y) : x + 2y = 8} is a relation on N.
Number of reflexive relations = 2 -
= 24-2 = 22 = 4 : . R = {(2, 3), (4, 2), (6, 1)}
2. (c) Range= {1, 2, 3}.
3
3. (b) 6. Relation R = {(a, a ) : a is a prime number less than 5}
4. Given relation, R = {(a, b): a < b} R = {(2, 8), (3, 27)} ,
(i) For symmetric Range = {8, 27}.
Let a = 2, b = 3 7. Given relation R = {(a, b) : a$ b}
(a, b) E Ras 2 < 3 For reflexive: Let for a E IR
But (b , a) !l R as 3 <I. 2
(a, a)ER ⇒ a$ a, true. Hence, reflexive.
Hence, not symmetric as
For symmetric: Let a, b E IR
(a , b) ERP(b , a) eRfora , b E!R.
such that (a, b)ER ⇒ a$ b
(ii) For transitive:
Let (a , b) E Rand(b, c)ER This may not imply b $ a
⇒ a < b and b < c ⇒ a < c e.g. (2, 3)eR i.e. 2 $ 3 but (3, 2) i JR.
⇒ (a , c) E R Hence, not symmetric.
~ Chapt ,
erw,se CBSE PYQs (Mathematics)- 12 - - - A _ { _ , 5, 6, 7} and relation .
t or tran11IUve: Let b c IR • set - 1, · '
234 O
'' is
O 10. Given . both a and b are either odd or eve }
such th ' ' e R= {(a , b) · n
~ a 5 :' (a, b) e /R and (b, c) e fR nexive· let aeA
and b s c ==> a s c (transitive law) For re R. a is even or odd even is related t
~ (a . c) eR ⇒ (a , a)e a~d is related to same odd. o sarrie
Hence, tr anst11ve.
·· even and 0
8. Given A = {I Hence reflexive.
by ( . , 2, 3, ... , 9} and relation R in A x A defined For symmetric:
i (a, b) R (c, d) e a + d = b + c ... (i) For a, beA ,
or a, b), (c, d) e AxA
Forren-• · Let (a , b)eR d
"iuve: Let for (a , b) e A x A b e both even or od
(a , b) R (a b) 0 ⇒ a ar
' ==> + b = b + a, true in A
Ii encc, rencxive. ⇒ b', 0 are both even or odd
For ⇒ (b, a)eR
!i')'lnmetrlc: b) R ⇒ (b a) e R, for a, b EA
Let for(a , b), (c, d) EA XA As (a , E ,
(a, b) R (c, d) ::::) a + d = b + c Hence, symmetric.
::::) b + c = a + d For transitive:
⇒ c +b = d +a Let for a, b, c EA
⇒ (c, d) R (a, b) [Commutative in A] (a , b) eR an d (b , c) ER
Hence, (a, b) R (c, d) ⇒ a, bare both even or odd
⇒ (c, d)R(a , b),for(a, b),(c, d) EA x A. b, care both even or odd
He nee, symmetric. ⇒ a, C are both even or odd
For transitive: Let (a, b), (c, d), (e, f) e A x A such that ⇒ (a, c)eR
(a, b) R (c, d) and (c, d) R (e, f) As ta, b) ER, (b, c) e R, ⇒ (a, c) ER
(a, b) R (c, d) ⇒ a + d = b + c for a, b, c EA
(c, d) R (e, f) ⇒ c + f = d + e Hence, transitive.
⇒ a + d + c +f = b + c + d + e As the relation R is reflexive, symmetric and transitive.
⇒ a +f = b + e Hence relation R is equivalence relation.
⇒ (a, b) R (e, f) For equivalence clean {1}, 'l ' is odd number, so only odd
As for (a, b), (c, d), (e, f) EA x A numbers are related.
(a, b) R (c, d) and (c, d) R (e,f) ⇒ Equivalence class {1} = {1, 3, 5, 7}.
⇒ (a, b) R (e,f) 11. Given setA = {x E Z : 0 ~x ~ 12}
Hence, transitive. R = {(a, b): a, be A I a - b I is divisible by 4}
As relation R is reflexive, symmetric and transitive. Hence, For reflexive:
relation is an equivalence relation. Fora e A,
For equivalence class [(2, 5)], (a,a)eR
(a, b) EA x A is related to (2, 5), if ⇒ I a - a I is divisible by 4
(a , b) R (2, 5) = a + 5 = b + 2 ⇒ 0 is divisible by 4, true.

From (i) we notice, the following pairs are related as: Hence, reflexive.
For symmetric:
(1 , 4), (2, 5), (3, 6), (4, 7), (5, 8), (6, 9),
Fora, be A,
Hence [(2, 5)] = {(1, 4), (2, 5), (3, 6), (4, 7), (5, 8), (6, 9)}.
(a,b)eR
9. Given S = {(a, b) E JR x JR I a s b3}
⇒ I a - b I is divisible by 4
We can consider counter example.
⇒ I - (b - a) I is divisible by 4
For reflexive: Let (-2, -2) E S ⇒ -2 ~ (-2) 3
⇒ I b-a I is divisible by 4
⇒ -2 ~ - 8, false, Hence, not reflexive.
⇒ (b, a) e R
For symmetric: Let (-1 , 2) ES ⇒ -1 ~ (2)3
As (a , b) e R ⇒ (b, a) e R, for a, b e A
⇒ -1 ~ 8 true,
Hence, symmetric.
If symmetric then (2, - 1) e S For transitive:
⇒ 2 ~ (-1 )3 ⇒ 2 ~ -1 , false, Hence, not symmetric. Fora , b, c e A
For transitive: Let (25, 3) e S and (3, 2) e S
Let (a , b) ER and (b, c) ER
⇒ 25 ~ (3) 3 and 3 ~ (2)3
⇒ 25 ~ 27 and 3 ~ 8, true in both cases.
⇒ Ia - b I is divisible by 4 and Ib - c I is divisible by 4.
If tra nsi tive then (25, 2) e S
⇒ (a - b) is divisible by 4 and (b - c) is divisible by 4.
⇒ 25 ~ (2) 3 ⇒ 25 ~ 8, false ...(i)
⇒ (a-b) + (b-c) = (a-c) is divisible by4 [using (i)]
Hence. not transitive.
⇒ I a - c I is divisible by 4.
 _ _ _ Relations and Function s ~
____________________________

⇒ (a , c) E R. Hence, transitive. For symmetric: For (a , b), (c, d) EN x N

As the relation R is reflexive , symmetr ic and transitive . (a , b) R(c, d) ⇒ ad(b + c) = bc(a + d)
⇒ cb(d + a) = da(c + b)
Hence, relation R is an equivalen ce relation.
(using commutative property for addition and multiplication
If a EA is related to 1, then (a , 1) e R
in N]
⇒ la - 11 is divisible by 4.
⇒ (c, d) R(a , b)
⇒ a - 1 = 4A., for ).. e N. :. (a, b) R(c, d) ⇒ (c, d) R(a , b)
⇒ a = 1 + 4).. ⇒ a = 1 5 9 For all (a, b), (c, d) EN x N.
' '
Set of elements related to 1 is {1 , 5, 9} . Hence, symmetric.
For equivalen ce class [2] ⇒ la - 21 is divisible by 4. For transitive:
⇒ a - 2 = 4).. ⇒ a = 2 + 4).. For (a , b), (c, d), (e, f) EN x N
⇒ a= 2, 6, 10
Let (a , b) R(c, d) and (c, d) R(e, f)
⇒ ad(b + c) = bc(a + d)
: . Equivale nce class [2] = {2, 6, 10}.
1 1 l l
12. Given relation R, (x, y)ER ¢:> (x -y) is divisible by 3. ⇒ -+- = -+-
d a
c b
For reflexive: and cf(d + e) = de(c + f)
(a , a) ER¢:> a -a = 0 is divisible by 3, true for all a E Z. 1 1 1 1
Hence, relation R is reflexive . ⇒ -+- = -+-c
e d f
For symmetric: 1111 1111
Let (a, b) ER¢:> a - bis divisible by 3. ⇒ -+-+ -+- = -+-+
daf
-+-c
c bed
¢:> -(b - a) is divisible by 3.
1 1 1 1
¢:> (b, a) ER for a , b E Z. ⇒ -+- = -+-
b e a f
Hence, relation R is symmetr ic.
⇒ af(e + b) = be(!+ a)
For transitive:
⇒ af(b + e) = be(a + f)
Let (a , b) ER and (b, c) e R, for a, b , c E Z
⇒ (a , b) R(e,f)
¢:> (a - b) is divisible by 3 and (b - c) is divisible by 3. As (a, b) R(c, d); (c, d) R(e, f)
¢:> (a - b) + (b - c) = (a - c) is divisible by 3 ⇒ (a , b) R(e,f)
[ ·: if numbers are divisible by 3, then their Hence, transitive .
sum is also divisible by 3) As relation R is reflexive, symmetr ic and transitive . Hence,
<=> (a, c) ER R is an equivalen ce relation.
As (a, b) ER and (b, c) e R 14. (d)
⇒ (a, c) ER 15. (d)
Hence, R is transitive . = [x]
16. f(x)
As relation R is reflexive , symmetr ic and transitive . Hence, Letx 1 = 1.1 andx2 = 1.2
relation R is an equivale nce relation. :. [xi]= [1.1) = 1, [x2] = [1.2] = 1
13. Relation R on N x N is given by As x1 =#=x2 butf(x 1) = f(x 2)
= be (a + d) , Hence, not one-one.
(a , b) R(c, d) <:=> ad(b + c)
Also for 1.5 eR (co-dom ain) there is no xeR (domain )
for (a , b), (c, d) EN x N
such thatf(x) = 1.5
For reflexive: For (a , b) e N x N
as 1.5 is not an integer.
(a , b)R(a, b) ⇒ ab(b +a ) = ba(a + b) , true in N
Hence, not onto.
H ence, reflexive.