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

Quotient Groups

Graduate Depth 82 in the knowledge graph ☐ I know this ☆ Set as goal
543topics build on this
373prerequisites beneath it
See this on the map →
Normal Subgroups→→Exact Sequences in Homological AlgebraFiber Bundles+3 more
quotient coset-multiplication G/N

Core Idea

If N is a normal subgroup of G, the set of cosets G/N forms a group under coset multiplication: (aN)(bN) = (ab)N. The quotient group G/N has order |G| / |N|.

Explainer

To understand quotient groups, start with what you already know about cosets: given a subgroup N of G, the left cosets aN = {an : n ∈ N} partition G into equal-sized pieces. The crucial question is: can these pieces themselves form a group? The answer is yes — but only when N is normal, meaning aN = Na for every a ∈ G. Normality is exactly what is needed for coset multiplication to be well-defined.

Here is why normality matters. If you try to multiply two cosets by picking representatives — compute (aN)(bN) = (ab)N — you need the result to be independent of which representatives you chose. If you had picked a' = an₁ and b' = bn₂ instead, you'd compute (a'b')N = (an₁bn₂)N. For this to equal (ab)N, you need n₁b to equal b times something in N — that is, b⁻¹n₁b ∈ N for all n₁ ∈ N. This is exactly the condition that N is closed under conjugation by elements of G, which is precisely the definition of a normal subgroup. Without normality, the multiplication rule breaks down and you don't get a well-defined group structure.

A canonical example: take G = ℤ₆ = {0,1,2,3,4,5} under addition, and N = {0,3}. The cosets are {0,3}, {1,4}, {2,5}. The quotient G/N has three elements and is isomorphic to ℤ₃. What the quotient is doing conceptually: it "collapses" N to zero, treats elements that differ by an element of N as equivalent, and what survives is the structure that remains after that identification. The order formula |G/N| = |G|/|N| follows directly from the partition: there are |G|/|N| cosets, each of size |N|.

The quotient group captures the idea of "G modulo the symmetry described by N." If N encodes some kind of equivalence — elements that are "the same" for some purpose — then G/N is the group you get when you stop distinguishing between equivalent elements. This idea leads directly to the First Isomorphism Theorem: whenever you have a group homomorphism φ: G → H, the image is isomorphic to G/ker(φ). The kernel is always a normal subgroup, and the quotient group is precisely the image of G under φ, with all the "collapsing" made explicit. Quotient groups are thus the bridge between subgroup structure and the structure-preserving maps between groups.

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

Longest path: 83 steps · 373 total prerequisite topics

Prerequisites (1)

Leads To (5)