I have no Ida how to approach this problem:
Suppose S is a relation on a set X which is reflexive and transitive. Then S intersection S inverse is an equivalence relation on X.
Any idea on how I would tackle this would be appreciated.
|
I have no Ida how to approach this problem: Suppose S is a relation on a set X which is reflexive and transitive. Then S intersection S inverse is an equivalence relation on X. Any idea on how I would tackle this would be appreciated. |
|||||||||||
|
|
This is what I call a follow your nose proof: at each stage there’s really only one sensible thing to do, and it works. You have a reflexive, transitive relation $S$ on a set $X$, and you want to prove that $S\cap S^{-1}$ is an equivalence relation. Check the definition of an equivalence relation: it’s a relation that is reflexive, symmetric, and transitive, so to prove that $S\cap S^{-1}$ is an equivalence relation, you must prove that it is reflexive, symmetric, and transitive. Take them one at a time.
|
|||
|