Cosets and quotient groups: the art of controlled forgetting
The quotient group G/N is the first major conceptual hurdle in group theory. By computing small examples by hand -- from clock arithmetic to D4 modulo its center -- we build the intuition for what "dividing" a group really means, and why normality is indispensable.
The quotient group is, for many students, the first serious wall in group theory. The textbook defines cosets, states that they form a group when the subgroup is normal, and proves well-definedness. Mechanically the argument is straightforward. But the nagging question persists: what are we actually doing when we "divide" one group by another?
The purpose of this article is to answer that question through direct computation, starting with the most familiar quotient of all and working up to examples where things go wrong.
1 The simplest example:
Consider the group of integers and its subgroup consisting of all multiples of . The cosets of in are the sets of integers that share the same remainder when divided by . For :
where , , and .
Each coset is an infinite set, yet addition on cosets is perfectly well-behaved: (since, for instance, ). Choosing different representatives gives the same answer (). The arithmetic is consistent no matter which representatives we pick.
Because is abelian, the subgroup is automatically normal, and no difficulties arise. The trouble begins when the ambient group is non-abelian.
2 Dividingby its center
The dihedral group has a center – the set of elements that commute with everything. (The rotation commutes with all rotations and all reflections.) Since the center of any group is a normal subgroup, we may form the quotient .
Writing out the cosets:
This gives a group of order , with four cosets as its elements. Let us compute some products.
: choosing representatives and , we get . Choosing instead and , we get . The answer is the same coset either way – as it must be, since is normal – but it is reassuring to verify by hand.
: . So , the identity coset. One can similarly check that and .
A group of order in which every non-identity element has order – this is the Klein four-group. The eight-element non-abelian group has been compressed into a four-element abelian group. The quotient construction has "forgotten" the distinction between and , between and , and so on, leaving behind only the coarser structure.
3 What goes wrong without normality
This is the part that textbooks often rush past. Let us take and its subgroup , which is not normal in , and see the quotient construction collapse.
Since and , there are three left cosets:
Now try to define a product on cosets. We want to compute , but the result must not depend on which representatives we choose.
Taking representatives and : .
Taking representatives and : .
Different choices of representatives land in different cosets. The operation is not well-defined, and no amount of cleverness can fix it. The quotient construction simply fails.
To confirm that the problem lies with normality, observe that , so is not closed under conjugation and hence not normal.
4 What normality guarantees
When (that is, is a normal subgroup of ), every element satisfies – left cosets and right cosets coincide. This is the condition that makes coset multiplication well-defined.
Here is the precise argument. Suppose and with , so that and represent the same coset, and likewise and . Then
5 A normal subgroup of
Not every subgroup of is problematic. The alternating group – the set of all even permutations – is a subgroup of index , which is automatically normal.
The quotient is
– one coset of even permutations and one coset of odd permutations, forming a group of order . In other words, . The quotient has forgotten everything about the permutations except their parity.
6 Quotient groups as acts of forgetting
The quotient is a "lower-resolution view" of : it blurs out differences that lie inside and retains only the structure visible from outside. Here are several examples, side by side:
– ignore differences that are multiples of ; what remains is the cyclic group of order .
– ignore everything about a permutation except whether it is even or odd.
– ignore the distinction between and rotation; the eight symmetries collapse to four.
– ignore everything about a matrix except the value of its determinant.
Even when the original group is large and complicated, its quotients are often small and tractable. This "progressive simplification" is the basic strategy for analyzing the internal structure of groups, and it leads ultimately to the Jordan–Hö– the group-theoretic analogue of prime factorization.
7 Takeaway
The quotient group is what you get when you declare all elements of to be indistinguishable and do algebra on the resulting equivalence classes. For this algebra to be consistent – for the product of cosets to be independent of the representatives chosen – the subgroup must be normal. The failure with in is not an edge case; it is the rule whenever normality is absent. On the other hand, the clean quotient shows how powerful the construction becomes once normality holds. Working through these small examples by hand is the surest route to understanding quotient groups not as an abstract formalism, but as a concrete tool for dissecting the structure of a group.
Mathematics "between the lines" — exploring the intuition textbooks leave out, written in LaTeX on Folio.