- Unique factorization domain
In
mathematics , a unique factorization domain (UFD) is, roughly speaking, acommutative ring in which every element, with special exceptions, can be uniquely written as a product ofprime element s, analogous to thefundamental theorem of arithmetic for theinteger s. UFDs are sometimes called factorial rings, following the terminology of Bourbaki.A unique factorization domain is a specific type of integral domain, and can be characterized by the following (not necessarily exhaustive) chain of class inclusions:
*
integral domain s ⊃unique factorization domain s ⊃principal ideal domain s ⊃Euclidean domain s ⊃ fieldsDefinition
Formally, a unique factorization domain is defined to be an
integral domain "R" in which every non-zero non-unit "x" of "R" can be written as a product ofirreducible element s of "R"::"x" = "p"1 "p"2 ... "p""n"and this representation is unique in the following sense: if "q"1,...,"q""m" are irreducible elements of "R" such that:"x" = "q"1 "q"2 ... "q""m",
then "m" = "n" and there exists a bijective map φ : {1,...,"n"} -> {1,...,"m"} such that "p""i" is associated to "q"φ("i") for "i" = 1, ..., "n".
The uniqueness part is sometimes hard to verify, which is why the following equivalent definition is useful: a unique factorization domain is an integral domain "R" in which every non-zero non-unit can be written as a product of prime elements of "R".
Examples
Most rings familiar from elementary mathematics are UFDs:
* All
principal ideal domain s, hence allEuclidean domain s, are UFDs. In particular, theintegers (also seefundamental theorem of arithmetic ), theGaussian integer s and theEisenstein integer s are UFDs.
* Any field is trivially a UFD, since every non-zero element is a unit. Examples of fields includerational number s,real number s, andcomplex number s.
* If "R" is a UFD, then so is "R" ["x"] , the ring of polynomials with coefficients in "R". A special case of this, due to the above, is that the polynomial ring over any field is a UFD.Further examples of UFDs are:
* The
formal power series ring "K" "X"1,...,"X""n"over a field "K".
* The ring of functions in a fixed number of complex variables holomorphic at the origin is a UFD.
*By induction one can show that the polynomial rings Z ["X"1, ..., "X""n"] as well as "K" ["X"1, ..., "X""n"] ("K" a field) are UFDs. (Any polynomial ring with more than one variable is an example of a UFD that is not a principal ideal domain.)Counterexamples
*The ring of all complex numbers of the form , where "a" and "b" are integers. Then 6 factors as both (2)(3) and as . These truly are different factorizations, because the only units in this ring are 1 and −1; thus, none of 2, 3, , and are associate. It is not hard to show that all four factors are irreducible as well, though this may not be obvious. See also
algebraic integer .*Most factor rings of a polynomial ring are not UFDs. Here is an example:
:Let be any commutative ring. Then is not a UFD. The proof is in two parts.
:First we must show , , , and are all irreducible. Grade by degree. Assume for a contradiction that has a factorization into two non-zero non-units. Since it is degree one, the two factors must be a degree one element and a degree zero element . This gives . In , then, the degree one element must be an element of the ideal , but the non-zero elements of that ideal are degree two and higher. Consequently, must be zero in . That implies that , so is a unit, which is a contradiction. , , and are irreducible by the same argument.
:Next, the element equals the element because of the relation . That means that and are two different factorizations of the same element into irreducibles, so is not a UFD.
*The ring of holomorphic functions in a single complex variable is not a UFD, since there exist holomorphic functions with an infinity of zeros, and thus an infinity of irreducible factors, while a UFD factorization must be finite, e.g.:::
Properties
Some concepts defined for integers can be generalized to UFDs:
* In UFDs, every
irreducible element is prime. (In any integral domain, every prime element is irreducible, but the converse does not always hold.) Note that this has a partial converse: any Noetherian domain is a UFD iff every irreducible element is prime (this is one proof of the implication PID UFD).* Any two (or finitely many) elements of a UFD have a
greatest common divisor and aleast common multiple . Here, a greatest common divisor of "a" and "b" is an element "d" which divides both "a" and "b", and such that every other common divisor of "a" and "b" divides "d". All greatest common divisors of "a" and "b" are associated.* Any UFD is
integrally closed . In other words, if R is anintegral domain withquotient field K, and if an element k in K is a root of a monic polynomial withcoefficients in R, then k is an element of R.Equivalent conditions for a ring to be a UFD
Under some circumstances, it is possible to give equivalent conditions for a ring to be a UFD.
* A
Noetherian integral domain is a UFDif and only if every height 1prime ideal is principal.* An integral domain is a UFD if and only if the ascending chain condition holds for principal ideals, and any two elements of "A" have a least common multiple.
* There is a nice ideal-theoretic characterization of UFDs, due to
Kaplansky . If R is anintegral domain , then R is a UFD if and only if every nonzeroprime ideal of R has a nonzeroprime element .* A
Dedekind domain is a UFD if and only if itsideal class group is trivial. In this case it is in fact aprincipal ideal domain .References
* Chap. 4.
* Chap.II.5.
*
Wikimedia Foundation. 2010.