Equivalence Classes Math Example 1

Follow the full solution, then compare it with the other examples linked below.

Example 1

medium
Define the relation aba \sim b on Z\mathbb{Z} by 'aba \sim b iff ab(mod3)a \equiv b \pmod{3}'. Verify this is an equivalence relation and list the equivalence classes.

Solution

  1. 1
    Reflexive: aa(mod3)a \equiv a \pmod{3} (since 303 \mid 0). True.
  2. 2
    Symmetric: if 3(ab)3 \mid (a-b), then 3(ba)3 \mid (b-a). True.
  3. 3
    Transitive: if 3(ab)3 \mid (a-b) and 3(bc)3 \mid (b-c), then 3(ac)3 \mid (a-c) (by addition). True.
  4. 4
    Equivalence classes: [0]={,3,0,3,6,}[0]=\{\ldots,-3,0,3,6,\ldots\}, [1]={,2,1,4,7,}[1]=\{\ldots,-2,1,4,7,\ldots\}, [2]={,1,2,5,8,}[2]=\{\ldots,-1,2,5,8,\ldots\}. These three classes partition Z\mathbb{Z}.

Answer

Z/3Z={[0],[1],[2]}\mathbb{Z}/3\mathbb{Z} = \{[0],[1],[2]\}
An equivalence relation partitions a set into disjoint equivalence classes. Modular arithmetic provides the canonical example: every integer belongs to exactly one class [0],[1],,[n1][0],[1],\ldots,[n-1] modulo nn.

About Equivalence Classes

An equivalence class is the set of all elements that are related to a given element under an equivalence relation — it groups objects that are considered 'the same' in some specified sense.

Learn more about Equivalence Classes →

More Equivalence Classes Examples