Verifying Equivalence Relations
What you'll learn: You'll practice systematically checking whether a given relation qualifies as an equivalence relation by verifying all three required properties.
The Core Idea
An equivalence relation must satisfy three properties simultaneously: reflexive, symmetric, and transitive. Your job when verifying is to check each property methodically—if even one fails, the relation is not an equivalence relation.
Think of it like inspecting a bridge: it needs a solid foundation (reflexive), balanced structure (symmetric), and connected spans (transitive). Miss one, and the bridge fails inspection.
The Verification Checklist
1. Reflexive Check: Does every element relate to itself?
For all a in the set, is (a, a) in the relation?
2. Symmetric Check: If one element relates to another, does the reverse hold?
For all a, b, if (a, b) is in the relation, is (b, a) also in it?
3. Transitive Check: Does the relation chain properly?
For all a, b, c, if (a, b) and (b, c) are in the relation, must (a, c) be too?
Example Verification
Consider the relation "has the same birthday month as" on a set of people:
- Reflexive? Yes—you have the same birthday month as yourself.
- Symmetric? Yes—if Alice shares a birthday month with Bob, then Bob shares one with Alice.
- Transitive? Yes—if Alice and Bob share a month, and Bob and Carol share a month, then Alice and Carol share a month.
✓ All three pass → This is an equivalence relation.
Counter-example: "is older than" on people fails reflexive (you're not older than yourself) and symmetric (if A is older than B, B isn't older than A).
Key Takeaway: To verify an equivalence relation, you must confirm all three properties—reflexive, symmetric, and transitive—hold for every applicable element or pair in the set. A single counterexample to any property disqualifies the relation.