Equivalence Relations and Equivalence Classes

Equivalence Relations and Equivalence Classes

An equivalence relation is a special kind of relation that satisfies three important properties: reflexivity, symmetry, and transitivity. These properties are fundamental in many areas of mathematics, especially in set theory, algebra, and geometry.

Once a relation is defined as an equivalence relation, it partitions a set into subsets known as equivalence classes. These equivalence classes represent elements that are considered "equivalent" to each other under the given relation.

1. Equivalence Relation

A relation $R$ on a set $A$ is called an equivalence relation if it satisfies the following three properties:

1.1 Reflexive Property

For every element $a \in A$, the pair $(a, a)$ must be in the relation $R$. This means that every element is related to itself.

1.2 Symmetric Property

If $(a, b) \in R$, then $(b, a) \in R$ as well. In other words, if $a$ is related to $b$, then $b$ must be related to $a$.

1.3 Transitive Property

If $(a, b) \in R$ and $(b, c) \in R$, then $(a, c) \in R$ as well. This means that if $a$ is related to $b$, and $b$ is related to $c$, then $a$ must also be related to $c$.

Example:

Consider the set $A = \{1, 2, 3, 4\}$, and let the relation $R$ be defined by "is congruent to modulo 2," i.e., $a \sim b$ if $a$ and $b$ leave the same remainder when divided by 2.

The relation $R$ on $A$ is:

This relation is:

• Reflexive: Every element is congruent to itself mod 2.
• Symmetric: If $1 \sim 3$, then $3 \sim 1$, and similarly for other pairs.
• Transitive: If $1 \sim 3$ and $3 \sim 1$, then $1 \sim 1$ holds.

Thus, $R$ is an equivalence relation.

2. Equivalence Classes

An equivalence class is a subset of the set $A$ formed by all elements that are related to a specific element under the equivalence relation. The equivalence class of an element $a \in A$, denoted by $[a]$, consists of all elements in $A$ that are equivalent to $a$.

Formal Definition:

The equivalence class of an element $a$ in $A$, denoted by $[a]$, is:

This means that the equivalence class $[a]$ includes all elements $b$ of $A$ that are related to $a$.

Example of Equivalence Classes:

Consider the set $A = \{1, 2, 3, 4\}$ again, with the equivalence relation "congruent modulo 2". The equivalence classes under this relation are:

• The equivalence class of $1$ is: $[1] = \{1, 3\}$ (since $1 \sim 3$)
• The equivalence class of $2$ is: $[2] = \{2, 4\}$ (since $2 \sim 4$)

Thus, we have two equivalence classes: $[1] = \{1, 3\}$ and $[2] = \{2, 4\}$.

These equivalence classes partition the set $A$, meaning that every element of $A$ belongs to exactly one equivalence class.

3. Properties of Equivalence Classes

• Partitioning the Set: The equivalence classes of an equivalence relation partition the set $A$ into disjoint subsets. Each element of $A$ belongs to exactly one equivalence class, and the union of all equivalence classes is $A$.

• Non-Overlapping: For any two elements $a, b \in A$, the equivalence classes $[a]$ and $[b]$ are either the same or disjoint. That is, $[a] \cap [b] = \emptyset$ if $a \neq b$, and $[a] = [b]$ if $a = b$.

• Reflexive Property of Equivalence Classes: Every element $a$ of $A$ is in its own equivalence class, i.e., $a \in [a]$.

4. Examples of Equivalence Relations and Classes

Example 1: Congruence Modulo $n$

Let $A$ be the set of integers $\mathbb{Z}$, and define the relation $R$ on $\mathbb{Z}$ by $a \sim b$ if $a - b$ is divisible by $n$. This is an equivalence relation (reflexive, symmetric, transitive), and the equivalence classes are the sets of integers congruent modulo $n$.

For example, for $n = 3$, the equivalence classes are:

• $[0] = \{ \dots, -6, -3, 0, 3, 6, \dots \}$
• $[1] = \{ \dots, -5, -2, 1, 4, 7, \dots \}$
• $[2] = \{ \dots, -4, -1, 2, 5, 8, \dots \}$

Example 2: Similarity of Triangles

Consider the set of all triangles in a plane. Define a relation $R$ where two triangles are related if they are congruent (i.e., if one can be transformed into the other by translation, rotation, or reflection). This is an equivalence relation, and the equivalence classes are the distinct shapes of triangles.

5. Summary of Equivalence Relation Properties

Conclusion

An equivalence relation provides a way to classify or group elements that are "equivalent" under a particular relation. The three properties of reflexivity, symmetry, and transitivity ensure that the relation partitions a set into equivalence classes, each of which contains elements that are related to each other in the same way. Equivalence relations are widely used in mathematics to define partitions, quotient sets, and equivalence classes, and they have applications in algebra, geometry, and number theory.