Quotient groups and isomorphism theorems
Build a group of cosets, prove why normality is necessary, and interpret a homomorphism through the information it discards.
On this page
The question for today
What you’ll understand
- Verify that multiplication of cosets is independent of representatives.
- Construct the first isomorphism theorem map and identify its kernel.
- Use the second and third isomorphism theorems with their normality hypotheses.
A homomorphism may identify different inputs while retaining every multiplication relation visible in its output. A quotient records exactly that deliberate loss of information. Instead of choosing one preferred element from each fiber, it treats the entire fiber as one element of a new group. The central question is whether multiplying these bundles gives an unambiguous answer. Normality supplies the answer, and the isomorphism theorems organize what happens when several such constructions overlap.
When cosets can be multiplied
Let N be a normal subgroup of G. Define the product of two left cosets by multiplying representatives: the proposed answer for aN times bN is abN. To justify this, replace a by an and b by bm, where n and m belong to N. Their product is ab times the element b inverse n b m, which remains in N by normality and subgroup closure. Thus every choice gives the same resulting coset. Associativity descends from G; the identity is N and the inverse of aN is a inverse N.
Normality is also necessary for this multiplication rule. If it were well defined for a subgroup H, then nH=H for n in H would imply ngH=gH for every g, hence g inverse n g belongs to H. Applying this inclusion for g and g inverse gives conjugation invariance. Without normality, a set of cosets is not a quotient group. Every subgroup defines a partition and an index, but only normal subgroups support this representative-independent multiplication. The projection sending a to aN is a surjective homomorphism with kernel N. For finite G, each coset contains exactly |N| elements, so the quotient has |G| divided by |N| elements.
A homomorphism becomes an isomorphism after quotienting
For a homomorphism f from G to H, the kernel K is normal. Two elements a and b have equal outputs exactly when b inverse a lies in K, equivalently when their cosets agree. Therefore define a map from G/K to the image of f by sending aK to f(a). The fiber calculation proves it is well defined and injective; the definition of image proves it is surjective. It respects multiplication because f does. This proves the first isomorphism theorem, rather than merely matching two group orders.
The theorem describes information, not a convenient coincidence. A quotient removes precisely distinctions invisible to f, while restricting the codomain to the image removes outputs that never occur. Both adjustments matter: G/K need not be isomorphic to the whole stated codomain. In the modular lab, pause, reset, then set both controls to modulus twelve and additive step four. Predict the orbit of zero before playing: its three members are the kernel in the worked example. Construct the other cosets manually by shifting this orbit. The instrument computes one sequence of additive multiples; it does not perform the quotient construction or verify an induced map.
Overlapping and successive quotients
The second isomorphism theorem takes a subgroup H and a normal subgroup N of G. The product HN is a subgroup, N is normal in HN, and H intersect N is normal in H. Restrict the projection to H: its kernel is H intersect N and its image is HN/N. Applying the first theorem gives H/(H intersect N) isomorphic to HN/N. This is a clean way to compare a subgroup before and after collapsing N.
For the third theorem, suppose N is contained in M and both are normal in G. The map from G/N to G/M sending aN to aM is surjective, with kernel M/N. Quotienting in two stages therefore produces the same group as quotienting directly by M. The assumptions are part of the statement: M/N must itself be a normal subgroup of G/N. Always name the actual induced map; doing so makes its domain, kernel, and surjectivity checkable.
Work it through
Reduction modulo four through twelve residues
Let G be the additive group of residues modulo 12. Define f to the additive group modulo 4 by reducing a residue again modulo 4. Identify the kernel and quotient explicitly.
Changing a representative by 12 does not change its remainder modulo 4, so f is well defined. Addition is preserved, and residues 0, 1, 2, 3 show surjectivity.
The kernel is K={0,4,8}. Its four cosets are K, 1+K, 2+K, and 3+K. Each contains three residues, accounting for all twelve inputs.
Map j+K to the residue j modulo 4. The map preserves addition and is bijective. For example, (3+K)+(3+K)=2+K, agreeing with 3+3=2 modulo 4.
The quotient G/K is isomorphic to the additive group modulo 4. Its elements are cosets containing three residues, not selected individual residues.
The living notebook
Explore the model
Interactive lab · modular
Find the subgroup collapsed by reduction
Pause, reset, then set both controls to modulus 12 and additive step 4. Predict period three and observe the orbit K={0,4,8}. Reducing these residues modulo 4 gives zero. Manually shift K by 1, 2, and 3 and predict which residue modulo 4 each entire coset represents. The model displays one additive orbit starting at zero; it does not draw shifted cosets, implement their multiplication, or prove the isomorphism theorem.
- Residue r0
- 0
- Orbit period · m/gcd(m,a)
- 12
- Distinct residues visited
- 1 of 12
Addition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forThe concrete kernel has three elements, leaving four cosets whose addition must be checked through the induced reduction map.
Pause & reason
Check your understanding
Your turn
Try it yourself
In the additive group of integers, take N=12Z and M=4Z. Identify (Z/N)/(M/N) and explain why the third isomorphism theorem applies.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
First check containment, then interpret M/N inside the twelve-residue group.
Compare with the solution
Every multiple of 12 is a multiple of 4, so N is contained in M. All subgroups of an abelian group are normal. M/N is {0,4,8} inside Z/12Z. Reducing a residue modulo 12 to one modulo 4 has this kernel. The resulting quotient is Z/4Z, agreeing with the direct quotient Z/M. The induced map, rather than just the order four, identifies the group operation.
Keep the idea
Take it with you
- Normality makes multiplication of cosets independent of representatives.
- The first theorem identifies a quotient with an image through an explicit map.
- Successive quotient theorems require their containment and normality assumptions.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.