Equivalence relations “group together” the elements that share a property. Each element aa identifies its equivalence class [a]={xA:xRa}.[a]=\{x\in A : x\mathbin{R} a\}. The set of classes forms a partition of AA: each element belongs to exactly one class.

Example — Remainder of division by 33

On Z\mathbb{Z} we set aRba\mathbin{R} b if aba-b is a multiple of 33. It is an equivalence relation (the three properties can be checked). There are three classes: [0]={,3,0,3,6,},[1]={,2,1,4,7,},[2]={,1,2,5,8,}.[0]=\{\ldots,-3,0,3,6,\ldots\},\quad [1]=\{\ldots,-2,1,4,7,\ldots\},\quad [2]=\{\ldots,-1,2,5,8,\ldots\}. Every integer belongs to exactly one class, determined by the remainder (00, 11 or 22) upon division by 33. This is the first step of modular arithmetic.

Topics: Set theory
Concepts: Equivalence class · Partition · Equivalence relation