Skip to content

Equivalence Relation

Definition

An equivalence relation on a set AA is a relation ∼\sim on AA such that, for all a,b,c∈Aa,b,c\in A, it is:

  1. reflexive: a∼aa\sim a;
  2. symmetric: if a∼ba\sim b, then b∼ab\sim a;
  3. transitive: if a∼ba\sim b and b∼cb\sim c, then a∼ca\sim c.

Interpretation

An equivalence relation formalizes when different objects should be treated as the same for a particular purpose, for example integers that leave the same remainder after division by 33, or sets of the same cardinality.

The numbers 0 to 8 grouped into three shaded ovals by their remainder modulo 3: {0, 3, 6}, {1, 4, 7} and {2, 5, 8}, the equivalence classes that partition the set.

In the figure x∼yx\sim y if and only if xx and yy leave the same remainder after division by 33, on the set A={0,1,…,8}A=\{0,1,\ldots,8\}, labelled XX in the figure. The relation sorts the nine numbers into the three equivalence classes [0]={0,3,6}[0]=\{0,3,6\}, [1]={1,4,7}[1]=\{1,4,7\} and [2]={2,5,8}[2]=\{2,5,8\}, where [x]={y∈A ⁣:y∼x}[x]=\{y\in A\colon y\sim x\}. The classes partition AA: every element lies in exactly one class, and [x]=[y][x]=[y] if and only if x∼yx\sim y.

Each property has a job. Reflexivity puts xx into its own class [x][x], so no element is left out. Symmetry and transitivity prevent classes from overlapping without being equal: if zz lies in both [x][x] and [y][y], then x∼zx\sim z and z∼yz\sim y, so x∼yx\sim y and the two classes coincide. Without one of them this breaks down. The relation ≤\le on R\mathbb{R} is reflexive and transitive but not symmetric, and "differ by at most 11" is reflexive and symmetric but not transitive: 00 is related to 11 and 11 to 22, but 00 is not related to 22.

Equal cardinality is another example: it relates two sets when there is a bijection between them.


Key Results


Examples

  • Congruence modulo nn is an equivalence relation on integers.

Prerequisites

Sources

Aliases: equivalency relation Keywords: equivalence class Symbols: element of, real numbers

Last updated: 20 October 2026 03:02