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

Introduction to the Ideal Class Group

Research Depth 98 in the knowledge graph ☐ I know this ☆ Set as goal
418prerequisites beneath it
See this on the map →
Failure of Unique FactorizationSubrings and Ideals→
ideal-class-group algebraic-number-theory

Core Idea

The ideal class group measures how far a number ring departs from unique factorization. In rings of algebraic integers where elements may not factor uniquely, ideals always factor uniquely into prime ideals. Two ideals are equivalent if they differ by multiplication by a principal ideal. The class group is the quotient of fractional ideals by principal ideals, and its order—the class number h(K)—equals 1 precisely when the ring is a principal ideal domain with unique factorization. Computing class numbers reveals the arithmetic complexity of number fields and connects to deep results in algebraic number theory.

How It's Best Learned

Work through ℤ[√−5], where 6 = 2 · 3 = (1+√−5)(1−√−5) shows factorization failure. Then verify that ideal factorization restores uniqueness and compute that h = 2, making the class group ℤ/2ℤ.

Common Misconceptions

The class group is not about individual elements failing to factor—it is about the global structure of ideals. Students sometimes think unique factorization fails "everywhere" when h > 1, but many elements still factor uniquely; it is the exceptions that the class group quantifies.

Explainer

From your study of the failure of unique factorization, you know that some rings of algebraic integers do not behave like ℤ. In ℤ[√−5], the equation 6 = 2 · 3 = (1 + √−5)(1 − √−5) gives two genuinely distinct factorizations into irreducibles — the ring is not a unique factorization domain. The ideal class group is the algebraic object that measures exactly how badly unique factorization fails. It does not just say "factorization is broken" — it quantifies the structural obstruction and organizes it into a group.

The key insight from your study of ideals is that while elements may not factor uniquely, ideals always do in a Dedekind domain (which every ring of algebraic integers is). In ℤ[√−5], the ideals (2), (3), (1 + √−5), and (1 − √−5) are not prime ideals, but each can be factored uniquely into products of prime ideals. For instance, (2) = 𝔭₁² where 𝔭₁ = (2, 1 + √−5) is a prime ideal. The passage from elements to ideals restores unique factorization — the problem is not that factorization is impossible, but that it happens at the level of ideals rather than elements.

Two fractional ideals I and J are declared equivalent if I = αJ for some nonzero element α of the field — that is, they differ by multiplication by a principal ideal. The equivalence classes form a group under ideal multiplication, called the ideal class group Cl(K). The identity element is the class of principal ideals (those of the form (α) for some element α). The class number h(K) = |Cl(K)| counts how many equivalence classes there are. The critical fact is: h(K) = 1 if and only if every ideal is principal, which happens if and only if the ring is a PID, which for Dedekind domains is equivalent to being a UFD. So h(K) = 1 is the precise algebraic condition for unique factorization to hold.

For ℤ[√−5], the class group is ℤ/2ℤ, so h = 2. There are exactly two ideal classes: the principal ideals and one non-trivial class represented by 𝔭₁ = (2, 1 + √−5). The non-unique factorization of 6 is a direct consequence: the prime ideal factorization of (6) passes through non-principal ideals, so the factorization at the ideal level cannot be "lifted" to a unique factorization at the element level. Computing class numbers for specific number fields — using Minkowski's bound to reduce the computation to finitely many ideals — is one of the central practical tasks of algebraic number theory and connects to deep results including the analytic class number formula involving L-functions.

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 → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Field Extensions → Algebraic Integers → The Norm in Algebraic Number Fields → Failure of Unique Factorization in Algebraic Number Fields → Introduction to the Ideal Class Group → Failure of Unique Factorization → Introduction to the Ideal Class Group

Longest path: 99 steps · 418 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.