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

Third Isomorphism Theorem for Groups

Graduate Depth 86 in the knowledge graph ☐ I know this ☆ Set as goal
499topics build on this
383prerequisites beneath it
See this on the map →
First Isomorphism Theorem for Groups→→First Isomorphism Theorem for RingsSecond Isomorphism Theorem for Groups
isomorphism-theorem normal-subgroups

Core Idea

If N and M are normal subgroups of G with N ⊆ M, then M/N is a normal subgroup of G/N, and (G/N)/(M/N) ≅ G/M.

Explainer

The Third Isomorphism Theorem is easiest to understand through a familiar arithmetic analogy. Consider the integers ℤ, with the subgroups 2ℤ ⊆ 6ℤ. Here N = 6ℤ and M = 2ℤ. The quotient ℤ/6ℤ ≅ ℤ₆ is the integers mod 6. Inside ℤ₆, the subgroup 2ℤ/6ℤ = {0, 2, 4} ≅ ℤ₃ is the even residues mod 6. The theorem says (ℤ/6ℤ)/(2ℤ/6ℤ) ≅ ℤ/2ℤ — that is, ℤ₆ modulo its subgroup {0, 2, 4} gives ℤ₂. Check: ℤ₆/{0,2,4} has cosets {0,2,4} and {1,3,5}, giving a two-element group. And ℤ/2ℤ ≅ ℤ₂. The theorem is confirmed.

The intuition is cancellation, like fractions: (G/N)/(M/N) behaves like "G over M", with the N's cancelling. The N that was introduced into the denominator of both quotient groups washes out, leaving G/M. This is why the Third Isomorphism Theorem is sometimes stated as a "cancellation law" for quotient groups.

To prove it, the First Isomorphism Theorem is the main tool. You already know that if φ: G → H is a surjective homomorphism with kernel K, then G/K ≅ H. Here, define a map φ: G/N → G/M by φ(gN) = gM — that is, "re-coset" each coset of N into a coset of M. Because N ⊆ M, every coset of M is a union of cosets of N, so this map is well-defined. It is clearly surjective (every coset gM is hit). Its kernel consists of all cosets gN such that gM = eM, i.e., g ∈ M, i.e., gN ∈ M/N. So ker(φ) = M/N. By the First Isomorphism Theorem, (G/N)/ker(φ) ≅ G/M, which is exactly (G/N)/(M/N) ≅ G/M.

The practical significance is that the Third Isomorphism Theorem lets you "factor" quotient groups: instead of computing (G/N)/(M/N) directly, you can compute the simpler G/M. It also reinforces a general lesson in abstract algebra: the isomorphism theorems are not independent facts to memorize but a coherent family of tools built on the First Isomorphism Theorem and the kernel-image correspondence.

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 → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups

Longest path: 87 steps · 383 total prerequisite topics

Prerequisites (1)

Leads To (2)