← Graph View All Domains

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

Failure of Unique Factorization

Research Depth 97 in the knowledge graph ☐ I know this ☆ Set as goal

1topic build on this

417prerequisites beneath it

See this on the map →

The Norm in Algebraic Number Fields Introduction to the Ideal Class Group→→Introduction to the Ideal Class Group

unique-factorization-failure algebraic-number-theory

Core Idea

Unlike ℤ and Gaussian integers, most rings of algebraic integers lack unique factorization. In ℤ[√(-5)], we have 6 = 2·3 = (1+√(-5))(1-√(-5)), two distinct factorizations. This motivates ideals, where factorization recovers uniqueness.

Explainer

The unique factorization theorem — the fundamental theorem of arithmetic — guarantees that every integer greater than 1 factors into primes in exactly one way. This feels inevitable until you extend arithmetic to larger number systems and watch it break down. The norm of an algebraic integer, which you studied as a prerequisite, is the key tool for detecting irreducibility in these rings.

In the ring ℤ[√(-5)], consider the number 6. On one hand, 6 = 2 × 3. On the other hand, 6 = (1 + √(-5))(1 - √(-5)). Both are factorizations into elements that cannot be factored further — they are irreducible in ℤ[√(-5)]. To verify irreducibility, use norms: N(2) = 4, and there is no element in ℤ[√(-5)] with norm 2, since a² + 5b² = 2 has no integer solutions. So 2 cannot split. Similarly for 3, (1 + √(-5)), and (1 - √(-5)). We have four distinct irreducibles appearing in two different products equaling 6.

The failure is subtle: these irreducibles are not prime in the ring-theoretic sense. A prime p satisfies: if p divides ab, then p divides a or p divides b. In ℤ, every irreducible is prime — the two concepts coincide. In ℤ[√(-5)], they diverge. For example, 2 divides (1 + √(-5))(1 - √(-5)) = 6, but 2 does not divide either factor individually in this ring. This divergence between irreducible and prime is precisely what produces the two factorizations of 6. Unique factorization holds if and only if every irreducible is prime — equivalently, if and only if the ring is a unique factorization domain (UFD).

The cure is the theory of ideals. Rather than factoring elements, we factor ideals, and ideal factorization is always unique in rings of algebraic integers. The ideal (2) in ℤ[√(-5)] factors as a product of two prime ideals, and the ideals (1 ± √(-5)) each factor further. When you recombine these ideal factorizations, the two seemingly different element-level factorizations emerge from the same underlying unique ideal factorization. This is why Dedekind invented ideals: they restore the uniqueness that element arithmetic alone cannot guarantee, and the ideal class group — measuring how far a ring is from being a UFD — becomes the central object for quantifying the failure.

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

Longest path: 98 steps · 417 total prerequisite topics

Prerequisites (2)

The Norm in Algebraic Number Fieldshard Introduction to the Ideal Class Groupsoft

Leads To (1)

Introduction to the Ideal Class Grouphard