GCD ___domain

In mathematics, a GCD ___domain (sometimes called just ___domain) is an integral ___domain R with the property that any two elements have a greatest common divisor (GCD); i.e., there is a unique minimal principal ideal containing the ideal generated by two given elements. Equivalently, any two elements of R have a least common multiple (LCM).^[1]

A GCD ___domain generalizes a unique factorization ___domain (UFD) to a non-Noetherian setting in the following sense: an integral ___domain is a UFD if and only if it is a GCD ___domain satisfying the ascending chain condition on principal ideals (and in particular if it is Noetherian).

GCD domains appear in the following chain of class inclusions:

rngs ⊃ rings ⊃ commutative rings ⊃ integral domains ⊃ integrally closed domains ⊃ GCD domains ⊃ unique factorization domains ⊃ principal ideal domains ⊃ euclidean domains ⊃ fields ⊃ algebraically closed fields

Every irreducible element of a GCD ___domain is prime. A GCD ___domain is integrally closed, and every nonzero element is primal. In other words, every GCD ___domain is a Schreier ___domain.

For every pair of elements x, y of a GCD ___domain R, a GCD d of x and y and an LCM m of x and y can be chosen such that dm = xy, or stated differently, if x and y are nonzero elements and d is any GCD d of x and y, then xy/d is an LCM of x and y, and vice versa. It follows that the operations of GCD and LCM make the quotient R/~ into a distributive lattice, where "~" denotes the equivalence relation of being associate elements. The equivalence between the existence of GCDs and the existence of LCMs is not a corollary of the similar result on complete lattices, as the quotient R/~ need not be a complete lattice for a GCD ___domain R.^{[citation needed]}

If R is a GCD ___domain, then the polynomial ring R[X₁,...,X_n] is also a GCD ___domain.^[2]

R is a GCD ___domain if and only if finite intersections of its principal ideals are principal. In particular, ${\displaystyle (a)\cap (b)=(c)}$, where ${\displaystyle c}$ is the LCM of ${\displaystyle a}$ and ${\displaystyle b}$.

For a polynomial in X over a GCD ___domain, one can define its content as the GCD of all its coefficients. Then the content of a product of polynomials is the product of their contents, as expressed by Gauss's lemma, which is valid over GCD domains.

• A unique factorization ___domain is a GCD ___domain. Among the GCD domains, the unique factorization domains are precisely those that are also atomic domains (which means that at least one factorization into irreducible elements exists for any nonzero nonunit).
• A Bézout ___domain (i.e., an integral ___domain where every finitely generated ideal is principal) is a GCD ___domain. Unlike principal ideal domains (where every ideal is principal), a Bézout ___domain need not be a unique factorization ___domain; for instance the ring of entire functions is a non-atomic Bézout ___domain, and there are many other examples. An integral ___domain is a Prüfer GCD ___domain if and only if it is a Bézout ___domain.^[3]
• If R is a non-atomic GCD ___domain, then R[X] is an example of a GCD ___domain that is neither a unique factorization ___domain (since it is non-atomic) nor a Bézout ___domain (since X and a non-invertible and non-zero element a of R generate an ideal not containing 1, but 1 is nevertheless a GCD of X and a); more generally any ring R[X₁,...,X_n] has these properties.
• A commutative monoid ring ${\displaystyle R[X;S]}$ is a GCD ___domain iff ${\displaystyle R}$ is a GCD ___domain and ${\displaystyle S}$ is a torsion-free cancellative GCD-semigroup. A GCD-semigroup is a semigroup with the additional property that for any ${\displaystyle a}$ and ${\displaystyle b}$ in the semigroup ${\displaystyle S}$, there exists a ${\displaystyle c}$ such that ${\displaystyle (a+S)\cap (b+S)=c+S}$. In particular, if ${\displaystyle G}$ is an abelian group, then ${\displaystyle R[X;G]}$ is a GCD ___domain iff ${\displaystyle R}$ is a GCD ___domain and ${\displaystyle G}$ is torsion-free.^[4]
• The ring ${\displaystyle \mathbb {Z} [{\sqrt {-d}}]}$ is not a GCD ___domain for all square-free integers ${\displaystyle d\geq 3}$.^[5]

Many of the properties of GCD ___domain carry over to Generalized GCD domains,^[6] where principal ideals are generalized to invertible ideals and where the intersection of two invertible ideals is invertible, so that the group of invertible ideals forms a lattice. In GCD rings, ideals are invertible if and only if they are principal, meaning the GCD and LCM operations can also be treated as operations on invertible ideals.

Examples of G-GCD domains include GCD domains, polynomial rings over GCD domains, Prüfer domains, and π-domains (domains where every principal ideal is the product of prime ideals), which generalizes the GCD property of Bézout domains and unique factorization domains.