To prove relation reflexive, transitive, symmetric and equivalent
Example 4 Important
Ex 1.1, 6
Ex 1.1, 15 (MCQ) Important You are here
Ex 1.1, 7
Ex 1.1, 1 (i)
Ex 1.1, 2
Ex 1.1, 3
Ex 1.1, 4
Ex 1.1, 5 Important
Ex 1.1, 10 (i)
Ex 1.1, 8
Ex 1.1, 9 (i)
Example 5
Example 6 Important
Example 2
Ex 1.1, 12 Important
Ex 1.1, 13
Ex 1.1, 11
Example 3
Ex 1.1, 14
Misc 3 Important
Example 19 Important
Example 18
To prove relation reflexive, transitive, symmetric and equivalent
Last updated at April 16, 2024 by Teachoo
Ex 1.1, 15 Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer. (A) R is reflexive and symmetric but not transitive. (B) R is reflexive and transitive but not symmetric. (C) R is symmetric and transitive but not reflexive. (D) R is an equivalence relation. R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Check Reflexive If the relation is reflexive, then (a, a) ∈ R for every a ∈ {1, 2, 3, 4} Since (1, 1), (2, 2), (3, 3) & (4, 4) ∈ R. ∴ R is reflexive Check symmetric To check whether symmetric or not, If (a, b) ∈ R, then (b, a) ∈ R Here (1, 2) ∈ R , but (2, 1) ∉ R ∴ R is not symmetric Check transitive To check whether transitive or not, If (a, b) ∈ R & (b, c) ∈ R , then (a, c) ∈ R Here, (1, 3) ∈ R and (3, 2) ∈ R & (1, 2) ∈ R. ∴ R is transitive Hence, R is reflexive and transitive but not symmetric. The correct answer is B.