An integral domain in which every nonzero nonunit element factors into irreducible elements and this factorization is unique up to order and multiplication by units; commonly abbreviated UFD.

Principle

Unique factorization extends the fundamental theorem of arithmetic to general domains: elements decompose into atomic irreducibles and multiplicative ambiguity is confined to units and permutation.

Demonstration

Z is a UFD because every integer factors uniquely (up to sign and order) into prime integers; polynomial rings k[x1,...,xn] over a field are UFDs by Gauss's lemma and induction on the number of variables.

Misapplication

Assuming that unique factorization holds in every Noetherian domain or that irreducible = prime in general; there are Noetherian domains where irreducibles lack uniqueness or where primes and irreducibles differ.

Consequence

In a UFD, divisibility questions and gcd computations are well-behaved; prime and irreducible elements align in a way that simplifies arithmetic and ideal factorization into principal prime ideals when the domain is a PID.

Reversal

A domain failing unique factorization exhibits distinct nonassociate irreducible factorizations of the same element; such failure motivates study of class groups, factorization invariants, and nonunique arithmetic phenomena.

Boundary

UFD requires an integral domain setting; it neither implies principality of all ideals nor is it implied by Noetherianity alone; local properties may hold without global UFD status.

Semantic Tension

The terms 'irreducible' and 'prime' are close but distinct; casual transfer of integer-language intuition (primes = irreducibles) can mislead in rings where these notions separate, creating tension in factorization reasoning.

Synthesis

A UFD is an integral domain where atomic decomposition is canonical up to units and order: elements factor into irreducibles uniquely, providing a controlled multiplicative arithmetic analogous to the integers.