0% found this document useful (0 votes)
123 views5 pages

Relations

The document is a question bank focused on relations and functions, containing multiple-choice questions (MCQs) and detailed solutions. It covers various types of relations, including reflexive, symmetric, transitive, and equivalence relations, providing examples and explanations. Additionally, it includes a section on determining the properties of specific relations defined on sets of numbers and geometric figures.

Uploaded by

Sanjeev MH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
123 views5 pages

Relations

The document is a question bank focused on relations and functions, containing multiple-choice questions (MCQs) and detailed solutions. It covers various types of relations, including reflexive, symmetric, transitive, and equivalence relations, providing examples and explanations. Additionally, it includes a section on determining the properties of specific relations defined on sets of numbers and geometric figures.

Uploaded by

Sanjeev MH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Question Bank with Solutions Relations and Functions

RELATIONS AND FUNCTIONS


RELATIONS
One Mark Questions (MCQ) 9. A relation R in the set 𝐴 = {1, 2, 3} given by
1. Trivial relation is 𝑅 = {(1,1), (2,2), (3,3), (1,2), (2,3)} is
a) Empty relation a) reflexive and transitive
b) Universal relation b) symmetric only
c) both empty and universal relation c) transitive only
d) Equivalence relation. d) neither transitive nor symmetric
2. A relation R on set A “ if each elements of 𝐴 is 10. A relation R in the set 𝐴 = {1, 2, 3} given by
related to every element of A” then R is called 𝑅 = {(1,2), (2,1), (2,2)} is
a) Universal relation b) empty relation a) reflexive and transitive
c) reflexive relation d) symmetric relation b) symmetric and transitive
3. A relation R in the set 𝐴 , if each elements of set 𝐴 c) reflexive but not symmetric
d) symmetric but not transitive
is not related to every element of 𝐴 then 𝑅 is
11. A relation R in the set 𝐴 = {1, 2, 3} given by
called
𝑅 = {(1,2), (2,1), (1,1)} is
a) Empty relation b) universal relation
a) neither symmetric nor transitive
c) Equivalence relation d) Reflexive relation
b) symmetric and transitive
4. A relation 𝑅 on set 𝐴 is called reflexive relation if
c) transitive but not symmetric
a) (𝑎, 𝑎) ∈ 𝑅 for some 𝑎 ∈ 𝐴
d) symmetric but not transitive
b) (𝑎, 𝑎) ∈ 𝑅 for all 𝑎 ∈ 𝐴
12. A relation R in the set 𝐴 = {1, 2, 3} given by
c) if (𝑎, 𝑏) ∈ 𝑅 then (𝑏, 𝑎) ∈ 𝑅
d) if (𝑎, 𝑏)𝑎𝑛𝑑 (𝑏, 𝑐) ∈ 𝑅 then (𝑎, 𝑐) ∈ 𝑅 𝑅 = {(1,2), (2,1)} is
5. Let R be the relation in the set {1, 2, 3, 4} given by a) reflexive b) symmetric
𝑅 = {(1,2), (2,2), (1,1), (4,4), (1,3), (3,3), (3,2)} c) transitive d) Equivalence
choose the correct answer 13. Which of the following relations in the set
{1,2,3} is symmetric and transitive but not
a) R is reflexive ,symmetric but not transitive
reflexive?
b) R is reflexive, transitive but not symmetric
a) {(1,2), (2,1), (1,1)}
c) R is symmetric and transitive but not reflexive
b) {(1,2), (2,1)}
d) R is an Equivalence relation
c) {(2,3)}
6. Let 𝐴 = {𝑎 , 𝑏, 𝑐} relation on A defined by
d) {(1,2), (2,1), (1,1), (2,2)}
𝑅 = {(𝑎, 𝑎), (𝑏, 𝑏), (𝑐, 𝑐), (𝑎, 𝑏), (𝑏, 𝑎), (𝑏, 𝑐)(𝑐, 𝑏)} is
a) reflexive symmetric but not transitive 14. Let 𝐴 = {𝑎 , 𝑏, 𝑐} relation on A defined by
b) reflexive transitive but not symmetric 𝑅 = {(𝑎, 𝑎), (𝑏, 𝑏), (𝑐, 𝑐)} is an example for
c) symmetric and transitive but not reflexive a) Symmetric only b) Reflexive only
d) Equivalence relation c) Transitive only d) Equivalence
7. Let 𝐴 = {1, 2, 3} relation on A defined by 15. The relation R in the set {1,2,3} given by
𝑅 = {(1,2)} is an example for 𝑅 = {(2,3), (3,2)} is___
a) Symmetric b) Reflexive a) Symmetric b) Reflexive
c) Transitive d) Equivalence c) Transitive d) Equivalence
8. A relation R in the set 𝐴 = {1, 2, 3} given by 16. A relation R in the set 𝐴 = {1, 2, 3} given by
𝑅 = {(1,1), (2,3), (3,2), (3,3)} is 𝑅 = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)} is
a) symmetric only a) reflexive but not symmetric
b) symmetric and transitive b) Reflexive but not transitive
c) transitive only c) symmetric and transitive
d) transitive but not symmetric d) neither symmetric nor transitive

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page 1


Question Bank with Solutions Relations and Functions

a) 1 b) 2 c) 3 d) 4
17. The relation 𝑅 defined in the set 𝐴 of all triangles 25. Let L denotes the set of all straight lines in a plane.
as 𝑅 = {(𝑇1 , 𝑇2 )| 𝑇1 𝑖𝑠 𝑠𝑖𝑚𝑖𝑙𝑎𝑟 𝑡𝑜 𝑇2 } is an Let a relation is defined by
equivalence relation. Consider three right angled 𝑅 = {(𝑙, 𝑚): 𝑙 ⊥ 𝑚 𝑎𝑛𝑑 𝑙, 𝑚 ∈ 𝐿} the R is
triangles 𝑇1 with sides 3,4,5 , 𝑇2 with sides 5,12,13 a) Reflexive b) transitive
and 𝑇3 with sides 6,8,10 which triangles among c) symmetric d) Equivalence
𝑇1 , 𝑇2 𝑎𝑛𝑑 𝑇3 are related? 26. The relation “ two lines are parallel” is
a) 𝑇1 & 𝑇2 b) 𝑇2 & 𝑇3 a) Symmetric only b) Reflexive only
c) 𝑇1 & 𝑇3 d) None of these c) Transitive only d) Equivalence
18. Which one of the following relation is transitive 27. Let 𝑊 denote the words in the English dictionary.
only Define the relation 𝑅 by 𝑅 = {(𝑥, 𝑦) ∈ 𝑊 × 𝑊 ∶ the
a) A relation less than or equal on the set 𝑁 words 𝑥 and 𝑦 have at least one letter in
b) A relation less than on the set 𝑁 common}. Then 𝑅 is
c) A relation greater than or equal to on the set 𝑁 a) not reflexive, symmetric and transitive
d) A relation less than or equal to on the set 𝑅 b) reflexive, symmetric and not transitive
19. Let R be the relation in the set N given by c) reflexive, symmetric and transitive
𝑅 = {(𝑎, 𝑏): 𝑎 = 𝑏 − 2, 𝑏 > 6}, then choose the d) reflexive, not symmetric and transitive.
correct answer 28. If 𝑅 = {(𝑎, 𝑏): 𝑎 − 𝑏 𝑖𝑠 𝑎 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑒 𝑜𝑓 4} is an
a)(2,4) ∈ 𝑅 b) (3,8) ∈ 𝑅 equivalence relation on 𝐴 = {1,2,3 … .9} then
c) (6,8) ∈ 𝑅 d) (8,7) ∈ 𝑅 equivalence class of 1 is
20. Let 𝑅 be the relation on the set 𝑁 of natural a) {1,3,5} b) {1,5,9}
numbers defined by 𝑛𝑅𝑚 if “𝑛 divides 𝑚 “ then c) {1,3,5,7,9} d) None of these
𝑅 is ANSWER KEY
a) reflexive and transitive only QN KEY QN KEY QN KEY QN KEY QN KEY
b) transitive and symmetric only 1 c 2 a 3 a 4 b 5 b
c) Equivalence relation. 6 a 7 c 8 a 9 d 10 d
d) neither transitive nor symmetric
11 d 12 b 13 d 14 d 15 a
21. Let A be the set of all students of a boys school.
16 a 17 c 18 b 19 c 20 a
Then the relation R in A given by
𝑅 = {(𝑎, 𝑏): 𝑎 𝑖𝑠 𝑠𝑖𝑠𝑡𝑒𝑟 𝑜𝑓 𝑏} is 21 b 22 b 23 a 24 b 25 c

a) Universal relation b) empty relation 26 d 27 b 28 b


c) reflexive relation d) symmetric relation
22. Consider the non-empty set considering of Three Marks Questions:
children in a family and a relation R defined by Relations:
aRb if a is brother of b. Then R is 1. Check whether the relation 𝑹 defined in the
a) Symmetric but not transitive set {𝟏, 𝟐, 𝟑, 𝟒, 𝟓, 𝟔} as 𝑹 = {(𝒂, 𝒃): 𝒃 = 𝒂 + 𝟏}
b) transitive but not symmetric is reflexive or symmetric.
c) neither symmetric nor transitive Solution: Let 𝐴 = {1,2,3,4,5,6}
d) both symmetric and transitive Given , R = {(a, b)|b = a + 1}
23. Let 𝐴 = {1, 2, 3}. Then number of relations Given: 𝑏 = 𝑎 + 1
containing (1,2) 𝑎𝑛𝑑 (1,3)which are reflexive and If 𝑎 = 1 ⟹ 𝑏 = 1 + 1 = 2 ∈ 𝐴
symmetric but not transitive is If 𝑎 = 2 ⟹ 𝑏 = 2 + 1 = 3 ∈ 𝐴
a) 1 b) 2 c) 3 d) 4 If 𝑎 = 3 ⟹ 𝑏 = 3 + 1 = 4 ∈ 𝐴
24. Let 𝐴 = {1, 2, 3}. Then number of equivalence If 𝑎 = 4 ⟹ 𝑏 = 4 + 1 = 5 ∈ 𝐴
relations containing (1, 2) is If 𝑎 = 5 ⟹ 𝑏 = 5 + 1 = 6 ∈ 𝐴

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page 2


Question Bank with Solutions Relations and Functions

If 𝑎 = 6 ⟹ 𝑏 = 6 + 1 = 7 ∉ 𝐴 ⟹ (𝑥, 𝑧) ∈ 𝑅
Now , 𝑅 = {(1,2), (2,3), (3,4), (4,5), (5,6), } ⟹ R is transitive
Reflexive : Here (1,1) ∉ 𝑅
⟹ R is not reflexive. 4. Check whether the relation 𝑹 defined in the
Symmetric : Here (1,2) ∈ 𝑅 but (2,1) ∉ 𝑅 set 𝑵 of natural number as
⟹ R is not symmetric. 𝑹 = {(𝒙, 𝒚): 𝒚 = 𝒙 + 𝟓 , 𝒙 ≤ 𝟒} is reflexive,
Transitive : Here (1,2), (2,3) ∈ 𝑅 symmetric and transitive.
but (1,3) ∉ 𝑅 ⟹ R is not transitive. Solution: Given, R = {(𝑥, 𝑦): 𝑦 = 𝑥 + 5 , 𝑥 ≤ 4}
Given: 𝑦 = 𝑥 + 5
2. Determine whether the relation R in the set If 𝑥 = 1 ⟹ 𝑦 = 1 + 5 = 6 ∈ 𝑁
𝐀 = {𝟏, 𝟐, 𝟑 . . . . . . 𝟏𝟑, 𝟏𝟒} defined as If 𝑥 = 2 ⟹ 𝑦 = 2 + 5 = 7 ∈ 𝑁
𝐑 = {(𝐱, 𝐲): 𝟑𝐱 − 𝐲 = 𝟎} , is reflexive, If 𝑥 = 3 ⟹ 𝑦 = 3 + 5 = 8 ∈ 𝑁
symmetric and transitive If 𝑥 = 4 ⟹ 𝑦 = 4 + 5 = 9 ∈ 𝑁
Solution: Given , R = {(x, y)|3x − y = 0} Now , 𝑅 = {(1,6), (2,7), (3,8), (4,9)}
⟹ R = {(x, y)|𝑦 = 3𝑥} Reflexive : Here (1,1) ∉ 𝑅
Given: 𝑦 = 3𝑥 ⟹ R is not reflexive.
If 𝑥 = 1 ⟹ 𝑦 = 3(1) = 3 ∈ 𝐴 Symmetric : Here (1,6) ∈ 𝑅 but (6,1) ∉ 𝑅
If 𝑥 = 2 ⟹ 𝑦 = 3(2) = 6 ∈ 𝐴 ⟹ R is not symmetric.
If 𝑥 = 3 ⟹ 𝑦 = 3(3) = 9 ∈ 𝐴 Transitive: Here (𝑎, 𝑏) ∈ 𝑅 but (𝑏, 𝑐) ∉ 𝑅
If 𝑥 = 4 ⟹ 𝑦 = 3(4) = 12 ∈ 𝐴 ⟹ R is transitive.
If 𝑥 = 5 ⟹ 𝑦 = 3(5) = 15 ∉ 𝐴 … … ..
5. Show that the relation 𝑹 in the set
Now , 𝑅 = {(1,3), (2,6), (3,9), (4,12)}
𝑨 = {𝒙: 𝒙 ∈ 𝒁, 𝟎 ≤ 𝒙 ≤ 𝟏𝟐} given by
Reflexive : Here (1,1) ∉ 𝑅
𝑹 = {(𝒂, 𝒃): |𝒂 − 𝒃| 𝒊𝒔 𝒂 𝒎𝒖𝒍𝒕𝒊𝒑𝒍𝒆 𝒐𝒇 𝟒} is an
⟹ R is not reflexive.
equivalence relation.
Symmetric : Here (1,3) ∈ 𝑅 but (3,1) ∉ 𝑅
Solution:
⟹ R is not symmetric.
Given , R = {(a, b)| |a − b| is a multiple of 4}
Transitive : Here (1,3), (3,9) ∈ 𝑅
Reflexive: Let 𝑎 ∈ 𝐴 , we know that
but (1,9) ∉ 𝑅 ⟹ R is not transitive.
|𝑎 − 𝑎| = 0 is a multiple of 4
3. Determine whether the relation 𝑹 defined in ⟹ (𝑎, 𝑎) ∈ 𝑅, ∀ 𝑎 ∈ 𝐴 ⟹ R is reflexive
the set 𝑨 = {𝟏, 𝟐, 𝟑, 𝟒, 𝟓, 𝟔} as Symmetric: Let 𝑎 , 𝑏 ∈ 𝐴 such that (𝑎, 𝑏) ∈ 𝑅
𝑹 = {(𝒙, 𝒚): 𝒚 𝒊𝒔 𝒅𝒊𝒗𝒊𝒔𝒊𝒃𝒍𝒆 𝒃𝒚 𝒙} is reflexive, ⟹ |𝑎 − 𝑏| is a multiple of 4
symmetric and transitive. ⟹ |−(𝑎 − 𝑏)| is a multiple of 4
Solution: Let 𝐴 = {1,2,3,4,5,6} ⟹ |𝑏 − 𝑎| is a multiple of 4
Given , R = {(𝑥, 𝑦)|𝑦 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 𝑥} ⟹ (𝑏, 𝑎) ∈ 𝑅 ⟹ R is symmetric
(1,1), (1,2), (1,3), (1,4), (1,5), (1,6), (2,2) Transitive: Let 𝑎 , 𝑏, 𝑐 ∈ 𝐴
⟹𝑅={ }
(2,4), (2,6), (3,3), (3,6), (4,4), (5,5), (6,6) such that (𝑎, 𝑏), (𝑏, 𝑐) ∈ 𝑅
Reflexive : Here 𝑎 is divisible by 𝑎
⟹ |𝑎 − 𝑏| and |𝑏 − 𝑐| is a multiple of 4
⟹ (𝑎, 𝑎) ∈ 𝑅, ∀ 𝑎 ∈ 𝐴
⟹ 𝑎 − 𝑏 and 𝑏 − 𝑐 is a multiple of 4
⟹ R is reflexive.
⟹ 𝑎 − 𝑏 + 𝑏 − 𝑐 is a multiple of 4
Symmetric : Here (1,2) ∈ 𝑅 but (2,1) ∉ 𝑅
⟹ 𝑎 − 𝑐 is a multiple of 4
⟹ R is not symmetric.
⟹ |𝑎 − 𝑐| is a multiple of 4
Transitive: Let (𝑥, 𝑦), (𝑦, 𝑧) ∈ 𝑅
⟹ (𝑎, 𝑐) ∈ 𝑅 ⟹ R is transitive
⟹ 𝑦 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 𝑥 and 𝑧 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 𝑦
Since R is reflexive symmetric and transitive
⟹ 𝑥 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑦 and 𝑦 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑧
⟹R is an equivalence relation.
⟹ 𝑥 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑧 ⟹ 𝑧 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 𝑥

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page 3


Question Bank with Solutions Relations and Functions

6. Prove that the relation R in the set of integers 8. Show that the Relation R in the set Z of integers
Z defined by𝐑 = {(𝐱, 𝐲): 𝐱 − 𝐲 𝐢𝐬 𝐚𝐧 𝐢𝐧𝐭𝐞𝐠𝐞𝐫) given by 𝑹 = {(𝒙 𝒚): 𝟐 𝒅𝒊𝒗𝒊𝒅𝒆𝒔 (𝒙 − 𝒚)} is an
is an equivalence relation. equivalence Relation.
Solution: Given: 𝑅 = {(𝑥, 𝑦)|𝑥 − 𝑦 𝑖𝑠 𝑎𝑛 𝑖𝑛𝑡𝑒𝑔𝑒𝑟} Solution: Now,𝑅 = {(𝑥, 𝑦)|2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑥 − 𝑦}
Reflexive: Let 𝑥 ∈ 𝑍 ⟹ 𝑅 = {(𝑥, 𝑦): 2 | 𝑥 − 𝑦}
We know that 0 is an integer Reflexive: Let 𝑥 ∈ 𝑍
⟹ 𝑥 − 𝑥 is an integer We know that 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 (𝑥 − 𝑥)
⟹ (𝑥, 𝑥) ∈ 𝑅, ∀ 𝑥 ∈ 𝑍 ⟹ R is reflexive ⟹ (𝑥, 𝑥) ∈ 𝑅, ∀ 𝑥 ∈ 𝑍 ⟹ R is reflexive
Symmetric: Let 𝑥 , 𝑦 ∈ 𝑍 such that (𝑥, 𝑦) ∈ 𝑅 Symmetric: Let 𝑥 , 𝑦 ∈ 𝑍
⟹ 𝑥 − 𝑦 is an integer such that (𝑥, 𝑦) ∈ 𝑅 ⟹ 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑥 − 𝑦
⟹ −(𝑥 − 𝑦) is an integer ⟹ 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 − (𝑥 − 𝑦) ⟹ 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑦 − 𝑥
⟹ 𝑦 − 𝑥 is an integer ⟹ (𝑦, 𝑥) ∈ 𝑅 ⟹ R is symmetric
⟹ (𝑦, 𝑥) ∈ 𝑅 ⟹ R is symmetric Transitive: Let 𝑥 , 𝑦, 𝑧 ∈ 𝑍
Transitive: Let 𝑥 , 𝑦, 𝑧 ∈ 𝑍 such that (𝑥, 𝑦), (𝑦, 𝑧) ∈ 𝑅
such that (𝑥, 𝑦), (𝑦, 𝑧) ∈ 𝑅 ⟹ 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑥 − 𝑦 and 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑦 − 𝑧
⟹ 𝑥 − 𝑦 and 𝑦 − 𝑧 is an integer ⟹ 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑥 − 𝑦 + 𝑦 − 𝑧
⟹ 𝑥 − 𝑦 + 𝑦 − 𝑧 is an integer ⟹ 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑥 − 𝑧 ⟹ (𝑥, 𝑧) ∈ 𝑅
⟹ 𝑥 − 𝑧 is an integer ⟹ (𝑥, 𝑧) ∈ 𝑅 ⟹ R is transitive
⟹ R is transitive Since R is reflexive symmetric and transitive
Since R is reflexive symmetric and transitive ⟹ R is an equivalence relation.
⟹ R is an equivalence relation.
9. Show that the Relation R in the set Z of
7. Show that the relation R in the set integers given by
𝑨 = {𝟏, 𝟐, 𝟑, 𝟒, 𝟓} given by 𝑹 = {(𝒙 𝒚): 𝟓 𝒅𝒊𝒗𝒊𝒅𝒆𝒔 (𝒙 − 𝒚)} is an
𝑹 = {(𝒂, 𝒃): |𝒂 − 𝒃|𝒊𝒔 𝒆𝒗𝒆𝒏}, is an Equivalence Relation.
equivalence relation. Solution: Now,𝑅 = {(𝑥, 𝑦)|5 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑥 − 𝑦}
Solution: Now, 𝑅 = {(𝑎, 𝑏)| |𝑎 − 𝑏| 𝑖𝑠 𝑒𝑣𝑒𝑛} ⟹ 𝑅 = {(𝑥, 𝑦): 5 | 𝑥 − 𝑦}
Reflexive: Let 𝑎 ∈ 𝐴 Reflexive: Let 𝑥 ∈ 𝑍
We know that |0| is even ⟹ |𝑎 − 𝑎| is even We know that 5 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 (𝑥 − 𝑥)
⟹ (𝑎, 𝑎) ∈ 𝑅, ∀ 𝑎 ∈ 𝐴 ⟹ R is reflexive ⟹ (𝑥, 𝑥) ∈ 𝑅, ∀ 𝑥 ∈ 𝑍 ⟹ R is reflexive
Symmetric: Let 𝑎 , 𝑏 ∈ 𝐴 such that Symmetric: Let 𝑥 , 𝑦 ∈ 𝑍
(𝑎, 𝑏) ∈ 𝑅 ⟹ |𝑎 − 𝑏| is even such that (𝑥, 𝑦) ∈ 𝑅 ⟹ 5 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑥 − 𝑦
⟹ |−(𝑎 − 𝑏)| is even ⟹ |𝑏 − 𝑎| is even ⟹ 5 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 − (𝑥 − 𝑦) ⟹ 5 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑦 − 𝑥
⟹ (𝑏, 𝑎) ∈ 𝑅 ⟹ R is symmetric ⟹ (𝑦, 𝑥) ∈ 𝑅 ⟹ R is symmetric
Transitive: Let 𝑎 , 𝑏, 𝑐 ∈ 𝐴 Transitive: Let 𝑥 , 𝑦, 𝑧 ∈ 𝑍
such that (𝑎, 𝑏), (𝑏, 𝑐) ∈ 𝑅 such that (𝑥, 𝑦), (𝑦, 𝑧) ∈ 𝑅
⟹ |𝑎 − 𝑏| and |𝑏 − 𝑐| is even ⟹ 5 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑥 − 𝑦 and 5 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑦 − 𝑧
⟹ 𝑎 − 𝑏 and 𝑏 − 𝑐 is even ⟹ 5 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑥 − 𝑦 + 𝑦 − 𝑧
⟹ 𝑎 − 𝑏 + 𝑏 − 𝑐 is even ⟹ 5 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑥 − 𝑧 ⟹ (𝑥, 𝑧) ∈ 𝑅
⟹ 𝑎 − 𝑐 is even⟹ |𝑎 − 𝑐| is even ⟹ R is transitive
⟹ (𝑎, 𝑐) ∈ 𝑅 ⟹ R is transitive Since R is reflexive symmetric and transitive
Since R is reflexive symmetric and transitive ⟹ R is an equivalence relation.
⟹ R is an equivalence relation.

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page 4


Question Bank with Solutions Relations and Functions

10. Show that the relation R in R defined as Transitive : Now, 10 < 33 ⟹ (10,3) ∈ 𝑅
𝑹 = {(𝒂, 𝒃)|𝒂 ≤ 𝒃} , is reflexive and and 3 < 23 ⟹ (3,2) ∈ 𝑅
transitive but not symmetric. But 10 ≤ 23 𝑖𝑠 𝑛𝑜𝑡 𝑡𝑟𝑢𝑒 ⟹ (10,2) ∉ 𝑅
Solution: Given , 𝑅 = {(𝑎, 𝑏)/ 𝑎 ≤ 𝑏} ⟹ R is not transitive
Reflexive: Let 𝑎 ∈ 𝑅 ∴ R is neither reflexive nor symmetric
We know that 𝑎 = 𝑎 nor transitive
⟹ (𝑎, 𝑎) ∈ 𝑅, ∀ 𝑎 ∈ 𝑅 ⟹ R is reflexive
Symmetric: Let 1 , 2 ∈ 𝑅 13. Show that the relation 𝑹 defined in the set 𝑨 of
such that (1,2) ∈ 𝑅 𝑏𝑒𝑐𝑎𝑢𝑠𝑒 1 < 2 all triangles as
Now, 2 > 1 ⟹ 2 ≰ 1 ⟹ (2,1) ∉ 𝑅 𝑹 = {(𝑻𝟏 , 𝑻𝟐 )| 𝑻𝟏 𝒊𝒔 𝒔𝒊𝒎𝒊𝒍𝒂𝒓 𝒕𝒐 𝑻𝟐 } is an
⟹ R is not symmetric equivalence relation.
Transitive: Let 𝑎 , 𝑏, 𝑐 ∈ 𝑅 Solution:
such that (𝑎, 𝑏), (𝑏, 𝑐) ∈ 𝑅 Given , R = {(𝑇1 , 𝑇2 )| 𝑇1 𝑖𝑠 𝑠𝑖𝑚𝑖𝑙𝑎𝑟 𝑡𝑜 𝑇2 }
⟹𝑎 ≤𝑏&𝑏 ≤𝑐 ⟹𝑎 ≤ 𝑐 Reflexive: Let 𝑇1 ∈ 𝐴 ,
⟹ (𝑎, 𝑐) ∈ 𝑅 ⟹ R is transitive we know that, 𝑇1 is similar to itself
∴ R is reflexive and transitive but not ⟹ (𝑇1 , 𝑇1 ) ∈ 𝑅, ∀ 𝑇1 ∈ 𝐴 ⟹ R is reflexive
symmetric. Symmetric: Let 𝑇1 , 𝑇2 ∈ 𝐴 such that
(𝑇1 , 𝑇2 ) ∈ 𝑅
⟹ 𝑇1 𝑖𝑠 𝑠𝑖𝑚𝑖𝑙𝑎𝑟 𝑡𝑜 𝑇2
11. Check whether the relation 𝐑 in 𝐑 defined by
⟹ 𝑇2 𝑖𝑠 𝑠𝑖𝑚𝑖𝑙𝑎𝑟 𝑡𝑜 𝑇1 ⟹ (𝑇2 , 𝑇1 ) ∈ 𝑅
𝐑 = {(𝐚, 𝐛)|𝐚 ≤ 𝐛𝟐 } is reflexive, symmetric or ⟹ R is symmetric
transitive. Transitive: Let 𝑇1 , 𝑇2 , 𝑇3 ∈ 𝐴
Solution: Given , 𝑅 = {(𝑎, 𝑏)/ 𝑎 ≤ 𝑏 2 } such that (𝑇1 , 𝑇2 ), (𝑇2 , 𝑇3 ) ∈ 𝑅
1 1 1 2
Reflexive: Now ∈ 𝑅 and ≤ ( ) is not true ⟹ 𝑇1 𝑖𝑠 𝑠𝑖𝑚𝑖𝑙𝑎𝑟 𝑡𝑜 𝑇2 and 𝑇2 𝑖𝑠 𝑠𝑖𝑚𝑖𝑙𝑎𝑟 𝑡𝑜 𝑇3
2 2 2
1 1 ⟹ 𝑇1 𝑖𝑠 𝑠𝑖𝑚𝑖𝑙𝑎𝑟 𝑡𝑜 𝑇3 ⟹ (𝑇1 , 𝑇3 ) ∈ 𝑅
⟹ (2 , 2) ∉ 𝑅, ⟹ R is transitive
⟹ R is not reflexive Since R is reflexive symmetric and transitive
Symmetric: Now, 1 < 22 ⟹ (1,2) ∈ 𝑅 ⟹R is an equivalence relation.
but ⟹ 2 ≤ 12 𝑖𝑠 𝑛𝑜𝑡 𝑡𝑟𝑢𝑒 ⟹ (2,1) ∉ 𝑅
⟹ R is not symmetric 14. Show that the relation 𝑹 defined in the set 𝑨 of all
Transitive : Now, 8 < 32 ⟹ (8,3) ∈ 𝑅 triangles as 𝑹 = {(𝑻𝟏 , 𝑻𝟐 )| 𝑻𝟏 𝒊𝒔 𝒄𝒐𝒏𝒈𝒓𝒖𝒆𝒏𝒕 𝒕𝒐 𝑻𝟐 }
and 3 < 22 ⟹ (3,2) ∈ 𝑅 is an equivalence relation.
But 8 ≤ 22 𝑖𝑠 𝑛𝑜𝑡 𝑡𝑟𝑢𝑒 ⟹ (8,2) ∉ 𝑅 Solution:
⟹ R is not transitive Given , R = {(𝑇1 , 𝑇2 )| 𝑇1 𝑖𝑠 𝑐𝑜𝑛𝑔𝑟𝑢𝑒𝑛𝑡 𝑡𝑜 𝑇2 }
∴ R is neither reflexive nor symmetric nor Reflexive: Let 𝑇1 ∈ 𝐴 ,
transitive we know that, 𝑇1 is congruent to itself
⟹ (𝑇1 , 𝑇1 ) ∈ 𝑅, ∀ 𝑇1 ∈ 𝐴 ⟹ R is reflexive
Symmetric: Let 𝑇1 , 𝑇2 ∈ 𝐴 such that
12. Check whether the relation 𝐑 in 𝐑 defined by
(𝑇1 , 𝑇2 ) ∈ 𝑅
𝐑 = {(𝐚, 𝐛)|𝐚 ≤ 𝐛𝟑 } is reflexive, symmetric or
⟹ 𝑇1 𝑖𝑠 congruent 𝑡𝑜 𝑇2
transitive. ⟹ 𝑇2 𝑖𝑠 congruent 𝑡𝑜 𝑇1 ⟹ (𝑇2 , 𝑇1 ) ∈ 𝑅
Solution: Given , 𝑅 = {(𝑎, 𝑏)/ 𝑎 ≤ 𝑏 3 } ⟹ R is symmetric
1
Reflexive: Now 2 ∈ 𝑅 Transitive: Let 𝑇1 , 𝑇2 , 𝑇3 ∈ 𝐴
1 1 3 1 1 such that (𝑇1 , 𝑇2 ), (𝑇2 , 𝑇3 ) ∈ 𝑅
⟹ ≤ ( ) 𝑖𝑠 𝑛𝑜𝑡 𝑡𝑟𝑢𝑒 ⟹ ( , ) ∉ 𝑅,
2 2 2 2 ⟹ 𝑇1 𝑖𝑠 congruent 𝑡𝑜 𝑇2 and
⟹ R is not reflexive 𝑇2 𝑖𝑠 congruent 𝑡𝑜 𝑇3
Symmetric: Now, 1 < 23 ⟹ (1,2) ∈ 𝑅 ⟹ 𝑇1 𝑖𝑠 congruent 𝑡𝑜 𝑇3 ⟹ (𝑇1 , 𝑇3 ) ∈ 𝑅
but 2 ≤ 13 𝑖𝑠 𝑛𝑜𝑡 𝑡𝑟𝑢𝑒 ⟹ (2,1) ∉ 𝑅 ⟹ R is transitive
⟹ R is not symmetric Since R is reflexive symmetric and transitive
⟹R is an equivalence relation.

Mr. Sharath Patil G H, Lecturer, Dept of Mathematics, DAVANGERE Page 5

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy