Factorization Theory in Commutative Monoids
Alfred Geroldinger, Qinghai Zhong

TL;DR
This survey explores the structure and properties of various classes of monoids in factorization theory, focusing on their arithmetical finiteness properties and examples illustrating these concepts.
Contribution
It provides a comprehensive overview of factorization properties across multiple monoid classes, highlighting new examples and the boundaries of finiteness properties.
Findings
Descriptions of sets of lengths and their unions
Examples of monoids with and without finiteness properties
Analysis of catenary degrees in different monoid classes
Abstract
This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and the multiplicative monoids of domains (including Krull domains, rings of integer-valued polynomials, orders in algebraic number fields) and of their ideals. We offer examples for all these classes of monoids and discuss their main arithmetical finiteness properties. These describe the structure of their sets of lengths, of the unions of sets of lengths, and their catenary degrees. We also provide examples where these finiteness properties do not hold.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Commutative Algebra and Its Applications · Polynomial and algebraic computation
Factorization Theory in Commutative Monoids
Alfred Geroldinger and Qinghai Zhong
University of Graz, NAWI Graz
Institute for Mathematics and Scientific Computing
Heinrichstraße 36
8010 Graz, Austria
[email protected], [email protected] https://imsc.uni-graz.at/geroldinger, https://imsc.uni-graz.at/zhong
Abstract.
This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and the multiplicative monoids of domains (including Krull domains, rings of integer-valued polynomials, orders in algebraic number fields) and of their ideals. We offer examples for all these classes of monoids and discuss their main arithmetical finiteness properties. These describe the structure of their sets of lengths, of the unions of sets of lengths, and their catenary degrees. We also provide examples where these finiteness properties do not hold.
Key words and phrases:
commutative monoids, Krull monoids, transfer Krull monoids, factorizations, sets of lengths, catenary degrees
2010 Mathematics Subject Classification:
20M13, 20M14; 11B13, 11R27, 13A05, 13F05, 13F15
1. Introduction
Factorization theory emerged from algebraic number theory. The ring of integers of an algebraic number field is factorial if and only if it has class number one, and the class group was always considered as a measure for the non-uniqueness of factorizations. Factorization theory has turned this idea into concrete results. In 1960 Carlitz proved (and this is a starting point of the area) that the ring of integers is half-factorial (i.e., all sets of lengths are singletons) if and only if the class number is at most two. In the 1960s Narkiewicz started a systematic study of counting functions associated with arithmetical properties in rings of integers. Starting in the late 1980s, theoretical properties of factorizations were studied in commutative semigroups and in commutative integral domains, with a focus on Noetherian and Krull domains (see [40, 45, 62]; [3] is the first in a series of papers by Anderson, Anderson, Zafrullah, and [1] is a conference volume from the 1990s).
From these beginnings factorization theory branched out, step by step, into various subfields of algebra including commutative and non-commutative ring theory, module theory, and abstract semigroup theory and today is considered as a structure theory of the arithmetic of a broad variety of objects. In this survey, we discuss finitely generated monoids (including affine monoids), Krull monoids (including Krull and Dedekind domains), power monoids (including the set of finite nonempty subsets of the nonnegative integers with set addition as its operation), strongly primary monoids (including numerical monoids and local one-dimensional Noetherian domains), and weakly Krull monoids (including orders in algebraic number fields). The main aim of factorization theory is to describe the various phenomena of non-uniqueness of factorizations by arithmetical invariants and to study the interdependence of these invariants and the classical algebraic invariants of the underlying algebraic structures. We discuss three long-term goals (Problem A, Problem B, and Problem C) of this area.
It turns out that abstract semigroup theory provides a most suitable frame for the formulation of arithmetic concepts, even for studying factorizations in domains. A reason for this lies in the use of one of its main conceptual tools, transfer homomorphisms. Objects of interest are oftentimes studied via simpler objects and associated transfer homomorphisms , which allow one to pull back arithmetical properties from to (see Definition 4.4 and Proposition 4.5).
In Section 2 we present semigroups from ring theory (semigroups of ideals and of modules) and power monoids (stemming from additive combinatorics), and we introduce the arithmetical concepts discussed later in the paper (including sets of lengths and their unions, sets of distances, and catenary degrees). Theorem 3.1 in Section 3 gathers the main arithmetical finiteness results for finitely generated monoids. In the next sections, we present Krull monoids, transfer Krull monoids, and weakly Krull monoids. We offer examples of such monoids, discuss their arithmetical properties, show how some of them can be pulled back from finitely generated monoids (Theorem 5.5), and show that none of these arithmetical finiteness properties need to hold in general (Remark 5.7).
Various aspects of factorization theory could not be covered in this survey. These include factorizations in non-commutative rings and semigroups ([87]), factorizations in commutative rings with zero-divisors ([5]), the arithmetic of non-atomic, non-BF, and non-Mori domains ([8, 24, 25]), and factorizations into distinguished elements that are not irreducible (e.g., factorizations into radical ideals and others [33, 82, 76, 77, 20]).
2. Background on monoids and their arithmetic
We denote by the set of positive integers. For rational numbers , means the discrete interval between and . For subsets , denotes their sumset and, for every , is the -fold sumset of . The set of distances is the set of all for which there is such that . If , then denotes the elasticity of with the convention that if . If and , then a subset is called an almost arithmetical progression (AAP) with difference and bound if
[TABLE]
where is a shift parameter, is a nonempty arithmetical progression with difference such that , , and (with the convention that if is infinite).
2.1. Monoids.
Let be a multiplicatively written commutative semigroup. We denote by the group of invertible elements of . We say that is reduced if and we denote by the associated reduced semigroup of . The semigroup is said to be
- •
cancellative if and implies that ;
- •
unit-cancellative if and implies that .
By definition, every cancellative semigroup is unit-cancellative. If is a unit-cancellative semigroup, then we define, for two elements , that if there is such that . This is a congruence relation on and the monoid is the associated cancellative monoid of . If is cancellative, then denotes the quotient group of ,
- •
\widehat{H}=\{x\in\mathsf{q}(H)\colon\text{there is c\in Hcx^{n}\in Hn\in\mathbb{N}}\} is the complete integral closure of , and
- •
is the root closure (also called the normalization) of .
We say that is completely integrally closed if and that it is root closed (or normal) if . For a set , let denote the free abelian monoid with basis . Every has a unique representation in the form
[TABLE]
where is the -adic valuation of . We call the length of and the support of .
Throughout this paper, a monoid means a
commutative unit-cancellative semigroup with identity element.
Let be a monoid. For two elements we say that divides (we write ) if and if (equivalently, ), then and are called associated (we write ). The element is called irreducible (or an atom) if with implies that or . We denote by the set of atoms of . A submonoid is said to be divisor-closed if every divisor of some element lies in . A monoid homomorphism is a divisor homomorphism if and (in ) implies that (in ). If the inclusion is a divisor homomorphism, then is called a saturated submonoid of . For a subset we denote by
- •
the smallest submonoid of containing , and by
- •
the smallest divisor-closed submonoid of containing .
Clearly, is the set of all dividing some element . If , then we write and .
A subset is an -ideal if and is -Noetherian if satisfies the ACC (ascending chain condition) on -ideals. We denote by - the set of prime -ideals and by - the set of minimal nonempty prime -ideals. Suppose that is cancellative. For subsets , and A_{v}=\big{(}H\colon(H\negthinspace:\negthinspace A)\big{)} is the -ideal (or divisorial ideal) generated by . If , then is a divisorial ideal. The monoid is a Mori monoid (or -Noetherian) if it satisfies the ACC for divisorial ideals. If are divisorial ideals, then is the -product of and . We denote by the semigroup of divisorial ideals of (equipped with -multiplication) and by the subsemigroup of -invertible divisorial ideals. Clearly, is cancellative and if is a Mori monoid, then is a monoid and is a Mori monoid. For any undefined concepts in ideal theory we refer to [64].
The monoid is said to be finitely generated if there is a finite set such that . Every finitely generated monoid is -Noetherian and the converse holds if is cancellative ([64, Theorem 3.6]). A monoid is called affine if it is finitely generated and isomorphic to a submonoid of a finitely generated free abelian group (equivalently, a commutative semigroup is affine if it is reduced, cancellative, finitely generated, and its quotient group is torsion-free).
If not stated otherwise, then a ring means a commutative ring with identity element. Let be a ring. Then denotes the semigroup of regular elements, and is a cancellative monoid. Rings with the property that implies that or are called présimplifiable in [2]. Ring theory gives rise to the following classes of monoids that are of central interest in factorization theory.
Example 2.1** **(Monoids from ring theory).
- (Semigroups of ideals) Let be a commutative integral domain. We denote by its integral closure and by its complete integral closure. Further, let be the semigroup of nonzero principal ideals, be the semigroup of invertible ideals, be the semigroup of all nonzero ideals, and be the semigroup of nonzero fractional ideals, all equipped with usual ideal multiplication. Then , the group of units of , is the group of invertible fractional ideals and this is the quotient group of . Furthermore, , the inclusion is a cofinal divisor homomorphism, is a divisor-closed submonoid, the prime elements of are precisely the invertible prime ideals, and is the Picard group of . Suppose that is Noetherian. If with , then whence . Since satisfies Krull’s Intersection Theorem, it follows that . Thus is unit-cancellative whence a monoid in the present sense.
The above constructions generalize to monoids of -ideals for general ideal systems (the interested reader may want to consult [64, 65, 80]). In the present paper we restrict ourselves to usual ring ideals, to usual semigroup ideals (-ideals), and to divisorial ideals of monoids and domains. We use that the semigroup of divisorial ideals of (respectively the monoid of -invertible divisorial ideals of ) are isomorphic to the semigroup of divisorial ideals of (respectively to the monoid of -invertible divisorial ideals of ). In particular, is a Mori domain if and only if its monoid is a Mori monoid.
Atomic domains having only finitely many non-associated atoms are called Cohen-Kaplansky domains and they are characterized by each of the following equivalent properties ([7, Theorem 4.3]) :
- (a)
is finitely generated.
- (b)
is finitely generated.
- (c)
is finitely generated.
- (d)
is a semilocal principal ideal domain, is finite, and .
- (Semigroups of modules) Let be a not necessarily commutative ring and let be a class of right -modules that is closed under finite direct sums, direct summands, and isomorphisms. This means, whenever are -modules with , then lies in if and only if and lies in . Let be the set of isomorphism classes of (we tacitly assume that this is indeed a set) where the operation is induced by forming direct sums. Then is a reduced commutative semigroup. By a result of Bergman-Dicks ([14, Theorems 6.2 and 6.4] and [15, page 315]), every commutative reduced semigroup with for some is isomorphic to a semigroup of modules (indeed, one may take the class of finitely generated projective right -modules over a hereditary -algebra).
If each module in is Noetherian (or artinian), then it is a finite direct sum of indecomposable modules and hence is atomic. If the endomorphism rings are local for all indecomposable modules in , then direct sum decomposition is unique whence is free abelian (in other words, the Krull-Remak-Schmidt-Azumaya Theorem holds). A module is said to be directly finite (or Dedekind finite) if it is not isomorphic to a proper direct summand of itself ([58, 72]). Thus the semigroup is unit-cancellative (whence a monoid in the present sense) if and only if all modules in are directly finite. The idea, to look at direct-sum decomposition of modules, from the viewpoint of factorization theory was pushed forward by Facchini, Wiegand, et al (for a survey see [12]). We meet semigroups of modules again in Example 4.2.4.
We end this subsection with a class of monoids stemming from additive combinatorics.
Example 2.2** **(Power monoids).
Let be an additively written torsion-free monoid. The power monoid of is the set of all finite nonempty subsets of , endowed with set addition as operation (thus, if , then is the sumset of and ). Clearly, is a commutative semigroup and if is the identity element of , then is the identity element of . The subset , which consists of those finite nonempty subsets with , is a divisor-closed submonoid of , called the restricted power monoid of . Power monoids of monoids were introduced by Tringali et al. and studied in an abstract framework ([32, 9, 90]). For simplicity of presentation, we restrict ourselves to and to consisting of all finite nonempty subsets of containing [math]. Finite nonempty subsets of the (nonnegative) integers and their sumsets are the primary objects of study in arithmetic combinatorics ([89, 48, 61]).
2.2. Arithmetical concepts.
Let be a monoid. The free abelian monoid is the factorization monoid of and , defined by for all , is the factorization homomorphism of . For an element ,
- •
is the set of factorizations of , and
- •
is the set of lengths of .
Thus, if and only if and if and only if . Then
[TABLE]
is the system of sets of lengths of . The monoid is said to be
- •
atomic if for all (equivalently, every non-invertible element of can be written as a finite product of atoms of );
- •
factorial if for all ;
- •
half-factorial if for all ;
- •
a BF-monoid (bounded factorization monoid) if is finite and nonempty for all .
A monoid is factorial if and only if is free abelian. Every Mori monoid is a BF-monoid, every BF-monoid satisfies the ACC on principal ideals, and every monoid satisfying the ACC on principal ideals is atomic. The main focus of factorization theory is on BF-monoids and this will also be the case in the present paper. For any undefined notion we refer to [43].
Suppose that is a BF-monoid. Then and for any subset we define the following invariants describing the structure of . We denote by
[TABLE]
and by
[TABLE]
Then is called the elasticity of and we say that the elasticity is accepted if there is an with . For every ,
[TABLE]
and is the -th elasticity of . If , then we briefly set \Delta(H)=\Delta\bigl{(}\mathcal{L}(H)\bigr{)} and similarly for the other invariants. Thus, by definition, is half-factorial if and only if if and only if . Furthermore, if , then and .
In many settings unions of sets of lengths as well as sets of lengths have a well-defined structure. For their description we need the concept of an AAMP (almost arithmetical multiprogression). Let , and . A subset is called an AAMP with difference , period , and bound , if
[TABLE]
- •
is finite nonempty with and , and
- •
, , and .
Next we define a distance function on the set of factorizations . Two factorizations can be written in the form
[TABLE]
where and are such that . Then is the distance between and . If with , then
[TABLE]
if is cancellative. Let and . A finite sequence is called an -chain of factorizations if for all . Then is the smallest such that any two factorizations can be concatenated by an -chain. The set
[TABLE]
is the set of (positive) catenary degrees of and is the catenary degree of . If is not half-factorial, then the inequalities of (2.1) imply that
[TABLE]
if is cancellative.
3. Finitely generated monoids
By Redei’s Theorem, every finitely generated commutative semigroup is finitely presented. The idea to describe arithmetical invariants in terms of relations was pushed forward by Chapman and García-Sánchez ([22, 21] are the first papers in this direction). This point of view laid the foundation for the development of algorithms computing arithmetical invariants in finitely generated monoids (we refer to [38] for a survey, and to [37, 79] for a sample of further work in this direction). In particular, for numerical monoids there is a wealth of papers providing algorithms for determining arithmetical invariants and in some cases there are even precise values (formulas) for arithmetical invariants (in terms of the atoms or of other algebraic invariants; [26, 39]). A further class of objects, for which precise formulas for arithmetical invariants are available, will be discussed in Section 6.
Our first result summarizes the main arithmetical finiteness properties of finitely generated monoids. Its proof is (implicitly) based on Dickson’s Lemma stating that a subset of has only finitely minimal points.
Theorem 3.1** **(Arithmetic of finitely generated monoids).
Let be a monoid such that is finitely generated.
The set of catenary degrees and the set of distances are finite and . If is cancellative, then the elasticity is accepted and there is some such that ; moreover, is the only possible limit point of . 2. 2.
There is such that, for all , the unions are finite AAPs with difference and bound . 3. 3.
If is cancellative, then there is such that every is an AAMP with difference and bound .
Proof.
- Suppose that the set of catenary degrees is finite. Then (2.2) implies that the set of distances is finite. The elasticity is rational by [31, Proposition 3.4]. Now suppose in addition that is cancellative. Then the elasticity is accepted by [43, Theorem 3.1.4] (this does not hold true in general if is not cancellative). The claim on the structure of was proved in [95].
Now we show that the catenary degree is finite. We may assume that is reduced and we denote by the factorization homomorphism. We consider the submonoid
[TABLE]
and start with the following assertion.
- A.
The set
[TABLE]
is finite.
*Proof of *A. Assume to the contrary that is infinite. Then there exists a sequence with terms from such that and for distinct with . Since is saturated, we have for distinct with . For every , we define
[TABLE]
Then is an ascending chain of -ideals of . Since is finitely generated, every ascending chain of -ideals of is stationary (this proof uses Dickson’s Lemma). Thus there exists such that . Therefore for every with we have . By definition of , there is with such that , a contradiction to . ∎[Proof of A.]
We assert that
[TABLE]
It suffices to prove that for all and for all with , there exists an -chain concatenating and . Assume to the contrary that this does not hold and let be a counter example for which is minimal. Let with . If , then , a contradiction. Thus and hence there exists with such that . Then and imply that there exist an -chain concatenating and and an -chain concatenating and , a contradiction.
These finiteness results for finitely generated monoids give rise to a core question in the area.
Problem A. Take a class of distinguished objects (e.g., the class of Noetherian domains or the class Problem B. of Krull monoids). Provide an algebraic characterization of the objects in satisfying all Problem B. resp. some of arithmetical finiteness properties of finitely generated monoids.
There are such algebraic characterizations of arithmetical finiteness properties in the literature (e.g., the finiteness of the elasticity is characterized within the class of finitely generated domains in [70]; see also [71]). But Problem A addresses a field of problems, many of which are wide open. In this survey, we show that transfer Krull monoids of finite type satisfy the same arithmetical finiteness properties as given in Theorem 3.1 (Theorem 5.5) and we characterize the finiteness of unions of sets of lengths in the setting of weakly Krull monoids (Theorems 7.2 and 7.4). It is no surprise that none of the statements of Theorem 3.1 needs to hold true for general BF-monoids and Remark 5.7 gathers some most striking examples.
4. Krull monoids
Definition 4.1**.**
A monoid is a Krull monoid if it is cancellative and satisfies one of the following equivalent conditions .
- (a)
is a completely integrally closed Mori monoid. 2. (b)
has a divisor theory ; this means that is a divisor homomorphism such that for every there are with \alpha=\gcd\bigl{(}\partial(a_{1}),\ldots,\partial(a_{m})\bigr{)}. 3. (c)
has a divisor homomorphism into a free abelian monoid.
Let be a Krull monoid. Then the monoid is free abelian, and there is a free abelian monoid such that the inclusion is a divisor theory. Since divisor theories of a monoid are unique up to isomorphisms, the group
[TABLE]
depends only on and it is called the (divisor) class group of . Every is a subset of , is the set of prime divisors lying in , and is the set of classes containing prime divisors.
Example 4.2** **(Examples of Krull monoids).
-
Domains. A Noetherian domain is Krull if and only if it is integrally closed and the integral closure of any Noetherian domain is Krull (Theorem of Mori-Nagata). The property of being a Krull domain is a purely multiplicative one. Indeed, a domain is a Krull domain if and only if its multiplicative monoid of nonzero elements is a Krull monoid (this characterization generalizes to rings with zero-divisors, see [46, Theorem 3.5]). If is a Krull domain, then , where is the usual -class group of a Krull domain. If is a Dedekind domain, then .
-
Submonoids of domains. Since the composition of divisor homomorphisms is a divisor homomorphism, every saturated submonoid of a Krull domain is a Krull monoid. But also non-Krull domains may have submonoids that are Krull. We mention two classes of examples.
Let be an order in an algebraic number field with conductor . Then is the ring of integers of and is a submonoid. Moreover, is Krull and it is an example of a regular congruence monoid ([43, Section 2.11]).
Let be an integral domain with quotient field . Then is the ring of integer-valued polynomials. If is factorial, then the divisor-closed submonoid is a Krull monoid for every nonzero polynomial ([81]).
-
Normal affine monoids. Let be a reduced monoid. Then is normal and affine if and only if is a finitely generated Krull monoid, which holds if and only if it is isomorphic to the monoid of non-negative solutions of a system of linear diophantine equations ([43, Theorem 2.7.14]). Normal affine monoids and the associated monoid algebras play a crucial role in combinatorial commutative algebra ([17]).
-
Monoids of modules. Let be a not necessarily commutative ring, a class of -modules, and the semigroup of modules as introduced in Example 2.1.2. By a path breaking result of Facchini ([27, Theorem 3.4]), is a Krull monoid if the endomorphism rings are semilocal for all modules of (for modules having semilocal endomorphism rings see [28]). This result paved the way for studying direct-sum decomposition of modules with methods from the factorization theory of Krull monoids.
-
Monoids of zero-sum sequences. Let be an abelian group, a subset, and the free abelian monoid with basis . According to the tradition of additive combinatorics, elements of are called sequences over . If , then is the sum of and is called a zero-sum sequence if . The set is a submonoid (called the monoid of zero-sum sequences over ) and since the inclusion is a divisor homomorphism, is a Krull monoid. Suppose that is finite. Then is finitely generated and the converse holds if . Moreover, since is reduced and its quotient group is torsion-free, it is a normal affine monoid.
-
Analytic monoids. These are Krull monoids with finite class group and a suitable norm function that allows to establish a theory of -functions. Analytic monoids serve as a general frame for a quantitative theory of factorizations. Let be a divisor theory of and let be a norm. The goal of quantitative factorization theory is to study, for a given arithmetical property , the asymptotic behavior, for , of the associated counting function
[TABLE]
A systematic study of counting functions (in the setting of algebraic number fields) was initiated by Narkiewicz in the 1960s (we refer to the presentations in the monographs [73, Chapter 9], [43, Chapter 9]), and for recent work to [68]). Among others, the property that ”” was studied for every . Note that if and only if is irreducible whence counts the number of irreducibles with norm . The property that ” is an interval” deserves special attention. It turned out that almost all sets of lengths are intervals. More precisely, for the ring of integers in an algebraic number field we have ([43, Theorem 9.4.11])
[TABLE]
This result is in contrast to Theorem 5.6.3 demonstrating the variety of sets of lengths in Krull monoids with class group and should also be compared with Problem C. in Section 6.
Let be a Krull monoid, a divisor theory, an abelian group, and a family of cardinal numbers. We say that has characteristic if there is a group isomorphism such that for all .
Theorem 4.3** **(Structure and Realization Results for Krull monoids).
If is an abelian group, a family of cardinal numbers, , and , then the following statements are equivalent .**
- (a)
There exists a Krull monoid with characteristic . 2. (b)
* and for every .*
Moreover, two reduced Krull monoids are isomorphic if and only if they have the same characteristic. 2. 2.
For every Krull monoid there is a reduced Krull monoid with such that . 3. 3.
For every reduced Krull monoid there is an abelian group and a subset such that . 4. 4.
For every reduced Krull monoid there is a ring and a class of -modules such that .
Proof.
For 1. - 3. see [43, Sections 2.4 and 2.5] and for 4. see [29, Theorem 2.1]. ∎
Next we introduce transfer homomorphisms, a key tool in factorization theory (for transfer homomorphisms in more general settings see [11, 32]).
Definition 4.4**.**
A monoid homomorphism between atomic monoids is said to be a transfer homomorphism if the following two properties are satisfied.
- **(T 1) **
and . 2. **(T 2) **
If , and , then there exist such that , and .
Thus transfer homomorphisms are surjective up to units and they allow to lift factorizations. The next proposition shows that they allow one to pull back arithmetical information to the source monoid.
Proposition 4.5**.**
Let be a transfer homomorphism between atomic monoids.
For every we have \mathsf{L}_{H}(a)=\mathsf{L}_{B}\big{(}\theta(a)\big{)}. In particular, we have , , , and for all . 2. 2.
, where is the catenary degree in the fibres.
Proof.
-
It follows easily from the definition that \mathsf{L}_{H}(a)=\mathsf{L}_{B}\big{(}\theta(a)\big{)} for every (for a proof in the cancellative setting see [43, Proposition 3.2.3]). The remaining statements are an immediate consequence.
-
The proof runs along the same lines as in the cancellative setting ([43, Theorem 3.2.5]). ∎
Proposition 4.6**.**
Let be a reduced Krull monoid, be a free abelian monoid such that the inclusion is a cofinal divisor homomorphism. Let be the class group, denote the set of classes containing prime divisors, and let be the unique homomorphism such that for all .
For every , we have if and only if . 2. 2.
The restriction is a transfer homomorphism with .
Proof.
-
Let , where and . Since the inclusion is a divisor homomorphism, we have , whence if and only if .
-
By 1., we have whence is surjective and . To verify (T2), let be given with and . Suppose that with , say and with . Then 1. implies that , , and clearly . Thus is a transfer homomorphism. The inequality follows from [43, Proposition 3.4.8]. ∎
5. Transfer Krull monoids
Within the class of Mori monoids, Krull monoids are the ones whose arithmetic is best understood. Transfer Krull monoids need not be Krull but they have the same arithmetic as Krull monoids. They include all commutative Krull monoids, but also classes of not integrally closed Noetherian domains and of non-commutative Dedekind domains (see Example 5.4). We start with the definition, discuss some basic properties, and as a main structural result we show that for every cancellative transfer Krull monoid there is an overmonoid that is Krull such that the inclusion is a transfer homomorphism (Proposition 5.3.2).
Definition 5.1**.**
A monoid is said to be a transfer Krull monoid if one of the following two equivalent properties is satisfied .
- (a)
There exist a Krull monoid and a transfer homomorphism . 2. (b)
There exist an abelian group , a subset , and a transfer homomorphism .
Since is a Krull monoid by Example 4.2.5, Property (b) implies Property (a). Conversely, since every Krull monoid has a transfer homomorphism to a monoid of zero-sum sequences by Proposition 4.6 and since the composition of transfer homomorphisms is a transfer homomorphism, Property (a) implies Property (b). Thus Property (a) and Property (b) are equivalent. If satisfies Property (b) with a finite set , then is said to be transfer Krull of finite type. Since Krull monoids are BF-monoids, transfer Krull monoids are BF-monoids by Proposition 4.5.1, but they need neither be Mori nor be completely integrally closed.
Lemma 5.2**.**
Coproducts of transfer Krull monoids are transfer Krull. 2. 2.
Divisor-closed submonoids of transfer Krull monoids are transfer Krull. 3. 3.
Let be a cancellative monoid, be a transfer homomorphism to a reduced Krull monoid , be a submonoid, and . Then is a transfer homomorphism and is transfer Krull.
Proof.
- Let be a family of transfer Krull monoids and
[TABLE]
their coproduct. If is a family of transfer homomorphisms into the Krull monoids , then the homomorphism is a transfer homomorphism. Since the coproduct of Krull monoids is a Krull monoid, is a transfer Krull monoid.
-
Let be a transfer homomorphism to a reduced Krull monoid and let be a divisor-closed submonoid. Then the restriction is a transfer homomorphism, is a divisor-closed submonoid, and since divisor-closed submonoids of Krull monoids are Krull, the divisor-closed submonoid is a transfer Krull monoid.
-
Since localizations of Krull monoids are Krull, is a Krull monoid and hence it suffices to verify that is a transfer homomorphism. Since is surjective, we infer that is surjective. An elementary calculation shows that \Theta^{-1}\bigl{(}(T^{-1}B)^{\times}\bigr{)}=(S^{-1}H)^{\times}. Thus (T1) holds. In order to verify (T2), let , be such that , where , , , and . Let be such that and . Then
[TABLE]
Since is a transfer homomorphism, there are such that , , and . Thus we obtain that
[TABLE]
and hence (T2) holds. ∎
Proposition 5.3**.**
Let be a monoid and be the associated cancellative monoid.
* is a transfer Krull monoid if and only if there is a Krull monoid with such that the canonical map is a transfer homomorphism. If this holds, then , , and .* 2. 2.
Suppose that is cancellative. Then is a transfer Krull monoid if and only if there is a Krull monoid with such that the inclusion is a transfer homomorphism. If this holds, then , , and . 3. 3.
If are integral domains with , , , and , then the inclusion is a transfer homomorphism. If, in addition, is a Krull domain, then is a transfer Krull domain.
Proof.
- Clearly, if is a Krull monoid and is a transfer homomorphism, then is a transfer Krull monoid. Conversely, suppose that is a transfer Krull monoid and let be a transfer homomorphism, where is a reduced Krull monoid. For an element , we denote by the congruence class of . If such that , then whence . Thus induces a homomorphism , defined by for all . Since is a transfer homomorphism, it is easy to see is a transfer homomorphism.
If , then the homomorphism is a divisor homomorphism, whence is a Krull monoid. By construction, we have and thus .
To verify that is a transfer homomorphism, we first note that . Now let where with . Then there exists such that . Since is a transfer homomorphism, there exist such that and , . It follows that and , whence . Similarly, we get whence (T1) holds.
To verify (T2), let and be given such that . Then and hence there exist such that and , . It follows that and . Therefore is a transfer homomorphism.
- is a special case of 1. and for 3. we refer to [43, Proposition 3.7.5]. ∎
Example 5.4** **(Examples of transfer Krull monoids).
-
Since the identity map is a transfer homomorphism, every Krull monoid is a transfer Krull monoid. This generalizes to not necessarily commutative, but normalizing Krull monoids as studied in the theory of Noetherian semigroup algebras ([67, 41, 75]).
-
Every half-factorial monoid is transfer Krull. Indeed, let be half-factorial and let be the trivial group. Then , defined by for every and for every , is a transfer homomorphism.
-
Main examples of transfer Krull monoids stem from non-commutative ring theory whence they are beyond the scope of this article. Nevertheless, we mention one example and refer the interested reader to [10, 11, 87, 88] for more. Let be the ring of integers in an algebraic number field , a central simple -algebra, and a classical maximal -order of . Then is transfer Krull if and only if every stably free left -ideal is free, and if this holds then there is a transfer homomorphism for some finite abelian group ([86]).
-
The assumptions made in Proposition 5.3.3 hold true for -domains ([43, Proposition 3.7.4]). Further applications in the setting of seminormal weakly Krull monoids and domains are given in ([44, Proposition 4.6 and Theorem 5.8].
-
Module theory offers a wealth of non-cancellative finitely generated transfer Krull monoids. We discuss a simple example. Let be an additive Krull monoid with such that is the only relation among the atoms. Let be the free abelian monoid with basis modulo the relation generated by . By the Theorem of Bergman-Dicks (see Example 2.1.1), is isomorphic to a monoid of modules , where is a set of representatives of indecomposable modules in . Clearly, , defined by , , and , is a transfer homomorphism.
Theorem 5.5** **(Arithmetic of transfer Krull monoids).
Let be a transfer Krull monoid of finite type. Then and all arithmetical finiteness results of Theorem 3.1 hold.
Proof.
Let be a transfer homomorphism where is a finite subset of an abelian group. Since is finite, is finitely generated, whence the finiteness results of Theorem 3.1 hold for and they can be pulled back to by Proposition 4.5. The claim on follows from [55, Theorem 3.1]. ∎
Our next theorem shows that, for the class of finitely generated Krull monoids, the finiteness result for the set of distances and for the set of catenary degrees, as well as the structural result for sets of lengths (given in Theorems 3.1 and 5.5), are best possible.
Theorem 5.6** **(Realization Results).
For every finite nonempty subset there is a finitely generated Krull monoid with finite class group such that . 2. 2.
For every finite nonempty set with there is a finitely generated Krull monoid such that . 3. 3.
For every and every finite nonempty set there is a finitely generated Krull monoid with finite class group such that the following holds: for every AAMP L with difference and bound there is some such that for all .
Proof.
For 1. we refer to [30, Proposition 3.2], for 2. to [52], and for 3. see [83]. ∎
Remark 5.7**.**
Each of the following monoids respectively domains has the property that every finite nonempty subset of occurs as a set of lengths.
- •
(Frisch) The ring of integer-valued polynomials over ([34, 35]).
- •
(Kainrath) Krull monoids with infinite class group and prime divisors in all classes ([69] and [43, Theorem 7.4.1]).
The assumption, that every class contains a prime divisor, is crucial in Kainrath’s Theorem. Indeed, on the other side of the spectrum, there is the conjecture that every abelian group is the class group of a half-factorial Krull monoid (even of a half-factorial Dedekind domain; [56]). According to a conjecture of Tringali, the power monoid (and hence the monoid ) has the property that every finite nonempty subset of occurs as a set of lengths. This conjecture is supported by a variety of results such as \operatorname{\mathsf{Ca}}\big{(}\mathcal{P}_{{\text{\rm fin}},0}(\mathbb{N}_{0})\big{)}=\Delta\big{(}\mathcal{P}_{{\text{\rm fin}},0}(\mathbb{N}_{0})\big{)}=\mathbb{N} ([32, Theorem 4.11]).
Thus both extremal families,
[TABLE]
are systems of sets of lengths of BF-monoids. Clearly, every subset , that is the system of sets of lengths of a BF-monoid (i.e., ) with , has the following properties.
- (a)
and all other sets of lie in .
- (b)
For every there is with .
- (c)
If , then there is with .
This gives rise to the following realization problem.
Problem B. Which subsets satisfying Properties (a) - (c) can be realized as systems of sets Problem A. of lengths of a BF-monoid?
Note that every system with (a) - (c) and with satisfies the property ([31, Proposition 2.9]), which holds for all systems stemming from BF-monoids.
We end this section with a list of monoids and domains that are not transfer Krull and we will discuss such monoids in Section 7.
Example 5.8** **(Monoids and domains that are not transfer Krull).
-
According to Remark 5.7 a Krull monoid with infinite class group having prime divisors in all classes and have the same system of sets of lengths. Nevertheless, is not transfer Krull ([35]). Similarly, the monoid of polynomials having nonnegative integer coefficients is not transfer Krull ([18, Remark 5.4]).
-
and are reduced BF-monoids that have no transfer homomorphism to any cancellative monoid ([32, Proposition 4.12]).
-
Let be a finite group and let be the monoid of product-one sequences over . If is abelian, then is Krull by Example 4.2.5 and hence transfer Krull. Jun Seok Oh showed that is transfer Krull if and only if it is Krull if and only if is abelian ([74, Proposition 3.4]).
-
An additive submonoid of the nonnegative rational numbers (distinct from ) is transfer Krull if and only if it is isomorphic to ([59, Theorem 6.6]).
-
In Section 7 we show that strongly primary monoids and monoids of ideals of weakly Krull monoids are transfer Krull if and only if they are half-factorial (Lemma 7.1 and Proposition 7.3).
6. Transfer Krull monoids over finite abelian groups
In this section we discuss transfer Krull monoids having a transfer homomorphism , where is a finite abelian group. By Proposition 4.6, this setting includes Krull monoids with finite class groups having prime divisors in all classes. Rings of integers of algebraic number fields ([66, Corollary 4.4.3]), monoid algebras that are Krull ([19]), and many other Krull domains have finite class group and prime divisors in all classes. This is the reason why this setting has received the closest attention in factorization theory.
Let be a transfer Krull monoid over a finite abelian group , say with . It is usual to write instead of for all invariants we had. In particular, we set
[TABLE]
By Propositions 4.5 and 4.6, the arithmetical invariants of and of coincide (except for some trivial exceptions), whence and so on. The long term goal is to determine the precise value of these invariants in terms of the group invariants , which is done with methods from additive combinatorics. We refer to [48, Chapter 1] for a detailed discussion of the interplay of factorization theory in and additive combinatorics and to the survey [85] for the state of the art. We have a quick glance at this interplay, introduce a key combinatorial invariant, and present a main problem.
Since the group is finite, is finitely generated whence is finite, and the Davenport constant , defined as
[TABLE]
is a positive integer. The Davenport constant and the structure of atoms with play an important role in all arithmetical investigations. So we have, for example, and . It needs just a few lines to verify that , whence if is cyclic. If is a -group or has rank , then but this equality does not hold in general. The precise value of is unknown even for rank three groups and for groups of the form , where ([57]).
What do we know about ? It is easy to verify that
[TABLE]
[TABLE]
The above four groups are precisely the groups having Davenport constant . Apart from them, the systems are also written down explicitly for all groups with ([53]). Full descriptions of systems are hard to get, whence the focus of research is to get at least a good understanding for parameters controlling sets of lengths. We cite one result and this is in sharp contrast to Theorem 5.6.
Theorem 6.1**.**
Let be a finite abelian group.
Carlitz for every if and only if . 2. 2.
The unions are finite intervals for every . 3. 3.
The set of distances and the set of catenary degrees are finite intervals.
Proof.
-
If , then is factorial whence half-factorial. Conversely, suppose that . If with , then , , and are atoms of . Then and . If with , then , , and for . Then and .
-
and 3. The unions are intervals by [48, page 36] and 3. follows from [55, Theorem 4.1]. ∎
Suppose that . The minima of the sets can be expressed in terms of their maxima, and for the maxima we have the following. For every , , and (for all this and for more on see [85]). It is easy to see that and that . The maxima of and of are known only for very special classes of groups which includes cyclic groups ([85]).
To sum up our discussion so far, given a transfer Krull monoid over , arithmetical invariants of depend only on (in particular, ) and the goal is to describe them in terms of the group invariants. The associated inverse problem (known as the Characterization Problem) asks whether the system is characteristic for the group. More precisely, it reads as follows.
Problem C. Let be a finite abelian group with Davenport constant , and let be an abelian Problem C. group with . Are and isomorphic?
In spite of results stating that the typical set of lengths in is an interval (e.g., see (4.1)), the standing conjecture is that the exceptional sets of lengths in are characteristic for the group. In other words, the conjecture is that the above question has an affirmative answer and we refer to [49, 54, 94, 93] and to [84, Theorem 5.3] for recent progress. Clearly, all such studies require a detailed understanding of sets of lengths in terms of the group invariants of . We address one subproblem. For any BF-monoid and two elements the sumset is contained in but, in general, we do not have equality. This is the reason why, in general, the system , considered as a subset of , is not a submonoid. On the other hand, the explicit descriptions given in (6.1) and (6.2) show that , and are submonoids of . There is a characterization of all finite abelian groups for which is a submonoid, and in the following result we show that all of them are finitely generated.
Theorem 6.2**.**
Let be a finite abelian group. Then the following statements are equivalent :**
- (a)
* is a submonoid of .* 2. (b)
All sets of lengths in are arithmetical progressions. 3. (c)
* is cyclic of order or isomorphic to a subgroup of or isomorphic to a subgroup of .*
If these statements hold, then is a finitely generated submonoid of . More precisely, we have
* and is the unique prime element of .* 2. 2.
* and are the two prime elements of .* 3. 3.
* is a non-cancellative non-transfer Krull monoid with \mathcal{A}(\mathcal{L}(C_{4}))=\big{\{}\{1\},[2,3],[3,5],\{2,4\}\big{\}}.* 4. 4.
* is a non-cancellative non-transfer Krull monoid containing and with .* 5. 5.
* is a cancellative non-transfer Krull monoid with .*
Proof.
The equivalence of (a), (b), and (c) is proved in [50, Theorem 1.1], and we prove the Claims 1. - 5.
Claim 1. follows immediately from (6.1). To verify Claim 2, we observe that for we have whence (6.2) shows that and generate and clearly both elements are atoms. To verify that they are primes, let such that . This implies that and whence is factorial and and are primes.
In order to prove 3. and 4., we use the explicit description of and ([43, Theorem 7.3.2]). We have
- •
\mathcal{L}(C_{4})=\bigl{\{}y+k+1+[0,k]\,\colon\,y,\,k\in\mathbb{N}_{0}\bigr{\}}\,\cup\,\bigl{\{}y+2k+\{2\nu\colon\nu\in[0,k]\}\,\colon\,y,\,k\in\mathbb{N}_{0}\bigr{\}}.
- •
\mathcal{L}(C_{2}^{3})=\bigl{\{}y+(k+1)+[0,k]\,\colon\,y\in\mathbb{N}_{0},\ k\in[0,2]\bigr{\}}
\cup\ \bigl{\{}y+k+[0,k]\,\colon\,y\in\mathbb{N}_{0},\ k\geq 3\bigr{\}}\cup\bigl{\{}y+2k+\{2\nu\colon\nu\in[0,k]\}\,\colon\,y,\,k\in\mathbb{N}_{0}\bigr{\}}.
These descriptions show that . Let . Then . If is odd, then . If is even, then . If , then . Thus is generated by and all these elements are atoms. Since , we obtain that is not cancellative. Since is generated by , we obtain is generated by . It is easy to see that all these elements are atoms and as before we infer that is not cancellative.
Assume to the contrary that there is a transfer homomorphism , where is a Krull monoid. Then are atoms, whence , a contradiction. The same argument shows that is not transfer Krull.
It remains to prove Claim 5. By [51, Proposition 3.12], we have
[TABLE]
Let . Then , , and if , then . Thus is generated by and all these elements are atoms. To verify cancellativity, we use that all sets of lengths are intervals. Let such that and . Then and which imply that and . Therefore whence is cancellative.
Assume to the contrary that there is a transfer homomorphism , where is a subset of any abelian group. Since , we have that and for all . Therefore , a contradiction as and are distinct atoms. ∎
7. Weakly Krull monoids
In this section we study weakly Krull monoids and we start with primary monoids. Primary monoids are weakly Krull and localizations of weakly Krull monoids at minimal nonzero prime ideals are primary.
A monoid is primary if it is cancellative with and for every there is such that . The multiplicative monoid of a domain is primary if and only if is one-dimensional and local ([43, Proposition 2.10.7]). Additive submonoids of , called Puiseux monoids, have found a well-deserved attention in recent literature and are primary (provided that they are different from . Since primary monoids need not be atomic, we restrict to a class of primary monoids (called strongly primary) which are BF-monoids. A monoid is strongly primary if it is cancellative with and for every there is such that . We denote by the smallest having this property. Every primary Mori monoid is strongly primary. Thus numerical monoids are strongly primary and the multiplicative monoids of one-dimensional local Mori domains are strongly primary. An additive submonoid , with , is a BF-monoid and it is primary if and only if .
Our first lemma unveils that primary monoids and Krull monoids are very different, both from the algebraic as well as from the arithmetic point of view.
Lemma 7.1**.**
Let be a primary monoid.
* is a Krull monoid if and only if with .* 2. 2.
If is strongly primary, then is a BF-monoid. 3. 3.
Let be strongly primary. If is not half-factorial, then there is a such that for all with . In particular, is transfer Krull if and only if it is half-factorial.
Proof.
-
Suppose that is a Krull monoid. Then there is a free abelian monoid such that the inclusion is a divisor theory. Since is primary, it follows that for all . Since every is a greatest common divisor of elements from , it follows that . Since is completely integrally closed, it is equal to . Thus Theorem 4.3.2 implies that has the asserted form, and the converse implication is obvious.
-
We assert that every has a factorization into atoms and that . Let be given. If is not an atom, then there are such that . Proceeding by induction, we obtain a product decomposition of into non-units, say . If , then and hence divides a proper subproduct of , a contradiction. Thus has a product decomposition into atoms and the number of factors is bounded by .
-
The first claim follows from [53, Theorem 5.5]. Thus Theorem 5.5 and Example 5.4.2 imply the second statement. ∎
The arithmetic of various classes of strongly primary monoids, especially of numerical monoids, has found wide attention in the literature. We mention some striking recent results. O’Neill and Pelayo showed that for every finite nonempty subset there is a numerical monoid such that ([78]). It is an open problem whether there is a numerical monoid with prescribed sets of distances (see [23]). F. Gotti proved that there is a primary BF-submonoid of such that every finite nonempty set occurs as a set of lengths of (see [60, Theorem 3.6], and compare with Remark 5.7). Such an extreme phenomenon cannot happen if we impose a further finiteness condition, namely local tameness. Let be a cancellative atomic monoid. For an atom , the local tame degree is the smallest with the following property:
- If with , and , then there exists such that .
The monoid is locally tame if for all . If is finitely generated or a Krull monoid with finite class group, then is locally tame. Strongly primary monoids with nonempty conductor and all strongly primary domains are locally tame ([47]).
Our next result should be compared with Theorem 3.1, which gathered arithmetical finiteness properties of finitely generated monoids. The main difference is that unions of sets of lengths can be infinite. To give a simple example for this phenomenon, consider the additive monoid . Then is a locally tame strongly primary monoid, that is not finitely generated and for all .
Theorem 7.2** **(Arithmetic of strongly primary monoids).
Let be a locally tame strongly primary monoid.
The set of catenary degrees and the set of distances are finite. 2. 2.
There is such that, for all , the unions are AAPs with difference and bound . If , then all sets are finite if and only if is a valuation monoid. 3. 3.
There is such that every is a finite AAP with difference and bound .
Proof.
Now we consider the global case. Weakly Krull domains were introduced by Anderson, Anderson, Mott, and Zafrullah ([6, 4]). A pure multiplicative description and a divisor theoretic characterization are due to Halter-Koch ([63, 64]). A monoid is weakly Krull if it is cancellative,
[TABLE]
Note that is a primary monoid for all and a weakly Krull monoid is Krull if and only if is a discrete valuation monoid for all . A domain is weakly Krull if and only if is a weakly Krull monoid. The arithmetic of weakly Krull monoids is studied via transfer homomorphisms to -block monoids (see [43, Sections 3.4 and 4.5] for -block monoids and the structure of sets of lengths and [92, 91] for the structure of their unions). We cannot develop these concepts here whence we restrict to the monoid of their divisorial ideals whose arithmetic can be deduced easily from the local case.
For the remainder of this section we study the monoid of divisorial ideals of weakly Krull Mori monoids and the submonoid of -invertible divisorial ideals. Clearly, is a divisor-closed submonoid. Every one-dimensional Noetherian domain (in particular, every Cohen-Kaplansky domain) is a weakly Krull Mori domain and in that case we have . A domain is called divisorial (see [13]) if each nonzero ideal is divisorial (i.e., ). Note that one-dimensional Noetherian domains need not be divisorial.
Proposition 7.3**.**
Let be a weakly Krull Mori monoid.
* is a Mori monoid and it is transfer Krull if and only if it is half-factorial.* 2. 2.
If is transfer Krull, then is half-factorial. 3. 3.
If is an order in a quadratic number field, then is transfer Krull if and only if it is half-factorial.
Proof.
- By [44, Proposition 5.3], is a Mori monoid and
[TABLE]
Suppose that is transfer Krull. By Lemma 5.2, the divisor-closed submonoids , for all , are transfer Krull and hence they are half-factorial by Lemma 7.1.3. This implies that is half-factorial. Since all half-factorial monoids are transfer Krull, the reverse implication is obvious.
-
Since is a divisor-closed submonoid of , this follows from 1.
-
Let be an order in a quadratic number field. Then is weakly Krull Mori, is divisorial whence , and is half-factorial if and only if is half-factorial ([16, Theorem 1.1]. Thus the claim follows from 2. ∎
Proposition 7.3.1 shows that is transfer Krull only in the trivial case when it is half-factorial. This need not be true for the monoid itself. Indeed, there are weakly Krull Mori monoids (including orders in number fields) that are transfer Krull but not half-factorial ([44, Theorem 5.8]).
Theorem 7.4**.**
Let be a weakly Krull Mori monoid with . We set and .
The set of catenary degrees and the set of distances of are finite. 2. 2.
If there is such that for all and all , then there are such that, for all , the unions \mathcal{U}_{k}\bigl{(}\mathcal{I}_{v}^{*}(H)\bigr{)} are AAPs with difference \min\Delta\bigl{(}\mathcal{I}_{v}^{*}(H)\bigr{)} and bound . The sets \mathcal{U}_{k}\bigl{(}\mathcal{I}_{v}^{*}(H)\bigr{)} are finite for all if and only if the map --, defined by , is bijective. 3. 3.
There is such that every L\in\mathcal{L}\bigl{(}\mathcal{I}_{v}^{*}(H)\bigr{)} is an AAMP with difference d\in\Delta\bigl{(}\mathcal{I}_{v}^{*}(H)\bigr{)} and bound .
Proof.
Since the global conductor , the local conductors whence is a primary Mori monoid (whence strongly primary) with nonempty conductor (whence locally tame) for all . Since is a Mori monoid, the set is finite and is a discrete valuation monoid for all . Thus, by (7.1), we infer that
[TABLE]
-
This follows from Theorem 7.2.1 and from the structure of as given in (7.2).
-
We first note that if and are BF-monoids but not groups and , then
[TABLE]
[TABLE]
Let such that for all and all . We assert that for all . If , then . Otherwise, there is such that whence \rho_{k+1}(H_{1}\times H_{2})-\rho_{k}(H_{1}\times H_{2})\leq\bigl{(}\rho_{k+1-\nu}(H_{1})+\rho_{\nu}(H_{2})\big{)}-\bigl{(}\rho_{k-\nu}(H_{1})+\rho_{\nu}(H_{2})\bigr{)}=\rho_{k+1-\nu}(H_{1})-\rho_{k-\nu}(H_{1})\leq M^{\prime}.
By assumption, by (7.2), and by the argument above, we infer that \rho_{k+1}\bigl{(}\mathcal{I}_{v}^{*}(H)\bigr{)}-\rho_{k}\bigl{(}\mathcal{I}_{v}^{*}(H)\bigr{)}\leq M^{\prime} for all . This property and the finiteness of the set of distances imply that the set \mathcal{U}_{k}\bigl{(}\mathcal{I}_{v}^{*}(H)\bigr{)} have the asserted structure by [36, Theorem 4.2].
Equation (7.3) shows that the sets \mathcal{U}_{k}\bigl{(}\mathcal{I}_{v}^{*}(H)\bigr{)} are finite for all if and only if the sets \mathcal{U}_{k}\bigl{(}H_{\mathfrak{p}}\bigr{)} are finite for all and all . Let . Then is Krull and it is a valuation monoid if and only if it is a discrete valuation monoid. Thus, by Theorem 7.2.2, all sets \mathcal{U}_{k}\bigl{(}H_{\mathfrak{p}}\bigr{)} are finite if and only if all are discrete valuation monoids if and only if the map -- is bijective.
- By (7.2),
[TABLE]
Thus sets of lengths of are finite sumsets of sets of lengths of a free abelian monoid and of finitely many locally tame strongly primary monoids. Therefore, by Theorem 7.2.3, they are sumsets of AAPs and the claim follows by application of an addition theorem given in [43, Theorem 4.2.16]. The fact that the difference lies in \Delta\bigl{(}\mathcal{I}_{v}^{*}(H)\bigr{)} can be seen either from a direct argument or one uses [43, Theorem 4.5.4]. ∎
Acknowledgement. We would like to thank the reviewers for all their helpful comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D.D. Anderson (ed.), Factorization in Integral Domains , Lect. Notes Pure Appl. Math., vol. 189, Marcel Dekker, 1997.
- 2[2] D.D. Anderson and O.A. Al-Mallah, Commutative group rings that are présimplifiable or domainlike , J. Algebra Appl. 16 (2017), 9pp.
- 3[3] D.D. Anderson, D.F. Anderson, and M. Zafrullah, Factorization in integral domains , J. Pure Appl. Algebra 69 (1990), 1 – 19.
- 4[4] by same author, Atomic domains in which almost all atoms are prime , Commun. Algebra 20 (1992), 1447 – 1462.
- 5[5] D.D. Anderson and Sangmin Chun, Irreducible elements in commutative rings with zero-divisors , Houston J. Math. 37 (2011), 741 – 744.
- 6[6] D.D. Anderson, J. Mott, and M. Zafrullah, Finite character representations for integral domains , Boll. Unione Mat. Ital. 6 (1992), 613 – 630.
- 7[7] D.D. Anderson and J.L. Mott, Cohen-Kaplansky domains : integral domains with a finite number of irreducible elements , J. Algebra 148 (1992), 17 – 41.
- 8[8] P.N. Ánh, L. Márki, and P. Vámos, Divisibility theory in commutative rings: Bezout monoids , Trans. Am. Math. Soc. 364 (2012), 3967 – 3992.
