Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-26T16:29:49.942Z Has data issue: false hasContentIssue false

A characterisation of atomicity

Published online by Cambridge University Press:  24 April 2023

SALVATORE TRINGALI*
Affiliation:
School of Mathematical Sciences, Hebei Normal University, Shijiazhuang, Hebei province, 050024 China. e-mail: salvo.tringali@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

In a 1968 issue of the Proceedings, P. M. Cohn famously claimed that a commutative domain is atomic if and only if it satisfies the ascending chain condition on principal ideals (ACCP). Some years later, a counterexample was however provided by A. Grams, who showed that every commutative domain with the ACCP is atomic, but not vice versa. This has led to the problem of finding a sensible (ideal-theoretic) characterisation of atomicity.

The question (explicitly stated on p. 3 of A. Geroldinger and F. Halter–Koch’s 2006 monograph on factorisation) is still open. We settle it here by using the language of monoids and preorders.

Type
Research Article
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of Cambridge Philosophical Society

1. Introduction

A (multiplicatively written) monoid H is $\textsf{cancellative}$ if the function $H \to H \colon x \mapsto uxv$ is injective for all $u, v \in H$ ; $\textsf{unit-cancellative}$ if $xy \ne x \ne yx$ for all $x, y \in H$ with y not a unit; and $\textsf{acyclic}$ if $uxv \ne x$ for all $u, v, x \in H$ unless u and v are both units (we address the reader to J. M. Howie’s monograph [ Reference Howie21 ] for generalities on monoids).

An acyclic or cancellative monoid is unit-cancellative, but not conversely; and it is a basic fact that a cancellative monoid satisfying the ascending chain condition (ACC) on both principal left ideals (ACCPL) and principal right ideals (ACCPR) is atomic, namely, each non-unit is a product of atoms (we recall that an atom, in an arbitrary monoid, is a non-unit that does not factor as a product of two non-units). We will refer to this fundamental result as Cohn’s theorem, since it can be traced back to P. M. Cohn’s work on factorisation in the 1960s (e.g., see [ Reference Cohn6 , theorem 2·8], the unnumbered corollary on p. 589 of [ Reference Cohn7 ], and [ Reference Cohn10 , proposition 0·9·3]).

Cohn’s theorem was extended to unit-cancellative monoids in [ Reference Fan and Tringali15 , theorem 2·28(i)] and then generalised to premons in [ Reference Tringali23 , theorem 3·10] and [ Reference Cossu and Tringali11 , theorem 3·4], where a $\textsf{premon}$ (or $\textsf{premonoid}$ ) is a pair consisting of a monoid H and a preorder — i.e., a reflexive and transitive binary relation — on (the carrier set of) H. A key to these arguments is the role played by the $\textsf{divisibility preorder}$ $\mid_H$ , viz., the binary relation on H defined by $x \mid_H y$ if and only if $x \in H$ and $y \in HxH$ (it is easy to check that $\mid_H$ is a preorder). In fact, the result follows from applying [ Reference Tringali23 , theorem 3·10] to the $\textsf{divisibility premon}$ $(H, \mid_H\!)$ of H and considering that, by [ Reference Tringali23 , corollary 4·6], H is unit-cancellative and satisfies the ACCPL and the ACCPR if and only if it is acyclic and satisfies the ACC on principal two-sided ideals (ACCP).

The interplay between ACCs and factorisation in commutative monoids is a classical topic which has overseen a revival in recent years. In [ Reference Cohn8 , proposition 1·1], Cohn famously claimed (without proof) that a commutative domain R is atomic (i.e., the multiplicative monoid $R^\bullet$ of the non-zero elements of R is atomic) if and only if R satisfies the ACCP (i.e., $R^\bullet$ satisfies the ACCP). Some years later, A. Grams [ Reference Grams20 ] showed, by way of a counterexample, that Cohn’s assertion is however wrong. Indeed, every commutative domain with the ACCP is atomic, but not vice versa. Grams’ construction is usually acknowledged as the first counterexample, but it seems that Cohn had already realized his own mistake and outlined a simpler construction in [Reference Cohn9, p. 4, lines 14--18].

Further contributions in the same vein were subsequently made by A. Zaks [ 24 ], who considered certain quotients of a polynomial ring in infinitely many variables and proved that they are atomic but do not satisfy the ACCP; and by M. Roitman, who showed the existence of an atomic commutative domain R such that the univariate polynomial ring R[X] is not atomic [ Reference Roitman22 , example 5·1]. Incidentally, Roitman’s example produced an atomic commutative domain without the ACCP (if R had the ACCP, then we would gather from [ Reference Gilmer18 , theorem 14·6] that R[X] also has the ACCP and hence is atomic by Cohn’s theorem). More recently, J. G. Boynton and J. Coykendall [ Reference Boynton and Coykendall2 ] have used pullbacks of commutative rings to generate large families of atomic commutative domains that do not satisfy the ACCP; F. Gotti and B. Li [ Reference Gotti and Li19 , theorem 4·4] have built what appears to be the first example of an atomic, commutative monoid domain without the ACCP; and J. Bell et al. [ Reference Bell, Brown, Nazemian and Smertnig1 , proposition 7·6] have provided the first example of an atomic, non-commutative, finitely presented monoid domain that satisfies neither the ACCPL nor the ACCPR (see also [ Reference Coykendall and Gotti13 ] for some related results on monoid rings, atomicity, and the ACCP).

It is definitely easier to come up with cancellative commutative monoids that are lacking the ACCP. E.g., S. T. Chapman et al. proved in [ Reference Chapman, Gotti and Gotti5 , corollary 4·4] that, if r is a non-zero rational number smaller than 1 and the numerator (of the reduced fraction) of r is not 1, then the submonoid of the additive group of the rational field generated by $1, r, r^2, \ldots$ is atomic but does not satisfy the ACCP.

With these preliminaries in place, it is natural to ask if Cohn’s false claim (that, for commutative domains, atomicity is equivalent to the ACCP) can be fixed by providing a sensible characterization (of an ideal-theoretic nature) of when a cancellative commutative monoid is atomic. In this regard, the last lines of p. 3 in A. Geroldinger and F. Halter–Koch’s 2006 monograph [ Reference Geroldinger and Halter–Koch16 ] on non-unique factorisation read, “Up to now, there is no satisfactory ideal-theoretic characterisation of atomic [commutative] domains.” Geroldinger has confirmed in private communication that, to his knowledge, the problem — ostensibly belonging to folklore — is still open.

In this paper, we aim to settle the question by proving, more generally, a characterisation of factorability in the abstract setting of premons (Corollary 2·5). First, we demonstrate that, in a locally artinian premon $(H, \preceq\!)$ , every $\preceq$ -non-unit factors as a product of $\preceq$ -irreducibles (Theorem 2·4). Next, we obtain a characterisation of atomicity (Corollary 2·6) by (i) restricting the previous result to the case where H is acyclic and $\preceq$ is the divisibility preorder on H, (ii) recognising that all $\preceq$ -irreducibles are then atoms, (iii) reinterpreting the condition of local artinianity in ideal-theoretic terms, and (iv) considering that, among many others, cancellative commutative monoids are acyclic. Details will be given in Section 2 (see, in particular, Definition 2·1), but something to keep in mind is that we use the adverb “locally” to refer to an element-wise property (i.e., the term has nothing to do with prime ideals and localisations in the sense, say, of [ Reference Geroldinger and Halter–Koch16 , section 2·2]).

Overall, this work is simple if measured from the technicality of the proofs. Its value, we hope, lies rather in the insight that the ACCP has little to do with the classical setting [ Reference Geroldinger and Zhong17 ] of factorisation theory (an observation already made in [ Reference Tringali23 ]) and is the first step in a countably infinite ladder of weaker and weaker conditions ultimately “converging” to local artinianity (Remarks 2·2).

2. Turning the ACCP to an element-wise condition

Let $(H, \preceq\!)$ be a premon (note that, in principle, we require no compatibility between the monoid operation and the preorder). An element $u \in H$ is a $\preceq$ - $\textsf{unit}$ if $u \preceq 1_H \preceq u$ and a $\preceq$ - $\textsf{non-unit}$ otherwise. A $\preceq$ - $\textsf{quark}$ is then a $\preceq$ -non-unit $a \in H$ with the property that there is no $\preceq$ -non-unit $b \prec a$ (i.e., $b \preceq a$ and $a \not\preceq b$ ); and given $s \in \mathbb N_{\ge 2} \cup \{\infty\}$ , a $\preceq$ - $\textsf{irreducible of degree}$ s (or $\textsf{degree}$ -s $\preceq$ - $\textsf{irreducible}$ ) is a $\preceq$ -non-unit a such that $a \ne x_1 \cdots x_k$ for every $k \in [\![ 2, s ]\!]$ and all $\preceq$ -non-units $x_1 \prec a, \ldots, x_k \prec a$ . In particular, we refer to a $\preceq$ -irreducible of degree 2 as a $\preceq$ - $\textsf{irreducible}$ (occasionally, the term may also be used as an adjective).

The $\preceq$ - $\textsf{height}$ of an element $x \in H$ is, on the other hand, the supremum of the set of all $n \in \mathbb N^+$ for which there are $\preceq$ -non-units $x_1, \ldots, x_n$ with $x_1 = x$ and $x_{i+1} \prec x_i$ for each $i \in [\![ 1, n-1 ]\!]$ , where $\sup \emptyset \,{:\!=}\, 0$ . Of course, x is a $\preceq$ -unit if and only if its $\preceq$ -height is zero; and is a $\preceq$ -quark if and only if its $\preceq$ -height is one (in general, there is not much we can say about the $\preceq$ -height of a $\preceq$ -irreducible).

The notions of $\preceq$ -[non-]unit, $\preceq$ -quark, $\preceq$ -irreducible, and $\preceq$ -height were introduced in [ Reference Tringali23 , definitions 3·6 and 3·11], while $\preceq$ -irreducibles of finite degree were first considered in [ Reference Cossu and Tringali11 , definition 3·1]. Note that a $\preceq$ -quark is $\preceq$ -irreducible, but the converse need not be true [ Reference Tringali23 , remark 3·7(4)].

Definition 2 1.

  1. (1) Given a premon $(H, \preceq\!)$ , an element $x \in H$ is $\preceq$ - $\textsf{artinian}$ if there is no (strictly) $\preceq$ -decreasing sequence $x_1, x_2, \ldots$ in H with $x_1 = x$ , and is $\textsf{strongly}$ $\preceq$ - $\textsf{artinian}$ if the $\preceq$ -height of x is finite.

  2. (2) The premon itself is then $\textsf{artinian}$ (resp., $\textsf{strongly artinian}$ ) if every $\preceq$ -non-unit is $\preceq$ -artinian (resp., strongly $\preceq$ -artinian); and k- $\textsf{locally}$ (resp., $\textsf{strongly}$ k-locally) $\textsf{artinian}$ , for a certain $k \in \mathbb N \cup \{\infty\}$ , if every $\preceq$ -non-unit is a finite product of k or fewer $\preceq$ -artinian (resp., strongly $\preceq$ -artinian) $\preceq$ -non-units.

  3. (3) An $\infty$ -locally (resp., strongly $\infty$ -locally) artinian premon will simply be called a $\textsf{locally}$ (resp., $\textsf{strongly locally}$ ) artinian premon; and we shall say that the monoid H is $\preceq$ -artinian, [strongly] locally $\preceq$ -artinian, etc., if the premon $(H, \preceq\!)$ is, resp., artinian, [strongly] locally artinian, etc.

The notions of $\preceq$ -artinianity and strong $\preceq$ -artinianity (as per Definition 2·1(2)) are equivalent to the homonymous notions introduced in [ Reference Tringali23 , definitions 3·8 and 3·11] and further studied in [ Reference Cossu and Tringali11,Reference Cossu and Tringali12 ]. The main novelty of this work lies in the idea of turning $\preceq$ -artinianity into an element-wise condition, inspired by an online talk by F. Gotti at the seminar of the Algebra and Number Theory research group of University of Graz in June 2022.

Remarks 2·2.

  1. (1) A 1-locally (resp., strongly 1-locally) artinian premon is nothing else than an artinian (resp., strongly artinian) premon, and it is fairly obvious that, for all $h, k \in \mathbb N \cup \{\infty\}$ with $h \le k$ , an h-locally (resp., strongly h-locally) artinian premon is also k-locally (resp., strongly k-locally) artinian. In particular, artinian premons are locally artinian. The converse need not be true, as shown by Grams’ counterexample in the basic case of the divisibility premon of a cancellative commutative monoid.

  2. (2) Fix $h, k \in \mathbb N_{\ge 2}$ , and let $X = \{x_0, x_1, \ldots\}$ and $Y = \{y_1, y_2, \ldots\}$ be disjoint, countably infinite sets and $\sigma$ be a (strictly) increasing function on $\mathbb N$ . Following [ Reference Tringali23 , section 2·3], we denote by H the quotient of the free monoid $\mathcal{F}(S)$ with basis $S \,{:\!=}\, X \cup Y$ by the smallest monoid congruence $R^\#$ containing the subset

    \[R \,{:\!=}\, \bigcup_{r \in \mathbb N} \{(x_{rh}, x_{rh+1} \ast \cdots \ast x_{rh+h}), (x_{rh}, \underbrace{y_{\sigma(rk)+1} \ast y_{\sigma(rk)+2} \ast \cdots \ast y_{\sigma(rk+k)}}_{\sigma(rk+k) - \sigma(rk) \textrm{ \scriptsize terms}})\}\]
    of $\mathcal{F}(S) \times \mathcal{F}(S)$ , where we denote by $\ast$ the operation (of word concatenation) in $\mathcal{F}(S)$ . Writing $\overline{\mathfrak{u}}$ for the congruence class modulo $R^\#$ of an S-word $\mathfrak{u}$ , it is clear that $\overline{z}$ is a $\mid_H$ -quark for every $z \in S \setminus \{x_0, x_h, x_{2h}, \ldots\}$ , while the $\mid_H$ -height of $\overline{x_{rh}}$ is infinite for each $r \in \mathbb N$ (here we use that $h, k \ge 2$ and hence $\sigma(rk+k) - \sigma(rk) \ge 2$ by the hypothesis that $\sigma$ is increasing). It is then a routine exercise to check that (i) if $h < k$ and $\sigma$ is the identity map on $\mathbb N$ , then the divisibility premon $(H, \mid_H\!)$ of H is strongly k-locally artinian but not h-locally artinian, and (ii) if the growth rate of $\sigma$ is superlinear (e.g., if $\sigma(n) \,{:\!=}\, n^2$ for all $n \in \mathbb N$ ), then $(H, \mid_H\!)$ is strongly locally artinian but not $k^\prime$ -artinian for any $k' \in \mathbb N^+$ (we leave the details to the reader).
  3. (3) Given a premon $\mathcal{H} = (H, \preceq\!)$ and an element $\bar{x} \in H$ , we put $\downarrow_{\mathcal{H}} \bar{x} \,{:\!=}\, \{x \in H \colon x \preceq \bar{x}\}$ and $\uparrow_{\mathcal{H}} \bar{x} \,{:\!=}\, \{x \in H \,{\colon}\, \bar{x} \preceq x\}$ . Similarly as in the case of a poset (see, e.g., [Reference Davey and Priestley14, p. 45]), we call $\downarrow_{\mathcal{H}} \bar{x}$ and $\uparrow_{\mathcal{H}} \bar{x}$ , resp., the $\textsf{principal}$ $\preceq$ - $\textsf{ideal}$ and the $\textsf{principal}$ $\preceq$ - $\textsf{filter}$ generated by $\bar{x}$ . Note that $\uparrow_{\mathcal{H}} \bar{x}$ is then a principal $\preceq^{\textrm{op}}$ -ideal and $\downarrow_{\mathcal{H}} \bar{x}$ is a principal $\preceq^{\textrm{op}}$ -filter, where $\preceq^{\textrm{op}}$ is the dual of the preorder $\preceq$ (i.e., $u \preceq^{\textrm{op}} v$ if and only if $v \preceq u$ ).

It is evident that, for all $y, z \in H$ , we have $y \preceq z$ if and only if $\downarrow_{\mathcal{H}} y \subseteq {\downarrow_{\mathcal{H}} z}$ , if and only if $\uparrow_{\mathcal{H}} z \subseteq {\uparrow_{\mathcal{H}} y}$ . It follows that an element $\bar{x} \in H$ is $\preceq$ -artinian if and only if there is no sequence $x_1, x_2, \ldots$ in H with $x_1 = \bar{x}$ and $\downarrow_{\mathcal{H}} x_{i+1} \subsetneq {\downarrow_{\mathcal{H}} x_i}$ (resp., $\uparrow_{\mathcal{H}} x_i \subsetneq {\uparrow_{\mathcal{H}} x_{i+1}}$ ) for all $i \in \mathbb N^+$ . This allows for an ideal-theoretic interpretation of the notions of $\preceq$ -artinianity and local $\preceq$ -artinianity introduced in Definition 2. Most notably, the principal $\mid_H$ -filter generated by $\bar{x}$ is the principal two-sided ideal $H\bar{x}H$ of the monoid H; whence H satisfies the ACCP if and only if it is $\mid_H$ -artinian (cf. [ Reference Tringali23 , remark 3·9(4)]).

We are going to show that local artinianity is a sufficient condition for a premon $(H, \preceq\!)$ to be $\textsf{factorable}$ in the sense of [ Reference Cossu and Tringali12 , definition 3·2(4)], i.e., for each $\preceq$ -non-unit to factor as a product of $\preceq$ -irreducibles (equivalently, we will say that the monoid H is $\preceq$ - $\textsf{factorable}$ ).

Lemma 2·3. Let $(H, \preceq\!)$ be a premon and s be either an integer $\ge 2$ or $\infty$ . Each $\preceq$ -artinian $\preceq$ -non-unit is then a product of $\preceq$ -irreducibles of degree s.

Proof. Let $\Omega$ be the set of all $\preceq$ -artinian $\preceq$ -non-units that do not factor as a product of $\preceq$ -irreducibles of degree s, and suppose for a contradiction that $\Omega$ is non-empty. It then follows from the well-foundedness of artinian preorders (see, e.g., [ Reference Tringali23 , remark 3·9(3)]) that $\Omega$ has a $\preceq$ -minimal element $\bar{x}$ . In particular, $\bar{x}$ is neither a $\preceq$ -unit nor a $\preceq$ -irreducible (because the elements of $\Omega$ are neither $\preceq$ -units nor products of $\preceq$ -irreducibles of degree s). Therefore, $\bar{x} = yz$ for some $\preceq$ -non-units $y, z \in H$ with $y \prec \bar{x}$ and $z \prec \bar{x}$ , and at least one of y and z is not a product of $\preceq$ -irreducibles of degree s (or else so would be $\bar{x}$ , which is absurd). But then either y or z is in $\Omega$ (note that y and z are $\preceq$ -artinian elements of H, since $\bar{x}$ is $\preceq$ -artinian and we have $y \prec \bar{x}$ and $z \prec \bar{x}$ ), contradicting that $\bar{x}$ is a $\preceq$ -minimal element of the same set.

The proof of the next result is now straightforward from Definition 2·1 and Lemma 2·3.

Theorem 2·4 If $(H, \preceq\!)$ is a locally artinian premon, then every $\preceq$ -non-unit factors as a product of $\preceq$ -irreducibles of degree s for all $s \in \mathbb N_{\ge 2} \cup \{\infty\}$ and, in particular, H is a $\preceq$ -factorable monoid.

In fact, Theorem 2·4 is a refinement of [ Reference Tringali23 , theorem 3·10] and the existence part of [ Reference Cossu and Tringali11 , theorem 3·4], where the local artinianity of the premon $(H, \preceq\!)$ is replaced by the stronger condition of artinianity (and, incidentally, only $\preceq$ -irreducibles of finite degree are being considered).

Corollary 2·5 Let $(H, \preceq\!)$ be a premon such that every $\preceq$ -irreducible is a $\preceq$ -quark or, more generally, has finite $\preceq$ -height. Then H is a $\preceq$ -factorable monoid if and only if it is locally $\preceq$ -artinian.

Proof. The “if” part is a consequence of Theorem 2·4. The “only if” part follows from considering that, if H is a $\preceq$ -factorable monoid and each $\preceq$ -irreducible has finite $\preceq$ -height, then the premon $(H, \preceq\!)$ is strongly artinian and hence locally artinian (as already noted in Remark 2·2(1)).

In the light of Remark 2·2(3), let us say that $\textsf{an element}$ x in a monoid H $\textsf{satisfies the ACCP}$ if there is no sequence $x_1, x_2, \ldots$ in H with $x_1 = x$ and $H x_i H \subsetneq Hx_{i+1} H$ for every $i \in \mathbb N^+$ . Cohn’s assertion that “a commutative domain R is atomic if and only if its multiplicative monoid $(R, \cdot\,)$ satisfies the ACCP” then amounts to the statement that $(R, \cdot\,)$ is atomic if and only if each element of R satisfies the ACCP. We are about to see that the truth is, in fact, not too far from Cohn’s (false) claim.

Corollary 2·6. An acyclic monoid is atomic if and only if it has a generating set whose elements all satisfy the ACCP.

Proof. Let H be an acyclic monoid. An element $x \in H$ is then a $\mid_H$ -unit if and only if it is a unit. On the other hand, we gather from [ Reference Tringali23 , corollary 4·4] that x is a $\mid_H$ -irreducible if and only if it is an (ordinary) atom, if and only if it is a $\mid_H$ -quark. It follows that H is atomic if and only if it is $\mid_H$ -factorable; and by Corollary 2·5, this is in turn equivalent to saying that H is locally $\mid_H$ -artinian. Hence every non-unit factors as a product of finitely many elements each of which satisfies the ACCP. Thus we are done, for it is obvious that units also satisfy the ACCP.

First introduced in [ Reference Tringali23 , definition 4·2], acyclic monoids abound in nature and provide an interesting alternative to cancellativity in the study of factorisation in a non-commutative setting. Apart from unit-cancellative commutative monoids, a number of non-commutative examples can be found in [ Reference Cossu and Tringali12 , examples 5·4]. In particular, we recall from the introduction that, for a monoid, being unit-cancellative and satisfying both the ACCPL and the ACCPR is equivalent to being acyclic and satisfying the ACCP.

Examples 2·7.

  1. (1) Let R be the subdomain of the univariate polynomial ring $\mathbb Q[X]$ over the rational field consisting of all polynomials whose constant term is an integer. We gather from the unnumbered example on p. 166 of [ Reference Chapman3 ] that R is a non-atomic domain. This gives us a chance to illustrate how the sufficient condition in Corollary 2·6 can fail in practice. In fact, let H be the multiplicative monoid of the non-zero elements of R and suppose for a contradiction that H has a generating set A each of whose elements satisfies the ACCP. Since X is in H and the only divisors of X in H are either integers or degree-one polynomials with zero constant term, it is clear that $qX \in A$ for some non-zero $q \in \mathbb Q$ (if the only generators in A that divide X were integers, then X would not belong to the submonoid generated by A). However, qX does not satisfy the ACCP (which is absurd), because $qX, {qX}/{2} , \ldots, {qX}/{2^i} , \ldots$ is a (strictly) $\mid_H$ -decreasing sequence (note that $q_1 X \mid_H q_2 X$ , for arbitrary $q_1, q_2 \in \mathbb Q$ , if and only if $q_2 = q_1 k$ for some $k \in \mathbb Z$ ).

  2. (2) Let $r = a/b$ be a positive rational number smaller than 1, with $a, b \in \mathbb N^+$ , $a \ge 2$ , and $\gcd(a,b) = 1$ . We have already mentioned in Sect. 1 that the submonoid H of $(\mathbb Q, +)$ generated by $1, r, r^2, \ldots$ is then an atomic monoid without the ACCP [ Reference Chapman, Gotti and Gotti5 , corollary 4·4]. In fact, it is readily checked that, for all $i \in \mathbb N$ ,

    \begin{equation*}ar^{i+1} < ar^i = (b-a)r^{i+1} + ar^{i+1} \in ar^{i+1} + H, \end{equation*}
    which shows that $a, ar, ar^2, \ldots$ is a (strictly) $\mid_H$ -decreasing sequence. Since H is a cancellative monoid, it follows that for an element $x \in H$ to be $\mid_H$ -artinian (i.e., to satisfy the ACCP) it is necessary that $x \notin ar^i + H$ for each $i \in \mathbb N$ . Interestingly, it turns out that the same condition is also sufficient.

To see why, suppose $x \ne 0$ (or else there is nothing to prove) and denote by $\textsf{L}_H(x)$ the set of all $n \in \mathbb N^+$ such that $x = a_1 + \cdots + a_n$ for some atoms $a_1, \ldots, a_n \in H$ . We have that $\textsf{L}_H(x) \ne \emptyset$ (note that the only unit of H is the identity $0 \in \mathbb Q$ ), and [ Reference Chapman, Gotti and Gotti4 , lemma 3·1(3)] yields that $|\textsf{L}_H(x)| = \infty$ if and only if $x \in ar^i + H$ for some $i \in \mathbb N$ . So, if $x \notin ar^i + H$ for every $i \in \mathbb N$ , then $\textsf{L}_H(x)$ is a non-empty finite subset of $\mathbb N^+$ , which implies at once that the $\mid_H$ -height of x is finite and hence x is $\mid_H$ -artinian.

Acknowledgements. The paper was written during a visit at University of Graz, by invitation of Laura Cossu, in June-December 2022. The visit was funded through the Marie Skodowska–Curie grant No. 101021791 from the European Union’s Horizon 2020 research and innovation programme. I am indebted to Laura for her financial support, to Pedro A. García–Sánchez (University of Granada) for his help with Example 22, to Daniel Smertnig (University of Graz) for his critical remarks, and to an anonymous referee for careful reading and many constructive comments.

References

Bell, J. P., Brown, K., Nazemian, Z. and Smertnig, D.. On noncommutative bounded factorisation domains and prime rings. J. Algebra 622 (May 2023), 404449.CrossRefGoogle Scholar
Boynton, J. G. and Coykendall, J.. An example of an atomic pullback without the ACCP. J. Pure Appl. Algebra 223 (2019), 619625.CrossRefGoogle Scholar
Chapman, S. T.. A tale of two monoids: a friendly introduction to nonunique factorisations. Math. Mag. 87 (2014), No. 3, 163–173.Google Scholar
Chapman, S. T., Gotti, F. and Gotti, M.. Factorisation invariants of Puiseux monoids generated by geometric sequences. Comm. Algebra 48 (2020), No. 1, 380–396.Google Scholar
Chapman, S. T., Gotti, F. and Gotti, M.. When is a Puiseux monoid atomic? Amer. Math. Monthly 128 (2021), No. 4, 302–321.Google Scholar
Cohn, P. M.. Free ideal rings. J. Algebra 1 (1964), 4769.CrossRefGoogle Scholar
Cohn, P. M.. Torsion modules over free ideal rings. Proc. London Math. Soc. III. Ser. 17 (1967), 577–599.CrossRefGoogle Scholar
Cohn, P. M.. Bezout rings and their subrings, Math. Proc. Camb. Phil. Soc. 64 (1968), No. 2, 251–264.Google Scholar
Cohn, P. M.. Unique factorisation domains. Amer. Math. Monthly 80 (1973), No. 1, 1–18.Google Scholar
Cohn, P. M.. Free Ideal Rings and Localisation in General Rings. New Math. Monogr. 3 (Cambridge University Press, 2006).CrossRefGoogle Scholar
Cossu, L. and Tringali, S.. Abstract factorization theorems with applications to idempotent factorisations. Israel J. Math., to appear (https://arxiv.org/abs/2108.12379).Google Scholar
Cossu, L. and Tringali, S.. Factorisation under local finiteness conditions. J. Algebra, to appear (https://arxiv.org/abs/2208.05869).Google Scholar
Coykendall, J. and Gotti, F.. On the atomicity of monoid algebras. J. Algebra 539 (2019), 138151.CrossRefGoogle Scholar
Davey, B. A. and Priestley, H. A.. Introduction to Lattices and Order (2nd edition). (Cambridge University Press, 2002).CrossRefGoogle Scholar
Fan, Y. and Tringali, S.. Power monoids: a bridge between factorisation theory and arithmetic combinatorics. J. Algebra 512 (Oct. 2018), 252–294.Google Scholar
Geroldinger, A. and Halter–Koch, F.. Non-Unique Factorisations. Algebraic, Combinatorial and Analytic Theory. Pure Appl. Math. 278 (Chapman and Hall/CRC: Boca Raton, FL, 2006).CrossRefGoogle Scholar
Geroldinger, A. and Zhong, Q.. Factorisation theory in commutative monoids. Semigroup Forum 100 (2020), 2251.CrossRefGoogle Scholar
Gilmer, R.. Commutative Semigroup Rings. Chicago Lect. Math. XII, 380 pp. (University of Chicago Press: Chicago, IL, 1984).Google Scholar
Gotti, F. and Li, B.. Atomic semigroup rings and the ascending chain condition on principal ideals. Proc. Amer. Math. Soc. 151 (2023), 2291–2302.Google Scholar
Grams, A.. Atomic rings and the ascending chain condition for principal ideals. Math. Proc. Camb. Phil. Soc. 75 (1974), No. 3, 321–329.Google Scholar
Howie, J. M.. Fundamentals of Semigroup Theory. London Math. Soc. Monogr. Ser. 12 (Oxford University Press, 1995).Google Scholar
Roitman, M.. Polynomial extensions of atomic domains. J. Pure Appl. Algebra 87 (1993), No. 2, 187–199.Google Scholar
Tringali, S.. An abstract factorisation theorem and some applications. J. Algebra 602 (July 2022), 352380.CrossRefGoogle Scholar
A. Zaks. Atomic rings without a.c.c. on principal ideals. J. Algebra 80 (1982), 223231.Google Scholar