You are here
Homeequivalence relation
Primary tabs
equivalence relation
An equivalence relation $\sim$ on a set $S$ is a relation that is:
 Reflexive.

$a\sim a$ for all $a\in S$.
 Symmetric.

Whenever $a\sim b$, then $b\sim a$.
 Transitive.

If $a\sim b$ and $b\sim c$ then $a\sim c$.
If $a$ and $b$ are related this way we say that they are equivalent under $\sim$. If $a\in S$, then the set of all elements of $S$ that are equivalent to $a$ is called the equivalence class of $a$. The set of all equivalence classes under $\sim$ is written $S/\sim$.
An equivalence relation on a set induces a partition on it. Conversely, any partition induces an equivalence relation. Equivalence relations are important, because often the set $S$ can be ’transformed’ into another set (quotient space) by considering each equivalence class as a single unit.
Two examples of equivalence relations:
Mathematics Subject Classification
0600 no label found03D20 no label found Forums
 Planetary Bugs
 HS/Secondary
 University/Tertiary
 Graduate/Advanced
 Industry/Practice
 Research Topics
 LaTeX help
 Math Comptetitions
 Math History
 Math Humor
 PlanetMath Comments
 PlanetMath System Updates and News
 PlanetMath help
 PlanetMath.ORG
 Strategic Communications Development
 The Math Pub
 Testing messages (ignore)
 Other useful stuff
Recent Activity
new question: numerical method (implicit) for nonlinear pde by roozbe
new question: Harshad Number by pspss
Sep 14
new problem: Geometry by parag
Aug 24
new question: Scheduling Algorithm by ncovella
new question: Scheduling Algorithm by ncovella
Comments
integers modulo n
For example, the integers modulo n are partitioned into n equivalence classes, by the relation a R b iff remainder(a/n)=remainder(b/n).
apk