Jump to content

GCD domain: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
m Properties: tweak ref
m added that GCD domains are sometimes called only "domains", it seems to be common in stackoverflow
 
(17 intermediate revisions by 13 users not shown)
Line 1: Line 1:
{{Short description|Mathematical structure with greatest common divisors}}
In mathematics, a '''GCD 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).<ref>{{cite book|author=Scott T. Chapman, [[Sarah Glaz]] (ed.)|title=Non-Noetherian Commutative Ring Theory|url=https://archive.org/details/nonnoetheriancom00ande|url-access=limited|publisher=Springer|year=2000|series=Mathematics and Its Applications|isbn=0-7923-6492-9|page=[https://archive.org/details/nonnoetheriancom00ande/page/n475 479]}}</ref>
{{Algebraic structures |Ring}}
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 [[Subring#Subring_generated_by_a_set|generated by]] two given elements. Equivalently, any two elements of ''R'' have a [[least common multiple]] (LCM).<ref>{{cite book
| last = Anderson | first = D. D.
| editor1-last = Chapman | editor1-first = Scott T.
| editor2-last = Glaz | editor2-first = Sarah | editor2-link = Sarah Glaz
| contribution = GCD domains, Gauss' lemma, and contents of polynomials
| doi = 10.1007/978-1-4757-3180-4_1
| location = Dordrecht
| mr = 1858155
| pages = 1–31
| publisher = Kluwer Academic Publishers
| series = Mathematics and its Application
| title = Non-Noetherian Commutative Ring Theory
| volume = 520
| year = 2000}}</ref>


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]]).
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 [[subclass (set theory)|class inclusions]]:
GCD domains appear in the following chain of [[subclass (set theory)|class inclusions]]:
{{Commutative ring classes}}
{{Commutative ring classes}}
{{Algebraic structures |Ring}}


== Properties ==
== Properties ==
Every irreducible element of a GCD domain is prime. A GCD domain is [[integrally closed domain|integrally closed]], and every nonzero element is [[primal element|primal]].<ref>[http://planetmath.org/proofthatagcddomainisintegrallyclosed proof that a gcd domain is integrally closed], [[PlanetMath|PlanetMath.org]]</ref> In other words, every GCD domain is a [[Schreier domain]].
Every [[irreducible element]] of a GCD domain is [[prime element|prime]]. A GCD domain is [[integrally closed domain|integrally closed]], and every nonzero element is [[primal element|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 {{nowrap|''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 [[distributive lattice#Characteristic properties|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 lattice]]s, as the quotient ''R''/~ need not be a complete lattice for a GCD domain ''R''.{{Citation needed|date=March 2015}}
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 {{nowrap|''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 [[distributive lattice#Characteristic properties|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 lattice]]s, as the quotient ''R''/~ need not be a complete lattice for a GCD domain ''R''.{{Citation needed|date=March 2015}}
Line 30: Line 44:
| url = http://www.emis.de/journals/BAG/vol.44/no.1/6.html
| url = http://www.emis.de/journals/BAG/vol.44/no.1/6.html
| volume = 44
| volume = 44
| year = 2003}}. P.&nbsp;84: "It is easy to see that an integral domain is a Prüfer GCD-domain if and only if it is a Bezout
| year = 2003}}. P.&nbsp;84: "It is easy to see that an integral domain is a Prüfer GCD-domain if and only if it is a Bezout domain, and that a Prüfer domain need not be a GCD-domain".</ref>
domain, and that a Prüfer domain need not be a GCD-domain.".</ref>
*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''<sub>1</sub>,...,''X''<sub>''n''</sub>] has these properties.
*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''<sub>1</sub>,...,''X''<sub>''n''</sub>] has these properties.
*A [[Commutative ring|commutative]] [[monoid ring]] <math>R[X; S]</math> is a GCD domain iff <math>R</math> is a GCD domain and <math>S</math> is a [[Torsion-free group|torsion-free]] [[Cancellative semigroup|cancellative]] GCD-semigroup. A GCD-semigroup is a semigroup with the additional property that for any <math>a</math> and <math>b</math> in the semigroup <math>S</math>, there exists a <math>c</math> such that <math>(a + S) \cap (b + S) = c + S</math>. In particular, if <math>G</math> is an [[abelian group]], then <math>R[X;G]</math> is a GCD domain iff <math>R</math> is a GCD domain and <math>G</math> is torsion-free.<ref>{{citation
*A [[Commutative ring|commutative]] [[monoid ring]] <math>R[X; S]</math> is a GCD domain iff <math>R</math> is a GCD domain and <math>S</math> is a [[Torsion-free group|torsion-free]] [[Cancellative semigroup|cancellative]] GCD-semigroup. A GCD-semigroup is a semigroup with the additional property that for any <math>a</math> and <math>b</math> in the semigroup <math>S</math>, there exists a <math>c</math> such that <math>(a + S) \cap (b + S) = c + S</math>. In particular, if <math>G</math> is an [[abelian group]], then <math>R[X;G]</math> is a GCD domain iff <math>R</math> is a GCD domain and <math>G</math> is torsion-free.<ref>{{citation
Line 44: Line 57:
| url = http://projecteuclid.org/euclid.mmj/1029001210
| url = http://projecteuclid.org/euclid.mmj/1029001210
| year = 1973}}.</ref>
| year = 1973}}.</ref>
* The ring <math>\mathbb Z[\sqrt{-d}]</math> is not a GCD domain for all [[square-free integer]]s <math>d\ge 3</math>.<ref>{{citation
| last = Mihet | first = Dorel
| volume = 15
| issue = 8
| journal = Resonance
| pages = 737–739
| title = A Note on Non-Unique Factorization Domains (UFD)
| url = https://www.ias.ac.in/article/fulltext/reso/015/08/0737-0739
| year = 2010}}.</ref>

==G-GCD domains==

Many of the properties of GCD domain carry over to Generalized GCD domains,<ref>{{citation
| last = Anderson | first = D.
| volume = 28
| issue = 2
| journal = Commentarii Mathematici Universitatis Sancti Pauli.
| pages = 219–233
| title = Generalized GCD domains.
| url = https://www.academia.edu/71860043/Generalized_GCD_Rings
| year = 1980}}</ref> where principal ideals are generalized to [[fractional ideal|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 domain]]s, and π-domains (domains where every principal ideal is the product of prime ideals), which generalizes the GCD property of [[Bézout domain]]s and [[unique factorization domain]]s.


== References ==
== References ==

Latest revision as of 21:21, 24 September 2024

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:

rngsringscommutative ringsintegral domainsintegrally closed domainsGCD domainsunique factorization domainsprincipal ideal domainsEuclidean domainsfieldsalgebraically closed fields

Properties

[edit]

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[X1,...,Xn] 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, , where is the LCM of and .

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.

Examples

[edit]
  • 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[X1,...,Xn] has these properties.
  • A commutative monoid ring is a GCD domain iff is a GCD domain and is a torsion-free cancellative GCD-semigroup. A GCD-semigroup is a semigroup with the additional property that for any and in the semigroup , there exists a such that . In particular, if is an abelian group, then is a GCD domain iff is a GCD domain and is torsion-free.[4]
  • The ring is not a GCD domain for all square-free integers .[5]

G-GCD domains

[edit]

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.

References

[edit]
  1. ^ Anderson, D. D. (2000). "GCD domains, Gauss' lemma, and contents of polynomials". In Chapman, Scott T.; Glaz, Sarah (eds.). Non-Noetherian Commutative Ring Theory. Mathematics and its Application. Vol. 520. Dordrecht: Kluwer Academic Publishers. pp. 1–31. doi:10.1007/978-1-4757-3180-4_1. MR 1858155.
  2. ^ Robert W. Gilmer, Commutative semigroup rings, University of Chicago Press, 1984, p. 172.
  3. ^ Ali, Majid M.; Smith, David J. (2003), "Generalized GCD rings. II", Beiträge zur Algebra und Geometrie, 44 (1): 75–98, MR 1990985. P. 84: "It is easy to see that an integral domain is a Prüfer GCD-domain if and only if it is a Bezout domain, and that a Prüfer domain need not be a GCD-domain".
  4. ^ Gilmer, Robert; Parker, Tom (1973), "Divisibility Properties in Semigroup Rings", Michigan Mathematical Journal, 22 (1): 65–86, MR 0342635.
  5. ^ Mihet, Dorel (2010), "A Note on Non-Unique Factorization Domains (UFD)", Resonance, 15 (8): 737–739.
  6. ^ Anderson, D. (1980), "Generalized GCD domains.", Commentarii Mathematici Universitatis Sancti Pauli., 28 (2): 219–233