Example 48 - Chapter 1 Class 12 Relation and Functions
Last updated at May 29, 2018 by Teachoo
Transcript
Example 48 Show that the number of equivalence relation in the set {1, 2, 3} containing (1, 2) and (2, 1) is two. Total possible pairs = { (1, 1) , (1, 2), (1, 3), (2, 1) , (2, 2), (2, 3), (3, 1) , (3, 2), (3, 3) } Reflexive means (a, a) should be in relation . So, (1, 1) , (2, 2) , (3, 3) should be in a relation Symmetric means if (a, b) is in relation, then (b, a) should be in relation . So, since (1, 2) is in relation, (2, 1) should also be in relation Transitive means if (a, b) is in relation, & (b, c) is in relation, then (a, c) is in relation So, if (1, 2) is in relation, & (2, 1) is in relation, then (1, 1) should be in relation Relation R1 = { Total possible pairs = { (1, 1) , (1, 2), (1, 3), (2, 1) , (2, 2), (2, 3), (3, 1) , (3, 2), (3, 3) } So, smallest relation is R1 = { (1, 2), (2, 1), (1, 1), (2, 2), (3, 3) } If we add (2, 3), then we have to add (3, 2) also , as it is symmetric but, as (1 , 2) & (2, 3) are there, we need to add (1, 3) also , as it is transitive As we are adding (1, 3), we should add (3, 1) also, as it is symmetric Relation R2 = { Hence, only two possible relations are there which are equivalence
Examples
Example 1
Example 2
Example 3
Example 4 Important
Example 5
Example 6 Important
Example 7
Example 8
Example 9
Example 10
Example 11 Important
Example 12 Important
Example 13 Important
Example 14 Important
Example 15
Example 16
Example 17
Example 18 Important
Example 19 Important
Example 20
Example 21
Example 22
Example 23 Important
Example 24
Example 25 Important
Example 26
Example 27 Important
Example 28
Example 29
Example 30
Example 31
Example 32
Example 33
Example 34
Example 35
Example 36
Example 37
Example 38
Example 39
Example 40
Example 41 Important
Example 42 Important
Example 43 Important
Example 44
Example 45 Important
Example 46 Important
Example 47 Important
Example 48 Important You are here
Example 49
Example 50
Example 51 Important
Chapter 1 Class 12 Relation and Functions
Serial order wise
About the Author
Davneet Singh
Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He has been teaching from the past 9 years. He provides courses for Maths and Science at Teachoo.