What Is An Equivalence Relation Group Theory

Understanding Equivalence Relations in Group Theory: The Art of Mathematical Grouping

At its heart, mathematics is the science of identifying and exploiting patterns of similarity. One of the most powerful and elegant tools for doing this is the concept of an equivalence relation. In the specific world of group theory, this abstract idea transforms from a simple classification tool into the fundamental mechanism for building new, simpler groups from complex ones. An equivalence relation in group theory is not merely a way to sort elements; it is the gateway to understanding quotient groups, a cornerstone concept that reveals the deep hierarchical structure of algebraic systems. This article will demystify this essential idea, showing how a simple set of rules can unlock profound insights into symmetry and structure.

What Exactly is an Equivalence Relation?

Before diving into groups, we must grasp the general definition. An equivalence relation on a set is a special type of relationship between its elements that satisfies three intuitive properties. If we have a set S and a relation ~ (read as "is related to"), then ~ is an equivalence relation if, for all elements a, b, c in S:

Reflexive: Every element is related to itself. a ~ a.
Symmetric: If a is related to b, then b is related to a. If a ~ b, then b ~ a.
Transitive: If a is related to b and b is related to c, then a is related to c. If a ~ b and b ~ c, then a ~ c.

These three rules create a robust framework for partitioning a set into disjoint, non-overlapping subsets called equivalence classes. All elements within a class are mutually related to each other, while no element in one class is related to any element in another. The set of all these equivalence classes forms a new set, often denoted S / ~, which is called the quotient set.

A Simple Non-Group Example: Consider the set of all integers, ℤ. Define a ~ b if a - b is an even number (i.e., a and b have the same parity).

Reflexive: a - a = 0, which is even. So a ~ a.
Symmetric: If a - b is even, then b - a = -(a - b) is also even. So a ~ b implies b ~ a.
Transitive: If a - b is even and b - c is even, their sum (a - b) + (b - c) = a - c is even. So a ~ c. The equivalence classes are the set of all even integers and the set of all odd integers. The quotient set ℤ / ~ has two elements: {evens} and {odds}.

The Group Theory Twist: Equivalence Relations Respect the Operation

In group theory, we don't just have a set; we have a set G equipped with a binary operation (like multiplication or addition) that satisfies the group axioms (closure, associativity, identity, inverses). For an equivalence relation ~ on G to be useful in group theory, it must play nicely with the group operation. This means the relation must be compatible with the operation. Formally, we require:

If a ~ a' and b ~ b', then a * b ~ a' * b'.

This property is often called being a congruence relation (by analogy with modular arithmetic). It ensures that if you replace an element with an equivalent one in any group expression, the result remains equivalent. This compatibility is non-negotiable; without it, the collection of equivalence classes cannot inherit a consistent group structure from G.

The Prime Example: Cosets and Normal Subgroups

The most natural and important source of such compatible equivalence relations in a group G comes from its subgroups. Let H be any subgroup of G. We can define a relation based on H:

Definition: For a, b ∈ G, we say a ~ b if a * b⁻¹ ∈ H.

Let's verify this is an equivalence relation:

Reflexive: a * a⁻¹ = e (the identity), and e ∈ H because H is a subgroup. So a ~ a.
Symmetric: If a * b⁻¹ ∈ H, then its inverse (a * b⁻¹)⁻¹ = b * a⁻¹ is also in H (subgroups contain inverses). So b ~ a.
Transitive: If a * b⁻¹ ∈ H and b * c⁻¹ ∈ H, then their product (a * b⁻¹) * (b * c⁻¹) = a * c⁻¹ is in H (closure). So a ~ c.

This relation partitions G into equivalence classes. What are these classes? For a fixed a ∈ G, the equivalence class of a is: [a] = { x ∈ G | x ~ a } = { x ∈ G | x * a⁻¹ ∈ H }. If we multiply every element in this set on the right by a, we get { x * a | x * a⁻¹ ∈ H } = { h * a | h ∈ H }. This is precisely the left coset of H in G containing a, denoted aH.

Crucial Insight: The relation a ~ b defined by a * b⁻¹ ∈ H is compatible with the group operation **if and

... and only if H is a normal subgroup of G. That is, the relation a ~ b defined by a * b⁻¹ ∈ H respects the group operation precisely when g * H * g⁻¹ = H for every g ∈ G. When H is normal, the set of left cosets G/H inherits a well-defined group operation from G: (aH) * (bH) = (a * b)H. This new group, the quotient group G/H, is a fundamental construction in group theory, allowing us to "mod out" by a normal subgroup and study the resulting simpler structure.

Example: Consider the symmetric group S₃ and its normal subgroup A₃ (the alternating group of even permutations). The cosets are A₃ itself and the set of odd permutations (12)A₃. The quotient group S₃/A₃ has two elements and is isomorphic to ℤ/2ℤ, reflecting the parity of permutations.

Conclusion

Equivalence relations provide the language to partition sets, but in group theory, we demand more: compatibility with the operation. This constraint elevates a mere partition into a congruence, and the equivalence classes become cosets of a subgroup. The requirement that the induced operation on cosets be well-defined singles out normal subgroups as the precise algebraic structures that allow the formation of quotient groups. Thus, the journey from an arbitrary equivalence relation to a quotient group illuminates a deep principle: the most natural and algebraically useful partitions of a group are those arising from its normal subgroups, revealing how complex groups can be understood through their simpler, factored forms.