Normal Subgroups, Quotient Groups, and Automorphisms
December 10, 2025 · Luciano Muratore
So far we have seen how groups can be generated and how they can be combined. Now we turn to a more structural question: what subgroups of a group are well-behaved enough to let us form a new group out of their cosets?
Normal Subgroups
A subgroup is called normal if it is invariant under conjugation by any element of , that is, if for all , or equivalently, if left and right cosets coincide: for all .
There are several ways to recognize normality. One is that is a union of conjugacy classes. Another is that for all — which, combined with the finite or symmetric argument, gives equality. And perhaps the most important one: is normal if and only if the cosets form a group , the quotient group.
A simple but useful criterion is the following: if , then is normal. The reason is purely combinatorial — there are only two left cosets ( and ) and only two right cosets ( and ), so for , both and must equal , forcing . The canonical example is , since .
Normal Subgroups of
Let us work through a concrete case. The symmetric group has subgroups , , , , , and itself. Of these, only , , and are normal.
Why are the order-2 subgroups not normal? Because conjugation sends one transposition to another — for example, — so is not preserved by all conjugations. On the other hand, has index 2 and is therefore normal by the criterion above, and .
The Quaternion Group
The quaternion group with relations , , is another instructive example. Its center is , and its subgroups are , , , , , and .
Remarkably, every subgroup of is normal. The reason is that conjugation sends any generator to itself or its inverse: for example, … and one can check directly that each subgroup is preserved. The quotient groups are also illuminating: the index-2 quotients , , are all isomorphic to , and the index-4 quotient .
Products of Normal Subgroups
If , then their intersection is normal in , and their product equals and is also normal in . The key idea is that normality ensures conjugation preserves both and , so it preserves their product as well.
Homomorphisms
A map is a homomorphism if for all . The kernel is always a normal subgroup of , and the image is a subgroup of .
Some examples worth keeping in mind: is a homomorphism from to ; maps to the unit circle; and is a projection from to .
Endomorphisms and Automorphisms of
Every endomorphism is determined by , giving . For to be an automorphism it must be bijective, which forces . So : the only automorphisms of are the identity and the inversion map .
Inner Automorphisms
For any , conjugation by defines an automorphism by . These satisfy and , so the collection forms a subgroup of , and in fact a normal one.
Now consider the map defined by . It is a surjective homomorphism, and its kernel is precisely , the center: if and only if for all , that is, if and only if commutes with everything. By the First Isomorphism Theorem,
This is a neat result: the group of inner automorphisms is completely determined by how far is from being abelian.
The Inversion Map
Let me close with a small observation that ties back to what we saw about groups of exponent 2. Consider the map . When is this a homomorphism?
For to satisfy , we would need . But , so the condition becomes , which is exactly the statement that is abelian. So is a homomorphism if and only if is abelian — a compact way of saying that inversion reverses order, and the group only forgives that if order does not matter.