# fundamental theorem of arithmetic, proof of the

To prove the fundamental theorem of arithmetic  , we must show that each positive integer has a prime decomposition and that each such decomposition is unique up to the order (http://planetmath.org/OrderingRelation) of the factors. Before proceeding with the proof, we note that in any integral domain  , every prime is an irreducible element  . Furthermore, by Euclid’s lemma, every irreducible element in $\mathbb{Z}$ is prime. As a result, prime elements  and irreducible elements are equivalent     in $\mathbb{Z}$. We will use this fact to prove the theorem.

Existence

Now we prove the existence of a prime decomposition. Since 1 has a prime decomposition and any prime has a prime decomposition, it suffices to show that any composite number  has a prime decomposition. We claim that any composite number is divisible by some prime number  . To see this, assume n is a composite positive integer. Then there exist positive integers a and b, necessarily strictly smaller than n, such that n = ab. If a is not prime we can write it as a product  of smaller positive integers in the same way. Continuing this process, we obtain a strictly decreasing sequence  of natural numbers. By the well-ordering principle, this sequence must terminate, and by construction, it must terminate in a prime number. Hence n is divisible by a prime number, as desired.

To complete      the proof of existence, we apply the well-ordering principle again. If n is composite, then it is divisible by some prime. Moreover, the quotient is strictly smaller than n. If the quotient is not prime then as before we find a prime that divides it; continuing this process, we produce a strictly decreasing sequence of natural numbers. By the well-ordering principle, this sequence terminates in a prime number. The product of the prime numbers we found in the construction of this sequence is simply n. Thus every composite number has a prime decomposition.

Uniqueness

Now we show uniqueness up to order of factors. Suppose we are given two prime decompositions

 $n=p_{1}\cdots p_{k}=q_{1}\cdots q_{\ell}$

of n, where $k\leq\ell$ and the factors in each prime decomposition are arranged in nondecreasing order. Since $p_{1}$ divides n, it divides the product $q_{1}\cdots q_{\ell}$, so by primality must divide some $q_{i}$. Thus there is a natural number b such that $q_{i}=b\cdot p_{1}$. Since $q_{i}$ is an irreducible element and $p_{1}$ is not a unit, it must be that b is a unit, that is, b = 1. Hence $p_{1}=q_{i}\geq q_{1}$. Similarly, there is some j such that $q_{1}=p_{j}\geq p_{1}$. Since $p_{1}\geq q_{1}$ and $q_{1}\geq p_{1}$, it follows that $p_{1}=q_{1}$. Cancelling these factors yields the simpler equation

 $p_{2}\cdots p_{k}=q_{2}\cdots q_{\ell}.$

By repeating the above procedure we can show that $p_{i}=q_{i}$ for all i from 0 to k. Cancelling these factors gives the equation

 $1=q_{k+1}\cdots q_{\ell}.$

Since a nontrivial product of primes is greater than 1, the right-hand side of this equation is the empty product. We conclude that k = l. Hence all prime decompositions of n use the same number of factors, and the factors which appear are unique up to the order in which they appear. This completes the proof of uniqueness and thereby the proof of the theorem.

Remark. Note that Euclid’s Lemma is necessary in order to prove the uniqueness portion of the theorem. Also, an alternative way of proving the existence portion of the theorem is to use induction  : if $n$ is composite, then $n=ab$ for some integers $a,b (this is true, for if one of $a,b$ is $n$, then the other integer must be $1$). By induction, both $a$ and $b$ can be written as product of primes, which implies that $n$ is a product of primes.

Title fundamental theorem of arithmetic, proof of the FundamentalTheoremOfArithmeticProofOfThe 2013-03-22 11:48:00 2013-03-22 11:48:00 mps (409) mps (409) 16 mps (409) Proof msc 11-00 msc 16U99 msc 13A99