Equivalence class
Given a set X and an equivalence relation ~ over X, an equivalence class is a subset of X of the form
- { x in X | x ~ a }
| Table of contents |
|
2 Properties 3 See also: |
Examples:
- If X is the set of all cars, and ~ is the equivalence relation of "having the same color", then one particular equivalence class consists of all green cars. X / ~ could be naturally identified with the set of all car colors.
- Consider the "modulo 2" equivalence relation on the set of integers: x~y if and only if x-y is even. This relation gives rise to exactly two equivalence classes: [0] consisting of all even numbers, and [1] consisting of all odd numbers.
- Given a group G and a subgroup H, we can define an equivalence relation on G by x ~ y iff xy -1 ∈ H. The equivalence classes are known as right cosets of H in G. If H is a normal subgroup, then the set of all cosets is itself a group in a natural way.
- Every group can be partitioned into equivalence classes called conjugacy classes.
- The rational
numbers can be constructed as the set of equivalence classes of pairs of integers
(a,b) where the equivalence relation is defined by
- The homotopy class of a continuous map f is the equivalence class of all maps homotopic to f.
Properties
Because of the properties of an equivalence relation it holds that a is in [a] and that any two equivalence classes are either equal or disjoint. It follows that the set of all equivalence classes of X forms a partition of X: every element of X belongs to one and only one equivalence class. Conversely every partition of X also defines an equivalence relation over X.
It also follows from the properties of an equivalence relation that
- a ~ b if and only if [a] = [b].
- a ~ b if and only if [a] = [b].


