RELATIONS AND FUNCTIONS

SOME IMPORTANT RESULTS/CONCEPTS

** Relation : A relation R from a non-empty set A to a non-empty set B is a subset of A × B.
**A relation R in a set A is called
(i) Reflexive, if (a, a) ∈ R, for every a∈ A,
(ii) Symmetric, if (a, b) ∈ R then (b, a)∈ R,
(iii)Transitive, if (a, b) ∈ R and (b, c)∈ R then (a, c)∈ R.
** Equivalence Relation :R is equivalence if it is reflexive, symmetric and transitive.
** Function :A relation f : A B is said to be a function if every element of A is correlated to unique
element in B.
* A is domain
* B is codomain
* For any x element x  A, function f correlates it to an element in B, which is denoted by f(x) and
is called image of x under f . Again if y= f(x), then x is called as pre- image of y.
* Range = {f(x) | x A }. Range  Codomain
* The largest possible domain of a function is called domain of definition.
**Composite function :Let two functions be defined as f : A  B and g : B  C. Then we can define a
function gof: A C is called thecomposite function off and g.
** Different type of functions : Let f : A B be a function.
*f is one to one (injective) mapping, if any two different elements in A is always correlated to different
elements in B, i.e. x1  x2 f(x1)  f(x2) or f(x1) = f(x2)  x1 = x2
*f is many one mapping, if  at least two elements in Asuch that their images are same.
*f is onto mapping (subjective), if each element in B is having at least one preimage.
*f isinto mapping if range  codomain.
*f is bijective mapping if it is both one to one and onto.

RESULTS :
1. A relation 𝑅 in a set 𝐴, if n(A)= n then,
2
a) Number of relation from A to A = 2n
2
b) Number of reflexive relation from A to A = 2n −n
n n +1
c) Number of symmetric relation from A to A = 2 2
2
d) Number of relation from A to A which are not symmetric = 2(n −n)/2

2. Let a function f : X → Y where n (X) = n & n (Y) = m.

a) Total number of functions = mn= (no of elements in co-domain)no. of elements in domain
m
c n n! , if m ≥ n
b) Total number of one-one functions=
0, , if m < 𝑛
n m
m − c n n! , if m ≥ n
c) Total number of many one functions=
mn , if m < 𝑛
d) Total number of onto
mn − m c1 (m  1)n m c2 (m  2)n m c3 (m  3)n  .... , if m < 𝑛
functions m! , if m = n =
0 , if m > 𝑛
m − c1 (m  1)  c2 (m  2)  c3 (m  3)  .... , if m < 𝑛
n m n m n m n

mn , if m > 𝑛
m
c1 (m  1)n m c2 (m  2)n m c3 (m  3)n  .... , if m ≤ n
e) Total number of into functions=
mn , if m > 𝑛
f) Total number of one-one and onto functions= m!
g) Total number of constant functions = m
h) Total number of onto functions from the set { 1, 2, 3, ….,n} = n!

6
II) Some illustrations/examples:
(i) MCQ
1. Let A = { 1, 2, 3, ….,n}and B= {a, b}. then the number of surjections from A to B is
n
(a) P2 (b) 2n-2 (c)2n-1 (d) none of these
2
2. Let 𝑓∶R → R defined by f(x) = 1+ x . Choose the correct answer
(a) both one -one and onto (b)one-one but not onto
(c) onto but not one-one (d) Neither one- one nor onto
3. The maximum number of equivalence relation on the set A ={ 2, 4, 6} is/are
(a) 1 (b) 2 (c) 3 (d) 5
4. Let the relation R in the set A = { xϵ Z: 0 ≤ x ≤ 12}, given by R = { (a,b): |a-b| is multiple of 4 }. Then
the equivalence class of 1is
(a) {1, 5, 9} (b) { 0, 1, 2, 5} (c)∅ (d) A
Ans . 1 (b), 2 (d) , 3 (c) , 4(a)

(ii) Case based study: An organization conducted bike race under 2 different categories-boys and girls.
Totally there were 250 participants. Among all of them finally three from Category 1 and two from Category
2 were selected for the final
race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3}
G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final
race. Ravi decides to explore these sets for various types of relations and functions.

1. Ravi wishes to form all the relations possible from B to G. How many such relations are possible?
2. Let 𝑅: 𝐵 → 𝐺 be defined by R = { (b1,g1), (b2,g2),(b3,g1)}. Check R is/are injective/
surjective/bijective.
3. Ravi wants to find the number of injective functions from B to G. How many numbers of injective
functions are possible?
Ans . 1. 26, 2. Surjective, 3. 0
(iii) Short answer type:
1. In each of the following cases, state whether the function is one-one , onto or bijective. Justify your
answer:
(i) f: R → R defined by f x = 3 − 4x
(ii) f: R → R defined by f x = 1 + x 2
Sol. (i)f: R → R defined by f x = 3 − 4x
Let x1 , x2 ∈ Rbe such thatf x1 = f(x2 )
 3 − 4x1 = 3 − 4x2 ⇒ −4x1 = −4x2 ⇒ x1 = x2
∴ fisone − one
Let y ∈ Rbe any real number.
∴ f x = y ⇒ 3 − 4x = y
3−y
⇒x=
4
3−y
∴f =y
4

7
 3−y 3−y
∴ Corresponding to every element y ∈ R, there exists such that f =y
4 4
⇒ f is onto.
ii) 𝐟: 𝐑 → 𝐑 defined by 𝐟 𝐱 = 𝟏 + 𝐱 𝟐
Let x1 , x2 ∈ Rbe such thatf x1 = f(x2 )
⇒1 + x12 = 1 + x22
⇒x12 = x22
⇒x = ±x2
⇒f x1 = f −x1
⇒fisone − one
Let y ∈ Rbe any real number
∴ f x = y ⇒ 1 + x2 = y
As x 2 ≥ 0 ⇒ 1 + x 2 ≥ 1 ⇒ y ≥ 1
∴ Range of f is greater than or equal to 1
∴ Rf ≠ R
⇒f is onto.
Thus, fis neither one-one nor onto.

(iv) Long answer type:

Show that the relation R in the set A={ x∈ Z: 0≤ x ≤ 12} given by
R={ a − b is a multiple of 4} is an equivalence relation. And the equivalence class of 2 i.e. [2]
Sol Reflexive. a − a = 0 ∈ A,

Symmetry.
let (a,b)∈R
a − b is multiple of 4
= −(b − a) is multiple of 4
(b − a) is multiple of 4
hence (b,a)∈R

𝐓𝐫𝐚𝐧𝐬𝐢𝐭𝐢𝐯𝐞:
let a, b , b, c ∈ R
then , a − b = 4m and b − c = 4n .
a − b = ±4m and b − c = ±4n
a − b + b − c = ±4m ± 4n = ±4M
a − c is multiple of 4
hence (a,c)∈R
[2]= {0, 4, 8, 12}

III. Questions for practices:

(i) MCQ :
Q.1 Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a
is congruent to b ∀ a, b ∈ T. Then R is
(A) reflexive but not transitive (B) transitive but not symmetric
(C) equivalence (D) none of these
Q.2. Let us define a relation R in R as aRb if a ≥ b. Then R is
(A) an equivalence relation (B) reflexive, transitive but not symmetric
(C) symmetric, transitive but not reflexive (D) neither transitive nor reflexive but symmetric.
Q.3. If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and
onto mappings from A to B is
(A) 720 (B) 120 (C) 0 (D) none of these
Q.4 Let f : R → R be defined by f (x) = 1/x ∀ x ∈ R. Then f is
(A) one-one (B) onto (C) bijective (D) f is not defined

8
Q.5 . Which of the following functions from Z into Z are bijections?
(A) f (x) = x 3 (B) f (x) = x + 2 (C) f (x) = 2x + 1 (D) f (x) = x 2 + 1
Q.6. Let f : [2, ∞) → R be the function defined by f (x) = x 2 – 4x + 5, then the range of f is
(A) R (B) [1, ∞) (C) [4, ∞) (D) [5, ∞)
Q.7.. Let f : R → R be defined by f (x) = x2 + 1. Then, pre-images of 17 and – 3, respectively, are
(A) φ, {4, – 4} (B) {3, – 3}, φ (C) {4, –4}, φ (D) {4, – 4, {2, – 2}
Q.8. . For real numbers x and y, define xRy if and only if x – y + 2 is an irrational number. Then the
relation R is
(A) reflexive (B) symmetric (C) transitive (D) none of these
Q.9. The maximum number of equivalence relations on the set A = {1, 2, 3} are
(A) 1 (B) 2 (C) 3 (D) 5
Q.10. If the set A contains 3 elements and the set B contains 4 elements, then the number of one-one
mappings from A to B is
(A) 144 (B) 81 (C) 24 (D) 64
ASSERTION - REASON TYPE QUESTIONS:
Directions: Each of these questions contains two statements, Assertion and Reason. Each of these questions
also has four alternative choices, only one of which is the correct answer. You have to select one of the
codes (a), (b), (c) and (d) given below.
(a) Assertion is correct, Reason is correct; Reason is a correct explanation for assertion.
(b) Assertion is correct, Reason is correct; Reason is not a correct explanation for Assertion
(c) Assertion is correct, Reason is incorrect
(d) Assertion is incorrect, Reasonis correct.
Q.11. Let A = {1, 2, 3, 4, 6}. If R is the relation on A defined by {(a, b) : a, b ∈A, b is exactly divisible by
a}. Assertion : The relation R in Roster form is {(6, 3), (6, 2), (4, 2)}.
Reason : The domain and range of R is {1, 2, 3, 4, 6}..
Q.12.Assertion : Let f and g be two real functions givenby f = {(0, 1), (2, 0), (3, –4), (4, 2), (5, 1)} and g =
{(1, 0), (2, 2), (3, –1), (4, 4), (5, 3)} Then, domain of f· g is given by {2, 3, 4, 5}.
Reason : Let f and g be two real functions. Then, (f·g)(x) = f {g(x)}.
Ans: 1.C, 2 B, 3. C 4.D, 5. B, 6. B, 7. C 8. A, 9.D, 10.C11. D, 12. C

(ii) Case based study.

1 Students of Grade 11, planned to plant saplings along straight lines, parallel to each other to one side
of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows
of the saplings along the line 𝑦 = 𝑥 − 4. Let L be the set of all lines which are parallel on the ground and R
be a relation on L.

Answer the following using the above information.

(i) Let 𝑓: 𝑅 → 𝑅 be defined by (𝑥) = 𝑥 − 4. Find the range of 𝑓(𝑥)
(ii) Let R = {(L 1 , L 2 ) : L 1 is parallel to L 2 and L 1 : y = x – 4} then write of the equation L 2 ?
(iii) Let relation R be defined by R = {(𝐿1, 𝐿2): 𝐿1║𝐿2 where L1,L2 € L} then show that R is equivalence
relation.

2. Raji visited the Exhibition along with her family. The Exhibition had a huge swing, which attracted
many children. Raji found that the swing traced the path of a Parabola as given by 𝑦 = 𝑥2.

9
Answer the following questions using the above information.
(i) Let f: {1,2,3,….}→{1,4,9,….} be defined by 𝑓(𝑥) = 𝑥2. Prove it is bijective.
(ii) Check the function f: Z→Z defined by (𝑥) = 𝑥2 is injective , surjective.
(iii) Let : 𝑁 → 𝑅 be defined by 𝑓(𝑥) = 𝑥 2 . Write Range of the function.
(iv) Show that : 𝑅 → 𝑅 be defined by 𝑓(𝑥) = 𝑥2 is not one-one.
(v) Let 𝑓: 𝑁 → 𝑁 be defined by (𝑥) = 𝑥2 . Write the domain of f.
3. Kriti and Kirat are two friends studying in class XII in a school at Chandigarh. While doing their
mathematics project on Relations and Functions they have to collect the name of five metro cities and four
cities other than metro cities of India; and present the name of cities in the form of sets. They have collected
the name of cities and write in the form of sets given as follows:
A={ five metro cities of India}= { Delhi, Mumbai, Bangalore, Calcutta, Pune}
and B = {four non metro cities of India} = { Patiala, Agra, Jaipur, Ahmedabad}

Answer the following questions using the above information.

(i) How many functions exist from A to B.
(ii) Riya wants to know how many relation are possible from A to B.
(iii) Karan wants to know how many reflexive relation on set B.
(iv) How many symmetric relation on set A.
(v) Let R : A → A defined by R = { (x, y) : Total number of vehicles in Delhi(x) is greater than total
number of vehicles in Mumbai(y)}. Show that R is neither reflexive nor symmetric.
Ans. 1. (i) R, (ii) y= x +c. , 2. (ii)Neither injective nor surjective, (iii) {1,4,9,16…}, (v) N
3.(i)1024, (ii)220, (iii) 212, (iv)215.
(iii) Short answer type:
1. Let R be the relation on the set {1, 2, 3, 4} given by R  (1,2), (2,2), (1,1), (1,3), (3,2), (3,3), (4,4)}
Check whether the function is reflexive, symmetric or transitive?
2. Show that the relation R in R is defined by R = { (a, b) : a  b } is reflexive and transitive but not
symmetric
3. Determine whether given relation in N is reflexive, symmetric and transitive where
R = {( x, y) : y = x + 5 and x < 4}.

10
4. Show that the relation R defined in the set A of all polygons as R = {(P1, P2): P1 and P2 have same
number of sides}, is an equivalence relation. What is the set of all elements in A related to the right angle
triangle T with sides 3, 4 and 5?
5. Show that the number of equivalence relation in the set {1, 2, 3} containing (1, 2) and (2, 1) is two.
6. Prove that the function f : R  R defined by 4 x 2  12x  15  0 is one-one.
1
7. If f: R → R be given by f x = (3 − x 3 )3 , then find the value of fof (x)
8. Is g = {(1, 1), (2, 3), (3, 5), (4, 7)} a function? If g is described by g (x) = αx + β, then what value
should be assigned to α and β.
1
9. Let f : R → R be the function defined by f (x) = 2−cosx ∀x ∈ R. Then, find the range of f.
10. Give an example of mapping
(i) Which is one-one but not onto
(ii) Which is not one-one but onto
(iii) Which is neither one-one nor onto
Ans.1.Reflexive and transitive only. 4. Neither reflexive nor symmetric and nor transitive
1. Reflexive, symmetric and nor transitive, 7.x , 8. 𝛂=2, β= –1, 9. [1/3,1]

(IV) Long answer type:

1. Let A = {1, 2, 3, ... 9}and R be the relation in A×A defined by (a , b) R (c, d) = (a + c , b + d). Show
that R is equivalence relation and also obtain the equivalent class [(2, 5)].
2. Prove that R is an equivalence relation, R:N ×N→N defined as
(a, b) R (c, d) if and only if ad(b + c) = bc(a + d).
n − 1 if n is odd
3. Let f : W→W be defined as f = Show that f is bijective, W is whole number.
n + 1 if n is even
4. Give an example of a relation which is
(i) Symmetric but neither reflexive nor transitive.
(ii) Transitive but neither reflexive nor symmetric.
(iii) Reflexive and symmetric but not transitive.
(iv) Reflexive and transitive but not symmetric.
(v) Symmetric and transitive but not reflexive.
1
5. Show that the function f : R → {x ∈ R : – 1 < x < 1} defined by f x = 1+|x|,x ∈ R is one-one and
onto function.
6. Show that the function f : R → R given by f(x) = x3 is injective.
x−2
7. Let A = R − 3 and = R − 1 , consider the function f: A → B defined by f x = x−3 . Is f one-
one and onto? Justify your answer.
8. If R1 and R2 are equivalence relations in a set A, show that R1 ∩ R2 is also an equivalence relation.
x2
9. Show that the function f : R → R defined by f x = 1+x 2 ,x ∈ R is neither one-one nor onto function
10. Let A = {– 1, 0, 1, 2}, B = {– 4, – 2, 0, 2} and f, g : A → B be functions definedby f(x) = x2 – x, x ∈
1
A and g x = 2 x − 2 − 1x ∈ A. Are f and g equal? Justify your answer.
Ans. 1. 7. Both one-one and onto. 10. Yes

11
 PRACTICE PAPER (I) M.M: 20

Q. Let f : R → R be defined by f (x) = 1/x ∀ x ∈ R. Then f is 1

1. (A) one-one (B) onto (C) bijective (D) f is not defined
2. Let A = {1, 2, 3, 4}, B = {1, 5, 9, 11, 15, 16} and f = {(1, 5), (2, 9), (3, 1), (4, 5), (2, 11)}. 1
Then,
(a) f is a relation from A to B (b) f is a function from A to B
(c) Both (a) and (b) (d) None of these
3. If A = {2, 3, 4, 5} and B = {3, 6, 7, 10}. R is a relation defined by R = {(a, b) : a is relatively 1
prime to b, a ∈ A and b ∈ B}, then domain of R is
(a) {2, 3, 5} (b) {3, 5} (c) {2, 3, 4} (d) {2, 3, 4, 5}
4 There are three relations R1, R2 and R3 such that R1 = {(2, 1), (3, 1), (4, 2)}, R2 = {(2, 2), (2, 1+1
4), (3, 3), (4, 4)} and R3 = {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6), (6, 7)} Then,
(a) R 1 and R2 are functions (b) R2 and R3 are functions
(c) R 1 and R3 are functions (d) Only R1 is a function
5 If g = {(1, 1), (2, 3), (3, 5), (4, 7)} is a function described by the formula, g (x) = αx + β then 1+1
what values should be assigned to D and E?
(a) α=2, β= 1 (b) α=2, β= -1 (c) α=1, β= -1 (d) α=3, β= -1
6. Show that the relation R defined in the set A of all polygons as R = {(P1, P2) : P1 and P2 have 2
same number of sides}, is an equivalence relation. What is the set of all elements in A related
to the right angle triangle T with sides 3, 4 and 5?
7 1 2
Let f : R → R be the function defined by f (x) =2−cosx ∀x ∈R. Then, find the range of f.

8 Show that the relation R in the set A={ x∈ Z: 0≤ x ≤ 12} given by 5

R={ a − b is divisible by 4} is an equivalence relation. And the equivalence class of 3 i.e.[3]
9

9(i) Sravya draws the graph in ' V shape ' . Write co-ordinate of vertex. 1
9(ii 1
)

Observe the adjacent figure. who is draw it.

9(ii Find the distance between the vertices of the graphs of Rakesh and Navys graphs. 2
)
Ans 1.d, 2.a, 3d , 4c, 5.b, 7.[1/3,1], 9(i)(0,2), 9(ii) Rakesh, 9(iii)2 𝟐

12
 PRACTICE PAPER (II)
M.M: 30

1. Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as 1
aRb if a is congruent to b ∀ a, b ∈ T. Then R is
(A) reflexive but not transitive (B) transitive but not symmetric
(C) equivalence (D) none of these
2 If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one 1
and onto mappings from A to B is
(A) 720 (B) 120 (C) 0 (D) none of these
3 For real numbers x and y, define xRy if and only if x – y + 2 is an irrational number. Then the 1
relation R is
(A) reflexive (B) symmetric (C) transitive (D) equivalence
4 If A = {2, 3, 4, 5} and B = {3, 6, 7, 10}. R is a relation defined by R = {(a, b) : a is less than to b, 1
a ∈ A and b ∈ B}, then domain of R is
(a) {2, 3, 5} (b) {3, 5} (c) {2, 3, 4} (d) {2, 3, 4, 5}
5 Which of the following functions from Z into Z are bijections? 1+1
(A) f (x) = x 3 (B) f (x) = x + 2 (C) f (x) = 2x + 1 (D) f (x) = x 2 + 1
6 1+1

7 1+1

8. Is g = {(1, 1), (2, 3), (3, 5), (4, 7)} a function? If g is described by g (x) = αx + β, then what 4
value should be assigned to α and β.
9 3

10 3

11 5

12 Let A = {– 1, 0, 1, 2}, B = {– 4, – 2, 0, 2} and f, g : A → B be functions defined by f(x) = x2 – x, 5

1
x ∈ A and g x = 2 x − 2 − 1x ∈ A. Are f and g equal? Justify your answer.

Ans 1c, 2c, 3d, 4d, 5c, 6a,b,c, 7b, 8 𝛂=2, β= -1 12.yes

13
 CLICK ON IMAGE TO
JOIN US ON TELEGRAM

CLICK HERE TO JOIN

US ON TELEGRAM