Also known as: irreducible element · prime element
Definition 2.11University Mathematics — Year 3 · Chapter 2 — Rings and Arithmetic
Let A be an integral domain, a,b∈A. We say adividesb (a∣b) if b∈(a)=aA. Elements a,b are associates if a=ub with u∈A× (equivalently (a)=(b)). A nonzero nonunit p is:
irreducible if p=ab forces a∈A× or b∈A×;
prime if p∣ab forces p∣a or p∣b (i.e. the ideal(p) is prime).
Examples
Example 2.20(A ring without unique factorization)
None of the implications Euclidean⇒PID⇒UFD is an equivalence, and the failure of the last is worth seeing once in complete detail. In
A=Z[i5]={a+ib5:a,b∈Z},N(a+ib5)=a2+5b2,
the norm is multiplicative and N(z)=1 iff z∈A×={±1}. Consider
6=2⋅3=(1+i5)(1−i5).
All four factors are irreducible: their norms are 4,9,6,6, and a proper factorization z=z1z2 would force N(z1)∈{2,3} — but a2+5b2 never equals 2 or 3 (b=0 leaves the non-squares 2,3; ∣b∣≥1 gives ≥5). Yet 2 is associate to neither 1±i5 (norms 4=6): two genuinely different factorizations of 6 into irreducibles. Equivalently, irreducible= prime here: 2 divides the product (1+i5)(1−i5)=6 but neither factor (norms again). The ideal-theoretic repair of this failure — factorizing ideals rather than elements — is the birth of algebraic number theory; at our level, the example calibrates how special the Euclidean rings Z, K[X], Z[i] of this chapter really are.
Example 2.26
Xn−p is irreducible over Q for every prime p and n≥1 (Eisenstein at p): there are irreducible polynomials of every degree over Q — in stark contrast with C (degree 1, d’Alembert–Gauss, proved in Chapter 16) and R (degrees 1,2). The trick of shifting enlarges Eisenstein’s reach: the p-th cyclotomic polynomialΦp=Xp−1+⋯+X+1=X−1Xp−1 has
Φp(X+1)=X(X+1)p−1=Xp−1+(1p)Xp−2+⋯+(p−1p),
Eisenstein at p (p∣(kp) for 0<k<p, and (p−1p)=p≡0modp2): Φp(X+1), hence Φp, is irreducible over Q. This is the algebraic heart of the 17-gon story told in Chapter 4.