# Unique Factorization Failure ## Unique Factorization in the Integers One of the central properties of the ordinary integers is unique factorization. Every nonzero integer can be written as a product of prime numbers, and this factorization is unique up to order and signs. For example, $$ 60=2^2\cdot3\cdot5. $$ No essentially different prime factorization exists. This theorem, called the fundamental theorem of arithmetic, underlies much of classical number theory. When arithmetic is extended to algebraic integers, however, unique factorization may fail. ## First Example of Failure Consider the ring $$ \mathbb{Z}[\sqrt{-5}] = \{a+b\sqrt{-5}:a,b\in\mathbb{Z}\}. $$ Inside this ring, the number $6$ factors in two different ways: $$ 6=2\cdot3, $$ and $$ 6=(1+\sqrt{-5})(1-\sqrt{-5}). $$ $$ 6=2\cdot3=(1+\sqrt{-5})(1-\sqrt{-5}) $$ These are genuinely different factorizations. To see this, one must verify that the factors are irreducible and not associates of one another. ## Norm Argument The norm in $$ \mathbb{Z}[\sqrt{-5}] $$ is $$ N(a+b\sqrt{-5})=a^2+5b^2. $$ The norm is multiplicative: $$ N(\alpha\beta)=N(\alpha)N(\beta). $$ Now compute: $$ N(2)=4, \qquad N(3)=9, $$ and $$ N(1+\sqrt{-5})=1+5=6. $$ Suppose $$ 2=\alpha\beta. $$ Then $$ 4=N(2)=N(\alpha)N(\beta). $$ Possible norms are positive integers of the form $$ a^2+5b^2. $$ There is no element of norm $2$. Hence $2$ cannot factor nontrivially. Thus $2$ is irreducible. A similar argument shows that: - $3$ is irreducible, - $1+\sqrt{-5}$ is irreducible, - $1-\sqrt{-5}$ is irreducible. Therefore the two factorizations of $6$ are genuinely distinct. Unique factorization fails. ## Irreducible Versus Prime In ordinary integers, irreducible and prime mean the same thing. In general rings, they differ. An element $p$ is prime if $$ p\mid ab $$ implies $$ p\mid a \quad\text{or}\quad p\mid b. $$ An element is irreducible if it cannot be factored nontrivially. In $$ \mathbb{Z}[\sqrt{-5}], $$ the element $2$ is irreducible but not prime. Indeed, $$ 2\mid (1+\sqrt{-5})(1-\sqrt{-5}), $$ but $$ 2\nmid (1+\sqrt{-5}), \qquad 2\nmid (1-\sqrt{-5}). $$ Thus irreducibility no longer guarantees primality. This distinction is the fundamental reason unique factorization breaks down. ## Why Unique Factorization Matters Many classical proofs rely implicitly on unique factorization. For example, the standard proof that $$ \sqrt2 $$ is irrational uses prime factorization. Attempts to generalize such arguments to algebraic number fields initially failed because unique factorization was assumed to persist. This problem became especially important in attempts to prove Fermat last theorem. ## Kummer and Fermat Equation entity["people","Ernst Kummer","German mathematician"] studied the equation $$ x^p+y^p=z^p. $$ Using cyclotomic factorizations, one obtains expressions such as $$ x^p+y^p = (x+y)(x+\zeta y)\cdots(x+\zeta^{p-1}y), $$ where $$ \zeta=e^{2\pi i/p}. $$ Kummer initially hoped to apply unique factorization in cyclotomic integer rings. However, unique factorization often failed. This obstacle forced Kummer to develop new arithmetic concepts. ## Ideals Restore Factorization The solution came from replacing elements by ideals. Although elements may not factor uniquely, ideals do. This idea was developed fully by entity["people","Richard Dedekind","German mathematician"]. In the ring of integers $\mathcal O_K$ of a number field, every nonzero ideal factors uniquely into prime ideals. Thus unique factorization survives at the ideal level even when it fails for elements. This theorem became one of the cornerstones of algebraic number theory. ## Class Number The failure of unique factorization is measured by the class number. If the class number of a number field equals $1$, then unique factorization of elements holds. If the class number is greater than $1$, unique factorization fails. For example: - $\mathbb{Z}[i]$ has class number $1$, - $\mathbb{Z}[\sqrt{-5}]$ has class number greater than $1$. Thus class numbers quantify arithmetic complexity. ## Euclidean Domains and UFDs Some rings of integers retain strong factorization properties. A Euclidean domain admits a division algorithm. Every Euclidean domain is a principal ideal domain, and every principal ideal domain is a unique factorization domain. For example: - $\mathbb{Z}$ is Euclidean, - $\mathbb{Z}[i]$ is Euclidean. But many rings of integers are not Euclidean and not UFDs. Understanding which number fields possess unique factorization is a deep problem. ## Geometric Interpretation Under embeddings into Euclidean space, rings of integers form lattices. Unique factorization failure reflects geometric complexity of these lattices. Ideal factorization restores structure by treating arithmetic objects globally rather than elementwise. This geometric viewpoint becomes increasingly important in modern algebraic number theory. ## Historical Significance The discovery that unique factorization can fail was a major turning point in mathematics. It revealed that ordinary integer arithmetic is unusually special rather than universally typical. The need to repair factorization theory led to: - ideals, - Dedekind domains, - class groups, - algebraic number theory itself. Thus the failure of unique factorization was not merely a technical difficulty. It became the source of an entirely new mathematical framework.