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 GroupsFirst 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 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 SubgroupsQuotient GroupsFirst Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsFirst Isomorphism Theorem for GroupsThird Isomorphism Theorem for Groups

Longest path: 87 steps · 383 total prerequisite topics

Prerequisites (1)

Leads To (2)