An equivalence relation in group theory provides the foundational framework for partitioning a group into distinct, non-overlapping subsets that share a specific structural property. Consider this: at its core, it is a binary relation defined on a group G that satisfies three axioms: reflexivity, symmetry, and transitivity. When a relation possesses these properties, it allows mathematicians to classify elements into equivalence classes, effectively organizing the chaotic sprawl of a group’s elements into a tidy, hierarchical structure. This concept is not merely an abstract curiosity; it is the engine that drives the construction of quotient groups, the analysis of cosets, and the fundamental understanding of homomorphisms via the First Isomorphism Theorem.
The Three Pillars: Reflexivity, Symmetry, and Transitivity
To formally define an equivalence relation on a set G, we require a relation, typically denoted by $\sim$, that adheres to the following logic for all elements $a, b, c \in G$:
- Reflexivity: Every element is related to itself. Formally, $a \sim a$. In the context of a group, this means the identity element $e$ makes a real difference, as $a = a \cdot e$ often serves as the trivial proof of self-relation.
- Symmetry: If one element relates to a second, the second relates back to the first. If $a \sim b$, then $b \sim a$. This bidirectional nature ensures the relation does not impose a directional hierarchy.
- Transitivity: The relation chains across elements. If $a \sim b$ and $b \sim c$, then $a \sim c$. This property allows the relation to "jump" across intermediate elements, binding the entire class together.
Without all three, a relation cannot partition a set. Think about it: a relation that is reflexive and transitive but not symmetric is a preorder; one that is symmetric and transitive but not reflexive is a partial equivalence relation. Only the combination of all three yields the powerful partitioning capability required for advanced group theory.
The Canonical Example: Congruence Modulo a Subgroup
The most significant equivalence relation in group theory arises from the concept of a subgroup. Let H be a subgroup of a group G. We can define two distinct but deeply connected equivalence relations on G using H: left congruence and right congruence.
Honestly, this part trips people up more than it should.
Left Cosets and Left Congruence
We say $a$ is left congruent to $b$ modulo H, written $a \sim_L b$, if and only if $a^{-1}b \in H$. Equivalently, this means $aH = bH$. The equivalence class containing $a$ is the left coset $aH = {ah \mid h \in H}$.
Right Cosets and Right Congruence
We say $a$ is right congruent to $b$ modulo H, written $a \sim_R b$, if and only if $ab^{-1} \in H$. Equivalently, this means $Ha = Hb$. The equivalence class here is the right coset $Ha = {ha \mid h \in H}$ Most people skip this — try not to..
Verification of the Axioms (Left Congruence):
- Reflexive: $a^{-1}a = e \in H$ (since H is a subgroup). Thus $a \sim_L a$.
- Symmetric: If $a \sim_L b$, then $a^{-1}b \in H$. Since H is closed under inverses, $(a^{-1}b)^{-1} = b^{-1}a \in H$. Thus $b \sim_L a$.
- Transitive: If $a \sim_L b$ and $b \sim_L c$, then $a^{-1}b \in H$ and $b^{-1}c \in H$. By closure, $(a^{-1}b)(b^{-1}c) = a^{-1}c \in H$. Thus $a \sim_L c$.
This verification relies entirely on the subgroup criteria (identity, inverses, closure). This demonstrates a profound link: subgroups define equivalence relations, and equivalence relations induced by subgroups partition the group into cosets.
Partitions and the Index of a Subgroup
A fundamental theorem of set theory states that an equivalence relation on a set induces a partition of that set into disjoint equivalence classes. Conversely, any partition defines an equivalence relation (two elements are related iff they belong to the same block of the partition).
In group theory, the partition of G by left cosets of H is denoted $G/H$ (read "G mod H"). Because of this, the order of H must divide the order of G. Lagrange’s Theorem—the cornerstone of finite group theory—follows immediately from this partitioning: $|G| = [G:H] \cdot |H|$ Because the cosets partition G, they are all disjoint and have the same cardinality as H (since the map $h \mapsto ah$ is a bijection). The number of distinct left cosets is the index of H in G, written $[G:H]$. This arithmetic constraint is a direct consequence of the equivalence relation structure.
Normal Subgroups and Quotient Groups
While any subgroup yields an equivalence relation and a partition into cosets, the set of cosets $G/H$ does not automatically form a group. For the operation $(aH)(bH) = abH$ to be well-defined (independent of the choice of representatives $a$ and $b$), the subgroup H must be normal Still holds up..
A subgroup $N \trianglelefteq G$ is normal if $gNg^{-1} = N$ for all $g \in G$ (equivalently, $gN = Ng$ for all $g$). On top of that, when H is normal, left congruence and right congruence coincide ($aH = Ha$). The equivalence classes (cosets) then inherit a group structure from G, forming the quotient group (or factor group) $G/N$.
This construction is the group-theoretic analog of modular arithmetic. Because of that, just as $\mathbb{Z}/n\mathbb{Z}$ partitions integers into congruence classes modulo n, the quotient group $G/N$ partitions G into classes that "mod out" the structure of N. The equivalence relation here is not just a classification tool; it creates a new algebraic object Most people skip this — try not to..
The Kernel of a Homomorphism
Equivalence relations provide the most elegant perspective on group homomorphisms. But let $\phi: G \to K$ be a homomorphism. The kernel of $\phi$ is $\ker(\phi) = {g \in G \mid \phi(g) = e_K}$.
The kernel is always a normal subgroup of G. Here's the thing — * Symmetric: $\phi(a) = \phi(b) \implies \phi(b) = \phi(a)$. We can define an equivalence relation on G by: $a \sim b \iff \phi(a) = \phi(b)$ It is easy to verify this is an equivalence relation:
- Reflexive: $\phi(a) = \phi(a)$.
- Transitive: $\phi(a) = \phi(b)$ and $\phi(b) = \phi(c) \implies \phi(a) = \phi(c)$.
The equivalence class of the identity $e_G$ is precisely $\ker(\phi)$. The equivalence class of any $a \in G$ is the coset $a\ker(\phi)$. This leads directly to the First Isomorphism Theorem: $G / \ker(\phi) \cong \operatorname{im}(\phi)$ This theorem reveals that every homomorphic
… homomorphic image of (G) is isomorphic to a quotient group (G/N) where (N=\ker(\phi)) is a normal subgroup of (G). Simply put, the First Isomorphism Theorem tells us that the structure lost when we apply a homomorphism is exactly captured by the normal subgroup that collapses to the identity; the remaining structure survives intact in the factor group Which is the point..
Beyond the first theorem, the isomorphism theorems form a cohesive trilogy that further illuminates how normal subgroups and quotient groups interact:
-
Second Isomorphism Theorem. If (H\le G) and (N\trianglelefteq G), then (HN) is a subgroup of (G), (H\cap N\trianglelefteq H), and
[ \frac{H}{H\cap N}\cong\frac{HN}{N}. ] This result shows that “modding out” by a normal subgroup can be performed either before or after intersecting with another subgroup, yielding isomorphic outcomes The details matter here.. -
Third Isomorphism Theorem. For normal subgroups (N\trianglelefteq M\trianglelefteq G), we have
[ \frac{G/N}{M/N}\cong\frac{G}{M}. ] Here, taking a quotient twice in succession is equivalent to a single quotient by the larger normal subgroup, reflecting the transitivity of the equivalence relation induced by normality.
These theorems are not merely formal curiosities; they provide powerful tools for classifying groups. Take this case: to determine whether a finite group (G) possesses a subgroup of a given order, one often examines possible normal subgroups and the corresponding quotient groups, applying Lagrange’s theorem to the factor groups and lifting information back to (G) via the correspondence theorem (which states that normal subgroups of (G/N) correspond precisely to normal subgroups of (G) containing (N)).
And yeah — that's actually more nuanced than it sounds.
Beyond that, the viewpoint of equivalence relations clarifies why normal subgroups are the natural candidates for “factoring out.Because (\pi) is a homomorphism, its kernel must be normal, and conversely any normal subgroup arises as the kernel of some homomorphism (namely, the projection onto its quotient). ” The relation (a\sim b\iff a^{-1}b\in N) is precisely the kernel congruence of the canonical projection (\pi:G\to G/N). Thus normal subgroups and homomorphisms are two sides of the same coin, each encoding the same equivalence relation on the underlying set Turns out it matters..
Simply put, the language of equivalence relations—cosets, kernels, and congruences—unifies several cornerstone results of group theory:
- Lagrange’s theorem follows from the disjoint, equal‑sized partition of a group by left cosets.
- Normal subgroups are exactly those subgroups for which the coset set inherits a well‑defined group operation, giving rise to quotient groups.
- Homomorphisms induce equivalence relations whose classes are cosets of the kernel, leading to the First Isomorphism Theorem and its companions.
- The isomorphism theorems describe how these quotient constructions interact, enabling a systematic decomposition and reconstruction of groups.
Through this lens, the abstract notion of “modding out” ceases to be a mere algebraic trick; it becomes a manifestation of the fundamental idea that grouping elements according to a well‑behaved equivalence relation preserves and reveals the intrinsic structure of the original object. This perspective not only streamlines proofs but also deepens our intuition about how groups can be built, broken down, and reassembled Took long enough..
