Teachers' Copy
Test Name: Relation &
Board: CBSE Standard: 12th Subject: Mathematics
Function
Questions: 20 Time: 30 Minutes Marks: 30
1: Let set X = {1, 2, 3} and a relation R is defined in X as: R = {(1, 3), (2, 2), (3, 2)}, then Mark: 2.00
minimum ordered pairs which should be added in relation R to make it reflexive and
symmetric are
{(1, 1), (2, 3), (1, 2)} {(3, 3), (3, 1), (1, 2)}
{(1, 1), (3, 3), (3, 1), (2, 3)} {(1, 1), (3, 3), (3, 1), (1, 2)}
2: Read the following text and answer the following questions on the basis of the same: Mark: 2.00
A general election of Lok Sabha is a gigantic exercise. About 911 million people were
eligible to vote and voter turnout was about 67%, the highest ever Let I be the set of all
citizens of India who were eligible to exercise their voting right in general election held
in 2019. A relation ‘R’ is defined on I as follows:
ONE – NATION
ONE – ELECTION
FESTIVAL OF DEMOCRACY
GENERAL ELECTION - 2019
R = {(V1 , V2 ) : V1 , V2 ∈ I and both use their voting right in general election – 2019}
Two neighbours X and Y ∈ I. X exercised his voting right while Y did not cast her vote
in general election - 2019. Which of the following is true?
(X, Y) ∈ R (Y, X) ∈ R
(X, X) ∉ R (X, Y) ∉ R
3: Read the following text and answer the following questions on the basis of the same: Mark: 2.00
Rohan is confused in the Mathematics topic 'Relation and equivalence relation'. To
clear his concepts on the topic, he took help his elder brother. He has following notes on
this topic.
Relation : A relation R from a set A to a set B is a subset of the cartesian product A × B
obtained by describing a relationship between first element x and the second element
'y' of the ordered pairs in A × B. A relation R in a set A is called. :
Reflexive : If (a, a) ∈ R ∀ a ∈ A
Symmetric : If (a1 , a1 ) ∈ R ⇒ (a2 , a1 ) ∈ R ∀ a1 , a2 ∈ R.
Transitive : If (a1 , a1 ) ∈ R and (a2 , a3 ) ∈ R ⇒ (a1 , a3 ) ∈ R ∀ a1 , a2 , a3 ∈ A
Equivalence Relation : A relation R in a set A is an equivalence relation if R is reflexive,
symmetric and transitive.
Show that relation defined by R1 = {(x, y) | x2 = y2} x, y ∈ R is an equivalence relation.
Given relation R1 = {(x, y) | x2 = y2}
Reflexive : For all x ∈ R, x2 = x2, so, (x, x) ∈ R1
Hence, R1 is reflexive relation.
Symmetric : For all x, y ∈ R
If x2 = y2 then y2 = x2
Hence, R1 is symmetric relation.
Transitive : For all x, y ∈ R, x2 = y2 and for all y, z ∈ R y2 = z2
∴ x2 = y2 = z2, for all x, y, z ∈ R
Hence, R1 is transitive.
Thus, R1 is an equivalence relation.
4: Let R be the relation in the set N given by R = {(a, b) : a = b – 2, b > 6}, then : Mark: 2.00
(2, 4) ∈ R (3, 8) ∈ R
(6, 8) ∈ R (8, 7) ∈ R
5: In the following questions, a statement of Assertion (A) is followed by a Mark: 2.00
statement of Reason (R). Choose the correct answer out of the following
choices.
Assertion (A): The possible number of reflexive relations of a set A whose
n(A) = 4 is 212. Reason (R): Number of reflexive relation on a set contain n
elements is
2
n -n
2
Both A and R are true, and R is the correct Both A and R are true, but R is not the correct
explanation of A. explanation of A.
A is true but R is false. A is false and R is true.
6: Check if the relation R in the set R of real numbers defined as R = {(a, b) : a < b} is (i) Mark: 2.00
symmetric, (ii) transitive.
(i) Since such that 1 < 2 ⇒ (1, 2) ∈ R, but since 2 is not less than 1 ⇒ (2, 1) ∉ R. Hence R is not symmetric.
(ii) Let (a, b) ∈ R and (b, c) ∈ R, ∴ a < b and b < c
⇒ a < c ⇒ (a, c) R ∴ R is transitive.
Detailed Answer:
(i) It is not symmetric because if a < b then b < a is not true.
(ii) Here, if a < b and b < c then a < c is also true for all a, b, c ∈ Real numbers. Therefore R is transitive.
7: Check if the relation R on the set A = {1, 2, 3, 4, 5, 6} defined as R = {(x, y) : y is Mark: 2.00
divisible by x} is (i) symmetric (ii) transitive.
(i) As (2, 4) ∈ R but (4, 2) ∉ R ⇒ R is not symmetric,
(ii) Let (a, b) ∈ R and (b, c) ∈ R
⇒ b = λa and c = μb
Now, C = μb = μ(λa) ⇒ (a, c) ∈ R
⇒ R is transitive
Detailed Answer:
A = {1, 2, 3, 4, 5, 6}
R = {(x, y) : y is divisible by x}
(i) Symmetric
Let (x, y) ∈ R
y is divisible by x
∴ x is not necessarily divisible by y
(y, x) ∉ R
e.g., (1, 2) ∈ R
2 is divisible by 1
but 1 is not divisible by 2
(2, 1) ∉ R
Hence, Given Relation is not symmetric
(ii) Transitive
Let (x, y) ∈ R
y is divisible by x ...(i)
and (y, z) ∈ R
z is divisible by y ...(ii)
From eq(i) and eq(ii)
z is divisible by x
∴ (x, z) ∈ R
e.g., (1, 2) ∈ R
2 is divisible by 1 ...(i)
(2, 4) ∈ R
4 is divisible by 2 ...(ii)
From eq(i) and eq(ii)
4 is divisible by 1
(1, 4) ∈ R
Hence, Given Relation is transitive.
8: How many equivalence relations on the set {1, 2, 3} containing (1, 2) and (2, 1) are Mark: 2.00
there in all ? Justify your answer.
Equivalence relations could be the following :
{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)} and {(1, 1), (2, 2), (3, 3), (1, 2), (1, 3), (2, 1), (2, 3), (3, 1), (3, 2)}
So, only two equivalence relations.
9: Let f : X → Y be a function. Define a relation R on X given by R = {(a, b) : f(a) = f(b)}. Mark: 2.00
Show that R is a transitive relation.
Let (a, b), (b, c) ∈ R, f(a) = f(b), f(b) = f(c) ⇒ f(a) = f(c), (a, c) ∈ R. Thus, Relation is transitive.
10: Read the following text and answer the following questions on the basis of the same: Mark: 2.00
A general election of Lok Sabha is a gigantic exercise. About 911 million people were
eligible to vote and voter turnout was about 67%, the highest ever Let I be the set of all
citizens of India who were eligible to exercise their voting right in general election held
in 2019. A relation ‘R’ is defined on I as follows:
ONE – NATION
ONE – ELECTION
FESTIVAL OF DEMOCRACY
GENERAL ELECTION - 2019
R = {(V1 , V2 ) : V1 , V2 ∈ I and both use their voting right in general election – 2019}
The above defined relation R is __________
Symmetric and transitive but not reflexive Universal relation
Equivalence relation Reflexive but not symmetric and transitive
11: How many reflexive relations are possible in a set A whose n(A) = 3 Mark: 1.00
26 reflexive relations.
Detailed Answer:
Given, n(A) = 3
Total number of reflexive relations = 2n(n – 1)
= 23(3 – 1) = 23 × 2 = 26
12: An equivalence relation R in A divides it into equivalence classes A1, A2, A3. Mark: 1.00
What is the value of A1 ∪ A2 ∪ A3 and A1 ∩ A2 ∩ A3.
A1 ∪ A2 ∪ A3 = A and A1 ∩ A2 ∩ A3 = ϕ
13: Read the following text and answer the following questions on the basis of the same: Mark: 1.00
Students of Grade 9, 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 y = x − 4. Let L
be the set of all lines which are parallel on the ground and R be a relation on L.
Let relation R be defined by R = {(L1, L2) : L1 || L2 where L1, L2 ∈ L} then R is______
relation
Equivalence Only reflexive
Not reflexive Symmetric but not transitive
14: State the reason why the Relation R = {(a, b) : a ≤ b2} on the set R of real numbers is Mark: 1.00
not reflexive.
2
Since,
1 1 1 1
> ( ) ⇒ ( , ) ∉ R.
2 2 2 2
Hence, R is not reflexive.
15: State the reason for the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} not to Mark: 1.00
be transitive.
We know that, for a relation to be transitive,
(x, y) ∈ R and (y, z) ∈ R ⇒ (x, z) ∈ R.
Here, (1, 2) ∈ R and (2, 1) ∈ R but (1, 1) ∈ R.
∴ R is not transitive.
16: 2 4x+3 Mark: 1.00
Show that the function f in A = R− {
3
} defined as f(x) =
6x−4
is onto.
Let, y ∈ B
2
= R − { }
3
∴ y = f(x)
4x+3
or y = 6x−4
or y(6x – 4) = 4x + 3
or 6xy – 4y = 4x +3
or 6xy – 4x = 4y + 3
or x(6y – 4) = 4y + 3
4y+3
or x =
2
∈ B = R − { }
6y−4 3
4y+3
or For every value of y except y = { , there is a pre-image x = .
2
} = g(y)
3 6y−4
∴ f is onto.
17: Show that the function f : R → R defined by f (x) = x
2
x +1
,∀ x ∈ R is neither one-one Mark: 1.00
nor onto.
Checking for one-one:
here f (x) = f ( ) . For example f (2) = f (
1 1
)
x 2
∴ f is not one-one
Checking for onto:
Let y = 1 ∈ R (co-domain) . Then
x
y = f (x) ⇒ 2
= 1
x +1
⇒ x2 – x + 1 = 0, which has no real roots.
∴ Rf ≠ co-domain ⇒ f is not onto.
18: A relation R in the set of real numbers R defined as R − {(a, b) : √a = b} is a function Mark: 1.00
or not. Justify
Since √a is not defined for a ∈(−∞, 0)
∴ √a = b is not a function
19: Check which of the following function is onto or into. Mark: 1.00
(i) f : A → B, given by f(x) = 3x, where A = {0, 1, 2} and B = {0, 3, 6}.
(ii) f : Z → Z, given by f(x) = 3x + 2, where Z = set of integers.
(i) We have a function f : A → B, given by f(x) = 3x,where A = {0, 1, 2} and B = {0, 3, 6}
Let y ∈ B be any arbitrary element. y
Then, y = f (x) ⇒ y = 3x ⇒ x = 3
Thus, f is onto
Now,
0
at y = 0, x = = 0 ∈ A
3
3
At y = 3, x = = 1 ∈ A
3
6
At y = 6, x = = 2 ∈ A
3
Thus, for each element y of B, there is a pre-image in A.
(ii) We have a function f : Z → Z, given by f(x) = 3x + 2.
Let y ∈ Z, (codomain of f) be any arbitrary element.
y−2
Then y = f(x) ⇒ y = 3x + 2 ⇒ x = 3
Clearly for some elements y of z,
There is no pre-image in z
⇒ f is into.
20: In the following questions, a statement of Assertion (A) is followed by a Mark: 1.00
statement of Reason (R). Choose the correct answer out of the following
choices.
Assertion (A): Given a relation R = {x, y); (x, y ∈ Z; x2 + y2 ≤ 9}, the domain of
R is {–3, –2, –1, 0, 1, 2, 3}.
Reason (R): For domain of R, put y = 0, then x2 ≤ 9.
Both A and R are true, and R is the correct Both A and R are true, but R is not the correct
explanation of A. explanation of A.
A is true but R is false. A is false and R is true.
