Course contentsShow
← Mathematics
Lesson 2552 of 3,12151. Discrete Math — Sets, Relations, FunctionsFree lesson

Equivalence Classes

Understand equivalence classes as sets of elements that are all related to each other under an equivalence relation.

Equivalence Classes

What You'll Learn

You'll learn how equivalence classes partition a set into disjoint subsets where every element in a subset is equivalent to every other element under an equivalence relation.

The Core Idea

Once you have an equivalence relation on a set, you can group elements together based on whether they're related. An equivalence class is the collection of all elements that are equivalent to a particular element.

For any element a in set A, the equivalence class of a (denoted [a] or [a]~) is:

[a] = {x ∈ A : x ~ a}

In plain English: the equivalence class of a contains every element x that is related to a.

Why This Matters

Equivalence classes have a powerful property: they partition the entire set. This means:

  • Every element belongs to exactly one equivalence class
  • Two equivalence classes are either identical or completely disjoint (no overlap)
  • The union of all equivalence classes gives you back the original set

A Concrete Example

Consider the relation "has the same remainder when divided by 3" on integers:

  • [0] = {..., -6, -3, 0, 3, 6, 9, ...} (all multiples of 3)
  • [1] = {..., -5, -2, 1, 4, 7, 10, ...} (one more than multiples of 3)
  • [2] = {..., -4, -1, 2, 5, 8, 11, ...} (two more than multiples of 3)

Notice that 6 and 9 are both in [0] because they're equivalent to each other (and to 0). These three classes contain every integer exactly once—they partition the integers completely.

The Analogy

Think of sorting laundry: if your equivalence relation is "same color," then [red shirt] contains all red items, [blue jeans] contains all blue items, etc. Every piece of clothing goes into exactly one color pile.

Key Takeaway: An equivalence class [a] collects all elements equivalent to a; together, all equivalence classes partition the set into non-overlapping groups of mutually related elements.