Equivalence Relations
Reflexive, symmetric and transitive relations partition a set.
Key idea
Reflexive, symmetric and transitive relations partition a set.
In depth
A relation that is reflexive, symmetric and transitive. It splits the set into disjoint equivalence classes, so every element belongs to exactly one class. Congruence mod n is the model example.
Worked example
Congruence mod 3 splits the integers into three classes: multiples of 3, those with remainder 1, those with remainder 2.
Real-world uses
- Grouping equal fractions or cities in the same time zone
- Sorting records by matching keys
Common mistake
Checking only some of the three properties.
How to learn this
- Read the key idea and say it in your own words.
- Work through the worked example, then try a similar problem.
- Use the interactive lesson’s visual and mini-quiz to check the pattern.
Frequently asked questions
What is Equivalence Relations?
Reflexive, symmetric and transitive relations partition a set. It is a topic at the advanced level in Discrete Math & Number Theory.
Where is Equivalence Relations used in real life?
Real-world examples: Grouping equal fractions or cities in the same time zone; Sorting records by matching keys.
What should I learn before Equivalence Relations?
Make sure you are comfortable with Relations, the previous topic in Discrete Math & Number Theory.
What is a common mistake with Equivalence Relations?
Checking only some of the three properties.
How can I practise Equivalence Relations?
Open the interactive lesson, play with the visual, then answer the three-question mini-quiz. Getting two right marks the topic complete.
What comes after Equivalence Relations?
Move on to Partial Orders next.
Related advanced topics in Discrete Math & Number Theory
- Tautologies and Contradictions – Always true or always false statements.
- Logical Equivalence – Statements with identical truth tables.
- De Morgan’s Laws – Negation swaps AND and OR.
- Converse and Contrapositive – A conditional equals its contrapositive.
- Quantifiers – “For all” and “there exists”.
- Negating Quantified Statements – Flip the quantifier and negate the predicate.