IntroductionAn equivalence relation is a specific type of relation that groups elements of a set into mutually exclusive classes, each class containing objects that are considered “the same” in a precise sense. In group theory, this idea becomes especially powerful because it allows mathematicians to partition a group into subsets that respect the group operation, leading to important structures such as cosets and quotient groups. Understanding equivalence relations within the framework of groups not only clarifies many algebraic proofs but also provides a gateway to deeper topics like normal subgroups and factor groups, which are essential in advanced algebra and its applications.
What Is an Equivalence Relation?
An equivalence relation on a set (S) is a relation (\sim) that satisfies three fundamental properties for all (a, b, c \in S):
- Reflexive: (a \sim a). Every element is related to itself.
- Symmetric: If (a \sim b), then (b \sim a). The relation works both ways.
- Transitive: If (a \sim b) and (b \sim c), then (a \sim c). The relation can be extended across a chain.
These properties guarantee that the set (S) can be divided into disjoint equivalence classes, where each class consists of all elements that are mutually related Easy to understand, harder to ignore..
Example: The relation “has the same parity” on the set of integers is an equivalence relation. Even numbers form one class, odd numbers another That's the part that actually makes a difference. But it adds up..
Equivalence Relations in Group Theory
When a group (G) is equipped with an equivalence relation that is compatible with the group operation, the resulting structure often reveals deep algebraic insights. The most common scenario is when the relation is defined by a subgroup (H \leq G). In this case, the relation (a \sim b) iff (
(a^{-1}b\in H).
Because (H) is a subgroup, this condition satisfies the three axioms of an equivalence relation:
- Reflexive: (a^{-1}a=e\in H), so (a\sim a).
- Symmetric: If (a^{-1}b\in H), then ((a^{-1}b)^{-1}=b^{-1}a\in H), hence (b\sim a).
- Transitive: If (a^{-1}b\in H) and (b^{-1}c\in H), then ((a^{-1}b)(b^{-1}c)=a^{-1}c\in H), giving (a\sim c).
Thus the relation partitions (G) into left cosets of (H): [ aH={ah\mid h\in H},\qquad a\in G . ] Each coset is an equivalence class, and two elements lie in the same class exactly when one can be obtained from the other by multiplying on the right by an element of (H) No workaround needed..
Cosets and Their Properties
A fundamental theorem, often called Lagrange’s theorem, states that all left cosets of a finite subgroup (H) have the same cardinality, namely (|H|). Even so, consequently, [ |G| = |H|\cdot [G:H], ] where ([G:H]) denotes the number of distinct left cosets (the index of (H) in (G)). This simple counting principle already yields powerful corollaries: the order of any element divides (|G|), and any subgroup’s order must divide the group’s order.
If we instead define the relation by (a\sim b) iff (ab^{-1}\in H), we obtain the right cosets (Ha). In general the families ({aH}) and ({Ha}) need not coincide. When they do, the subgroup (H) enjoys a special status.
Normal Subgroups and Quotient Groups
A subgroup (N\le G) is called normal if it is invariant under conjugation: [ gNg^{-1}=N\qquad\text{for all }g\in G . ] The resulting group (G/N) is called the quotient group (or factor group) of (G) by (N). In this case the set of cosets [ G/N={gN\mid g\in G} ] inherits a natural group operation: for cosets (g_1N) and (g_2N), [ (g_1N)(g_2N) = (g_1g_2)N . ] Equivalently, (gN=N g) for every (g), so the left and right cosets of (N) coincide. Plus, ] The operation is well‑defined precisely because (N) is normal; if (g_1N=g_1'N) and (g_2N=g_2'N), then [ g_1g_2N = g_1'g_2'N . Its order is (|G/N|=[G:N]), and the canonical projection [ \pi:G\to G/N,\qquad \pi(g)=gN, ] is a surjective homomorphism whose kernel is exactly (N).
Worth pausing on this one That's the part that actually makes a difference..
Examples
-
Integers modulo (n).
The subgroup (n\mathbb Z) of ((\mathbb Z,+)) is normal (all subgroups of an abelian group are normal). The quotient (\mathbb Z/n\mathbb Z) is the familiar cyclic group of order (n); its elements are the residue classes ({0,1,\dots ,n-1}) under addition modulo (n). -
Alternating group.
The subgroup (A_n
of (S_n) (the alternating group) is normal in (S_n), with quotient (S_n/A_n \cong \mathbb{Z}/2\mathbb{Z}). This reflects the sign homomorphism mapping permutations to (\pm 1) Still holds up..
-
Symmetric group action. Consider (G = S_3) acting on the set (X = {1, 2, 3}). The stabilizer (G_x = \text{Stab}(x)) of (x \in X) is a subgroup of order 2. The orbit-stabilizer theorem gives (|S_3| = |G_x| \cdot |X|), confirming (|G_x| = 2).
-
Conjugacy classes. In (G), elements are conjugate if they share the same cycle type. For (S_3), conjugacy classes are:
- Identity: ({(e)}) (size 1),
- Transpositions: ({(1\ 2), (1\ 3), (2\ 3)}) (size 3),
- 3-cycles: ({(1\ 2\ 3), (1\ 3\ 2)}) (size 2).
-
Center of a group. The center (Z(G) = {g \in G \mid gx = xg \text{ for all } x \in G}) is a normal subgroup. For (S_3), (Z(S_3) = {e}), as no non-identity element commutes with all others.
-
Class equation. For a finite group (G), the class equation is ( |G| = |Z(G)| + \sum [G:C_G(g_i)] ), where the sum is over representatives (g_i) of non-central conjugacy classes. For (S_3), this becomes (6 = 1 + 3 + 2), matching the class sizes It's one of those things that adds up. Turns out it matters..
Conclusion
Group theory provides a framework to analyze symmetry through subgroups, cosets, and quotient structures. Normal subgroups enable the construction of quotient groups, which simplify complex group structures by "factoring out" invariance. The orbit-stabilizer theorem links group actions to counting principles, while the class equation reveals the distribution of conjugacy classes. Together, these tools not only classify groups but also illuminate their intrinsic symmetries, making group theory indispensable in mathematics and beyond.
