Normal Subgroups and Quotient Groups

One-line statement: A subgroup

N \leq G

is normal (written

N ⊴ G

) when it is invariant under conjugation, and exactly these subgroups allow the set of cosets

G / N

to inherit a group structure called the quotient group. Key result in words: Normal subgroups are precisely the kernels of group homomorphisms, and quotienting by a kernel recovers the homomorphic image (First Isomorphism Theorem). Where it applies: Throughout group theory, Galois theory, topology (fundamental groups), and the classification of finite simple groups. Who/when: Évariste Galois (c. 1831) implicitly; formalized by Camille Jordan, Otto Hölder, and others in the late 19th century.

A normal subgroup $N$ of a group $G$ is a subgroup satisfying $g N g^{- 1} = N$ for every $g \in G$ ; equivalently, its left and right cosets coincide. This invariance is precisely the condition needed to make the collection of cosets $G / N$ into a group under the natural operation $(a N) (b N) = ab N$ , called the quotient group (or factor group). Normal subgroups matter because they are the exact mechanism by which one group is built from smaller pieces: every homomorphism's kernel is normal, and every normal subgroup arises as a kernel. The surprising fact is that "dividing" a group by a normal subgroup is genuinely analogous to dividing integers — but it works only for the normal subgroups, and a subgroup can be invariant as a set under conjugation without any of its individual elements being fixed.

The Core Insight

Coset multiplication "wants" to be well-defined by the rule $(a N) (b N) = ab N$ , but this requires that the answer not depend on which representatives $a, b$ we chose. That well-definedness is logically equivalent to normality. So normality is not an arbitrary technical hypothesis — it is the condition that lets a partition of $G$ into cosets become a quotient group. Normality $\Leftrightarrow$ "the cosets form a group" $\Leftrightarrow$ " $N$ is a kernel."

Formal Statement

Normal Subgroup

Let $G$ be a group and $N \leq G$ a subgroup. Then $N$ is normal in $G$ , written $N ⊴ G$ , if any of the following equivalent conditions hold:

\forall g \in G : g N g^{- 1} = N

⟳This is the definition by conjugation invariance of the whole set;

g N g^{- 1} = {g n g^{- 1} : n \in N}

\forall g \in G : g N = N g

⟳Multiply

g N g^{- 1} = N

on the right by

g

; left and right cosets coincide.

\forall g \in G, \forall n \in N : g n g^{- 1} \in N

⟳Condition [1] reduces to the inclusion

g N g^{- 1} \subseteq N

for all

g

; applying it to

g^{- 1}

gives the reverse inclusion, so

\subseteq

for all

g

already forces equality.

Here $G$ is the ambient group, $N$ the candidate subgroup, $g$ ranges over all of $G$ , and $n$ over $N$ . The element $g n g^{- 1}$ is the conjugate of $n$ by $g$ .

Condition [1], $g N g^{- 1} = N$ , is a statement about the set $N$ , not about individual elements. It does not say $g n g^{- 1} = n$ (that would be centrality). It says the conjugation map permutes $N$ among itself. Conflating these is the single most common error.

Quotient Group

If $N ⊴ G$ , the quotient group $G / N$ is the set of left cosets

G / N = {g N : g \in G}

⟳A left coset is

g N = {g n : n \in N}

; distinct cosets partition

G

equipped with the operation

(a N) (b N) = (ab) N

⟳Define multiplication of cosets via representatives; well-definedness requires normality (proved below).

The identity is $e N = N$ , and the inverse of $a N$ is $a^{- 1} N$ . The order of the quotient (when finite) is the index:

∣ G / N ∣ = [G : N] = \frac{∣ G ∣}{∣ N ∣}

⟳Lagrange's theorem — cosets all have size

∣ N ∣

and partition

G

, so the number of cosets is

∣ G ∣/∣ N ∣

Quotient Group Theorem

Let $N \leq G$ . The operation $(a N) (b N) = ab N$ on the set of cosets is well-defined if and only if $N ⊴ G$ . When it is well-defined, $G / N$ is a group.

First Isomorphism Theorem

Let $φ : G \to H$ be a group homomorphism. Then:

ker φ = {g \in G : φ (g) = e_{H}} ⊴ G

⟳For

k \in ker φ

and

g \in G

φ (g k g^{- 1}) = φ (g) φ (k) φ (g)^{- 1} = φ (g) e_{H} φ (g)^{- 1} = e_{H}

and the induced map is an isomorphism:

G / ker φ ≅ im φ

⟳Define

\overset{φ}{ˉ} (g ker φ) = φ (g)

; check well-defined, injective (trivial kernel), and surjective onto the image.

Why It Holds / Derivation

Well-definedness $\Leftrightarrow$ Normality

Goal: Show

(a N) (b N) = ab N

is well-defined exactly when

N ⊴ G

. Step 1 (Setup). Suppose

a N = a^{'} N

and

b N = b^{'} N

. Then

a^{'} = a n_{1}

and

b^{'} = b n_{2}

for some

n_{1}, n_{2} \in N

. Well-definedness means

a^{'} b^{'} N = ab N

, i.e.

(ab)^{- 1} (a^{'} b^{'}) \in N

. Step 2 (Compute the discrepancy).

(ab)^{- 1} (a^{'} b^{'}) = b^{- 1} a^{- 1} (a n_{1}) (b n_{2}) = b^{- 1} a^{- 1} a n_{1} b n_{2} = b^{- 1} n_{1} b n_{2} .

For this to lie in

N

for all choices, since

n_{2} \in N

already, we need

b^{- 1} n_{1} b \in N

. Step 3 (Normality is necessary). Taking

a = a^{'} = e

(so

n_{1}

arbitrary in

N

) and

b

arbitrary, well-definedness forces

b^{- 1} n_{1} b \in N

for all

b \in G

n_{1} \in N

. By [3] (applied to

g = b^{- 1}

), this is exactly

N ⊴ G

. Step 4 (Normality is sufficient). Conversely, if

N ⊴ G

then

b^{- 1} n_{1} b \in N

by [3], so

b^{- 1} n_{1} b n_{2} \in N

, giving

a^{'} b^{'} N = ab N

. The operation is well-defined. Step 5 (Group axioms). Associativity:

((a N) (b N)) (c N) = (ab) N (c N) = ab c N = (a N) ((b N) (c N))

, inherited from

G

. Identity:

(a N) (e N) = a N

. Inverse:

(a N) (a^{- 1} N) = a a^{- 1} N = N

■

First Isomorphism Theorem

Step 1 (Kernel is normal). Shown in the derivation hint for [7]. Step 2 (Define the map). Let

K = ker φ

. Define

\overset{φ}{ˉ} : G / K \to H

\overset{φ}{ˉ} (g K) = φ (g)

. Step 3 (Well-defined). If

g K = g^{'} K

then

g^{- 1} g^{'} \in K

, so

φ (g^{- 1} g^{'}) = e_{H}

, hence

φ (g) = φ (g^{'})

. The value does not depend on the representative. Step 4 (Homomorphism).

\overset{φ}{ˉ} (g K \cdot g^{'} K) = \overset{φ}{ˉ} (g g^{'} K) = φ (g g^{'}) = φ (g) φ (g^{'}) = \overset{φ}{ˉ} (g K) \overset{φ}{ˉ} (g^{'} K)

. Step 5 (Injective). If

\overset{φ}{ˉ} (g K) = e_{H}

then

φ (g) = e_{H}

, so

g \in K

, i.e.

g K = K

, the identity coset. Trivial kernel

\Rightarrow

injective. Step 6 (Surjective onto image). By construction

im \overset{φ}{ˉ} = im φ

. Hence

\overset{φ}{ˉ} : G / K \to im φ

is a bijective homomorphism, i.e. an isomorphism.

■

Évariste Galois | 1811–1832

Galois, who died in a duel at twenty, introduced the conceptual seed of normality while studying the solvability of polynomial equations by radicals. In his memoir he distinguished subgroups whose cosets behaved "regularly" — what we now call normal subgroups — because these correspond to field extensions that can be peeled off cleanly. His notion of a normal series with simple quotients underlies the modern statement that a polynomial is solvable by radicals iff its Galois group is solvable. The word "normal" and the systematic theory came later (Jordan, Hölder), but the strategic insight — that the invariant subgroups are the ones you can quotient by — is Galois's.

Building Intuition

Think of cosets as the "fibers" of a measurement. A homomorphism $φ : G \to H$ groups together all elements with the same image; those clumps are exactly the cosets of $ker φ$ . Quotienting is deliberate forgetting: we declare two elements equal if they differ by something in $N$ , then ask whether the group law survives this forgetting. It survives precisely when $N$ is "symmetric enough" — invariant under conjugation — so that the act of forgetting commutes with multiplication.

A second picture: $Z / n Z$ is the prototype. Here $G = Z$ , $N = n Z$ , and we forget multiples of $n$ — that's modular arithmetic. Every quotient group generalizes "clock arithmetic" to a setting where the underlying group need not be abelian. In an abelian group every subgroup is normal (conjugation does nothing), so abelian quotients are unobstructed; the subtlety only appears in nonabelian groups.

Cosets of a normal subgroup partition G; the quotient collapses each coset to a point

Worked Examples

The integers modulo 6

Given:

G = (Z, +)

and

N = 6 Z = {\dots, - 6, 0, 6, 12, \dots}

. Since

Z

is abelian,

N

is automatically normal. Step 1 — List cosets. A coset is

k + 6 Z

. There are exactly

6

distinct cosets:

0 + 6 Z, 1 + 6 Z, 2 + 6 Z, 3 + 6 Z, 4 + 6 Z, 5 + 6 Z .

Step 2 — Order. By [6],

∣ G / N ∣ = [Z : 6 Z] = 6

. Step 3 — Operation.

(4 + 6 Z) + (5 + 6 Z) = 9 + 6 Z = 3 + 6 Z

, because

9 \equiv 3 (mod 6)

. Step 4 — Identify. This is precisely the additive group

Z /6 Z

, the integers mod 6.

Z /6 Z ≅ ({0, 1, 2, 3, 4, 5}, + mod 6), ∣ Z /6 Z ∣ = 6

Quotient of S₃ by A₃

Given:

G = S_{3}

(symmetric group on 3 letters,

∣ G ∣ = 6

) and

N = A_{3} = {e, (123), (132)}

, the alternating group,

∣ N ∣ = 3

. Step 1 — Normality.

A_{3}

has index

[S_{3} : A_{3}] = 6/3 = 2

. Any subgroup of index 2 is normal (its two left cosets are

N

and

G ∖ N

, identical to the two right cosets). So

A_{3} ⊴ S_{3}

. Step 2 — Cosets. Two cosets:

N = A_{3}

(the even permutations) and

tN

where

t

is any transposition, e.g.

(12)

, giving the odd permutations. Step 3 — Operation (sign multiplication).

(tN) (tN) = t^{2} N = e N = N, (N) (tN) = tN .

This matches the rule even

\times

even

=

even, odd

\times

odd

=

even. Step 4 — Order and identification.

∣ S_{3} / A_{3} ∣ = 2

. The unique group of order 2 is

Z /2 Z

; here it records the sign (parity) of a permutation, i.e. the sign homomorphism

sgn : S_{3} \to {\pm 1}

with kernel

A_{3}

S_{3} / A_{3} ≅ Z /2 Z, ∣ S_{3} / A_{3} ∣ = 2

By the First Isomorphism Theorem, this is

S_{3} / ker (sgn) ≅ im (sgn) = {\pm 1}

Common Misconceptions

"Normal means elements commute with everything." False. Normality is

g N g^{- 1} = N

as sets, not

g n = n g

for each

n

. The condition that every element commutes defines the center

Z (G)

, a much stronger (and always-normal) special case. "Every subgroup is normal." True only in abelian groups (and a few others, e.g. quaternion-like Hamiltonian groups). In

S_{3}

, the subgroup

⟨(12)⟩ = {e, (12)}

is not normal. " $G / N$ is a subgroup of $G$ ." Almost never.

G / N

is a group whose elements are cosets, not elements of

G

. Confusing the quotient with a complementary subgroup leads to false claims like

G ≅ N \times (G / N)

, which can fail (see below).

A non-normal subgroup, and a non-splitting quotient

Non-normal subgroup. In

S_{3}

, let

H = {e, (12)}

. Conjugate by

(13)

(13) (12) (13)^{- 1} = (13) (12) (13) = (23) \in / H .

H

is not normal, and indeed

(12) H \neq = H (12)

: the left coset

{(12), e} \cdot

... — concretely

a H \neq = H a

for

a = (13)

. The coset product

(a H) (b H)

is genuinely ill-defined here. Quotient does not "split." In

G = Z /4 Z

take

N = 2 Z /4 Z ≅ Z /2 Z

. Then

G / N ≅ Z /2 Z

, but

Z /4 Z \neq ≅ (Z /2 Z) \times (Z /2 Z) .

Both sides have order 4, yet the left has an element of order 4 and the right does not. Knowing

N

and

G / N

does not determine

G

— that ambiguity is the subject of the Extension Problem.

Connections

Normal subgroups and quotients are the central machinery linking several pillars of algebra. They are inseparable from the Group Homomorphisms picture via the kernel/image correspondence and the First Isomorphism Theorem; the Second and Third Isomorphism Theorems and the Correspondence Theorem all describe how subgroups of $G / N$ mirror subgroups of $G$ containing $N$ . Repeated quotienting builds composition series, whose simple quotients are governed by the Jordan–Hölder Theorem and lead to the Classification of Finite Simple Groups — the "atoms" left when no further nontrivial normal subgroup exists. In Galois Theory, normal subgroups of the Galois group correspond exactly to normal (Galois) intermediate field extensions, and solvable groups (chains of abelian quotients) characterize solvability by radicals. In topology, the quotient of a Fundamental Group by a normal subgroup corresponds to a covering space.

Real-World Applications

Public-key cryptography (RSA, Diffie–Hellman): Computations occur in quotient groups $(Z / n Z)^{\times}$ ; the structure of these finite quotients underlies key generation and the hardness of discrete logarithms.
Error-correcting codes: Linear codes are subgroups of $(F_{2})^{n}$ ; the syndrome of a received word is its coset in the quotient $(F_{2})^{n} / C$ , enabling fast decoding.
Crystallography: Space groups are analyzed via the quotient by the translation lattice (a normal subgroup), yielding the finite point group that classifies crystal symmetry (the 230 space groups).
Quantum mechanics & particle physics: Symmetry groups and their quotients (e.g. $S U (2) / {\pm I} ≅ S O (3)$ ) explain spin and the relation between rotations and their double cover.
Rubik's Cube and puzzle theory: The legal-move group is analyzed via normal subgroups (orientation subgroups) and quotients to count reachable configurations.
Galois theory in practice: Determining whether a quintic is solvable by radicals reduces to checking whether its Galois group has a chain of normal subgroups with abelian quotients.
Coding-theoretic hashing and homomorphic schemes: Quotient structures provide compression maps that respect the group operation, used in homomorphic commitments.

Historical Development

c. 1831 — Galois: Implicitly identifies "invariant" (normal) subgroups while studying permutation groups of polynomial roots; introduces the strategic idea of solvability via chains of such subgroups.
1846 — Liouville: Publishes Galois's manuscripts posthumously, bringing the ideas to a wider audience.
1854 — Cayley: Gives an abstract definition of a (finite) group, setting the stage for intrinsic, axiomatic treatment.
1870 — Camille Jordan: Traité des substitutions systematizes normal subgroups ("sous-groupes invariants") and proves a version of what becomes the composition-series uniqueness theorem.
1889 — Otto Hölder: Completes and refines the Jordan–Hölder Theorem, establishing uniqueness of composition factors and crystallizing the role of simple quotients.
1893 — Heinrich Weber: Provides a fully abstract axiomatic definition of groups, normal subgroups, and quotient groups in modern style.
1895–1896 — Frobenius & others: Develop character theory and deepen the structural study of normal subgroups in finite groups.
1920s — Emmy Noether: Elevates the isomorphism theorems to general algebraic structures, framing quotients as a universal construction; her formulation is the one taught today.
1955–2004 — Classification of Finite Simple Groups: A vast collaborative effort culminates in listing all groups with no nontrivial normal subgroups — the endpoint of repeated quotienting.

Subtleties & Limits

Normality is not transitive. If

K ⊴ H ⊴ G

it need not follow that

K ⊴ G

. (Example: in

G = A_{4}

or in dihedral groups, one can find such a "subnormal but not normal" chain.) Subgroups reachable by a chain of normal inclusions are called subnormal, and the study of subnormality is a genuine subfield. The extension problem. Given

N ⊴ G

with quotient

Q = G / N

, the pair

(N, Q)

does not determine

G

. Classifying all groups

G

fitting into

1 \to N \to G \to Q \to 1

is the Extension Problem, controlled by group cohomology

H^{2} (Q, Z (N))

; it remains computationally formidable in general. Detecting simplicity. Determining whether a given group has any nontrivial normal subgroup (i.e. is simple) was historically extremely hard; the full classification of finite simple groups runs to thousands of pages and its complete write-up ("the second-generation proof") is still being consolidated. Infinite groups. For infinite (especially topological/Lie) groups one must require closed normal subgroups for the quotient to be well-behaved as a topological group — set-theoretic normality alone is insufficient.

Normal Subgroups and Quotient Groups

The Core Insight

Formal Statement

Normal Subgroup

Quotient Group

Quotient Group Theorem

First Isomorphism Theorem

Why It Holds / Derivation

Well-definedness $\Leftrightarrow$ Normality

First Isomorphism Theorem

Évariste Galois | 1811–1832

Building Intuition

Cosets of a normal subgroup partition G; the quotient collapses each coset to a point

Worked Examples

The integers modulo 6

Quotient of S₃ by A₃

Common Misconceptions

A non-normal subgroup, and a non-splitting quotient

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also

Before this

Where this leads