Learn

Learning preferences

Make learning more comfortable. Changes apply immediately.

Enlarges page content, including diagrams and their labels. You can also use your browser’s zoom.

Choose the colours that are easiest for you to distinguish. Applies to lesson diagrams and lab plots. Labels, shapes, hatching and line patterns also distinguish meanings. Source photographs and raw image brightness stay unchanged; mask-only views are available for image overlays.

ExampleComparisonSample link

Saved in this browser on this device. Preferences are separate from progress backups.

Lesson 10 of 33

Replace a map by a quotient and an embedding

Prove the first theorem and use the subgroup/quotient correspondences.

Loading your saved responses…

Try the optional starting-point checks and targeted refreshers. You can continue directly into this lesson.

Try

Return to multiplication by two on additive residues modulo ten. Its kernel is {0,5}, and its image is the five even residues. The quotient has five cosets. Match each coset to its common image and predict whether this matching preserves addition and is one-to-one.

The purpose of an isomorphism theorem is not merely to compare cardinalities. It produces a specific map and proves that the map preserves the operation.

Predict

Given φ:G→K with kernel N, define a candidate map gN↦φ(g). Which must be proved first: that the formula is independent of the representative, or that it is injective? A formula that assigns different answers to the same coset is not a function at all, so representative independence comes first.

Experiment

Trace the proof obligations for the induced map.

ObligationReason
Well-definedEqual cosets differ by a kernel element
Product preservationφ(gh)=φ(g)φ(h)
Onto imageEvery image element has a preimage
InjectiveEqual outputs force equal kernel cosets

In the residue example, {1,6} maps to two and {3,8} maps to six. Adding the cosets gives {4,9}, which maps to eight, matching two plus six modulo ten. Check another pair before writing the general product argument.

Understand

The first isomorphism theorem states G/ker φ≅im φ. If gN=hN, then h⁻¹g∈N, so φ(g)=φ(h), proving well-definedness. The same equivalence proves injectivity in reverse. Product preservation and surjectivity onto the image complete the proof. Surjectivity onto the original codomain is not assumed.

For the second theorem, let H≤G and N normal in G. The product HN is a subgroup: normality lets an N factor pass an H factor while remaining in N, and the inverse of hn can be rewritten in HN. Restrict the quotient map to H. Its kernel is H∩N, and its image is HN/N. The first theorem therefore gives H/(H∩N)≅HN/N. This also explains why H∩N is normal in H even when H itself is not normal in G.

For the third theorem, suppose N⊆K and both are normal in G. The map G/N→G/K given by gN↦gK is well-defined because N⊆K. It is onto, with kernel K/N. Thus (G/N)/(K/N)≅G/K. Omitting the containment or normality assumptions would leave one of these quotient groups unjustified.

The subgroup correspondence is another consequence of the quotient map. Subgroups of G/N correspond to subgroups H of G containing N, by inverse image and H↦H/N. These operations are inverse: containing N ensures an entire fiber returns with any one of its elements. Inclusions and normality are preserved. This is useful for transferring a subgroup question to a smaller quotient.

Apply

For additive Z₂₀, take N=⟨10⟩ and K=⟨5⟩. Compute their sizes, then compare the two sides of the third theorem. Identify an actual map, not just two groups with the same number of elements. The quotient Z₂₀/K has five elements and is generated by the image of one.

When using a theorem, list the ambient group, subgroup, normal subgroup, map, kernel, and image in your own notation. This short audit prevents a common error: choosing the right theorem name but applying it to objects that fail its hypotheses.

Continue

Direct products next build larger groups from independent coordinates. Their element orders provide practical invariants for deciding whether a proposed isomorphism can exist.

Apply · explain · revise

Practice and reasoning

Drafts save locally as you type. Reveal worked solutions when useful; the site remembers that exposure. Automatic matches check the requested answer, while written arguments require review against the rubric.

A homomorphism from a group of order 45 has kernel of order 5. What is its image order?

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

In Z₂₄, let N=⟨12⟩ and K=⟨4⟩. What is the order of (Z₂₄/N)/(K/N)?

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

Prove G/ker φ≅im φ, including representative independence.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

For H≤G and N normal in G, prove H/(H∩N)≅HN/N.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

For N⊆K normal subgroups of G, prove (G/N)/(K/N)≅G/K.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Describe and prove the correspondence between subgroups of G/N and subgroups of G containing N, for N normal.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Reflect and continue

Before marking this lesson complete, explain one key idea without the worked solution and identify a condition that matters. Marking complete records participation, not independent mastery.