A unique factorization domain (UFD) is an integral domain in which every nonzero element that is not invertible can be written as a product of irreducible elements, uniquely apart from the order of the factors and multiplication by invertible elements. The concept generalizes the fundamental theorem of arithmetic from the integers to more general rings. It is central to abstract algebra, number theory, and the study of polynomial rings.
Definition
Let be a commutative ring with identity and no zero divisors. Several notions are needed to state unique factorization precisely:
- A unit is an element with a multiplicative inverse in .
- Two elements are associates if for some unit .
- An irreducible element is a nonzero nonunit such that implies that at least one of is a unit.
The domain is a UFD if it satisfies two conditions.
Existence of factorization. Every nonzero nonunit has a factorization
where is a unit and each is irreducible.
Uniqueness of factorization. If
are two such factorizations, then , and the factors can be reordered so that each is associate to .
The qualification about units is essential. In , for example, the units are and , so does not constitute a failure of uniqueness.
Every field is a UFD under the standard definition: all its nonzero elements are units, so there are no nonzero nonunits requiring factorization. A unit can be regarded as a unit times an empty product of irreducibles. Zero is excluded from the factorization requirement.
Irreducible and prime elements
A prime element of an integral domain is a nonzero nonunit such that
This generalizes the divisibility property of a prime number. Every prime element in an integral domain is irreducible, but an irreducible element need not be prime.
The distinction gives a fundamental characterization:
An integral domain is a UFD if and only if every nonzero nonunit factors into irreducibles and every irreducible element is prime.
For the forward direction, suppose an irreducible divides . Comparing irreducible factorizations in an equation shows that must be associate to a factor of or of . Hence it divides one of them.
Conversely, suppose factorizations exist and irreducibles are prime. Given
the primality of implies that it divides some . Since is irreducible, the two are associates. Cancelling corresponding factors and repeating proves uniqueness.
The existence condition cannot simply be omitted: a domain may have no irreducible elements at all while still containing nonzero nonunits.
Basic examples
Integers and Gaussian integers
The ring is the standard example. Its irreducibles are the positive and negative rational primes, and its units are .
The Gaussian integers
also form a UFD. They admit a Euclidean division procedure using the norm
Factorization depends on the ring in which it is performed. For example, is prime in , but in ,
This does not violate unique factorization: it shows that an element irreducible in a smaller ring may become reducible in a larger one.
Polynomial rings
If is a field, the ring of polynomials in one variable is a UFD. Polynomial division makes it a Euclidean domain.
More generally, if is a UFD, then
is a UFD for every finite number of indeterminates. Thus
are all UFDs.
The irreducible factors need not be linear. Over , is irreducible, whereas over ,
Relationship with Euclidean and principal ideal domains
The standard implications are
A Euclidean domain supports division with remainder controlled by a suitable size function. The Euclidean algorithm then shows that each ideal is generated by a single element.
A principal ideal domain (PID) is an integral domain in which every ideal is principal. In a PID:
- The ascending chain condition on ideals ensures that every nonzero nonunit factors into irreducibles.
- If is irreducible, the ideal is maximal and hence prime, so is a prime element.
Together these establish unique factorization.
The converse implications do not hold in general. In particular, being a UFD does not mean that every ideal is principal. For a field , the ring is a UFD, but its ideal is not principal. Any generator would have to divide both and , and hence would have to be a unit; however, is a proper ideal.
Thus unique factorization is a condition about the multiplicative structure of elements, not a requirement that all ideals have single generators.
Gauss's lemma and polynomial factorization
The passage from to rests on Gauss's lemma.
For a nonzero polynomial over a UFD, its content is a greatest common divisor of its coefficients, defined up to multiplication by a unit. A polynomial is primitive if its content is a unit.
Gauss's lemma states that the product of two primitive polynomials is primitive. Consequently, for nonzero ,
where means “is associate to.”
Let be the field of fractions of . For a primitive polynomial of positive degree,
This bridges factorization over a ring and factorization over its fraction field. Since is a UFD, separating polynomial content from primitive factors establishes that is a UFD.
For example, a primitive polynomial in is reducible over precisely when it is reducible over . This makes it possible to transfer many polynomial factorization questions from rational coefficients to integer coefficients.
Greatest common divisors and divisibility
In a UFD, every pair of nonzero elements has a greatest common divisor and a least common multiple, each unique up to associates.
Choose representatives for the associate classes of irreducibles. If
where only finitely many exponents are nonzero, then
and
In particular,
Divisibility is determined by comparing exponents:
Nevertheless, a greatest common divisor need not be a linear combination of the original elements. In , the elements and have greatest common divisor , but there are no polynomials such that
as evaluation at shows. The familiar Bézout identity from the integers therefore does not hold in every UFD.
Failure of unique factorization
A classical counterexample is
In this domain,
The norm
is multiplicative. There are no elements of norm or . This implies that , , and are irreducible: a factorization of any of them into two nonunits would force factors of those impossible norms.
The only units are . The displayed factorizations therefore cannot be obtained from one another by reordering and multiplying factors by units.
This example also separates irreducibility from primality. Although is irreducible, it divides
without dividing either factor.
Further structural properties
Localization
A localization of a UFD is again a UFD, provided the multiplicative set being inverted does not contain zero. Inverting elements makes some formerly irreducible elements into units; the remaining irreducible factors still give unique factorization.
Examples include
and the Laurent polynomial ring
In the first, and become units. In the second, becomes a unit.
By contrast, an arbitrary subring or quotient of a UFD need not be a UFD. For example, the non-UFD is both a subring of the field and a quotient of the UFD .
Integral closure
Every UFD is an integrally closed domain: an element of its fraction field satisfying a monic polynomial with coefficients in the domain already belongs to the domain.
To see this, write such an element as , where and have no common irreducible factor. A monic equation of degree , after multiplication by , implies that . Unique factorization forces to be a unit.
The converse is false: integral closure alone does not ensure unique factorization.
Noetherianity and ideal factorization
Every Noetherian integral domain has factorization into irreducibles, but those factorizations need not be unique. Conversely, a UFD need not be Noetherian. The polynomial ring
in countably infinitely many indeterminates is a UFD, but it is not Noetherian, as shown by the strictly increasing chain
In a Dedekind domain, every nonzero proper ideal factors uniquely into prime ideals even when elements do not factor uniquely. Such a domain is a UFD exactly when it is a PID, equivalently when its ideal class group is trivial. Ideal factorization thus provides a replacement for element factorization in important rings arising in algebraic number theory.
Historical and mathematical significance
Unique factorization in the integers provided the model for the general theory. Carl Friedrich Gauss developed polynomial factorization methods and the arithmetic of Gaussian integers, both central examples of unique factorization beyond .
The study of Diophantine equations led to factorizations in larger rings of algebraic numbers, where uniqueness can fail. These failures helped motivate ideal-theoretic approaches to algebraic number theory.
In algebraic geometry, polynomial UFDs make irreducible factors central to the description of hypersurfaces. Unique factorization is also an important structural property of coordinate rings, but it does not by itself supply an efficient factorization algorithm. Existence and uniqueness of factors are algebraic statements; the computational cost of finding those factors is a separate question.