Courses
Courses for Kids
Free study material
Offline Centres
More
Store Icon
Store
seo-qna
SearchIcon
banner

Prove that intersection of equivalence relations on a set is also an equivalence relation.

Answer
VerifiedVerified
505.8k+ views
like imagedislike image
Hint: An equivalence relation is a binary relation that is reflexive, symmetric, and transitive. For the objects where
a=a (reflexive property)
if a=b and b=a(symmetric property)
if a=b and b=c, then a=c (transitive property)
In this question, to prove that the intersection of equivalence relations on a set is also an equivalence relation proves all that the set satisfies all the properties of equivalence.

Complete step-by-step solution
Let us assume P and Q are two equivalence sets whose intersection is to be proved of set S
So set S implies PQ equivalence, where
xS(x,xP)andxS(x,xQ)
(x,x)PQ
PQis Reflexive
Now to check symmetric
(x,y)PQ
Hence
(x,y)Pand (x,y)Q
are symmetrical
(y,x)Pand (y,x)Q
(y,x)PQ
Hence PQis symmetric.
Now for transitive property
(x,y)PQand (y,z)PQ
(x,y)Pand(y,z)P(x,z)P
(x,y)Qand(y,z)Q(x,z)Q
Therefore P and Q are transitive
PQis transitive
Hence all the properties of equivalence are satisfied, therefore PQis an equivalence relation.

Note: Two elements from an equivalence relation are called equivalent. The set of one element has only one equivalence relation with one equivalence class.