A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Normal Subgroups

Graduate Depth 81 in the knowledge graph ☐ I know this ☆ Set as goal
548topics build on this
372prerequisites beneath it
See this on the map →
Cosets and Lagrange's Theorem→→Fundamental Theorem of Galois TheoryInduced Representations+1 more
normal kernel conjugate invariant

Core Idea

A subgroup N is normal if gNg⁻¹ = N for all g ∈ G, equivalently gN = Ng for all g. Normal subgroups are precisely the kernels of homomorphisms. Only for normal subgroups does the set of cosets form a group.

Explainer

From your study of cosets, you know that any subgroup H partitions G into left cosets gH and also into right cosets Hg. For a general subgroup, the left coset gH and right coset Hg are different sets — the element g is in both, but the rest of the members may differ. A normal subgroup N is one where this distinction collapses: gN = Ng for every g in G. The left and right cosets always coincide. Equivalently, conjugating N by any g (forming gNg⁻¹) gives back N itself. This is the normality condition: N is closed under conjugation by every element of G.

Why does this matter? Because normality is precisely the condition needed for the set of cosets to form a group in its own right. Try to multiply two cosets: you want to define (aN)(bN) = (ab)N. For this to be well-defined — meaning the product of any representative of aN with any representative of bN lands in (ab)N — you need N to be normal. Specifically, you need bNb⁻¹ = N so that the N's can "pass through" b. Without normality, the multiplication of cosets depends on which representatives you pick, so there is no consistent group structure. With normality, the quotient group G/N, whose elements are the cosets of N, is a genuine group with (aN)(bN) = (ab)N.

The deepest characterization of normal subgroups connects them to group homomorphisms. A homomorphism φ: G → H is a function preserving the group operation: φ(ab) = φ(a)φ(b). The kernel of φ is ker(φ) = {g ∈ G : φ(g) = e_H}, the set of elements that map to the identity. The kernel is always a normal subgroup of G: if φ(n) = e and g is any element, then φ(gng⁻¹) = φ(g)eφ(g)⁻¹ = e, so gng⁻¹ ∈ ker(φ). Conversely, every normal subgroup is the kernel of some homomorphism — namely the quotient map G → G/N sending g to its coset gN. So normality and being a kernel are the same thing.

The most important examples to internalize: every subgroup of an abelian group is normal (since ab = ba implies aH = Ha always). The center Z(G) — elements commuting with everything — is always normal. The alternating group Aₙ is normal in the symmetric group Sₙ. Non-examples are equally instructive: in S₃, the subgroup generated by a single transposition (say {e, (12)}) is not normal because conjugating (12) by (13) gives (23), which is outside the subgroup. The subgroup fails to be closed under conjugation, so left and right cosets differ, and no quotient group can be formed.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups

Longest path: 82 steps · 372 total prerequisite topics

Prerequisites (1)

Leads To (3)