Board Questions - Relations and Functions

QUESTIONS FROM BOARD PAPERS
CHAPTER 1 : RELATIONS AND FUNCTIONS

PREPARED BY
M SRINIVASAN
PGT (MATHS)
KENDRIYA VIDYALAYA SANGATHAN
Revision, as the name suggests, means looking
back over previously learned information
ensuring that it is clear and fresh in the mind
5 Questions from board papers in selected
topic is presented at this video series
The steps in answers are supported by the
ideas used for getting the answer
1. Let R be an equivalence relation in the set A={0, 1, 2, 3, 4, 5}
given by 𝑹 = 𝒂, 𝒃 : 𝟐 𝒅𝒊𝒗𝒊𝒅𝒆𝒔 𝒂 − 𝒃 . Write the
equivalence class {0} CBSE 2014
The equivalence classes {0} is the set of elements in A which are related to 0
under the given relation
{0} = 𝒂 , 𝟎 ∈ 𝑹: 𝒂 ∈ 𝑨
⟹ 𝟐 𝒅𝒊𝒗𝒊𝒅𝒆𝒔 𝒂 − 𝟎 for 𝒂 ∈ 𝑨
⟹ 𝟐 𝒅𝒊𝒗𝒊𝒅𝒆𝒔 𝒂 for 𝒂 ∈ 𝑨
⟹ 𝒂 = 𝟎, 𝟐, 𝟒
{0} = 𝟎, 𝟐, 𝟒
2. Let A = {1, 2, 3}. Find the number of equivalence relations
containing (1 , 2). CBSE 2020
A  A = {(1 , 1), (1 , 2), (1 , 3), (2 , 1), (2 , 2), (2, 3), (3, 1), (3, 2), (3 , 3)}
For Reflexive (1, 1), (2, 2) and (3 ,3) should be in the relation
For symmetric if (1 ,2) is there in the relation (2 ,1) should
also be in the relation
For transitivity if (1 ,2) and (2, 1) are there in the relation
(1 ,1) should also be in the relation
𝑹𝟏 = 𝟏, 𝟏 , 𝟐, 𝟐 , 𝟑, 𝟑 , 𝟏, 𝟐 , 𝟐, 𝟏
A  A = {(1 , 1), (1 , 2), (1 , 3), (2 , 1), (2 , 2), (2, 3), (3, 1), (3, 2), (3 , 3)}
𝑹𝟏 = 𝟏, 𝟏 , 𝟐, 𝟐 , 𝟑, 𝟑 , 𝟏, 𝟐 , 𝟐, 𝟏
For transitivity if (1 , 2) and (2 , 3) are there in the relation
(1 ,3) should also be in the relation
𝑹𝟐 = 𝟏, 𝟏 , 𝟐, 𝟐 , 𝟑, 𝟑 , 𝟏, 𝟐 , 𝟐, 𝟏 , 𝟏, 𝟑 , 𝟑, 𝟏 , (𝟏, 𝟑)
There are two possible relations on A

3. Prove that the relation R on the set N  N defined by
𝒂 , 𝒃 𝑹 𝒄 , 𝒅 ⟺ 𝒂 + 𝒅 = 𝒃 + 𝒄 is an equivalence relation.
Also, find the equivalence classes [(2 , 3)] and [(7 , 3)]
CBSE 2010
Reflexive
Let 𝒂 , 𝒃 ∈ 𝑵 × 𝑵
𝒂 ,𝒃 𝑹 𝒂 ,𝒃 ⟹ 𝒂 + 𝒃 = 𝒂 + 𝒃
⟹ 𝒂 , 𝒃 𝑹 𝒂 , 𝒃 for all 𝒂 , 𝒃 ∈ 𝑵 × 𝑵
Relation R is Reflexive on N  N
Symmetry
Let 𝒂 , 𝒃 , (𝒄 , 𝒅) ∈ 𝑵 × 𝑵
𝒂 ,𝒃 𝑹 𝒄 ,𝒅 ⟹ 𝒂 + 𝒅 = 𝒃 + 𝒄
𝒄 ,𝒅 𝑹 𝒂 ,𝒃 ⟹ 𝒄 + 𝒃 = 𝒅 + 𝒂
𝑯𝒆𝒏𝒄𝒆 𝒂 , 𝒃 𝑹 𝒄 , 𝒅 ⟹ 𝒂 , 𝒃 𝑹 𝒄 , 𝒅 for all 𝒂 , 𝒃 , (𝒄 , 𝒅) ∈ 𝑵 × 𝑵
Relation R is Symmetric on N  N
Transitivity
Let 𝒂 , 𝒃 , 𝒄 , 𝒅 , (𝒆 , 𝒇) ∈ 𝑵 × 𝑵
𝒂 ,𝒃 𝑹 𝒄 ,𝒅 ⟹ 𝒂 + 𝒅 = 𝒃 + 𝒄
𝒄 ,𝒅 𝑹 𝒆 ,𝒇 ⟹ 𝒄 + 𝒇 = 𝒅 + 𝒆
On adding, 𝒂 + 𝒅 + 𝒄 + 𝒇 = 𝒃 + 𝒄 + 𝒅 + 𝒆
⟹𝒂+𝒇=𝒃+𝒆
𝒂 ,𝒃 𝑹 𝒆 ,𝒇
𝑯𝒆𝒏𝒄𝒆 𝒂 , 𝒃 𝑹 𝒄 , 𝒅 , 𝒄 , 𝒅 𝑹 𝒆 , 𝒇 ⟹ 𝒂 , 𝒃 𝑹 𝒆 , 𝒇
for all 𝒂 , 𝒃 , 𝒄 , 𝒅 , (𝒆, 𝒇) ∈ 𝑵 × 𝑵
Relation R is Transitive on N  N
The relation R being Reflexive, Symmetric and Transitive, is
an equivalence relation on N  N
The equivalence classes [(2 , 3)] is the set of elements in NN which
are related to (2, 3)
[(2 , 3)] = 𝒙 , 𝒚 ∈ 𝑵 × 𝑵: 𝒙 , 𝒚 𝑹(𝟐, 𝟑)
= 𝒙 , 𝒚 ∈ 𝑵 × 𝑵: 𝒙 + 𝟑 = 𝒚 + 𝟐
= 𝒙 , 𝒚 ∈ 𝑵 × 𝑵: 𝒚 = 𝒙 + 𝟏
= 𝒙 ,𝒙 + 𝟏 ∈ 𝑵 × 𝑵
= 𝟏 ,𝟐 , 𝟐 ,𝟑 , 𝟑 ,𝟒 ,……
The equivalence classes [(7 , 3)] is the set of elements in NN which
are related to (7, 3)
[(7 , 3)] = 𝒙 , 𝒚 ∈ 𝑵 × 𝑵: 𝒙 , 𝒚 𝑹(𝟕, 𝟑)
= 𝒙 , 𝒚 ∈ 𝑵 × 𝑵: 𝒙 + 𝟑 = 𝒚 + 𝟕
= 𝒙 , 𝒚 ∈ 𝑵 × 𝑵: 𝒚 = 𝒙 − 𝟒
= 𝒙 ,𝒙 − 𝟒 ∈ 𝑵 × 𝑵
= 𝟓 ,𝟏 , 𝟔 ,𝟐 , 𝟕 ,𝟑 ,……
𝒏 + 𝟏 𝒊𝒇 𝒏 𝒊𝒔 𝒐𝒅𝒅
4. Let f: N → N be defined by 𝒇 𝒙 = ቊ 𝒇𝒐𝒓 𝒏𝑵
𝒏 − 𝟏 𝒊𝒇 𝒏 𝒊𝒔 𝒆𝒗𝒆𝒏
Show that 𝒇 𝒙 is bijective. CBSE 2012
To Check one-one Let 𝒎 , 𝒏 𝑵
Assume m is odd and n is even Assume m and n are even
𝒇(𝒎) = 𝒇(𝒏) ⟹ 𝒎 + 𝟏 = 𝒏 − 𝟏 𝒇(𝒎) = 𝒇(𝒏) ⟹ 𝒎 − 𝟏 = 𝒏 − 𝟏
⟹ 𝒎 − 𝒏 = −𝟐 Not Possible
⟹𝒎=𝒏
Assume m is even and n is odd
Assume m and n are odd
𝒇(𝒎) = 𝒇(𝒏) ⟹ 𝒎 − 𝟏 = 𝒏 + 𝟏
𝒇(𝒎) = 𝒇(𝒏) ⟹ 𝒎 + 𝟏 = 𝒏 + 𝟏
⟹𝒎−𝒏=𝟐 Not Possible
⟹𝒎=𝒏
𝒇 𝒎 = 𝒇 𝒏 ⟹𝒎=𝒏 Hence 𝒇(𝒙) is one-one
𝒏 + 𝟏 𝒊𝒇 𝒏 𝒊𝒔 𝒐𝒅𝒅
𝒇 𝒙 =ቊ 𝒇𝒐𝒓 𝒏𝑵
𝒏 − 𝟏 𝒊𝒇 𝒏 𝒊𝒔 𝒆𝒗𝒆𝒏
To Check ONTO Let 𝒏 𝑵 (𝒄𝒐𝒅𝒐𝒎𝒂𝒊𝒏)
Assume 𝒏 is odd
For 𝒏 = 𝟐𝒓 + 𝟏, there exist 𝟐𝒓 ∈ 𝑵 𝒅𝒐𝒎𝒂𝒊𝒏 such that
𝒇 𝟐𝒓 = 𝟐𝒓 + 𝟏
Assume 𝒏 is even
For 𝒏 = 𝟐𝒓, there exist 𝟐𝒓 + 𝟏 ∈ 𝑵 𝒅𝒐𝒎𝒂𝒊𝒏 such that
𝒇 𝟐𝒓 + 𝟏 = 𝟐𝒓
Hence 𝒇(𝒙) is onto
𝒇(𝒙) is bijective
𝒙
5. If 𝒇: 𝑹 → 𝑹 is defined by 𝒇 𝒙 = 𝟐 , check if 𝒇(𝒙) is one-one or
𝒙 +𝟏
onto 𝟏 CBSE 2018
To Check one-one Let 𝟐 ,  𝑹 (𝑫𝒐𝒎𝒂𝒊𝒏)
𝟐
𝟐 𝟐
𝒇 𝟐 = 𝟐 +𝟏 =
𝟐 𝟓
𝟏 𝟏
𝟏 𝟐 𝟐 𝟐
𝒇 = 𝟏 𝟐
= 𝟓 =
𝟐 𝟓
+𝟏 𝟒
𝟐
𝟏 𝟏
𝟐 ≠, but 𝒇(𝟐) = 𝒇
𝟐 𝟐
𝒇(𝒙) is not one-one

To Check ONTO
Let 𝟏 𝑹 (𝑪𝒐 − 𝑫𝒐𝒎𝒂𝒊𝒏)

Assume 𝒙 𝑹 (𝑫𝒐𝒎𝒂𝒊𝒏) such that 𝒇 𝒙 = 𝟏
𝒙
⟹ 𝟐 = 𝟏
𝒙 +𝟏
⟹ 𝟐
𝒙 −𝒙 +𝟏=𝟎
𝟐
𝒙 − 𝒙 + 𝟏 = 𝟎 has no real roots
Hence, 𝟏 𝑹 (𝑪𝒐 − 𝑫𝒐𝒎𝒂𝒊𝒏) has no 𝒙 𝑹 (𝑫𝒐𝒎𝒂𝒊𝒏) such
that 𝒇 𝒙 = 𝟏
𝒇(𝒙) is not onto

Board Questions - Relations and Functions

Uploaded by

Copyright:

Available Formats

Board Questions - Relations and Functions

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Board Questions - Relations and Functions

Uploaded by

Copyright:

Available Formats

QUESTIONS FROM BOARD PAPERS

CHAPTER 1 : RELATIONS AND FUNCTIONS

There are two possible relations on A

𝑯𝒆𝒏𝒄𝒆 𝒂 , 𝒃 𝑹 𝒄 , 𝒅 ⟹ 𝒂 , 𝒃 𝑹 𝒄 , 𝒅 for all 𝒂 , 𝒃 , (𝒄 , 𝒅) ∈ 𝑵 × 𝑵

[(7 , 3)] = 𝒙 , 𝒚 ∈ 𝑵 × 𝑵: 𝒙 , 𝒚 𝑹(𝟕, 𝟑)

𝒇(𝒙) is not one-one

Let 𝟏 𝑹 (𝑪𝒐 − 𝑫𝒐𝒎𝒂𝒊𝒏)

𝒇(𝒙) is not onto

You might also like