Equivalence Relations

What Makes a Relation “Equivalence”?

An equivalence relation is a relation that satisfies three properties:

  1. Reflexive - everything is equivalent to itself
  2. Symmetric - if a is equivalent to b, then b is equivalent to a
  3. Transitive - if a ~ b and b ~ c, then a ~ c

If a relation has all three, it’s an equivalence relation.


The Symbol ~

We often use ~ (tilde) for equivalence relations.

aba \sim b reads as “a is equivalent to b.”


Equivalence Relations Partition Sets

The key idea: an equivalence relation divides a set into groups where everything in a group is equivalent.

These groups are called equivalence classes. No overlaps, nothing left out.


Examples

“Same remainder when divided by 3” on integers:

  • 7107 \sim 10 because both have remainder 1
  • 6126 \sim 12 because both have remainder 0
  • 7≁87 \not\sim 8 because 7 has remainder 1, but 8 has remainder 2

Is it an equivalence relation?

PropertyCheck
Reflexive555 \sim 5? Yes, 5 has the same remainder as itself
Symmetric7107 \sim 10 implies 10710 \sim 7? Yes
Transitive7107 \sim 10 and 10410 \sim 4 implies 747 \sim 4? Yes, all have remainder 1

All three hold, so it’s an equivalence relation.


“Same length” on line segments:

Two segments are equivalent if they have the same length.

PropertyCheck
ReflexiveA segment has the same length as itself
SymmetricIf A has same length as B, then B has same length as A
TransitiveIf A = B in length, and B = C in length, then A = C

All three hold. It’s an equivalence relation.


Equivalence Classes

An equivalence relation groups elements that are equivalent to each other.

The equivalence class of aa is the set of all elements equivalent to aa.

Written as [a][a].


Example: “Same remainder mod 3” on integers.

[0]={,6,3,0,3,6,9,}[0] = \{\ldots, -6, -3, 0, 3, 6, 9, \ldots\}

[1]={,5,2,1,4,7,10,}[1] = \{\ldots, -5, -2, 1, 4, 7, 10, \ldots\}

[2]={,4,1,2,5,8,11,}[2] = \{\ldots, -4, -1, 2, 5, 8, 11, \ldots\}

Every integer belongs to exactly one class.


Key Properties of Equivalence Classes

  1. Every element is in some class - nothing is left out
  2. Classes don’t overlap - an element can’t be in two different classes
  3. Elements in the same class are equivalent - that’s the whole point

Equivalence classes partition the set into non-overlapping groups.


Why is [1]=[4]=[7][1] = [4] = [7]?

Because 1, 4, and 7 are all equivalent (same remainder mod 3).

The class is the same no matter which representative you pick.


Equivalence relations formalize the idea of “same in some respect.”