What Are Equivalence Relations?
An equivalence relation is a relation on a set that is reflexive, symmetric, and transitive at the same time. A relation is any rule that decides whether one element is linked to another, written $a \sim b$ or as a set of ordered pairs $(a, b)$. When that rule passes all three tests below, it behaves like a strict form of "sameness," which is why it earns the special name.
The idea sits inside the wider study of relations in math, where relations come in many shapes. An equivalence relation is one particular, well-behaved shape. It captures the notion of two things being interchangeable for one specific purpose, even when they are not identical in every way.
Throughout this article we use a small set $A = {1, 2, 3}$ and the integers $\mathbb{Z}$ as running examples. The symbol $a \sim b$ reads "$a$ is related to $b$." The symbol $(a, b) \in R$ says the same thing in the language of sets, where $R$ is the relation written out as a collection of ordered pairs.
What Are The Three Properties Of An Equivalence Relation?
A relation $R$ on a set is an equivalence relation exactly when it satisfies three conditions together. Miss any one, and it is not an equivalence relation.
Reflexive: every element is related to itself. For all $a$, $a \sim a$. In pair form, $(a, a) \in R$ for every $a$ in the set.
Symmetric: the link runs both ways. If $a \sim b$, then $b \sim a$. In pair form, whenever $(a, b) \in R$, the pair $(b, a) \in R$ as well.
Transitive: links chain together. If $a \sim b$ and $b \sim c$, then $a \sim c$.
These names belong to three separate ideas. A relation can be reflexive on its own, or symmetric on its own. Reflexive relations, symmetric relations, and transitive relations are each studied in their own right. The equivalence relation is the case where all three hold in the same relation, and that combination is what makes it special.
Here is the smallest complete example. On $A = {1, 2, 3}$, take
$$R = {(1,1),\ (2,2),\ (3,3)}$$
Every element is paired with itself, so $R$ is reflexive. There is no pair $(a, b)$ with $a \neq b$, so the symmetric and transitive tests have nothing to violate, and both hold. This relation, plain equality, is the simplest equivalence relation of all.
How Do You Check If A Relation Is An Equivalence Relation?
To check a relation, test the three properties in order: reflexive first, then symmetric, then transitive. If all three hold, it is an equivalence relation. If even one fails, stop, because the relation is disqualified.
Take congruence modulo 3 on the integers. Two integers are related when their difference is a multiple of 3, written $a \equiv b \pmod{3}$. Work the three tests one at a time.
Reflexive:
$$a - a = 0, \quad \text{and } 3 \mid 0, \quad \text{so } a \equiv a \pmod{3}$$
Every integer leaves the same remainder as itself, so reflexivity holds.
Symmetric:
$$\text{if } 3 \mid (a - b), \text{ then } 3 \mid (b - a) \text{ since } b - a = -(a - b)$$
So $a \equiv b$ forces $b \equiv a$, and symmetry holds.
Transitive:
$$\text{if } 3 \mid (a - b) \text{ and } 3 \mid (b - c), \text{ then } 3 \mid (a - b) + (b - c) = a - c$$
So $a \equiv b$ and $b \equiv c$ give $a \equiv c$, and transitivity holds.
All three pass, so congruence modulo 3 is an equivalence relation. The same argument works for any modulus $n$, which is why "same remainder on division by $n$" is one of the most useful equivalence relations in all of mathematics.
The table below runs the same three tests across six well-known relations. Three of them are equivalence relations, and three are not, which is the fastest way to see what the definition rules in and rules out.
Table: Testing six relations against the three equivalence-relation properties.
Relation | Reflexive? | Symmetric? | Transitive? | Equivalence relation? |
|---|---|---|---|---|
Equality $=$ | Yes | Yes | Yes | Yes |
Congruence $a \equiv b \pmod{n}$ | Yes | Yes | Yes | Yes |
"Is similar to" for triangles | Yes | Yes | Yes | Yes |
Less-than-or-equal $\le$ | Yes | No | Yes | No |
Perpendicular $\perp$ (lines) | No | Yes | No | No |
Strictly-less-than $<$ | No | No | Yes | No |
Read the last column first. Only the rows with three yes answers are equivalence relations. The three no rows each fail at least one test, and one failure is enough.
Which Relations Are Not Equivalence Relations?
A relation is not an equivalence relation the moment one of the three properties fails. The three no rows above each break in a different, instructive way.
Less-than-or-equal $\le$ is reflexive ($a \le a$) and transitive, but not symmetric: $2 \le 3$ is true while $3 \le 2$ is false. One broken property is enough to disqualify it.
Perpendicular lines $\perp$ is symmetric (if line $a \perp b$ then $b \perp a$), yet it is not reflexive, since no line is perpendicular to itself, and not transitive, since two lines perpendicular to the same line are parallel, not perpendicular.
Strictly-less-than $<$ is transitive but fails both reflexivity ($a < a$ is never true) and symmetry.
The perpendicular case is worth a second look, because it kills a tempting shortcut. Being symmetric does not force a relation to be transitive. The two properties are independent, and you must check each one on its own.
What Are Equivalence Classes And Partitions?
An equivalence class is the set of all elements related to one chosen element. For an element $a$, its class is written $[a]$ and defined in set-builder notation as
$$[a] = {, x : x \sim a ,}$$
Take congruence modulo 3 again. Every integer falls into one of exactly three classes, sorted by the remainder it leaves after division by 3:
$$[0] = {\dots, -6, -3, 0, 3, 6, \dots}$$ $$[1] = {\dots, -5, -2, 1, 4, 7, \dots}$$ $$[2] = {\dots, -4, -1, 2, 5, 8, \dots}$$
These three classes never overlap, and together they contain every integer. A family of subsets that is disjoint and covers the whole set is called a partition. This is the payoff of the whole topic: every equivalence relation carves its set into a partition, and every partition of a set comes from exactly one equivalence relation. The two ideas are the same fact seen from two directions.
Why Do Equivalence Relations Matter?
Equivalence relations put a precise definition on an idea we use constantly: treating different things as "the same" for one purpose. That single idea does heavy lifting across mathematics for two connected reasons.
They let us build new number systems. A fraction like $\tfrac{1}{2}$ equals $\tfrac{2}{4}$ and $\tfrac{3}{6}$, because "represents the same amount" is an equivalence relation on pairs of integers, and each rational number is really one equivalence class of fractions. Clock and calendar arithmetic work the same way, grouping numbers by remainder through congruence modulo n.
They connect grouping to structure. Because every equivalence relation produces a partition, defining the right "sameness" is the same act as sorting a set into clean groups. Wherever mathematics classifies things, from shapes that are congruent to functions that behave alike, an equivalence relation is quietly doing the sorting.
That second point is the deep reason the concept appears everywhere. Classification is not a vague activity in mathematics. It is an equivalence relation with its partition, stated exactly, which is what lets us reason about whole groups instead of endless individual cases.
Who Discovered Equivalence Relations?
The three-part definition we teach today is young, but its most important example is old. Long before anyone wrote "reflexive, symmetric, transitive" as a checklist, mathematicians were already grouping numbers by their remainders.
Two later mathematicians turned the single example into the general idea:
Georg Cantor (1845–1918, Germany) built set theory and used "can be matched one-to-one," an equivalence relation on sets, to compare the sizes of infinite collections.
Giuseppe Peano (1858–1932, Italy) helped formalise the language of relations and membership that lets us state the reflexive, symmetric, and transitive conditions cleanly for any set at all.
Where Are Equivalence Relations Used In The Real World?
The same three-part rule runs quietly under a surprising range of technology and everyday life.
Databases: the SQL
GROUP BYcommand sorts rows into groups that share a key value, which is exactly forming equivalence classes and reporting one summary per class.Machine learning: clustering and classification assign each data point to a group of similar points, so the model is learning a partition of the data.
Cryptography: systems like RSA compute with congruence classes modulo a large number, the direct descendant of Gauss's $\equiv$.
Calendars and scheduling: "same weekday" groups all dates by their remainder modulo 7, which is why any calendar repeats in a seven-day cycle.
Error-correcting codes: phone and disk data are grouped into classes of bit patterns so that a small corruption still points back to the correct class.
One definition, three properties, and the result organises databases, learning machines, secret codes, and the calendar on the wall. Mathematics is the shared language under fields that look nothing alike.
What Are The Most Common Equivalence Relation Mistakes?
These four errors account for most lost marks on equivalence relations, verified against discrete-math relation-property guides, a university open-textbook error discussion, and the well-known symmetry-transitivity fallacy.
Proving only two of the three properties.
Where it slips in:
A student shows a relation is reflexive and symmetric, then declares it an equivalence relation without testing transitivity.
Don't do this:
Do not stop early. All three properties are required, and skipping one leaves the claim unproven.
The correct way:
Test reflexive, symmetric, and transitive as three separate checks, and write a short justification for each before concluding.
Assuming symmetric implies transitive.
Where it slips in:
A student argues that if $a \sim b$ gives $b \sim a$, then chaining must give $a \sim a$ and everything follows, so one check covers the rest.
Don't do this:
Do not treat the properties as linked. Perpendicularity is symmetric but not transitive, which shows the shortcut is false.
The correct way:
Verify transitivity directly: assume $a \sim b$ and $b \sim c$, then prove $a \sim c$ from the actual rule, never from symmetry alone.
Confusing the equivalence class with the relation.
Where it slips in:
A student is asked for the equivalence class $[a]$ and instead writes out the relation as a set of ordered pairs.
Don't do this:
Do not mix the two objects. The relation is a set of pairs like $(a, b)$, while a class $[a]$ is a set of elements.
The correct way:
Read $[a] = {, x : x \sim a ,}$ as "the elements related to $a$," and list elements, not pairs.
Mishandling the case that never happens.
Where it slips in:
Checking transitivity, a student panics because no pair actually chains, and wrongly decides the property fails.
Don't do this:
Do not call transitivity broken when there is nothing to break. A rule of the form "if this, then that" is automatically satisfied when the "if" part never occurs.
The correct way:
Treat an unmet condition as a pass. If no $a \sim b$ and $b \sim c$ ever line up, transitivity holds by default.
Practice Problems On Equivalence Relations
Use the set $A = {1, 2, 3}$ unless a problem says otherwise. Answers follow each line.
Is $R = {(1,1), (2,2), (3,3)}$ on $A$ an equivalence relation?
(Answer: Yes. It is reflexive, and symmetric and transitive hold with no pairs to violate them.)Is "less-than-or-equal" $\le$ on $A$ an equivalence relation?
(Answer: No. It is reflexive and transitive but not symmetric, since $1 \le 2$ while $2 \le 1$ is false.)Under congruence modulo 4, which class does 13 belong to?
(Answer: $[1]$, because $13 = 4 \times 3 + 1$ leaves remainder 1.)List the equivalence classes of "same remainder on division by 2" on ${1, 2, 3, 4, 5, 6}$.
(Answer: the odds ${1, 3, 5}$ and the evens ${2, 4, 6}$.)Is $R = {(1,1), (2,2), (3,3), (1,2), (2,1)}$ on $A$ an equivalence relation? If so, give its classes.
(Answer: Yes. Its classes are ${1, 2}$ and ${3}$.)Is "has the same number of letters as" an equivalence relation on a set of words?
(Answer: Yes. Word length is reflexive, symmetric, and transitive, so it partitions words by length.)
Where Should You Go Next After Equivalence Relations?
Equivalence relations open the door to the parts of algebra where "sameness" turns into a working tool. Three natural next steps follow from here.
Types Of Relations. See where the equivalence relation sits among the full family, including inverse and order relations, and how each property combination gets its own name.
Relations And Functions. Learn the extra condition that turns a relation into a function, the workhorse of the rest of algebra.
Operations On Sets. Since classes and partitions are built from sets, the set operations give you the tools to combine and compare them.
A live Bhanzu trainer teaches relations starting from the why, the grouping and partition idea the definition was built to capture, in the Bhanzu algebra program.
Was this article helpful?
Your feedback helps us write better content