An equivalence relation is reflexive, symmetric and transitive.
What Is Equivalence Relation?
An equivalence relation is reflexive, symmetric and transitive.
Examples of Equivalence Relation
1
Congruence modulo 3 is an equivalence relation on integers.Formula and Key Points
Formula / rule
Reflexive + Symmetric + Transitive
- Know the definition and standard notation for Equivalence Relation.
- Be able to recognise or compute equivalence relation in a small example.
- Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
Why This Matters in Computer Science
Used in algorithm proofs, counting, recurrence analysis, data structures and theoretical computer science.
Related Math Terms
Equivalence Relation: Frequently Asked Questions
What is Equivalence Relation?
An equivalence relation is reflexive, symmetric and transitive.
Why is Equivalence Relation useful in computer science?
Used in algorithm proofs, counting, recurrence analysis, data structures and theoretical computer science.