A unique factorization domain (UFD) is an RR such that:

  1. every nonzero nonunit is a finite product of ; and
  2. any two such factorizations differ only by reordering the factors and replacing factors by .
Remarks

In a UFD, every is . If RR is a UFD, then R[x]R[x] is a UFD; by iteration, so is R[x1,,xn]R[x_1,\dots,x_n].

Examples
  • Z\mathbb{Z} is a UFD.
  • If kk is a field, then k[x,y]k[x,y] is a UFD.
  • Z[5]\mathbb{Z}[\sqrt{-5}] is not a UFD (e.g. 66 has essentially different factorizations).