Square a4 · Mathematics · Queenside
Unique factorization
Fundamental theorem of arithmetic: unique prime factorization.
Meaning
The displayed formula expresses the fundamental theorem of arithmetic: every integer can be written as a product of prime powers, where the primes are distinct and the exponents are positive integers; and this factorization is unique up to ordering of the factors. Equivalently, the positive integers form a unique factorization domain under ordinary multiplication.
“Unique up to order” means that if with primes , then the multisets of prime factors coincide. The theorem fails if one allows to count as a prime, or if one works in certain other rings (for example, ), where factorization into irreducibles need not be unique. In itself, uniqueness holds.
Context
Euclid’s Elements already contains the key lemmas: every integer greater than has a prime factor (Book VII), and Euclid’s lemma—if a prime divides a product, it divides one of the factors—appears in substance in Book VII, Proposition 30. A fully explicit statement of unique factorization in modern form is often credited to Gauss’s Disquisitiones Arithmeticae (1801), which placed the theorem at the foundation of elementary number theory.
Unique factorization is the reason prime numbers deserve their name: they are the multiplicative “atoms” of the integers. Without uniqueness, the notion of the prime factorization of would be ambiguous, and many arguments that compare exponents—from the irrationality of to the analysis of Diophantine equations—would collapse or require repair.
The theorem also marks a boundary. In algebraic number theory one studies rings of integers in number fields; there unique factorization into primes may fail, and one introduces ideals (Kummer, Dedekind) to restore a unique factorization theorem at the level of ideals. Thus the square’s formula is both a completed result for and a template for what one hopes to recover in more general arithmetic settings.
On the Canon Board, unique factorization stands next to the infinitude of primes and the prime number theorem as a pillar of multiplicative number theory: existence and uniqueness of the prime decomposition of every natural number.
Sources
- Grokipedia: Fundamental theorem of arithmetic
- Wikipedia: Fundamental theorem of arithmetic
- Britannica: Fundamental theorem of arithmetic