Let G = ℤ₁₂, S = ⟨4⟩ = {0, 4, 8}, and N = ⟨6⟩ = {0, 6}. A student claims that (SN)/N must be isomorphic to S because 'S appears inside SN.' What does the Second Isomorphism Theorem actually say, and when would the student's conclusion fail in a different example?
A(SN)/N ≅ S always, which confirms the student's claim for the right reason
B(SN)/N ≅ S/(S ∩ N) — in this case S ∩ N = {0} so the conclusion holds, but the reason is wrong; when S ∩ N is non-trivial, (SN)/N is strictly smaller than S
C(SN)/N ≅ N/(S ∩ N) — the theorem reverses the roles of S and N
DThe theorem doesn't apply here because S is not normal in G
The Second Isomorphism Theorem says (SN)/N ≅ S/(S ∩ N). Here S ∩ N = {0}, so S/(S ∩ N) ≅ S, making the student's conclusion accidentally correct. But the reason is wrong: N 'absorbs' the part of S overlapping with it, and the quotient reflects only the part of S outside N. If S ∩ N were non-trivial — say, a subgroup of order 2 — then (SN)/N would be strictly smaller than S.
Question 2 Multiple Choice
The Third Isomorphism Theorem states that (G/M)/(N/M) ≅ G/N when M ⊆ N are both normal in G. Which of the following best captures the intuition behind this theorem?
AQuotienting twice by different subgroups always produces a trivial group
BThe order of quotienting does not matter — G/N and N/M are interchangeable in any product
CQuotienting first by M and then by N/M is equivalent to quotienting by N directly — a 'cancellation' analogous to fraction reduction
DThe theorem shows that every quotient group can be decomposed into exactly two smaller quotient groups
The Third Isomorphism Theorem is often called 'cancellation of quotients': (G/M)/(N/M) behaves like G/N because the M's cancel. The ℤ example makes this concrete: (ℤ/6ℤ)/(2ℤ/6ℤ) ≅ ℤ/2ℤ, just as (1/6)/(1/3) = 1/2. The key is not that order doesn't matter (it does) but that the nested two-step quotient reduces to the simpler direct quotient G/N.
Question 3 True / False
The proof of the Second Isomorphism Theorem works by defining a homomorphism φ: S → (SN)/N and applying the First Isomorphism Theorem — the kernel turns out to be S ∩ N.
TTrue
FFalse
Answer: True
This is the standard proof: define φ(s) = sN. This is a homomorphism (composition of inclusion S ↪ SN and natural projection SN → (SN)/N). Its kernel is {s ∈ S : sN = N} = {s ∈ S : s ∈ N} = S ∩ N. Its image is all of (SN)/N. The First Isomorphism Theorem then gives S/(S ∩ N) ≅ (SN)/N. The entire argument is an application of the first theorem in the right context — once you see the right homomorphism.
Question 4 True / False
The Second and Third Isomorphism Theorems are independent results that require largely different proof techniques from each other and from the First Isomorphism Theorem.
TTrue
FFalse
Answer: False
Both theorems are consequences of the First Isomorphism Theorem — they are the same tool applied in two different contexts. The key skill in both proofs is identifying the right homomorphism and computing its kernel; once the homomorphism is found, the First Isomorphism Theorem does all the work. Understanding them as 'First Isomorphism Theorem in disguise' is what allows fluent application rather than memorizing each as a separate result.
Question 5 Short Answer
Explain in your own words why the Third Isomorphism Theorem can be thought of as 'cancellation of quotients,' and give a concrete numerical example.
Think about your answer, then reveal below.
Model answer: When M ⊆ N are both normal in G, the theorem says (G/M)/(N/M) ≅ G/N. Quotienting G by M gives G/M; within G/M, the image of N is N/M; quotienting again by N/M is equivalent to having quotiented G by N in one step — the M's cancel. Numerically: G = ℤ, M = 6ℤ, N = 2ℤ. Then G/M = ℤ₆, N/M = {0̄, 2̄, 4̄} ≅ ℤ₃ inside ℤ₆, and (ℤ₆)/(ℤ₃) ≅ ℤ₂. But G/N = ℤ/2ℤ = ℤ₂ directly. The two-step and one-step quotients produce isomorphic groups.
The fraction analogy is (G/M) ÷ (N/M) = G/N, just as (1/6) ÷ (1/3) = 1/2. The theorem confirms that two successive quotients, when properly nested, reduce to a single quotient — providing a canonical simplification for working with complex subgroup lattices in deeper group theory.