In number theory, Euclid's lemma is a lemma that captures a fundamental property ofprime numbers, namely: For example, if,,, then, and since this is divisible by 19, the lemma implies that one or both of 133 or 143 must be as well. In fact,. Inherently, if the premise of the lemma does not hold, i.e., is a composite number, its consequent may be either true or false. For example, in the case of,,, composite number 10 divides, but 10 divides neither 4 nor 15. This property is the key in the proof of the fundamental theorem of arithmetic. It is used to define prime elements, a generalization of prime numbers to arbitrary commutative rings. Euclid's Lemma shows that in the integers irreducible elements are also prime elements. The proof uses induction so it does not apply to all integral domains.
Formulations
Let be a prime number, and assume divides the product of two integers and. Then or . Equivalent statements are:
If and, then.
If and, then.
Euclid's lemma can be generalized from prime numbers to any integers: This is a generalization because if is prime, either
The lemma first appears as proposition 30 in Book VII of Euclid's Elements. It is included in practically every book that covers elementary number theory. The generalization of the lemma to integers appeared in Jean Prestet's textbook Nouveaux Elémens de Mathématiques in 1681. In Carl Friedrich Gauss's treatise Disquisitiones Arithmeticae, the statement of the lemma is Euclid's Proposition 14, which he uses to prove the uniqueness of the decomposition product of prime factors of an integer, admitting the existence as "obvious." From this existence and uniqueness he then deduces the generalization of prime numbers to integers. For this reason, the generalization of Euclid's lemma is sometimes referred to as Gauss's lemma, but some believe this usage is incorrect due to confusion with Gauss's lemma on quadratic residues.
The usual proof involves another lemma called Bézout's identity. This states that if and are relatively prime integersthere exist integers and such that Let and be relatively prime, and assume that. By Bézout's identity, there are and making Multiply both sides by : The first term on the left is divisible by, and the second term is divisible by, which by hypothesis is divisible by. Therefore their sum,, is also divisible by. This is the generalization of Euclid's lemma mentioned above.
Proof of Elements
Euclid's lemma is proved at the Proposition 30 in Book VII of Euclid's Elements. The original proof is difficult to understand as is, so we quote the commentary from. ;Proposition 19 ;Proposition 20 ;Proposition 21 ;Proposition 29 ;Proposition 30 ;Proof of 30
