Atomic domain 2026-10-03
An atomic domain is an integral domain in which every nonzero nonunit is a finite product of irreducible elements. Every unique factorization domain is atomic, but atomicity alone does not imply uniqueness.
With the usual commutative, unital conventions, the chain is
A field is an integral domain, and every nonzero ideal contains an invertible element and is consequently the whole ring. Its only ideals are and , so it is a principal ideal domain.
To prove the middle implication, first show that a principal ideal domain has the ascending chain condition on ideals. The union of an ascending chain is an ideal, hence is ; its generator belongs to one member of the chain, and all later members equal . Now suppose a nonzero nonunit admitted no factorization into irreducible elements. It would factor into two nonunits, at least one of which again has no such factorization. Repeating would produce a strictly increasing chain of principal ideals: if with a nonunit, , since equality and cancellation would make invertible. This contradicts the ascending chain condition. Existence of factorization follows. By the permitted fact that every irreducible element is a prime element in a principal ideal domain, any irreducible factor in one factorization divides a factor in the other; cancellation then proves uniqueness up to units and order. This is a unique factorization domain. The final implication is part of the definition of a unique factorization domain.
None of the adjacent implications reverses. The principal ideal domain is not a field, since is not invertible. The polynomial ring is a unique factorization domain, by applying the polynomial extension theorem for unique factorization domains twice, but its ideal is not principal: a generator would divide both and , so would be a unit, whereas every member of this ideal vanishes at the origin. Finally, is an integral domain as a subring of , but is not a unique factorization domain. Its multiplicative norm is . There is no element of norm or . Hence , of norms , are all irreducible: a nontrivial factorization would require one of those missing norms. The only units have norm one and are . The two factorizations
are therefore not related by associates and reordering.
The multiplicative field norm on this ring is
If an element is a unit, its positive integer norm has a multiplicative inverse in the positive integers, hence is one. The only integer solutions of are . Therefore the units are exactly and .
The standard failure of unique factorization is
There is no element of norm two or three: gives norm at least five, while gives a square. An alleged nontrivial factorization of (norm four), (norm nine), or (norm six) would require a factor of norm two or three. Thus all four displayed factors are irreducible elements. No factor in the first factorization is associated to a factor in the second, since associates have the same norm and the norms are respectively four, nine and six. Hence is not a unique factorization domain.
An integral domain is an integrally closed domain if every element of its fraction field which is an integral element over belongs to . Explicitly, if satisfies
then . Thus .
Suppose is a unique factorization domain and is integral, with , , and with no common irreducible element as a factor. Multiplying its monic equation by gives
Hence divides . Every irreducible element dividing is a prime element, so it would divide , contrary to the choice of the fraction. Therefore is a unit, and . We have proved
The going-down theorem is the following. Let be an integral extension of integral domains with an integrally closed domain. If
then
We first prove this for a module-finite ring extension and then remove that extra hypothesis. We use the Lying-over theorem, the Going-up theorem, and the incomparability theorem for integral extensions: primes exist over every base prime, prime chains can be extended upwards, and distinct primes over the same base prime cannot contain one another. The Going-up theorem follows by applying the Lying-over theorem to the quotient by the lower prime. These results concern arbitrary integral extensions; none assumes the going-down theorem.
For the finite case, let and . Since is module-finite, is a finite field extension. Take a finite normal field extension containing , obtained as a splitting field of the minimal polynomials of finitely many field generators. The extension need not be a separable field extension. Let be the integral closure of in . Then , and is integral over both and .
We need one auxiliary fact: the finite group acts transitively on the prime ideals of over any fixed prime ideal of . First observe that an element fixed by all of is a purely inseparable algebraic element over . Indeed, all -embeddings of into an algebraic closure extend to -automorphisms of the normal field extension . Hence the minimal polynomial of an algebraic element has only one distinct root. In characteristic zero this says ; in characteristic it says for some .
Now let be primes of over , and suppose is different from every , . By the incomparability theorem for integral extensions, is contained in none of these conjugate primes. The prime avoidance lemma supplies
The product
is fixed by , is integral over , and lies in because one factor is . Choose an exponent equal to in characteristic zero, or a power of in characteristic , such that . Since is an integrally closed domain, . It also lies in , hence in . Because is a prime ideal, some factor lies in . This means , contradicting our choice. Thus for some , proving transitivity. The power accounts for the possible purely inseparable field extension and makes the argument valid in every characteristic.
Lift the prescribed to a prime of by the Lying-over theorem for . Separately, choose a prime over and use the Going-up theorem to find over . Transitivity gives with . Then
Contracting to gives with the required contraction. This proves the going-down theorem for the module-finite case.
For a general integral extension , consider and the ideal
We claim that is disjoint from . Otherwise, clearing the finitely many denominators in an expression for an element gives
The subalgebra is a module-finite ring extension of , since all its generators are integral elements. Apply the finite case to : there is a prime contracting to . The displayed identity puts in , but . Thus , a contradiction.
Localize further at the multiplicative subset . The extension of is a proper ideal, by the disjointness just proved. Choose a maximal ideal containing it and contract back to a prime ideal of . This prime contains and avoids . Its contraction to lies inside by the prime ideal correspondence for localization, and its contraction to is exactly . This completes the proof of the going-down theorem without any finite generation assumption on .
A unique factorization domain is an integral domain in which every nonzero nonunit is a finite product of irreducible elements, uniquely up to reordering and multiplication of factors by a unit in a ring. A principal ideal domain is an integral domain in which every ideal is generated by one element.
Gauss lemma for polynomials says that over a unique factorization domain , the product of two primitive polynomials is primitive, and the polynomial content satisfies up to a unit. In particular a primitive polynomial of positive degree is irreducible over exactly when it is irreducible over the fraction field of . Consequently a polynomial ring over a unique factorization domain is itself a unique factorization domain.
The Eisenstein criterion says that if has and there is a prime element with , for every , and , then is irreducible over the fraction field. If is primitive, it is also irreducible in . Over one may take to be an ordinary prime number. The primitivity qualification prevents a nonunit constant content from being overlooked.
The defining distinction is unique irreducible factorization versus generation of every ideal by one element.
First, every nonzero nonunit in a principal ideal domain factors into irreducible elements. Otherwise repeatedly choose a proper nonunit factor of ; then the principal ideals
form a strictly increasing chain, contradicting the ascending chain condition, since every principal ideal domain is a Noetherian ring.
Next every irreducible is a prime element. If but , then . The Bezout identity gives , so multiplying by shows . Thus irreducibles are prime.
Existence of an irreducible factorization and primality give uniqueness: an irreducible on one side divides the product on the other, hence is associate to one factor; cancel and continue. Therefore every principal ideal domain is a unique factorization domain.
Suppose were a product of irreducible elements of . Since degree of a polynomial is additive under products, exactly one factor has positive degree and all the others are constant. By the preceding classification, the positive-degree factor has constant term , while every constant irreducible is for a prime . Their product therefore has a nonzero constant term, contradicting .
Thus is not a product of irreducibles, so this integral domain is not an atomic domain and in particular is not a unique factorization domain.
The algebraic norm on is and satisfies multiplicativity of the algebraic norm. The calculation in part (a) therefore gives all elements of norm :
If one of these factored into two nonunits, multiplicativity would force both factors to have norm . But the Diophantine equation has no solution. Hence all six displayed elements are irreducible. This is a standard example in which an irreducible element need not have prime norm.
The height of a prime ideal is
The Krull principal ideal theorem states that if is Noetherian and is minimal among the primes containing a proper principal ideal , then
Suppose otherwise that . Quotient by and localize at ; it is enough to consider a Noetherian local domain whose maximal ideal is the only prime containing and which has .
For , put
This is a -primary ideal. Since is a zero-dimensional Noetherian ring, it is Artinian, and the descending chain eventually stabilizes. Thus, for all sufficiently large , every can be written
Now , while ; -primaryness gives . Hence
The Nakayama lemma applied to gives . Localizing at makes all sufficiently large powers of the nonzero maximal ideal equal. A nonzero element of the stable power then belongs to , contradicting the Krull intersection theorem. This proves the theorem.
Now let be a Noetherian integral domain. If is a unique factorization domain and has height one, choose and an irreducible factor of . In a UFD, is prime, so
Height one forces .
Conversely, suppose every height-one prime is principal. Noetherianity makes an atomic domain. Given an irreducible element , choose a prime minimal over . The principal ideal theorem gives , so by hypothesis. Since and is irreducible, is a unit; hence is prime. Thus every irreducible is a prime element, and an atomic domain with this property is a UFD. Therefore
Assume that is a prime element. If , then divides , so divides or . If , write ; cancellation in the integral domain gives , so is a unit. The other case is symmetric. Hence every prime element is irreducible.
Suppose first that is a unique factorization domain, and let be a minimal nonzero prime ideal. Choose and factor it into irreducibles. In a UFD each irreducible is a prime element, so one factor belongs to . The nonzero prime ideal must equal by minimality.
Conversely, the ascending chain condition in the Noetherian domain implies that every nonzero nonunit factors into irreducibles. Let be irreducible and choose a prime minimal over . The Krull principal ideal theorem gives . Since is a domain and , it is a minimal nonzero prime and hence is principal, say . The divisibility and irreducibility of force to be associate to , so is prime. Thus every irreducible is prime, proving that is a UFD. This is the Minimal-prime criterion for a Noetherian unique factorization domain.
Unique factorization in an integral domain Created 2026-10-06 Updated 2026-10-07
Every nonzero nonunit in a unique factorization domain is a finite product of irreducible elements. Such a factorization is unique up to permutation and multiplication of the factors by units. Irreducibles are prime elements, so divisibility can be checked by comparing their multiplicities. This applies to a polynomial ring over a field and is useful for intersections of localizations inside its fraction field.