All books

Professional

Apps About Coach Log in Start reading

Mathematics · Glossary

What is associate elements?

Also known as: irreducible element · prime element

Definition 2.11 University Mathematics — Year 3 · Chapter 2 — Rings and Arithmetic

Let AA be an integral domain, a,b∈Aa, b \in A. We say aa divides bb (a∣ba \mid b) if b∈(a)=aAb \in (a) = aA. Elements a,ba, b are associates if a=uba = ub with u∈A×u \in A^\times (equivalently (a)=(b)(a) = (b)). A nonzero nonunit pp is:

  • irreducible if p=abp = ab forces a∈A×a \in A^\times or b∈A×b \in A^\times;
  • prime if p∣abp \mid ab forces p∣ap \mid a or p∣bp \mid b (i.e. the ideal (p)(p) is prime).

Examples

Example 2.20 (A ring without unique factorization)

None of the implications Euclidean ⇒\Rightarrow PID ⇒\Rightarrow 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,A = \Z[\iu\sqrt5] = \{a + \iu b\sqrt5 : a, b \in \Z\}, \qquad N(a + \iu b\sqrt5) = a^2 + 5b^2,

the norm is multiplicative and N(z)=1N(z) = 1 iff z∈A×={±1}z \in A^\times = \{\pm1\}. Consider

6=2⋅3=(1+i5)(1−i5).6 = 2 \cdot 3 = (1 + \iu\sqrt5)(1 - \iu\sqrt5).

All four factors are irreducible: their norms are 4,9,6,64, 9, 6, 6, and a proper factorization z=z1z2z = z_1z_2 would force N(z1)∈{2,3}N(z_1) \in \{2, 3\} — but a2+5b2a^2 + 5b^2 never equals 22 or 33 (b=0b = 0 leaves the non-squares 2,32, 3; ∣b∣≥1\abs b \geq 1 gives ≥5\geq 5). Yet 22 is associate to neither 1±i51 \pm \iu\sqrt5 (norms 4≠64 \neq 6): two genuinely different factorizations of 66 into irreducibles. Equivalently, irreducible ≠\neq prime here: 22 divides the product (1+i5)(1−i5)=6(1 + \iu\sqrt5)(1 - \iu\sqrt5) = 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\Z, K[X]K[X], Z[i]\Z[\iu] of this chapter really are.

Example 2.26

Xn−pX^n - p is irreducible over Q\Q for every prime pp and n≥1n \geq 1 (Eisenstein at pp): there are irreducible polynomials of every degree over Q\Q — in stark contrast with C\C (degree 11, d’Alembert–Gauss, proved in Chapter 16) and R\R (degrees 1,21, 2). The trick of shifting enlarges Eisenstein’s reach: the pp-th cyclotomic polynomial Φp=Xp−1+⋯+X+1=Xp−1X−1\Phi_p = X^{p-1} + \dots + X + 1 = \frac{X^p - 1}{X - 1} has

Φp(X+1)=(X+1)p−1X=Xp−1+(p1)Xp−2+⋯+(pp−1),\Phi_p(X + 1) = \frac{(X+1)^p - 1}{X} = X^{p-1} + \binom{p}{1}X^{p-2} + \dots + \binom{p}{p-1},

Eisenstein at pp (p∣(pk)p \mid \binom pk for 0<k<p0 < k < p, and (pp−1)=p≢0 mod p2\binom{p}{p-1} = p \not\equiv 0 \bmod p^2): Φp(X+1)\Phi_p(X+1), hence Φp\Phi_p, is irreducible over Q\Q. This is the algebraic heart of the 1717-gon story told in Chapter 4.

Read in context →