Let R be an equivalence relation on a set S. Let E and F be two distinct equivalence classes of R. Prove that E and F = null set.

Do i show that itys transitive im a bit stuck. Help much appreciated thanks.

Printable View

- Dec 30th 2009, 03:33 AMadam_leedsDistinct equivalent classes the null set
Let R be an equivalence relation on a set S. Let E and F be two distinct equivalence classes of R. Prove that E and F = null set.

Do i show that itys transitive im a bit stuck. Help much appreciated thanks. - Dec 30th 2009, 03:43 AMSwlabr
- Dec 30th 2009, 03:45 AMadam_leeds
- Jan 5th 2010, 11:21 AMadam_leeds
- Jan 5th 2010, 11:50 AMDefunkt
- Jan 5th 2010, 01:47 PMDrexel28
More of a forward-knowledge looking back approach (since you need to do this problem to prove what I'm about to say), but a relation on induces a partition of where the blocks are the equivalence classes. If that is a definition in your book the answer follows immediately.