


Introducing your new favourite teacher - Teachoo Black, at only ₹83 per month
To prove relation reflexive, transitive, symmetric and equivalent
Example 4 Important
Ex 1.1, 6
Ex 1.1, 15 (MCQ) Important
Ex 1.1, 7
Ex 1.1, 1 (i)
Ex 1.1, 2
Ex 1.1, 3
Ex 1.1, 4 You are here
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. 8 Important
Example 42 Important
Example 41
To prove relation reflexive, transitive, symmetric and equivalent
Last updated at July 5, 2019 by Teachoo
Ex 1.1, 4 Show that the relation R in R defined as R = {(a, b) : a b}, is reflexive and transitive but not symmetric. R = { (a,b) : a b } Here R is set of real numbers Hence, both a and b are real numbers Check reflexive We know that a = a a a (a, a) R R is reflexive. Check symmetric To check whether symmetric or not, If (a, b) R, then (b, a) R i.e., if a b, then b a Since b a is not true for all values of a & b Hence, the given relation is not symmetric Check transitive If a b, & b c , then a c If (a, b) R & (b, c) R , then (a, c) R Hence, the given relation is transitive Hence, R = {(a, b) : a b}, is reflexive and transitive but not symmetric