Equivalence class

This article is about equivalency in mathematics; for equivalency in music see equivalence class (music).

In mathematics, given a set X and an equivalence relation ~ on X, the equivalence class of an element a in X is the subset of all elements in X which are equivalent to a:

$[a]_X = \{ x \in X | x \sim a \}.$

The notion of equivalence classes is useful for constructing sets out of already constructed ones. The set of all equivalence classes in X given an equivalence relation ~ is usually denoted as X / ~ and called the quotient set of X by ~. This operation can be thought of (very informally) as the act of "dividing" the input set by the equivalence relation, hence both the name "quotient", and the notation, which are both reminiscent of division. One way in which the quotient set resembles division is that if X is finite and the equivalence classes are all equinumerous, then the order of X/~ is the quotient of the order of X by the order of an equivalence class. The quotient set is to be thought of as the set X with all the equivalent points identified.

For any equivalence relation, there is a canonical projection map π from X to X/~ given by π(x) = [x]. This map is always surjective. In cases where X has some additional structure, one considers equivalence relations which preserve that structure. Then one says that that structure is well-defined, and the quotient set inherits the structure to become an object of the same category in a natural fashion; the map that sends a to [a] is then an epimorphism in that category. See congruence relation.

The alternative notation [a]_R can be used to denote that we mean the equivalence class of the element a specifically with respect to the equivalence relation R. This is said to be the R-equivalence class of a.

Examples

• If X 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. X / ~ could be naturally identified with the set of all car colors.
• Consider the "modulo 2" equivalence relation on the set Z of integers: x~y if and only if x-y is even. This relation gives rise to exactly two equivalence classes: one class consisting of all even numbers, and the other consisting of all odd numbers. Under this relation [7] [9] and [1] all represent the same element of Z / ~.
• The rational numbers can be constructed as the set of equivalence classes of ordered pairs of integers (a,b) with b not zero, where the equivalence relation is defined by

(a,b) ~ (c,d) if and only if ad = bc.

Here the equivalence class of the pair (a,b) can be identified with rational number a/b. This construction can be generalized to the field of fractions of an integral domain.

• Any function f : X → Y defines an equivalence relation on X by x₁ ~ x₂ if and only if f(x₁) = f(x₂). The equivalence class of x is the set of all elements in X which get mapped to f(x), i.e. the class [x] is the inverse image of f(x). This equivalence relation is known as the kernel of f.
• Given a group G and a subgroup H, we can define an equivalence relation on G by x ~ y if and only if xy ^-1 ∈ H. The equivalence classes are known as right cosets of H in G; one of them is H itself. They all have the same number of elements (or cardinality in the case of an infinite H). 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 homotopy class of a continuous map f is the equivalence class of all maps homotopic to f.
• In natural language processing, an equivalence class is a set of all references to a single person, place, thing, or event, either real or conceptual. For example, in the sentence "GE shareholders will vote for a successor to the company's outgoing CEO Jack Welch", GE and the company are synonymous, and thus constitute one equivalence class. There are separate equivalence classes for GE shareholders and Jack Welch.
• In an equivalence relation's matrix, the equivalence classes appear as blocks. In this example these equivalence blocks are marked in different colors, to be easily recognized.

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].

If ~ is an equivalence relation on X, and P(x) is a property of elements of x, such that whenever x ~ y, P(x) is true if P(y) is true, then the property P is said to be well-defined or a class invariant under the relation ~.

A frequent particular case occurs when f is a function from X to another set Y; if x₁ ~ x₂ implies f(x₁) = f(x₂) then f is said to be a morphism for ~, a class invariant under ~, or simply invariant under ~. This occurs, e.g. in the character theory of finite groups. The latter case with the function f can be expressed by a commutative triangle. See also invariant. Some authors use "compatible with ~" or just "respects ~" instead of "invariant under ~".

More generally, a function may map equivalent arguments (under an equivalence relation ~_A) to equivalent values (under an equivalence relation ~_B). Such a function is known as a morphism from ~_A to ~_B.

In other words, if ~ is an equivalence relation on a set A and a and b are two elements, then these statements are equivalent:

• a ~ b
• [a] = [b]
• $[a] \cap [b] \ne \emptyset$

See also

• First Isomorphism Theorem
• In computing a form of testing is based on equivalence partitions, which are based on equivalence classes.