Define reflexive, symmetric and transitive relations. When is a relation called an equivalence relation?
Reveal model answer + marking pointsHide answer▾
A relation R on a set A is reflexive if (a, a) belongs to R for every a in A. It is symmetric if (a, b) in R implies (b, a) in R. It is transitive if (a, b) in R and (b, c) in R together imply (a, c) in R. A relation that is reflexive, symmetric and transitive at the same time is called an equivalence relation.
Marking-scheme points
- ✓Reflexive: (a, a) in R for all a
- ✓Symmetric: (a, b) in R => (b, a) in R
- ✓Transitive: (a, b), (b, c) in R => (a, c) in R; all three => equivalence