Thank you for registering.

One of our academic counsellors will contact you within 1 working day.

Please check your email for login details.
MY CART (5)

Use Coupon: CART20 and get 20% off on all online Study Material

ITEM
DETAILS
MRP
DISCOUNT
FINAL PRICE
Total Price: Rs.

There are no items in this cart.
Continue Shopping

Let A = {1, 2, 3, ... 9} and R be the relation in A ×A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A ×A. Prove that R is an equivalence relation and also obtain the equivalent class [(2, 5)].

 Let A = {1, 2, 3, ... 9} and R be the relation in A ×A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A ×A.
Prove that R is an equivalence relation and also obtain the equivalent class [(2, 5)]. 

Grade:12

1 Answers

Harshit Singh
askIITians Faculty 5965 Points
one year ago
Dear Student
Given that
A = {1, 2, 3, ... 9} and (a, b) R (c, d) if a + d = b + c for (a, b), (c, d)∈A ×A.
Let (a, b) R(a, b)
So, a + b = b + a,∀a, b∈A which is true for any a, b∈A.
Thus, R is reflexive.

Let (a, b) R(c, d) Then, a+d=b+c c+b=d+a

(c, d) R(a, b)
Thus, R is symmetric.
Let (a, b) R(c, d) and (c, d) R(e, f)
a + d = b + c and c + f = d + e
a + d = b + c and d + e = c + f
(a + d)–(d + e = (b + c)–(c + f) a–e=b–f
a+f=b+e
(a, b) R(e, f)
So, R is transitive.
Therefore, R is an equivalence relation.

Thanks

Think You Can Provide A Better Answer ?

Provide a better Answer & Earn Cool Goodies See our forum point policy

ASK QUESTION

Get your questions answered by the expert for free