Folioby Interconnected
Log InSign Up

Normal Subgroups and Quotient Groups

We define normal subgroups and establish their equivalent characterizations, then construct the quotient group G/N and prove its basic properties. Topics include the canonical projection, the correspondence between normal subgroups and kernels, subgroups of index 2, and an introduction to simple groups.

FO
Folio Official
March 1, 2026

1 Motivation

When we proved Lagrange's theorem in the previous chapter, we saw that the left cosets of a subgroup H partition the group G. A natural question arises: can we turn this partition into a group?

If we try to define a "product" of cosets by aH⋅bH=(ab)H, we immediately encounter a problem. If aH=a′H and bH=b′H, it is not automatically true that (ab)H=(a′b′)H. This product is well-defined precisely when H is a normal subgroup.

2 Definition of Normal Subgroups

Definition 1 (Normal subgroup).
A subgroup N of a group G is called a normal subgroup if gN=Ng for every g∈G. We write N⊴G. If N={e} and N=G, we say N is a proper normal subgroup and write N◃G.
Remark 2.
The condition gN=Ng is an equality of sets, not of individual elements. It does not mean that gn=ng for every n∈N. Rather, it says: for every n∈N, there exists n′∈N such that gn=n′g (and vice versa).

3 Equivalent Conditions for Normality

Theorem 3 (Characterizations of normal subgroups).
Let G be a group and N≤G. The following are equivalent:
  1. N⊴G (i.e. gN=Ng for all g∈G).

  2. gNg−1=N for all g∈G.

  3. gng−1∈N for all g∈G and n∈N.

  4. gNg−1⊆N for all g∈G.

Proof.
(1)⇒(2): Multiplying gN=Ng on the right by g−1 gives gNg−1=Ngg−1=N.

(2)⇒(3): If gNg−1=N, then for any n∈N we have gng−1∈gNg−1=N.

(3)⇒(4): Immediate.

(4)⇒(1): If gNg−1⊆N for all g, then gN⊆Ng. Replacing g by g−1 gives g−1Ng⊆N, i.e. Ng⊆gN. Therefore gN=Ng. □
Definition 4 (Conjugation).
For g∈G and n∈N, the element gng−1 is called the conjugate of n by g. Condition (3) above says that N is closed under conjugation by every element ofG.

4 Examples of Normal Subgroups

Example 5 (Trivial normal subgroups).
For any group G, both {e}⊴G and G⊴G.
Example 6 (Abelian groups).
If G is abelian, then every subgroup of G is normal. Indeed, gng−1=gg−1n=n∈N for all g∈G and n∈N.
Example 7 (Subgroups of index 2).
If [G:N]=2, then N⊴G.
Proof.
If g∈N, then gN=N=Ng trivially. If g∈/N, there are only two left cosets: N and gN. Since gN=N, we must have gN=G∖N. Similarly, the two right cosets are N and Ng=G∖N. Therefore gN=Ng. □
Example 8 (An​⊴Sn​).
The alternating group An​ is a normal subgroup of Sn​. This follows immediately from the preceding result, since [Sn​:An​]=2.
Example 9 (SLn​(R)⊴GLn​(R)).
For A∈GLn​(R) and B∈SLn​(R), we have det(ABA−1)=det(A)det(B)det(A)−1=det(B)=1, so ABA−1∈SLn​(R).
Example 10 (The kernel of a homomorphism is normal).
For any group homomorphism φ:G→G′, we have kerφ⊴G. Indeed, if n∈kerφ, then φ(gng−1)=φ(g)φ(n)φ(g)−1=φ(g)eG′​φ(g)−1=eG′​, so gng−1∈kerφ.
Example 11 (A non-normal subgroup).
In S3​, the subgroup H={e,(12)} is not normal. Indeed, (13)(12)(13)−1=(13)(12)(13)=(23)∈/H.

5 Construction of the Quotient Group

Theorem 12 (Quotient group).
Let N⊴G. Define G/N={gN∣g∈G} (the set of all left cosets) with the operation
(aN)(bN)=(ab)N.
Then G/N is a group, called the quotient group (or factor group) of G by N.
Proof.
Well-definedness. Suppose aN=a′N and bN=b′N. Write a′=an1​ and b′=bn2​ with n1​,n2​∈N. Then a′b′=an1​bn2​=a(n1​b)n2​. Since N is normal, n1​b=bn1′​ for some n1′​∈N. Hence a′b′=abn1′​n2​ with n1′​n2​∈N, so (a′b′)N=(ab)N.

Associativity.(aN⋅bN)⋅cN=(ab)N⋅cN=((ab)c)N=(a(bc))N=aN⋅(bc)N=aN⋅(bN⋅cN).

Identity. The identity element is eN=N. Indeed, aN⋅N=(ae)N=aN.

Inverses. The inverse of aN is a−1N. Indeed, aN⋅a−1N=(aa−1)N=N. □
Example 13 (Z/nZ).
Since Z is abelian, nZ⊴Z. The quotient group Z/nZ is a cyclic group of order n, with elements 0ˉ,1ˉ,…,n−1​ and the operation aˉ+bˉ=a+b​.
Example 14 (S3​/A3​).
We have A3​={e,(123),(132)}⊴S3​. The quotient group S3​/A3​ has order 2 and is isomorphic to Z/2Z. Its elements are A3​ (the even permutations) and (12)A3​ (the odd permutations).
Example 15 (GLn​(R)/SLn​(R)).
Since SLn​(R)⊴GLn​(R), the quotient group is well-defined, and in fact GLn​(R)/SLn​(R)≅R× (via the determinant map).

6 The Canonical Projection

Definition 16 (Natural homomorphism).
For N⊴G, the map π:G→G/N defined by π(g)=gN is called the natural homomorphism (or canonical projection).
Theorem 17.
The natural homomorphism π:G→G/N is a surjective homomorphism with kerπ=N.
Proof.
π(ab)=(ab)N=(aN)(bN)=π(a)π(b), so π is a homomorphism. For any gN∈G/N, π(g)=gN, so π is surjective. Finally, kerπ={g∈G∣gN=N}={g∈G∣g∈N}=N. □
Remark 18.
This theorem establishes the fundamental correspondence: normal subgroups are precisely the kernels of homomorphisms. Given a normal subgroup N, we recover it as kerπ for the canonical projection π:G→G/N. Conversely, the kernel of any homomorphism φ is a normal subgroup (as shown in the examples above).

7 Homomorphisms and Normal Subgroups

Theorem 19 (Subgroups and homomorphisms).
Let φ:G→G′ be a group homomorphism. Then:
  1. If H≤G, then φ(H)≤G′.

  2. If H′≤G′, then φ−1(H′)≤G.

  3. If N′⊴G′, then φ−1(N′)⊴G.

  4. If φ is surjective and N⊴G, then φ(N)⊴G′.

Here φ−1(H′)={g∈G∣φ(g)∈H′} denotes the preimage.
Proof.
(1) For a,b∈H, φ(a)φ(b)−1=φ(ab−1)∈φ(H).

(2) For a,b∈φ−1(H′), φ(ab−1)=φ(a)φ(b)−1∈H′ (since H′≤G′), so ab−1∈φ−1(H′).

(3) For g∈G and n∈φ−1(N′), φ(gng−1)=φ(g)φ(n)φ(g)−1∈N′ (since N′⊴G′), so gng−1∈φ−1(N′).

(4) For g′∈G′ and φ(n)∈φ(N): since φ is surjective, g′=φ(g) for some g∈G. Then g′φ(n)g′−1=φ(g)φ(n)φ(g)−1=φ(gng−1)∈φ(N), using N⊴G. □

8 Simple Groups

Definition 20 (Simple group).
A group G with ∣G∣>1 is called simple if it has no proper normal subgroups, i.e. the only normal subgroups of G are {e} and G itself.
Theorem 21.
Every group of prime order is simple.
Proof.
By Lagrange's theorem, if ∣G∣=p (prime), the only possible subgroup orders are 1 and p. Hence the only subgroups are {e} and G, so G has no proper normal subgroups. □
Theorem 22.
For n≥5, the alternating group An​ is simple.
Remark 23.
The proof that An​ is simple for n≥5 requires a substantial argument, which we omit here. The group A5​ is the smallest non-abelian simple group, with ∣A5​∣=60.
Remark 24.
Simple groups play the role of "primes" in group theory. Every finite group can be built up from simple groups (via composition series). The complete classification of finite simple groups is one of the monumental achievements of twentieth-century algebra.

9 Analyzing Structure via Quotient Groups

Theorem 25 (Correspondence theorem (Fourth isomorphism theorem)).
Let N⊴G. There is an inclusion-preserving bijection between the subgroups of G that contain N and the subgroups of G/N:
H↦H/N,Hˉ↦π−1(Hˉ),
where π:G→G/N is the canonical projection. Moreover, H⊴G if and only if H/N⊴G/N.
Proof.
If N≤H≤G, then N⊴H (since N⊴G and N≤H), so H/N is a well-defined group, and H/N≤G/N.

Conversely, if Hˉ≤G/N, then π−1(Hˉ)={g∈G∣gN∈Hˉ} is a subgroup of G containing N.

One verifies that these two correspondences are mutual inverses and preserve both inclusion and normality. □

10 Summary and Next Steps

In this chapter we have covered:

  • The definition of normal subgroups and their equivalent characterizations (closure under conjugation).

  • Examples: abelian groups, subgroups of index 2, kernels, An​, SLn​.

  • Construction of the quotient group G/N and the proof of well-definedness.

  • The canonical projection π:G→G/N and the correspondence "normal subgroups = kernels."

  • Simple groups: definition and examples.

  • The correspondence theorem.

With normal subgroups and quotient groups in hand, we are ready to prove the central theorems of group theory — the isomorphism theorems (first, second, and third). These are variations on a single principle: "the image of a homomorphism is isomorphic to a quotient group," and they constitute the most powerful tools for analyzing the structure of groups.

Group TheoryAlgebraTextbookNormal SubgroupsQuotient Groups
FO
Folio Official

Mathematics "between the lines" — exploring the intuition textbooks leave out, written in LaTeX on Folio.

1 followers·107 articles
Group Theory TextbookPart 4 of 11
Previous
Cosets and Lagrange's Theorem
Next
The Homomorphism Theorems

Share your expertise with the world

Write articles with LaTeX support, build your audience, and earn from your knowledge.

Start Writing — It's Free

More from Folio Official

Folio Official·March 1, 2026

Cosets and Lagrange's Theorem

Beginning with the definition of cosets of a subgroup, we prove Lagrange's theorem --- the assertion that the order of a subgroup divides the order of the group. As applications, we derive Fermat's little theorem and Euler's theorem, and we exhibit the alternating group A_4 as a counterexample to the converse.

Group TheoryAlgebraTextbook
2
Folio Official·March 1, 2026

Composition Series and the Jordan--Hölder Theorem

We introduce normal series and composition series, establishing the framework for decomposing a group into simple factors. The Jordan--Hölder theorem proves the uniqueness of the composition factors, and we develop the theory of solvable groups with its connections to the derived series.

Group TheoryAlgebraTextbook
1
Folio Official·March 1, 2026

The Homomorphism Theorems

We prove the three isomorphism theorems: the first (the image of a homomorphism is isomorphic to the quotient by its kernel), the second (the diamond isomorphism theorem), and the third (cancellation of nested quotients). Each theorem is illustrated with concrete examples and commutative diagrams.

Group TheoryAlgebraTextbook
Folio Official·March 1, 2026

Group Actions and the Class Equation

We introduce group actions and develop the orbit-stabilizer theorem, Burnside's lemma, and the class equation. Applications include the proof that the center of a p-group is nontrivial, the classification of groups of order p^2, the fixed-point theorem for p-groups, and Cayley's theorem.

Group TheoryAlgebraTextbook