Equivalence relation
https://en.wikipedia.org/wiki/Equivalence_relation
An equivalence relation is a binary relation that is at the same time reflexive, symmetric and transitive.
A given binary relation on a set is said to be an equivalence relation iff it is reflexive, symmetric and transitive.
That is, :
reflexivity:
symmetry:
transitivity,
A set together with the relation is called a setoid.
As a consequence of these 3 properties an equivalence relation provides a partition of a set into equivalence classes. Two elements of the given set are equivalent to each other iff they belong to the same equivalence class.
The equivalence class of under , denoted , is defined as: . For example, if is the set of all cars, and is the equivalence relation has-the-same-color-as, then one particular equivalence class consists of all green cars.
The relation is-equal-to
The relation is-equal-to (=), is the canonical example of an equivalence relation, where :
reflexivity:
symmetry: if then
transitivity: if and then
Example #1
The relation is defined by the set of the ordered pairs, , on the set . Is an equivalence relation?
Reflexivity:
it needs to have 3 ordered pairs to be reflexive, which it does:
Symmetry:
if then
if it has a pair then it must also have a pair
Transitivity:
if and then
if there's a pair and then there must be
if then : it does have it
All 3 properties hold so an equivalence relation.
Last updated
Was this helpful?