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

  1. Every nonzero nonunit element can be written as a finite product of , and
  2. This factorization is unique up to reordering and replacing factors by .
Remarks

In a UFD, irreducible and elements coincide, which makes divisibility behave like the integers. Many polynomial rings over UFDs are again UFDs, enabling “induction on variables” arguments in commutative algebra.

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).