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 TheoremFundamental 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of GroupsGroup HomomorphismsGroup IsomorphismsCayley's TheoremCosets and Lagrange's TheoremNormal Subgroups

Longest path: 82 steps · 372 total prerequisite topics

Prerequisites (1)

Leads To (3)