Practice question · Multiple choice
An equivalence relation partitions its set into classes with no overlaps and nothing left out. Why do reflexivity, symmetry and transitivity together force that structure?
Hints
- Which property guarantees no element is missed?
- Suppose two classes share an element z. Use symmetry and transitivity to relate any a in one to any b in the other.
Show the answer
A. Because reflexivity leaves nothing out, and symmetry with transitivity forbid overlap.
Why
Reflexivity puts every element in its own class, so nothing is left out. For overlaps: if [a] and [b] share z then a ~ z and b ~ z, symmetry and transitivity give a ~ b, and the classes coincide. All three are load-bearing, 'is less than' is transitive alone and partitions nothing. The converse holds too, so partitions and equivalence relations are one idea.
Practise Relations and Equivalence
The app has 5 more questions on this lesson, and keeps your place in the course. Mathematics I is free to start.
More questions on Relations and Equivalence
- Complete the definition of transitivity.
- Let R be 'has the same parity as' on {1, 2, 3, 4}. Select every pair that belongs to R.
- "Has the same remainder mod 3" partitions the integers into three classes. Why is the quotient construction,…
- Order the steps that verify 'has the same parity as' is an equivalence relation.
- Every function is a relation.
- An equivalence relation is reflexive, symmetric AND transitive. Sort each relation.
- The relation 'has the same remainder when divided by 3' partitions the integers into equivalence classes. How…