betaFeedback

WorksMathematics

LCM Splittings in GCD Domains

Abstract

In a GCD ring RR, every pair of elements a,b∈Ra,b\in R admits a greatest common divisor gcd(a,b)\text{gcd}(a,b) and a least common multiple lcm(a,b)\text{lcm}(a,b). Motivated by a question on Mathematics Stack Exchange by Ash Seifert~\cite{Sei22}, I introduce the notion of an lcm splitting c,d∈Rc,d\in R for a,ba,b satisfying cd∼lcm(a,b),c∣a,d∣b,gcd(c,d)∼1cd\sim\text{lcm}(a,b), c\mid a, d\mid b, \text{gcd}(c,d)\sim1. I show that adequate Bézout domains always admit lcm splittings, give examples of Bézout domains in which some pair has no lcm splitting, and make further remarks on this seemingly new property.

LCM splittings in GCD rings

The notion of gcd for integers is classic, giving rise to arguably the first proper known algorithm, the Euclidean algorithm from at least 300 BC computing it. GCD rings generalize this notion to rings, which in this paper are always associative, commutative and unital.

Definition 1.1. Let RR be a ring and a,b∈Ra,b \in R two elements.

(a) A greatest common divisor g=gcd⁡(a,b)∈Rg = \gcd(a,b) \in R for the pair a,ba,b is a common divisor (g∣a,g∣b⟺∃a′,b′∈R:a=a′g,b=b′gg \mid a, g \mid b \Longleftrightarrow\exists a',b' \in R: a = a'g, b = b'g) such that any other common divisor d∈Rd \in R of aa and bb necessarily divides gg, i.e. d∣gd \mid g.

(b) RR is a GCD ring if every pair of elements admits a gcd.

(c) A least common multiple l=lcm⁡(a,b)∈Rl = \operatorname{lcm}(a,b) \in R is a common multiple (a∣la \mid l and b∣lb \mid l) such that any other common multiple m∈Rm \in R of aa and bb is necessarily a multiple of ll, i.e. l∣ml \mid m.

Gcds, when they exist, are only defined up to associates, i.e. only up to multiplication by a unit u∈R×u \in R^{\times}. Explicitly, for a,b∈Ra,b \in R, I will write a∼Rba \sim_R b if ∃u∈R×:ua=b\exists u \in R^{\times}: ua = b. I will simply write a∼ba \sim b when the ring is clear from the context. It is a standard result that this is an equivalence relation, i.e. it is reflexive, symmetric, and transitive. I assume that gcd⁡(a,b)\gcd(a,b) is some fixed choice among all valid associates. Consequently, for u,v∈R×u,v \in R^{\times}, we have gcd⁡(ua,vb)∼gcd⁡(a,b)\gcd(ua,vb) \sim\gcd(a,b), but equality need not hold. Lcms behave similarly.

Motivated by a question on Mathematics Stack Exchange by Ash Seifert [18], I define the following notions, which I could not find in the literature despite their seemingly obvious nature.

Definition 1.2. Let RR be a GCD ring and a,b∈Ra,b \in R two elements.

(a) An lcm splitting of a,ba,b, if it exists, consists of a pair c,d∈Rc,d \in R such that cd∼lcm⁡(a,b)cd \sim\operatorname{lcm}(a,b), c∣ac \mid a, d∣bd \mid b and gcd⁡(c,d)∼1\gcd(c,d) \sim1. The fourth and last condition is called the splitting condition.

(b) RR is lcm splitting if every pair of elements admits an lcm splitting.

The main contributions of this paper are

  • the definitions of lcm splitting just given,

  • a theorem that adequate (defined below) implies lcm splitting for domains, and

  • two explicit examples of Bézout domains that are not lcm splitting.

Some of the presented ideas were developed in dialog with chatbots, cf. § 6.

Preliminaries, related notions and results

Most rings considered will be integral domains, i.e., they have no nontrivial zero divisors. A GCD domain is a GCD ring that is an integral domain. Domains are canonically embedded in a fraction field R⊆Frac⁡(R)R \subseteq\operatorname{Frac}(R). This allows one to write certain elements of RR as fractions with nonzero denominator, simplifying notation. E.g., if gcd⁡(a,b)≠0\gcd(a,b) \ne0 and a′∈Ra' \in R satisfies a=a′gcd⁡(a,b)a = a'\gcd(a,b), then the fraction a′=agcd⁡(a,b)∈Frac⁡(R)a' = \frac{a}{\gcd(a,b)} \in\operatorname{Frac}(R) is well-defined and, moreover, lies in RR.

In Appendix A, I collect some standard identities for gcd and lcm for a,b,ca,b,c elements of a GCD domain RR, assumed to be nonzero when in doubt. Most references deal with the special case R=ZR = \mathbb{Z}, so I will supply (references to) proofs in the general context to be self-contained.

Remark 2.1. I will apply the identities and properties of Prop. A.1 by labeling steps with the corresponding numbers throughout the paper. Numbers in parentheses in equation-like statements without further explanation will always refer to Prop. A.1.

Associativity (7) lets us define multiple gcds and lcms iteratively. E.g. gcd⁡(a,b,c)=gcd⁡(gcd⁡(a,b),c)\gcd(a,b,c) = \gcd(\gcd(a,b),c) or lcm⁡(a,b,c,d)=lcm⁡(lcm⁡(lcm⁡(a,b),c),d)\operatorname{lcm}(a,b,c,d) = \operatorname{lcm}(\operatorname{lcm}(\operatorname{lcm}(a,b),c),d).

Next, I recall some classical notions used in the subsequent sections, followed by references for details. Then I recall several related facts, introducing further classical terminology.

Definition 2.2. (1) A GCD ring RR is a Bézout ring if all its finitely generated ideals are principal. In particular (and ultimately equivalently), for any a,b∈Ra,b \in R the ideal identity (a,b)=(gcd⁡(a,b))(a,b)=(\gcd(a,b)) holds. In general, only “⊆\subseteq” is guaranteed. In the language of the generalized Euclidean algorithm, the ideal identity (and thus the Bézout property) can equivalently be stated as ∃c,d∈R:ad−bc=gcd⁡(a,b)\exists c,d \in R: ad-bc=\gcd(a,b).

A Bézout domain is a Bézout ring that is also an integral domain.

(2) A GCD ring RR has good factorization (gf) if for all a,b∈R∖{0}a,b \in R \setminus\{0\} there exist c,d∈Rc,d \in R with a=cda=cd, gcd⁡(c,b)∼1\gcd(c,b)\sim1 and b∈(d)b \in(d).

(3) A ring RR is adequate if for all a,b∈R∖{0}a,b \in R \setminus\{0\} there exist c,d∈Rc,d \in R with a=cda=cd, bR+cR=RbR+cR=R and, for all d′∈Rd' \in R, the inclusions dR⊆d′R⊊RdR \subseteq d'R \subsetneq R imply bR+d′R⊊RbR+d'R \subsetneq R.

If RR is a Bézout ring, this is equivalent to: For all a,b∈R∖{0}a,b \in R \setminus\{0\} there exist c,d∈Rc,d \in R with a=cda=cd, gcd⁡(c,b)∼1\gcd(c,b)\sim1 and for all non-units d′∈R∖R×d' \in R \setminus R^\times the divisibility d′∣dd' \mid d implies gcd⁡(d′,b)≁1\gcd(d',b)\not\sim1. Note the similarity to the definition of gf.

(4) For an m×nm \times n-matrix A∈Mat⁡m,n(R)A \in\operatorname{Mat}_{m,n}(R) with coefficients in a ring RR (m,n∈N>0m,n \in\mathbb{N}_{>0}), we say that AA admits a diagonal reduction if there are invertible (over RR) matrices P∈Mat⁡m,m(R)P \in\operatorname{Mat}_{m,m}(R), Q∈Mat⁡n,n(R)Q \in\operatorname{Mat}_{n,n}(R) such that PAQ=Diag⁡((di)i=1min⁡(m,n))PAQ=\operatorname{Diag}((d_i)_{i=1}^{\min(m,n)}) is diagonal with di∣di+1d_i \mid d_{i+1} for all 1≤i≤min⁡(m,n)−11 \leq i \leq\min(m,n)-1. RR has the elementary divisor property if all (finite-dimensional) matrices admit diagonal reductions.

(5) For A∈Mat⁡m,n(R)A \in\operatorname{Mat}_{m,n}(R) over a ring RR (m,n∈N>0m,n \in\mathbb{N}_{>0}), we say that AA admits a triangular reduction if there is an invertible (over RR) matrix Q∈Mat⁡n,n(R)Q \in\operatorname{Mat}_{n,n}(R) such that AQAQ is lower triangular (arbitrary entries on the diagonal are allowed). RR is K-Hermite if all (finite-dimensional) matrices admit triangular reductions.

I will say that a pair (a,b)(a,b) satisfies resp. violates gf or adequate if the respective property holds resp. fails for (a,b)(a,b). Anderson [1] provides a survey of divisibility theory for GCD domains. Cohn [3] gives results about Bézout domains (Cohn calls GCD domains HCF domains and Bézout domains Bézout rings). Gillman and Henriksen [7] (they call Bézout rings F-rings and K-Hermite Hermite), Lam [13 Ch. 1, Def. 4.23] and L’Innocente and Point [14 Sec. 5.2] elaborate on the properties K-Hermite, elementary divisor, adequate and good factorization. A textbook by Cohn [4 Ch. 6.5] discusses some elementary properties of divisibility, gcds and lcms.

In the literature, gf and adequate are often used only in the narrower context of Bézout domains. Quoting van den Dries and Macintyre [20 Sec. 2.10] and adjusting notation: “In intuitive terms, writing prime factor of xx for maximal ideal containing xx, this implies that the prime factors of cc are those of aa that do not occur in bb, while the prime factors of dd are exactly the common prime factors of aa and bb.”

Good factorization resp. adequate allow one to split a ring element into factors multiplicatively well aligned with another ring element. This is close in spirit to the idea of an lcm splitting. Indeed, in § 3 I prove adequate (and gf) implies lcm splitting. [20 Sec. 2.10] also sketches an example, due to R. Wiegand, in which gf fails. In § 4, this is my starting point for the first counterexample: a Bézout domain that is not lcm splitting. Note that gf and adequate are not symmetric: (a,b)(a,b) can be gf resp. adequate while (b,a)(b,a) is not, cf. Prop. 4.14. However, the definition of lcm splitting is clearly symmetric.

Remark 2.3. To be self-contained, I give an overview of standard results on GCD domains.

  • In GCD domains, lcms always exist, cf. [3 Thm 2.1] or [1 Thm 2.1 (3)] for general statements about integral domains.

  • GCD domains that satisfy the ascending chain condition for principal ideals (ACCP) are UFDs (unique factorization domains). In particular, all Noetherian GCD domains are UFDs. However, there are non-Noetherian UFDs. In general, we have the following sequence of proper implications (meaning that there are counterexamples to their converses) between ring properties:

UFD⇒GCD domain⇒Schreier domain⇒integrally closed domain⇒domain.\mathrm{UFD} \Rightarrow\mathrm{GCD\ domain} \Rightarrow\mathrm{Schreier\ domain} \Rightarrow\mathrm{integrally\ closed\ domain} \Rightarrow\mathrm{domain}.
  • Bézout domains are exactly those GCD domains that are Prüfer (i.e. all finitely generated ideals are invertible). Any integral domain is the intersection of its localizations at maximal ideals resp. prime ideals. Moreover,

R is a Pru¨fer ring⟺R\text{ is a Prüfer ring} \Longleftrightarrow
∀p∈Spec⁡(R):Rp is a valuation ring⟺\forall p \in\operatorname{Spec}(R): R_p\text{ is a valuation ring} \Longleftrightarrow
∀m∈mSpec⁡(R):Rm is a valuation ring.\forall m \in\operatorname{mSpec}(R): R_m\text{ is a valuation ring}.

For a Bézout domain RR and a maximal ideal m\mathfrak{m}, the valuation of RmR_{\mathfrak{m}} restricts to a valuation vmv_{\mathfrak{m}} on RR. Valuations of this type characterize gcd and lcm up to units:

vm(gcd⁡(a,b))=min⁡(vm(a),vm(b)) and vm(lcm⁡(a,b))=max⁡(vm(a),vm(b)).v_{\mathfrak{m}}(\gcd(a,b))=\min\left(v_{\mathfrak{m}}(a),v_{\mathfrak{m}}(b)\right) \text{ and } v_{\mathfrak{m}}(\operatorname{lcm}(a,b))=\max\left(v_{\mathfrak{m}}(a),v_{\mathfrak{m}}(b)\right).
  • For a Bézout domain RR, the references above give the implications

\mathrm{UFD}\Rightarrow\mathrm{gf}\xRightarrow{\text{\citep`[14, p. 460]`}}\mathrm{adequate}\xRightarrow{\text{\citep`[16, p. 86]`}}\mathrm{elementary\ divisor}\xRightarrow{\text{\citep`[7, p. 363]`}}\mathrm{K\text{-}Hermite}\xLeftarrow{\text{\citep`[13, ch. 1, Cor. 4.28]`}}\text{Bézout domain}.

The implication “UFD ⇒ gf” is an almost immediate consequence of comparing the prime factorizations of aa and bb, constructing dd from the prime factors of aa that appear in bb, and cc from those that do not. For “gf ⇒ adequate”, see also Lem. B.1. Note that some of the implications hold under weaker assumptions than RR being a Bézout domain, in particular the last equivalence. See the references for the proper level of generality.

Some works study these properties for general rings, which need not be commutative or domains. Note that diagonal reduction needs to be checked only for matrix dimensions (m,n)∈{(1,2),(2,1),(2,2)}(m,n)\in\{(1,2),(2,1),(2,2)\} for the elementary divisor property to hold, cf. [7 Thm. 2]. Similarly, K-Hermite needs to be checked only for (m,n)∈{(1,2)}(m,n)\in\{(1,2)\}, cf. [13 ch. 1, Prop. 4.24].

A classic example of a non-UFD, gf domain is the ring of algebraic integers R3=ZR_3=\mathbb{Z}, cf. App. D. I was not able to find an example of a non-gf, adequate domain in the literature. I also do not know whether there are non-adequate, elementary divisor domains that are lcm splitting. In § 4, I will give two examples of non-adequate, elementary divisor domains that are not lcm splitting. Recently, Hägg and Mörtberg [9] announced an example of a Bézout domain that is not an elementary divisor domain – I do not know whether it is lcm splitting.

Let RR be a Bézout domain and a,b∈R∖{0}a,b\in R\setminus\{0\}. If a pair (c,d)∈R2(c,d)\in R^2 satisfies the gf resp. adequate conditions for (a,b)(a,b), then it is unique up to associates, cf. Cor. B.3 and Lem. B.2.

  • General GCD domains may be inertly embedded into Bézout domains, i.e. without changing the divisibility and thus gcd-properties too much, see [1] and [3]. This suggests, on an informal level, that most questions about divisibility for GCD domains may already be answered through Bézout domains.

Remark 2.4. I give some first observations on the lcm splitting property. I remind the reader of the convention in Rem. 2.1 about numbers in parentheses.

References

  1. [1]D. D. Anderson, GCD Domains, Gauss’ Lemma, and Contents of Polynomials, In: Non-Noetherian Commutative Ring Theory (Eds. S. T. Chapman, and S. Glaz) pp. 1–31. Springer, Boston, 2000.DOI
  2. [2]D. D. Anderson, T. Dumitrescu, and M. Zafrullah, Almost Splitting Sets and AGCD Domains, Communications in Algebra 32(1), 2004, pp. 147–158.DOI
  3. [3]P. M. Cohn, Bezout rings and their subrings, Mathematical Proceedings of the Cambridge Philosophical Society 64(2), 1968, pp. 251–264.DOI
  4. [4]P. M. Cohn, Algebra, Volume 1, John Wiley and Sons, London, 1974.
  5. [5]T. S. Fischer, The prime spectrum of a bezout ring, Communications in Algebra 6(16), 1978, pp. 1715–1739.DOI
  6. [6]T. S. Fischer, The maximal ideal space of a bezout ring, Communications in Algebra 7(3), 1979, pp. 241–258.DOI
  7. [7]L. Gillman, and M. Henriksen, Some Remarks About Elementary Divisor Rings, Transactions of the American Mathematical Society, 82(2), 1956, pp. 362–365.DOI
  8. [8]R. Gilmer, Multiplicative Ideal Theory, Queen’s Papers in Pure and Applied Mathematics, Kingston, 1992.
  9. [9]Ch. Hägg and A. Mörtberg, A Bézout Domain that is not an Elementary Divisor Domain, arXiv, 2026, https://arxiv.org/abs/2609.35229.
  10. [10]O. Helmer, Divisibility properties of integral functions, Duke Math. J. 6, 1940, pp. 345–356.DOI
  11. [11]H. C. Hutchins, Examples of Commutative Rings, Polygonal Publishing House, Passaic, 1981.
  12. [12]P. Jaffard, Les Systèmes d’idéaux, Dunod, Paris, 1960.
  13. [13]T. Y. Lam, Serre’s Problem on Projective Modules, Springer, Berlin, 2006.DOI
  14. [14]S. L’Innocente and F. Point, Bézout domains and lattice-valued modules, Journal of Pure and Applied Algebra 224(1), 2020, pp. 444–467.DOI
  15. [15]J. Ohm, Semi-Valuations and Groups of Divisibility, Canadian Journal of Mathematics 21, 1969, pp. 576–591.DOI
  16. [16]E. A. Rohi, S. A. Rosyada, and S. Wahyuni, The Relation Between Bézout Domain, Elementary Divisor Domain, and Adequate Domain, Diophantine Journal of Mathematics and Its Applications 3(2), 2024, pp. 81–90.DOI
  17. [18]Ash Seifert, Given b in a GCD domain R, what assumptions are necessary to find divisors which have d₁d₂ = lcm(a,b)?, Mathematics Stack Exchange, https://math.stackexchange.com/q/4507408, version: 2022-08-06.
  18. [19]T. S. Smith, Fermat’s last theorem and Bezout’s theorem in GCD domains, Journal of Pure and Applied Algebra, 79(1), 1992, pp. 63–85.DOI
  19. [20]L. van den Dries, A. Macintyre, The logic of Rumely’s local-global principle, Journal für die reine und angewandte Mathematik, 407, 1990, pp. 33–56.DOI

Paper details

vlnc:W_ysdwdmcy
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY-SA 4.0
Usage

views · 4

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Claude Sonnet 5 (bare)

View statement
Looking for related papers…
Contents