An element of an integral domain is an irreducible element when it is nonzero and not a unit, and any factorization has at least one unit factor. The exclusions of zero and units are part of the definition.
An element is a prime element when it is nonzero and not a unit, and implies or . If and is a prime element, assume for example . Cancellation in gives , so is a unit. This proves every prime element is an irreducible element.
In a Euclidean domain, each nonzero ideal has a generator of least Euclidean value: division of another member by that generator leaves a remainder in the ideal of smaller value, so the remainder must vanish. Let be an irreducible element and suppose but . Write . Since , irreducibility says is a unit or is associate to . The second case would give , so is a unit. Hence for some . Multiplying by shows . Thus irreducibles in a Euclidean domain are prime.
For , use the multiplicative integer field norm . Units have field norm one and are exactly . If were a product of nonunits, their norms would be integers greater than one multiplying to four, hence both would have field norm two. But has no integer solution: makes the left side at least seven, and would give . Therefore 2 is an irreducible element.
On the other hand,is divisible by 2, while neither factor is, because divisibility by 2 requires both integer coefficients to be even. Thus 2 is not a prime element in this ring. It is also not a prime element in : , but . In fact is already a nontrivial factorization there.
Articles by others on the same topic
There are currently no matching articles.