Fundamental theorem of arithmetic
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 either is a prime number itself or can be represented as the product of prime numbers and that, moreover, this representation is unique, up to (except for) the order of the factors. For example,
- 1200 = 24 × 31 × 52 = 2 × 2 × 2 × 2 × 3 × 5 × 5 = 5 × 2 × 5 × 2 × 3 × 2 × 2 = ...
The theorem says two things for this example: first, that 1200 can be represented as a product of primes, and second, that no matter how this is done, there will always be exactly 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, then factorization into primes would not be unique; for example, 2 = 2 × 1 = 2 × 1 × 1 = ...
Euclid's original versionEdit
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
(In modern terminology: if a prime p divides the product ab, then p divides either a or b or both.) 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
(In modern terminology: every integer greater than one is divided evenly by some prime number.) 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 proves 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
(In modern terminology: a least common multiple of several prime numbers is not a multiple of any other prime number.) Book IX, proposition 14 is derived from Book VII, proposition 30, and proves partially that the decomposition is unique – a point critically noted by André Weil. Indeed, in this proposition the exponents are all equal to one, so nothing is said for the general case.
Canonical representation of a positive integerEdit
Every positive integer n > 1 can be represented in exactly one way as a product of prime powers:
where p1 < p2 < ... < pk are primes and the ni are positive integers. This representation is commonly extended to all positive integers, including 1, by the convention that the empty product is equal to 1 (the empty product corresponds to k = 0).
- 999 = 33×37,
- 1000 = 23×53,
- 1001 = 7×11×13.
Factors p0 = 1 may be inserted without changing the value of n (e.g., 1000 = 23×30×53). In fact, any positive integer can be uniquely represented as an infinite product taken over all the positive prime numbers:
where a finite number of the ni are positive integers, and the rest are zero. Allowing negative exponents provides a canonical form for positive rational numbers.
The canonical representations of the product, greatest common divisor (GCD), and least common multiple (LCM) of two numbers a and b can be expressed simply in terms of the canonical representations of a and b themselves:
However, integer factorization, especially of large numbers, is much more difficult than computing products, GCDs, or LCMs. So these formulas have limited use in practice.
Many arithmetic 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.
It must be shown that every integer greater than 1 is either prime or a product of primes. First, 2 is prime. Then, by strong induction, assume this is true for all numbers greater than 1 and less than 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 = p1p2...pj and b = q1q2...qk are products of primes. But then n = ab = p1p2...pjq1q2...qk is a product of primes.
Suppose, to the contrary, there is an integer that has two distinct prime factorizations. Let n be the least such integer and write n = p1 p2 ... pj = q1 q2 ... qk, where each pi and qi is prime. (Note j and k are both at least 2.) We see p1 divides q1 q2 ... qk, so p1 divides some qi by Euclid's lemma. Without loss of generality, say p1 divides q1. Since p1 and q1 are both prime, it follows that p1 = q1. Returning to our factorizations of n, we may cancel these two terms to conclude p2 ... pj = q2 ... qk. We now have two distinct prime factorizations of some integer strictly smaller than n, which contradicts the minimality of n.
Elementary proof of uniquenessEdit
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 s is not prime and there must be at least two primes in each factorization of s:
If any pi = qj then, by cancellation, s/pi = s/qj would be another positive integer, different from s, which is greater than 1 and also has two distinct factorizations. But s/pi is smaller than s, meaning s would not actually be the smallest such integer. Therefore every pi must be distinct from every qj.
Without loss of generality, take p1 < q1 (if this is not already the case, switch the p and q designations.) Consider
and note that 1 < q2 ≤ t < s. Therefore t must have a unique prime factorization. By rearrangement we see,
Here u = ((p2 ... pm) - (q2 ... qn)) is positive, for if it were negative or zero then so would be its product with p1, but that product equals t which is positive. So u is either 1 or factors into primes. In either case, t = p1u yields a prime factorization of t, which we know to be unique, so p1 appears in the prime factorization of t.
If (q1 - p1) equaled 1 then the prime factorization of t would be all q's, which would preclude p1 from appearing. Thus (q1 - p1) is not 1, but is positive, so it factors into primes: (q1 - p1) = (r1 ... rh). This yields a prime factorization of
which we know is unique. Now, p1 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 p1 is a factor of (q1 - p1), so there exists a positive integer k such that p1k = (q1 - p1), and therefore
But that means q1 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.
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 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.
Similarly, in 1844 while working on cubic reciprocity, Eisenstein introduced the ring , where is a cube root of unity. This is the ring of Eisenstein integers, and he proved it has the six units and that it has unique factorization.
However, it was also discovered that unique factorization does not always hold. An example is given by . In this ring one has
Examples like this caused the notion of "prime" to be modified. In 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 + √) nor (1 − √) even though it divides their product 6. In algebraic number theory 2 is called irreducible in (only divisible by itself or a unit) but not prime in (if it divides a product it must divide one of the factors). The mention of is required because 2 is prime and irreducible in Using these definitions it can be proven that in any integral domain a prime must be irreducible. Euclid's classical lemma can be rephrased as "in the ring of integers every irreducible is prime". This is also true in and but not in
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.
- Gauss & Clarke (1986, Art. 16)
- Gauss & Clarke (1986, Art. 131)
- 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.
- Long (1972, p. 44)
- Pettofrezzo & Byrkit (1970, p. 53)
- Hardy & Wright (2008, Thm 2) harvtxt error: no target: CITEREFHardyWright2008 (help)
- 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."
- Long (1972, p. 45)
- Pettofrezzo & Byrkit (1970, p. 55)
- Hardy & Wright (2008, § 1.2) harvtxt error: no target: CITEREFHardyWright2008 (help)
- Gauss, BQ, §§ 31–34
- Hardy & Wright (2008, § 14.6) harvtxt error: no target: CITEREFHardyWright2008 (help)
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) . 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) . Number Theory: An Approach through History from Hammurapi to Legendre. Modern Birkhäuser Classics. Boston, MA: Birkhäuser. ISBN 978-0-817-64565-6.CS1 maint: ref=harv (link)
- Weisstein, Eric W. "Abnormal number". MathWorld.
- Weisstein, Eric W. "Fundamental Theorem of Arithmetic". MathWorld.
- 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.