Relations and functions · Definition

Equivalence class

set theoryrelations and functions

Before you start you need to know

An equivalence class gathers into a single block the elements that an equivalence relation regards as equal.

Definition

Given an equivalence relation \(R\) on \(A\) and an element \(a\in A\), the equivalence class \([a]\) is the set of all \(x\in A\) with \(x\,R\,a\).

\[[a]=\{x\in A : x\,R\,a\}\]

Equivalence classes form a partition of \(A\): every element belongs to some class, and two classes are either equal or disjoint. Moreover, \(x\in[a]\) if and only if \([x]=[a]\). That is why the set of classes \(A/R\), called the quotient set, counts the ways of being equal without repetition.

Worked example: on \(A=\{1,2,3,4,5,6\}\), the relation «has the same parity as» has two classes, \([1]=\{1,3,5\}\) and \([2]=\{2,4,6\}\). So \(A/R\) has 2 elements, even though \(A\) has 6.

Typical mistake: reading \([a]\) as if it were the element \(a\). The class is a subset of \(A\), and the same class can be named with different representatives: \([1]=[3]=[5]\) in the example above.

Think about it

Can two distinct equivalence classes share elements?

No: two classes are either equal or disjoint.

Exercises 10

References

  • Herbert B. Enderton, Elements of Set Theory, 1st edition, Academic Press, 1977.
  • Thomas Jech, Set Theory (The Third Millennium Edition), 3rd millennium edition, Springer, 2003.