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

Second Isomorphism Theorem for Groups

Graduate Depth 98 in the knowledge graph I know this Set as goal
31topics build on this
411prerequisites beneath it
See this on the map →
First Isomorphism Theorem for GroupsFundamental Theorem of Galois Theory+2 moreDirect Products of Groups
isomorphism-theorem subgroups correspondence

Core Idea

Let H be a subgroup and N a normal subgroup of G. Then HN is a subgroup, N is normal in HN, and (HN)/N ≅ H/(H ∩ N).

Explainer

The Second Isomorphism Theorem describes what happens when a subgroup H and a normal subgroup N interact inside a larger group G. You already know from the First Isomorphism Theorem that quotients and homomorphisms are deeply linked — this theorem extends that insight to a finer structural picture involving how two subgroups overlap and combine.

The setup: H is any subgroup of G and N is a normal subgroup. The theorem says three things at once. First, HN = {hn : h ∈ H, n ∈ N} is itself a subgroup of G (this wouldn't hold in general without N being normal). Second, N is normal inside HN (it was normal in all of G, so it's certainly normal in the smaller group HN). Third, and most importantly, there's an isomorphism (HN)/N ≅ H/(H ∩ N). The key to proving this is the map φ: H → (HN)/N defined by φ(h) = hN. This map is a surjective homomorphism, and its kernel is {h ∈ H : hN = N} = H ∩ N. The First Isomorphism Theorem then delivers the result.

A concrete example: take G = Z₁₂, H = ⟨4⟩ = {0, 4, 8}, N = ⟨3⟩ = {0, 3, 6, 9}. Then HN contains both 4 and 3, and since gcd(3, 4) = 1 in Z₁₂ these generate all of Z₁₂, so HN = Z₁₂. Meanwhile H ∩ N = {0} (the two cyclic subgroups share only the identity). The theorem says Z₁₂/{0, 3, 6, 9} ≅ {0, 4, 8}/{0}, i.e., Z₃ ≅ Z₃ — the sizes match (4 elements on the left, 3 elements on the right... wait, Z₁₂/N has 3 cosets). The theorem keeps the "sizes" consistent: |HN|/|N| = |H|/|H ∩ N|.

The theorem is sometimes called the diamond isomorphism theorem because the four groups N, H, HN, and H ∩ N form a diamond shape in the subgroup lattice. The isomorphism (HN)/N ≅ H/(H ∩ N) says the "ratio" between HN and N equals the "ratio" between H and H ∩ N — a beautiful symmetry in the lattice structure of the group. This perspective becomes especially powerful when studying the correspondence theorem and the structure of quotient groups in more advanced algebra.

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 GroupsFirst Isomorphism Theorem for RingsIntegral DomainsPrincipal Ideal DomainsUnique Factorization DomainsPolynomial RingsField ExtensionsAlgebraic and Transcendental ElementsSplitting FieldsFinite FieldsGalois GroupsFundamental Theorem of Galois TheorySecond Isomorphism Theorem for Groups

Longest path: 99 steps · 411 total prerequisite topics

Prerequisites (4)

Leads To (1)