Equivalence relation

Some things are the same.

Numbers can be equal.

Any number is equal to itself.

If A is equal to B, then B is equal to A.

If A and B are equal, and B and C are equal, then A and C are also equal.

This helps us make groups.

People can be in a group if they have the same birthday.

Triangles can be in a group if they are similar.

These groups are called equivalence classes.

Sometimes we want to group things that are similar. In math, we use an equivalence relation to do this. This is a special way to link two things. For a relation to work this way, it needs three rules. First, it must be reflexive. This means every thing is related to itself. Second, it must be symmetric. If A is related to B, then B is related to A. Third, it must be transitive. If A relates to B, and B relates to C, then A relates to C.

Think about birthdays. You and a friend might be in the same group if you share a birthday. This is an equivalence relation. You can also group triangles if they are similar in shape. These groups are called equivalence classes. Every item belongs to exactly one group. When we look at all these groups together, we call it a partition. A partition splits a big set into separate, non-overlapping parts.

This image shows how different relations can group five items into different parts.

In math, we often want to group things that share a special link. We call this link an equivalence relation. It is a way to say two things are "the same" in a specific way. For a relation to be an equivalence relation, it must follow three strict rules. First, it must be reflexive, meaning every item is related to itself. Second, it must be symmetric, so if A relates to B, then B relates to A. Third, it must be transitive, meaning if A relates to B and B relates to C, then A must relate to C.

These three rules work together to create neat groups. When we use these rules, every item ends up in exactly one group. We call these groups equivalence classes. If you look at all these groups together, they form a partition. A partition is like splitting a big pile into separate, non-overlapping piles. Every single item belongs to one, and only one, pile. This helps mathematicians organize huge sets of data into smaller, manageable pieces.

There are many real examples of this in math and life. Numerical equality is the simplest one because any number is equal to itself. In geometry, we can group triangles that are similar in shape. We can also group people by their birthdays to see who shares a day. Another example is grouping line segments that have the same length and direction. These are called equipollence relations.

Not every way of linking things is an equivalence relation. For example, the symbol for "greater than or equal to" fails a rule. It is reflexive and transitive, but it is not symmetric. If 7 is greater than 5, 5 is not greater than 7. Another example is the idea of being "approximately equal." While it seems close, small changes can add up to a big change. This means it often fails the transitivity rule.

Understanding these groups helps us solve many hard problems. We can use equivalence classes to create a "quotient set." This is a new set made entirely of the groups themselves. Mathematicians also use these relations to study how functions work. For instance, we can group numbers that have the same absolute value. By looking at these patterns, we can see the hidden structure of the math world.

In mathematics, an equivalence relation is a specific type of binary relation. A binary relation is simply a way to link two elements from a set. An equivalence relation allows mathematicians to group elements together that share a specific property. This process makes it possible to treat different items as if they are the same in a particular context. By using these relations, we can organize complex sets into much simpler, structured collections.

To be classified as an equivalence relation, a relation must satisfy three formal properties. The first is reflexivity, which requires that every element in a set is related to itself. The second is symmetry, meaning that if element A is related to element B, then B must also be related to A. The third is transitivity, which states that if A is related to B and B is related to C, then A must be related to C. If a relation lacks even one of these rules, it cannot be an equivalence relation. For example, the "greater than or equal to" relation fails because it is not symmetric. If 7 is greater than 5, 5 is not greater than 7.

These three properties work together to create a structure called a partition. A partition is a way of splitting a set into non-overlapping pieces called cells. Each cell is known as an equivalence class. Every element in the original set belongs to exactly one equivalence class. This ensures that the groups are disjoint, meaning they do not share any members. The collection of all these equivalence classes is called the quotient set.

There are many ways to define these relations in different fields of study. In basic arithmetic, numerical equality is the most common example. In geometry, we can use equivalence relations to group triangles that are similar or congruent. Another example is equipollence, which relates directed line segments that have the same length and direction. We can even use them to group people by their birthdays. Even in algebra, we can group integers using modular arithmetic, such as saying numbers are congruent modulo $n$.

Mathematicians also study how different relations compare to one another. One relation can be described as finer or coarser than another. A finer relation creates more, smaller equivalence classes. A coarser relation creates fewer, larger classes by grouping the smaller classes together. The equality relation is the finest possible relation because every element is in its own unique class. Conversely, the universal relation is the coarsest because it puts every element into one single group.

Equivalence relations are also deeply connected to the concept of functions. The equivalence kernel of a function is a specific relation defined by how the function maps elements. If a function maps two different inputs to the same output, those inputs are considered equivalent under the kernel. This idea is vital when studying homomorphisms in algebraic structures. In these cases, the relation helps us understand how the structure of a set is preserved or changed during a transformation.

Finally, the number of ways to partition a finite set is a well-studied mathematical value. For a set with $n$ elements, the number of distinct equivalence relations is equal to the $n$th Bell number, denoted as $B_n$. This connection shows that counting ways to group things is the same as counting the possible equivalence relations. Whether we are looking at set theory, geometry, or algebra, equivalence relations provide the fundamental tools for categorization and organization.