Fundamental Theorem of Arithmetic

Fundamental Theorem of Arithmetic The Fundamental Theorem of Arithmetic asserts that each integer greater than one admits a factorization into prime numbers, and that this factorization is unique up to the order of the factors. The theorem underpins results in Leonhard Euler's work on the Riemann zeta function, in Carl Friedrich Gauss's Disquisitiones Arithmeticae, and in modern texts such as those by G. H. Hardy and John von Neumann.

Statement

The formal statement appears in classical expositions by Euclid in the Elements and was later systematized by Pierre de Fermat and Adrien-Marie Legendre. It can be phrased: for any integer n > 1 there exist primes p1, p2, ..., pk with n = p1 p2 ... pk, and if n = q1 q2 ... qm is another representation with primes qi then k = m and {p1,...,pk} = {q1,...,qk} as multisets. This formulation is central in the work of Joseph-Louis Lagrange on integers and in Gauss's Disquisitiones, and it directly informs the statements of the Chinese remainder theorem, the Euclidean algorithm, and investigations by Évariste Galois into algebraic structures.

Proofs

Existence is often proven by induction using the Euclidean algorithm and was indicated in Euclid's Elements; modern expositions appear in treatises by David Hilbert and Emil Artin. Uniqueness can be shown using the lemma that if a prime p divides a product ab then p divides a or p divides b; this lemma is attributed to Euclid and is used in proofs by Gauss and Richard Dedekind. Alternative proofs use the structure of principal ideal domains and unique factorization in Dedekind domains, as elaborated by Ernst Kummer in his work on cyclotomic fields and by Hilbert in his Zahlbericht. Analytic proofs connect uniqueness with properties studied by Bernhard Riemann and Leonhard Euler through multiplicative functions and Dirichlet series, referenced in treatments by Atle Selberg and G. H. Hardy.

Uniqueness and Existence

The existence part is constructive: starting from n, repeatedly apply the Euclidean algorithm to find a nontrivial divisor or certify primality, an approach reflected in algorithms by Euclid and modern routines by Alan Turing and Donald Knuth. The uniqueness part relies on the prime divisibility lemma; classical expositions appear in works by Gauss and Dedekind, while algebraic generalizations are credited to Kummer and Noether. The uniqueness assertion yields the arithmetic of valuations used in Ostrowski's theorem and underlies the definition of the greatest common divisor exploited in the proofs of the Fundamental theorem of algebra analogs in algebraic number theory, as developed by Richard Brauer and Emmy Noether.

Consequences and Applications

The theorem is essential to the proof of the Fundamental theorem of arithmetic's corollaries such as the classification of solutions to Diophantine equations studied by Pierre de Fermat and the structural results used by Andrew Wiles in the proof of Fermat's Last Theorem. It underpins the prime number theorem as treated by Jacques Hadamard and Charles Jean de la Vallée Poussin, informs multiplicative number theory used by Paul Erdős and Atle Selberg, and enables cryptographic algorithms like RSA developed by Ron Rivest, Adi Shamir, and Leonard Adleman. The theorem controls the behavior of arithmetic functions such as the Euler totient function studied by Leonhard Euler and the Möbius function used in Srinivasa Ramanujan's identities; it also plays a role in computational complexity results by Shafi Goldwasser and Silvio Micali concerning integer factorization.

Generalizations and Related Results

Generalizations include the concept of unique factorization domains (UFDs) introduced in the context of algebraic number theory by Richard Dedekind, with failures first noted by Ernst Kummer in cyclotomic fields and resolved by the introduction of ideal factorization. The theorem is related to the structure theorems for principal ideal domains, the characterization of Noetherian rings, and the classification of Dedekind domains by class group theory studied by Emil Artin and Heinrich Weber. Further connections appear in the study of valuations by Ostrowski and in the use of adèles and idèles in the work of Andre Weil and Jean-Pierre Serre. Modern expansions connect to algorithmic number theory advances by A. K. Lenstra and Hendrik Lenstra, and to analytic perspectives by Atle Selberg and Enrico Bombieri.

Category:Theorems in number theory