Fundamental theorem of arithmetic

The unique factorization theorem was proved by Gauss with his 1801 book Disquisitiones Arithmeticae.^[1] In this book, Gauss used the fundamental theorem for proving the law of quadratic reciprocity.^[2]

In number theory, the fundamental theorem of arithmetic, also called the unique factorization theorem or the unique-prime-factorization theorem, states that every integer greater than 1^[3] either is prime itself or is the product of prime numbers, and that this product is unique, up to the order of the factors.^[4][5][6] For example,

1200 = 2⁴ × 3¹ × 5² = 3 × 2 × 2 × 2 × 2 × 5 × 5 = 5 × 2 × 3 × 2 × 5 × 2 × 2 = etc.

The theorem is stating two things: first, that 1200 can be represented as a product of primes, and second, no matter how this is done, there will always be four 2s, one 3, two 5s, and no other primes in the product.

The requirement that the factors be prime is necessary: factorizations containing composite numbers may not be unique (e.g. 12 = 2 × 6 = 3 × 4).

This theorem is one of the main reasons why 1 is not considered a prime number: if 1 were prime, the factorization would not be unique, as, for example, 2 = 2×1 = 2×1×1 = ...

History

Book VII, propositions 30, 31 and 32, and Book IX, proposition 14 of Euclid's Elements are essentially the statement and proof of the fundamental theorem.

If two numbers by multiplying one another make some number, and any prime number measure the product, it will also measure one of the original numbers.

— Euclid, Elements Book VII, Proposition 30

Proposition 30 is referred to as Euclid's lemma. And it is the key in the proof of the fundamental theorem of arithmetic.

Any composite number is measured by some prime number.

— Euclid, Elements Book VII, Proposition 31

Proposition 31 is proved directly by infinite descent.

Any number either is prime or is measured by some prime number.

— Euclid, Elements Book VII, Proposition 32

Proposition 32 is derived from proposition 31, and prove that the decomposition is possible.

If a number be the least that is measured by prime numbers, it will not be measured by any other prime number except those originally measuring it.

— Euclid, Elements Book IX, Proposition 14

Book IX, proposition 14 is derived from Book VII, proposition 30, and prove partially that the decomposition is unique – a point critically noted by André Weil.^[7] Indeed, in this proposition the exponents are all equal to one, so nothing is said for the general case.

Article 16 of Gauss' Disquisitiones Arithmeticae is an early modern statement and proof employing modular arithmetic.^[1]

Applications

Canonical representation of a positive integer

Every positive integer n > 1 can be represented in exactly one way as a product of prime powers:

$n=p_{1}^{\alpha _{1}}p_{2}^{\alpha _{2}}\cdots p_{k}^{\alpha _{k}}=\prod _{i=1}^{k}p_{i}^{\alpha _{i}}$

where p₁ < p₂ < ... < p_k are primes and the α_i are positive integers. This representation is commonly extended to all positive integers, including one, by the convention that the empty product is equal to 1 (the empty product corresponds to k = 0).

This representation is called the canonical representation^[8] of n, or the standard form^[9][10] of n.

For example 999 = 3³×37, 1000 = 2³×5³, 1001 = 7×11×13

Note that factors p⁰ = 1 may be inserted without changing the value of n (e.g. 1000 = 2³×3⁰×5³).
In fact, any positive integer can be uniquely represented as an infinite product taken over all the positive prime numbers,

$n=2^{n_{1}}3^{n_{2}}5^{n_{3}}7^{n_{4}}\cdots =\prod p_{i}^{n_{i}},$

where a finite number of the n_i are positive integers, and the rest are zero. Allowing negative exponents provides a canonical form for positive rational numbers.

Arithmetic operations

The canonical representation, when it is known, is convenient for easily computing products, gcd, and lcm:

$a\cdot b=2^{a_{2}+b_{2}}\,3^{a_{3}+b_{3}}\,5^{a_{5}+b_{5}}\,7^{a_{7}+b_{7}}\cdots =\prod p_{i}^{a_{p_{i}}+b_{p_{i}}},$

$\gcd(a,b)=2^{\min(a_{2},b_{2})}\,3^{\min(a_{3},b_{3})}\,5^{\min(a_{5},b_{5})}\,7^{\min(a_{7},b_{7})}\cdots =\prod p_{i}^{\min(a_{p_{i}},b_{p_{i}})},$

$\operatorname {lcm} (a,b)=2^{\max(a_{2},b_{2})}\,3^{\max(a_{3},b_{3})}\,5^{\max(a_{5},b_{5})}\,7^{\max(a_{7},b_{7})}\cdots =\prod p_{i}^{\max(a_{p_{i}},b_{p_{i}})}.$

However, as Integer factorization of large integers is much harder than computing their product, gcd or lcm, these formulas have, in practice, a limited usage.

Arithmetical functions

Many arithmetical functions are defined using the canonical representation. In particular, the values of additive and multiplicative functions are determined by their values on the powers of prime numbers.

Proof

The proof uses Euclid's lemma (Elements VII, 30): if a prime p divides the product of two natural numbers a and b, then p divides a or p divides b.

Existence

We need to show that every integer greater than 1 is either prime or a product of primes. For the base case, note that 2 is prime. By induction: assume true for all numbers between 1 and n. If n is prime, there is nothing more to prove. Otherwise, there are integers a and b, where n = ab and 1 < a ≤ b < n. By the induction hypothesis, a = p₁p₂...p_j and b = q₁q₂...q_k are products of primes. But then n = ab = p₁p₂...p_jq₁q₂...q_k is a product of primes.

Uniqueness

Assume that s > 1 is the product of prime numbers in two different ways:

${\begin{aligned}s&=p_{1}p_{2}\cdots p_{m}\\&=q_{1}q_{2}\cdots q_{n}.\end{aligned}}$

We must show m = n and that the q_j are a rearrangement of the p_i.

By Euclid's lemma, p₁ must divide one of the q_j; relabeling the q_j if necessary, say that p₁ divides q₁. But q₁ is prime, so its only divisors are itself and 1. Therefore, p₁ = q₁, so that

${\begin{aligned}{\frac {s}{p_{1}}}&=p_{2}\cdots p_{m}\\&=q_{2}\cdots q_{n}.\end{aligned}}$

Reasoning the same way, p₂ must equal one of the remaining q_j. Relabeling again if necessary, say p₂ = q₂. Then

${\begin{aligned}{\frac {s}{p_{1}p_{2}}}&=p_{3}\cdots p_{m}\\&=q_{3}\cdots q_{n}.\end{aligned}}$

This can be done for each of the m p_i's, showing that m ≤ n and every p_i is a q_j. Applying the same argument with the $p$'s and $q$'s reversed shows n ≤ m (hence m = n) and every q_j is a p_i.

Elementary proof of uniqueness

The fundamental theorem of arithmetic can also be proved without using Euclid's lemma, as follows:

Assume that s > 1 is the smallest positive integer which is the product of prime numbers in two different ways. If s were prime then it would factor uniquely as itself, so there must be at least two primes in each factorization of s:

${\begin{aligned}s&=p_{1}p_{2}\cdots p_{m}\\&=q_{1}q_{2}\cdots q_{n}.\end{aligned}}$

If any p_i = q_j then, by cancellation, s/p_i = s/q_j would be another positive integer, different from s, which is greater than 1 and also has two distinct factorizations. But s/p_i is smaller than s, meaning s would not actually be the smallest such integer. Therefore every p_i must be distinct from every q_j.

Without loss of generality, take p₁ < q₁ (if this is not already the case, switch the p and q designations.) Consider

$t=(q_{1}-p_{1})(q_{2}\cdots q_{n}),$

and note that 1 < q₂ ≤ t < s. Therefore t must have a unique prime factorization. By rearrangement we see,

${\begin{aligned}t&=q_{1}(q_{2}\cdots q_{n})-p_{1}(q_{2}\cdots q_{n})\\&=s-p_{1}(q_{2}\cdots q_{n})\\&=p_{1}((p_{2}\cdots p_{m})-(q_{2}\cdots q_{n})).\end{aligned}}$

Here u = ((p₂ ... p_m) - (q₂ ... q_n)) is positive, for if it were negative or zero then so would be its product with p₁, but that product equals t which is positive. So u is either 1 or factors into primes. In either case, t = p₁u yields a prime factorization of t, which we know to be unique, so p₁ appears in the prime factorization of t.

If (q₁ - p₁) equaled 1 then the prime factorization of t would be all q's, which would preclude p₁ from appearing. Thus (q₁ - p₁) is not 1, but is positive, so it factors into primes: (q₁ - p₁) = (r₁ ... r_h). This yields a prime factorization of

$t=(r_{1}\cdots r_{h})(q_{2}\cdots q_{n}),$

which we know is unique. Now, p₁ appears in the prime factorization of t, and it is not equal to any q, so it must be one of the r's. That means p₁ is a factor of (q₁ - p₁), so there exists a positive integer k such that p₁k = (q₁ - p₁), and therefore

$p_{1}(k+1)=q_{1}.$

But that means q₁ has a proper factorization, so it is not a prime number. This contradiction shows that s does not actually have two different prime factorizations. As a result, there is no smallest positive integer with multiple prime factorizations, hence all positive integers greater than 1 factor uniquely into primes.

Generalizations

The first generalization of the theorem is found in Gauss's second monograph (1832) on biquadratic reciprocity. This paper introduced what is now called the ring of Gaussian integers, the set of all complex numbers a + bi where a and b are integers. It is now denoted by $\mathbb {Z} [i].$ He showed that this ring has the four units ±1 and ±i, that the non-zero, non-unit numbers fall into two classes, primes and composites, and that (except for order), the composites have unique factorization as a product of primes.^[11]

Similarly, in 1844 while working on cubic reciprocity, Eisenstein introduced the ring $\mathbb {Z} [\omega ]$, where $\omega ={\frac {-1+{\sqrt {-3}}}{2}},$   $\omega ^{3}=1$ is a cube root of unity. This is the ring of Eisenstein integers, and he proved it has the six units $\pm 1,\pm \omega ,\pm \omega ^{2}$ and that it has unique factorization.

However, it was also discovered that unique factorization does not always hold. An example is given by $\mathbb {Z} [{\sqrt {-5}}]$. In this ring one has^[12]

${\displaystyle 6=2\cdot 3=(1+{\sqrt {-5}})(1-{\sqrt {-5}}).}$

Examples like this caused the notion of "prime" to be modified. In $\mathbb {Z} [{\sqrt {-5}}]$ it can be proven that if any of the factors above can be represented as a product, e.g. 2 = ab, then one of a or b must be a unit. This is the traditional definition of "prime". It can also be proven that none of these factors obeys Euclid's lemma; e.g. 2 divides neither (1 + √−5) nor (1 − √−5) even though it divides their product 6. In algebraic number theory 2 is called irreducible in $\mathbb {Z} [{\sqrt {-5}}]$ (only divisible by itself or a unit) but not prime in $\mathbb {Z} [{\sqrt {-5}}]$ (if it divides a product it must divide one of the factors). The mention of $\mathbb {Z} [{\sqrt {-5}}]$ is required because 2 is prime and irreducible in $\mathbb {Z} .$ Using these definitions it can be proven that in any ring a prime must be irreducible. Euclid's classical lemma can be rephrased as "in the ring of integers $\mathbb {Z}$ every irreducible is prime". This is also true in $\mathbb {Z} [i]$ and $\mathbb {Z} [\omega ],$ but not in $\mathbb {Z} [{\sqrt {-5}}].$

The rings in which factorization into irreducibles is essentially unique are called unique factorization domains. Important examples are polynomial rings over the integers or over a field, Euclidean domains and principal ideal domains.

In 1843 Kummer introduced the concept of ideal number, which was developed further by Dedekind (1876) into the modern theory of ideals, special subsets of rings. Multiplication is defined for ideals, and the rings in which they have unique factorization are called Dedekind domains.

There is a version of unique factorization for ordinals, though it requires some additional conditions to ensure uniqueness.

See also

• Euler product formula
• Integer factorization
• Noetherian ring
• Prime signature

Notes

1. Gauss & Clarke (1986, Art. 16)
2. Gauss & Clarke (1986, Art. 131)
3. Using the empty product rule one need not exclude the number 1, and the theorem can be stated as: every positive integer has unique prime factorization.
4. Long (1972, p. 44)
5. Pettofrezzo & Byrkit (1970, p. 53)
6. Hardy & Wright (2008, Thm 2)
7. Weil (2007, p. 5): "Even in Euclid, we fail to find a general statement about the uniqueness of the factorization of an integer into primes; surely he may have been aware of it, but all he has is a statement (Eucl.IX.I4) about the l.c.m. of any number of given primes."
8. Long (1972, p. 45)
9. Pettofrezzo & Byrkit (1970, p. 55)
10. Hardy & Wright (2008, § 1.2)
11. Gauss, BQ, §§ 31–34
12. Hardy & Wright (2008, § 14.6)

References

The Disquisitiones Arithmeticae has been translated from Latin into English and German. The German edition includes all of his papers on number theory: all the proofs of quadratic reciprocity, the determination of the sign of the Gauss sum, the investigations into biquadratic reciprocity, and unpublished notes.

• Gauss, Carl Friedrich; Clarke, Arthur A. (translator into English) (1986), Disquisitiones Arithemeticae (Second, corrected edition), New York: Springer, ISBN 978-0-387-96254-2
• Gauss, Carl Friedrich; Maser, H. (translator into German) (1965), Untersuchungen über hohere Arithmetik (Disquisitiones Arithemeticae & other papers on number theory) (Second edition), New York: Chelsea, ISBN 0-8284-0191-8

The two monographs Gauss published on biquadratic reciprocity have consecutively numbered sections: the first contains §§ 1–23 and the second §§ 24–76. Footnotes referencing these are of the form "Gauss, BQ, § n". Footnotes referencing the Disquisitiones Arithmeticae are of the form "Gauss, DA, Art. n".

• Gauss, Carl Friedrich (1828), Theoria residuorum biquadraticorum, Commentatio prima, Göttingen: Comment. Soc. regiae sci, Göttingen 6
• Gauss, Carl Friedrich (1832), Theoria residuorum biquadraticorum, Commentatio secunda, Göttingen: Comment. Soc. regiae sci, Göttingen 7

These are in Gauss's Werke, Vol II, pp. 65–92 and 93–148; German translations are pp. 511–533 and 534–586 of the German edition of the Disquisitiones.

• Baker, Alan (1984), A Concise Introduction to the Theory of Numbers, Cambridge, UK: Cambridge University Press, ISBN 978-0-521-28654-1
• Euclid (1956), The thirteen books of the Elements, 2 (Books III-IX), Translated by Thomas Little Heath (Second Edition Unabridged ed.), New York: Dover, ISBN 978-0-486-60089-5
• Hardy, G. H.; Wright, E. M. (2008) [1938]. An Introduction to the Theory of Numbers. Revised by D. R. Heath-Brown and J. H. Silverman. Foreword by Andrew Wiles. (6th ed.). Oxford: Oxford University Press. ISBN 978-0-19-921986-5. MR 2445243. Zbl 1159.11001.
• A. Kornilowicz; P. Rudnicki (2004), "Fundamental theorem of arithmetic", Formalized Mathematics, 12 (2): 179–185
• Long, Calvin T. (1972), Elementary Introduction to Number Theory (2nd ed.), Lexington: D. C. Heath and Company, LCCN 77-171950.
• Pettofrezzo, Anthony J.; Byrkit, Donald R. (1970), Elements of Number Theory, Englewood Cliffs: Prentice Hall, LCCN 77-81766.
• Riesel, Hans (1994), Prime Numbers and Computer Methods for Factorization (second edition), Boston: Birkhäuser, ISBN 0-8176-3743-5
• Weil, André (2007) [1984]. Number Theory: An Approach through History from Hammurapi to Legendre. Modern Birkhäuser Classics. Boston, MA: Birkhäuser. ISBN 978-0-817-64565-6.
• Weisstein, Eric W. "Abnormal number". MathWorld.

• Weisstein, Eric W. "Fundamental Theorem of Arithmetic". MathWorld.

External links

• Why isn’t the fundamental theorem of arithmetic obvious?
• GCD and the Fundamental Theorem of Arithmetic at cut-the-knot.
• PlanetMath: Proof of fundamental theorem of arithmetic
• Fermat's Last Theorem Blog: Unique Factorization, a blog that covers the history of Fermat's Last Theorem from Diophantus of Alexandria to the proof by Andrew Wiles.
• "Fundamental Theorem of Arithmetic" by Hector Zenil, Wolfram Demonstrations Project, 2007.
• Grime, James. "1 and Prime Numbers". Numberphile. Brady Haran.