Normal subgroups, quotients, isomorphism theorems
Why this is asked: Normality is not transitive. Know the standard normal/non-normal examples in S₄ and A₄, and that index-2 subgroups are always normal.
In one sentence
Normal subgroups are exactly the kernels, quotients exist exactly for them, and the property that catches people is that normality is a relation between two groups rather than something a subgroup possesses.
Why the exam asks it
Because "normal" gets treated as an adjective attached to a subgroup, and it is not — it is always normal in something. That misreading produces the transitivity error, which is set often and has a small concrete counterexample.
The idea
is normal, written , if for every ; equivalently every left coset is a right coset.
Normality is exactly what makes the coset multiplication well defined, so the quotient group exists precisely for normal .
Sufficient conditions worth recognising:
- Index normal.
- Any subgroup of an abelian group.
- The centre , and more generally any subgroup of the centre.
- Kernels: for every homomorphism, and conversely every normal subgroup is the kernel of the quotient map. Normal subgroups and kernels are the same objects.
The isomorphism theorems
First. . This is the one that does the work: to identify a quotient, find a homomorphism with that kernel and look at its image.
Second. For and : .
Third. For both normal in : .
Correspondence. Subgroups of correspond exactly to subgroups of containing , and normality is preserved both ways. This is how questions about a quotient's subgroup structure are answered without constructing anything.
Normality is not transitive
In of order :
- has index , so .
- , and is abelian, so .
- But , so is not normal in .
does not give . The reason is visible in the definition: normality of in constrains conjugation by elements of only, and has more elements.
The property that is transitive is being characteristic — preserved by every automorphism. Characteristic in normal gives normal, which is the correct repair.
Simple groups and solvability
is simple if its only normal subgroups are and . The abelian simple groups are exactly . The smallest non-abelian simple group is , of order , and is simple for every — which is what makes the general quintic unsolvable.
The commutator subgroup is the smallest normal subgroup with abelian quotient: is abelian . So is the largest abelian quotient.
Where intuition breaks
" and , so ." as above. The topic's central error, and it comes from reading "normal" as a property rather than a relation.
" abelian and abelian, so abelian." with : both and are abelian, and is not. An abelian quotient of an abelian subgroup says the group is solvable, not abelian.
"A quotient of a non-abelian group is non-abelian." . Quotients lose information, which is the point of them.
"Every subgroup is a kernel." Only the normal ones. in is not the kernel of anything.
" means ." Far from it. and . A quotient being a group does not split the extension.
"Normal subgroups commute elementwise with everything." as sets, not for each . Elementwise commuting is the centre, which is a much stronger condition.
" is simple because is." has the Klein four-group as a normal subgroup. Simplicity of starts at .
The exam's angle
- To identify a quotient, build a homomorphism. The first isomorphism theorem turns "what is " into "what does a map with kernel hit", which is usually visible.
- Check normality by conjugating a generator. One element that escapes settles it, as does above.
- Index 2, centre, kernel — all normal for free. Recognising one of these is often the whole step.
- For transitivity claims, look for the shape: a reflection inside a Klein subgroup.
- Use the correspondence theorem for questions about subgroups of a quotient rather than constructing cosets.
The night before
- every left coset is a right coset is a kernel.
- Index , the centre, and any subgroup of an abelian group are normal.
- First isomorphism theorem: . Second: . Third: .
- Normality is not transitive: , and . Characteristic-in-normal is the repair.
- and abelian does not give abelian — and . It gives solvable.
- abelian .
- Simple: only and normal. Abelian simple . simple for ; is the smallest non-abelian one. is not simple.
See it move
The trap here
“Converse of Lagrange: d | |G| ⇒ subgroup of order d” — false
has no subgroup of order 6
Check yourself — select all that apply
Which of the following statements are true?
More in Groups
Take it further
- The mistake this prevents: standard counterexample → real wrong options, and why each one tempts
- The mistake this prevents: property not inherited → real wrong options, and why each one tempts
- Previous-year questions set on this — every option and the answer, free:June 2025 · Part CJune 2025 · Part CDecember 2025 · Part CDecember 2024 · Part B
Last revised . Found a mistake? Tell us — corrections are the fastest thing we act on.
Next: Permutation groups: cycles, sign, conjugacy in S_n and A_n
Create a free account to keep your place and have this feed your study plan.
Open this in the full syllabus view · Unit 2