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

First Isomorphism Theorem for Groups

Graduate Depth 85 in the knowledge graph ☐ I know this ☆ Set as goal
500topics build on this
382prerequisites beneath it
See this on the map →
Quotient GroupsFirst Isomorphism Theorem for Rings→→Second Isomorphism Theorem for GroupsThird Isomorphism Theorem for Groups
isomorphism-theorem fundamental-theorem kernel image

Core Idea

If φ: G → H is a group homomorphism, then G/ker(φ) ≅ im(φ). This theorem connects quotient groups and images of homomorphisms.

Explainer

The First Isomorphism Theorem is one of the central structural results in group theory. It tells you that when a homomorphism φ: G → H cannot be injective — because multiple elements of G map to the same element of H — the "reason" for that collision is always the kernel. The kernel ker(φ) = {g ∈ G : φ(g) = e_H} is a normal subgroup of G, and it captures exactly the elements that get "crushed to the identity" by φ. Any two elements g₁ and g₂ with the same image — φ(g₁) = φ(g₂) — differ by a kernel element: g₂ = g₁k for some k ∈ ker(φ). So the kernel completely describes the collisions.

Your prerequisite knowledge of quotient groups is the key ingredient. The quotient group G/ker(φ) takes G and glues together everything that φ sends to the same place — creating one coset gK (where K = ker(φ)) for each "equivalence class" of elements sharing an image. The theorem says this collapsing operation produces a group genuinely isomorphic to the image im(φ) ≤ H. The isomorphism is the map φ̄: G/ker(φ) → im(φ) defined by φ̄(gK) = φ(g). This is well-defined precisely because any two representatives of gK have the same image under φ.

A concrete example makes this vivid. Let φ: ℤ → ℤ/3ℤ be the reduction-mod-3 map: φ(n) = n mod 3. The kernel is 3ℤ = {…, −6, −3, 0, 3, 6, …}, the multiples of 3. The quotient group ℤ/3ℤ on the left side of the isomorphism has three cosets: {3ℤ, 1+3ℤ, 2+3ℤ}. The image of φ is all of ℤ/3ℤ on the right. The theorem confirms these are isomorphic, and the isomorphism is immediate: coset k+3ℤ maps to k mod 3.

The deeper insight is a dimension-like counting principle. For finite groups, the theorem implies |G| = |ker(φ)| × |im(φ)|, since |G/ker(φ)| = |G|/|ker(φ)|. This is the group-theoretic analog of the rank-nullity theorem from linear algebra: the kernel (what collapses) and the image (what survives) together account for all of G. Every homomorphism factors as G surjecting onto G/ker(φ), followed by G/ker(φ) injecting isomorphically into H. The theorem makes this two-step factorization precise and universal — it applies to every group homomorphism, regardless of the specific groups involved.

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

Longest path: 86 steps · 382 total prerequisite topics

Prerequisites (2)

Leads To (2)