Skip to content

Euclidean Domains, PIDs, and UFDs

11.1 Euclidean Domains

An integral domain RR is a Euclidean domain if there exists a function δ:R{0}N0\delta : R \setminus \{0\} \to \mathbb{N}_0 such that for all a,bRa, b \in R with b0b \neq 0:

  1. There exist q,rRq, r \in R with a=bq+ra = bq + r and either r=0r = 0 or δ(r)<δ(b)\delta(r) \lt \delta(b).

Example. Z\mathbb{Z} is a Euclidean domain with δ(a)=a\delta(a) = |a|.

Example. F[x]F[x] is a Euclidean domain with δ(f)=deg(f)\delta(f) = \deg(f).

Example. Z[i]\mathbb{Z}[i] is a Euclidean domain with δ(a+bi)=a2+b2\delta(a + bi) = a^2 + b^2.

11.2 Principal Ideal Domains

An integral domain RR is a principal ideal domain (PID) if every ideal of RR is principal (generated by a single element).

Theorem 11.1. Every Euclidean domain is a PID.

Proof. Let II be a non-zero ideal of the Euclidean domain RR. Choose dI{0}d \in I \setminus \{0\} Minimising δ(d)\delta(d). We claim I=(d)I = (d). For any aIa \in IWrite a=qd+ra = qd + r with r=0r = 0 or δ(r)<δ(d)\delta(r) \lt \delta(d). Since r=aqdIr = a - qd \in IMinimality of δ(d)\delta(d) Forces r=0r = 0So a=qd(d)a = qd \in (d). \blacksquare

Corollary 11.2. Z\mathbb{Z}, F[x]F[x]And Z[i]\mathbb{Z}[i] are PIDs.

11.3 Unique Factorization Domains

An integral domain RR is a unique factorization domain (UFD) if:

  1. Every non-zero, non-unit element factors into irreducibles.
  2. The factorization is unique up to ordering and associates.

Theorem 11.3. Every PID is a UFD.

The chain of implications is:

Euclidean domainPIDUFD\mathrm{Euclidean\ domain} \Rightarrow \mathrm{PID} \Rightarrow \mathrm{UFD}

None of the reverse implications hold .

Example. Z[x]\mathbb{Z}[x] is a UFD but not a PID. (The ideal (2,x)(2, x) is not principal.)

Example. Z[5]\mathbb{Z}[\sqrt{-5}] is not a UFD: 6=23=(1+5)(15)6 = 2 \cdot 3 = (1 + \sqrt{-5})(1 - \sqrt{-5}) Gives two distinct factorizations into irreducibles.

Problem. Show that Z[5]\mathbb{Z}[\sqrt{-5}] is not a UFD.

Solution

Solution. We show that 2,3,1+5,152, 3, 1 + \sqrt{-5}, 1 - \sqrt{-5} are all irreducible in Z[5]\mathbb{Z}[\sqrt{-5}] and that 2,32, 3 are not associates of 1±51 \pm \sqrt{-5}.

The norm is N(a+b5)=a2+5b2N(a + b\sqrt{-5}) = a^2 + 5b^2. Note N(αβ)=N(α)N(β)N(\alpha\beta) = N(\alpha)N(\beta) and α\alpha is a unit iff N(α)=1N(\alpha) = 1.

N(2)=4N(2) = 4. If 2=αβ2 = \alpha\beta with neither a unit, then N(α)N(β)=4N(\alpha)N(\beta) = 4So N(α)=N(β)=2N(\alpha) = N(\beta) = 2. But a2+5b2=2a^2 + 5b^2 = 2 has no integer solutions. So 22 is irreducible.

Similarly, N(3)=9N(3) = 9And a2+5b2=3a^2 + 5b^2 = 3 has no solutions, so 33 is irreducible.

N(1±5)=6N(1 \pm \sqrt{-5}) = 6. If 1+5=αβ1 + \sqrt{-5} = \alpha\beta with neither a unit, then N(α),N(β){2,3}N(\alpha), N(\beta) \in \{2, 3\}. But a2+5b2=2a^2 + 5b^2 = 2 and a2+5b2=3a^2 + 5b^2 = 3 have no solutions. So 1±51 \pm \sqrt{-5} are irreducible.

Now 23=6=(1+5)(15)2 \cdot 3 = 6 = (1 + \sqrt{-5})(1 - \sqrt{-5}) gives two distinct factorizations into Irreducibles (the factors are not associates since their norms are different: 4,94, 9 vs 6,66, 6). Therefore Z[5]\mathbb{Z}[\sqrt{-5}] is not a UFD. \blacksquare