Geometric and combinatorial aspects of submonoids of a finite-rank free commutative monoid
Felix Gotti

TL;DR
This paper explores the geometric and combinatorial structure of certain submonoids of free commutative monoids, linking their algebraic properties to the geometry of their associated cones within finite-dimensional vector spaces.
Contribution
It provides a geometric characterization of divisor-closed submonoids and factorial properties of monoids in the class, connecting algebraic and geometric perspectives.
Findings
Submonoids from cone faces account for all divisor-closed submonoids.
Characterization of factorial and half-factorial monoids via cone geometry.
Classification of cones for various primary monoids and realization results.
Abstract
If is an ordered field and is a finite-rank torsion-free monoid, then one can embed into a finite-dimensional vector space over via the inclusion , where is the Grothendieck group of . Let be the class consisting of all monoids (up to isomorphism) that can be embedded into a finite-rank free commutative monoid. Here we investigate how the atomic structure and arithmetic properties of a monoid in are connected to the combinatorics and geometry of its conic hull . First, we show that the submonoids of determined by the faces of account for all divisor-closed submonoids of . Then we appeal to the geometry ofā¦
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.
Geometric and combinatorial aspects of submonoids
of a finite-rank free commutative monoid
Felix Gotti
Department of Mathematics
MIT
Cambridge, MA 02139
Abstract.
If is an ordered field and is a finite-rank torsion-free monoid, then one can embed into a finite-dimensional vector space over via the inclusion , where is the Grothendieck group of . LetĀ be the class consisting of all monoids (up to isomorphism) that can be embedded into a finite-rank free commutative monoid. Here we investigate how the atomic structure and arithmetic properties of a monoid in are connected to the combinatorics and geometry of its conic hull . First, we show that the submonoids of determined by the faces of account for all divisor-closed submonoids of . Then we appeal to the geometry of to characterize whether is a factorial, half-factorial, and other-half-factorial monoid. Finally, we investigate the cones of finitary, primary, finitely primary, and strongly primary monoids in . Along the way, we determine the cones that can be realized by monoids inĀ and by finitary monoids in .
Key words and phrases:
free commutative monoid, positive convex cone, finitary monoid, weakly finitary monoid, primary monoid, strongly primary monoid
2010 Mathematics Subject Classification:
Primary: 51M20, 20M13; Secondary: 20M14
Contents
1. Introduction
Let denote the class containing, up to isomorphism, each monoid that can be embedded into a finite-rank free commutative monoid. If is an ordered field and is a monoid in , then the chain of natural inclusions
[TABLE]
yields an embedding of into the finite-dimensional -vector space , where is the Grothendieck group of . Many connections between the algebraic properties of a finitely generated monoid in and the geometric properties of its cone in have been established in the past; see, for instance,Ā [5, PropositionsĀ 2.16, 2.36, 2.37, andĀ 2.40]. However, it seems that the search for similar connections for the non-finitely generated monoids in has only received isolated attention. In this paper we bring to the reader an initial systematic study of the connection between both arithmetic and atomic aspects of monoids in and both the geometry of and the combinatorics of the face lattice of . Here we primarily focus on the non-finitely generated members of .
As we proceed to illustrate, various subclasses of consisting of non-finitely generated monoids have appeared in the literature of commutative algebra and algebraic geometry. For example, semigroups of values of singular curves were first studied by Delgado inĀ [16], and then generalized by Barucci, DāAnna, and Frƶberg inĀ [3] under the term āgood semigroupsā. Good semigroups are monoids in that are not, in general, finitely generated (see ExampleĀ 3.3). On the other hand, for a cofinite submonoid of and , let be the monoid consisting of all arithmetic progressions of step size that are contained in . Monoids parameterized by the set of pairs are members of known as Leamer monoids. The atomic structure of Leamer monoids is connected to the Huneke-Wiegand Conjecture (see ExampleĀ 3.4 for more details). Finally, let and be two positive irrational numbers such that , and consider the submonoid of that results from intersecting and the cone in the first quadrant of determined by the lines and . The monoids , which clearly belong to , show up in the study of Betti tables of short Gorenstein algebras (see ExampleĀ 3.5).
It follows immediately that the conic hulls of the monoids and are not polyhedral cones in because they are not closed with respect to the Euclidean topology. Then Farkas-Minkowski-Weyl Theorem ensures that the monoids and cannot be finitely generated. Just as we did right now, we shall be using Farkas-Minkowski-Weyl Theorem systematically throughout this paper since it is the crucial tool guaranteeing that most of the monoids in we will be focused on cannot be finitely generated.
A cancellative commutative monoid is called atomic if each non-invertible element factors into irreducibles. Note that all monoids in are atomic. As for integral domains, a monoid is called a UFM (or a unique factorization monoid) provided that each non-invertible element has an essentially unique factorization into irreducibles. Any UFM is clearly atomic. A huge variety of atomic conditions between being atomic and being a UFM have been considered in the literature, including half-factoriality, other-half-factoriality, being finitary, and being strongly primary. In this paper, we investigate all the mentioned intermediate atomic conditions for members ofĀ in terms of the cones they generate.
Let be an atomic monoid. Then is called an HFM (or a half-factorial monoid) if for each non-invertible , any two factorizations of have the same number of irreducibles (counting repetitions). On the other hand, is called an OHFM (or an other-half-factorial monoid) if for each non-invertible no two essentially distinct factorizations ofĀ contain the same number of irreducibles (counting repetitions). Also,Ā is called primary if it is nontrivial and for all nonzero non-invertible there exists such that . If belongs to , then is called finitary if there exist a finite subset of and a positive integer such that .
The rest of this paper is structured as follows. In SectionĀ 2 we review the main concepts in commutative monoids and convex geometry we will need in later sections. In SectionĀ 3.3 we present some preliminary results about monoids in and their cones. The main result in this section is TheoremĀ 3.14, where we determine the cones generated by monoids in . In SectionĀ 4 we study the submonoids of a monoid in determined by the faces of , which we call face submonoids. The most important result we achieve in this section is TheoremĀ 4.5, where face submonoids are characterized; such a characterization allows us to deduce a characterization of the cones of primary monoids in , which was previously obtained inĀ [29]. Then in SectionĀ 5 we offer geometric characterizations for the UFMs, HFMs, and OHFMs ofĀ ; we do this in TheoremsĀ 5.1,Ā 5.4, andĀ 5.10, respectively. Lastly, SectionĀ 6 is devoted to study the cones of primary monoids and finitary monoids. The main results in this section are TheoremĀ 6.4, which states that if a monoid in is finitely primary, then the closure of the cone it generates (when ) is a rational simplicial cone, and TheoremĀ 6.8, which states that a monoid in is finitary provided that the cone it generates is polyhedral.
2. Atomic Monoids and Convex Cones
In this section we introduce most of the relevant concepts related to commutative semigroups and convex geometry required to follow the results presented later. General references for any undefined terminology or notation can be found inĀ [39] for commutative semigroups, inĀ [27] for atomic monoids, and inĀ [48] for convex geometry.
2.1. General Notation
Set . If , then we let denote the interval of integers between and , i.e.,
[TABLE]
Clearly, is empty when . In addition, for and , we set
[TABLE]
and we use the notation in a similar way. Lastly, if for some , then we set .
2.2. Atomic Monoids
A monoid is commonly defined in the literature as a semigroup along with an identity element. However, we shall tacitly assume that all monoids here are also commutative and cancellative, omitting these two attributes accordingly. As we only consider commutative monoids, unless otherwise specified we will use additive notation. In particular, the identity element of a monoid will be denoted by [math], and we let denote the set . A monoid is called reduced if its only invertible element is the identity element. Unless we state otherwise, monoids here are also assumed to be reduced.
Let be a monoid. We write when is generated by a set , i.e., and no proper submonoid of contains . If can be generated by a finite set, thenĀ is said to be finitely generated. An element is called an atom if for each pair of elements the equation implies that either or . The set consisting of all atoms of is denoted by . It immediately follows that
[TABLE]
Since is reduced, will be contained in each generating set of . However, may not generate : for instance, taking to be the submonoid of generated by one can see that and, therefore, does not generate . If generates , then is said to be atomic. From now on, all monoids addressed in this paper are assumed to be atomic. For , we say that divides in and write provided that for some . An element is said to be prime if whenever for some either or . The monoid is called a UFM (or a unique factorization monoid) if each nonzero element can be written as a sum of primes (in which case such a sum is unique up to permutation). Clearly, every prime element of is an atom. Thus, ifĀ is a UFM, then it is, in particular, an atomic monoid.
A subset of is called an ideal if (or, equivalently, ). An ideal is principal if for some . Furthermore, satisfies the ACCP (or the ascending chain condition on principal ideals) provided that each increasing sequence of principal ideals ofĀ eventually stabilizes. It is well known that each monoid satisfying the ACCP is atomic [27, PropositionĀ 1.1.4]. Gramās monoid, introduced inĀ [38], is an atomic monoid that does not satisfy the ACCP.
For the monoid there exist an abelian group and a monoid homomorphism such that any monoid homomorphism , where is an abelian group, uniquely factors through . The group , which is unique up to isomorphism, is called the Grothendieck group111The Grothendieck group of a monoid is often called the difference or the quotient group depending on whether the monoid is written additively or multiplicatively. of . The monoid is torsion-free if for all and the equality implies that . A monoid is torsion-free if and only if its Grothendieck group is torsion-free (see [5, SectionĀ 2.A]). IfĀ is torsion-free, then the rank ofĀ , denoted by , is the rank of the -module , that is, the dimension of the -space .
A multiplicative monoid is said to be free on a subset of provided that each element can be written uniquely in the form
[TABLE]
where and only for finitely many . It is well known that for each set , there exists a unique (up to isomorphism) monoid such that is a free (commutative) monoid on . For the monoid , we let denoted the free (commutative) monoid on , and we call the elements of factorizations. If is a factorization in for some and , thenĀ is called the length of and is denoted by . There is a unique monoid homomorphism satisfying that for all . For each the set
[TABLE]
is called the set of factorizations of . In addition, for we set
[TABLE]
Observe that is atomic if and only if is nonempty for all (notice that ). ByĀ [27, TheoremĀ 1.2.9], is a UFM if and only if for all . The monoid is called an FFM (or a finite factorization monoid) if for all . For each , the set of lengths of is defined by
[TABLE]
The sets of lengths of submonoids of , where , have been considered inĀ [34]. If for all , then is called a BFM (or a bounded factorization monoid). Clearly, each FFM is a BFM. In addition, each BFM satisfies the ACCP (see [27, CorollaryĀ 1.3.3]).
The monoid is called finitary if it is a BFM and there exist a finite subset of and such that . Clearly, finitely generated monoids are finitary. On the other hand, is called primary provided that is nontrivial and for all there exists such that . If is both finitary and primary, then it is called strongly primary.
A numerical monoid is a cofinite submonoid of . Each numerical monoid is finitely generated and, therefore, atomic. In addition, it is not hard to see that numerical monoids are strongly primary. An introduction to numerical monoids can be found inĀ [22]. The class of finitely generated submonoids of naturally generalizes that one of numerical monoids. Although members of the former class are obviously finitary, they need not be strongly primary; indeed, numerical monoids are the only primary monoids in this class (see PropositionĀ 6.1). However, we shall see later that there are many non-finitely generated submonoids of that are primary. In addition, we will provide necessary and sufficient conditions for a submonoid of to be finitary.
2.3. Convex Cones
For the rest of this section, fix . As usual, for we let denote the Euclidean norm ofĀ . We always consider the space endowed with the topology induced by the Euclidean norm. In addition, if is an ordered field such that , we let the vector space inherit the topology ofĀ . For a subset ofĀ , we let , , and denote the interior, closure, and boundary ofĀ , respectively.
Let be an ordered field, and let be a -dimensional vector space over for some . When , we denote the standard inner product of by , that is, for all and in . The convex hull of (i.e., the intersection of all convex subsets of containing ) is denoted by . A nonempty convex subset of is called a cone if is closed under linear combinations with nonnegative coefficients. A cone is called pointed if . Unless otherwise stated, we assume that the cones we consider here are pointed. If is a nonempty subset of , then the conic hull of , denoted by , is defined as follows:
[TABLE]
i.e., is the smallest cone in containing . When there is no risk of ambiguity, we write instead of . A cone in is called simplicial if it is the conic hull of a linearly independent set of vectors.
Let be a cone in . A face ofĀ is a cone contained in and satisfying the following condition: for all the fact that intersects the open line segment implies that both and belong to . If is a face of and is a face of , then it is clear that must be a face of . For a nonzero vector , consider the hyperplane , and denote the closed half-spaces and by and , respectively. If a coneĀ satisfies that (resp., ), then is called a supporting hyperplane ofĀ andĀ (resp., ) is called a supporting half-space of . A face of is called exposed if there exists a supporting hyperplane of such that .
The cone is called polyhedral provided that it can be expressed as the intersection of finitely many closed half-spaces. Farkas-Minkowski-Weyl Theorem states that a convex cone is polyhedral if and only if it is the conic hull of a finite setĀ [11, SectionĀ 1]. It is clear that every simplicial cone is polyhedral. When , a cone inĀ is called rational if it is the conic hull of vectors with integer coordinates. Gordanās Lemma states that if is a rational polyhedral cone in and is a subgroup of , then is finitely generatedĀ [5, Lemma 2.9].
A subset of is called an affine set (or an affine subspace) provided that for all with , the line determined by and is contained in . Affine sets are translations of subspaces, and an -dimensional affine set is called an affine hyperplane. The affine hull of a subset of , denoted by , is the smallest affine set containingĀ . In addition, we let denote the smallest subspace of containing . Clearly, . Let be also a finite-dimensional vector space overĀ , and let andĀ be cones in andĀ , respectively. Then andĀ are called affinely equivalent if there exists an invertible linear transformation from to mapping ontoĀ . When is an intermediate field of the extension , the relative interior of , denoted by , is the Euclidean interior of when considered as a subset of . If is a cone in , then is the disjoint union of all the relative interiors of its nonempty facesĀ [48, TheoremĀ 18.2].
3. Monoids in and Their Cones
3.1. Monoids in the Class
In this section we introduce the class of monoids we shall be concerned with throughout this paper. We also introduce the cones associated to such monoids.
Proposition 3.1**.**
For a monoid , the following statements are equivalent.
- (a)
The monoid can be embedded into a finite-rank free (commutative) monoid. 2. (b)
The monoid has finite rank and can be embedded into a free (commutative) monoid. 3. (c)
There exists such that can be embedded in as a maximal-rank submonoid.
Proof.
(a) (b): Suppose that is a free (commutative) monoid of finite rank containing , and assume that . Then one can consider as a -submodule of . Since is a finite-rank -module, so is . HenceĀ has finite rank, which yieldsĀ (b).
(b) (a): To argue this implication, let be a set such that is embedded into the free (commutative) monoid . After identifying with its image, we can assume that and identify with a subgroup of containing . Since , the dimension of the subspace of generated by is finite. Let be a basis of for some . For each there exists a finite subset of such that . As a result, , where . Then one finds that
[TABLE]
Because , the monoid is a free (commutative) monoid of finite rank containing , and soĀ (1) holds.
(c) (a): It follows trivially.
(a) (c): To prove this last implication, letĀ be a monoid of rank , and suppose that is a submonoid of a free (commutative) monoid of rankĀ for some . There is no loss of generality in assuming that is a submonoid of . LetĀ be the subspace of generated byĀ . Since , the subspace has dimensionĀ . Now consider the submonoid of . As is the intersection of the rational cone and the lattice , it follows from Gordanās Lemma that is finitely generated. On the other hand, guarantees that . Since is a finitely generated submonoid of of rankĀ , it follows fromĀ [5, PropositionĀ 2.17] that is isomorphic to a submonoid of . This, in turn, implies that is isomorphic to a submonoid of , which concludes our argument. ā
As we are interested in studying monoids satisfying the equivalent conditions of PropositionĀ 3.1, we introduce the following notation.
Notation: Let denote the class consisting of all monoids (up to isomorphism) satisfying the conditions in PropositionĀ 3.1. In addition, for every , we set
[TABLE]
A monoid is affine if it is isomorphic to a finitely generated submonoid of the free abelian group for some . The interested reader can find a self-contained treatment of affine monoids inĀ [5, PartĀ 2]. Clearly, the class contains a large subclass of affine monoids. Computational aspects of affine monoids and arithmetic invariants of half-factorial affine monoids have been studied inĀ [21] andĀ [20], respectively. Diophantine monoids form a special subclass of that one consisting of affine monoids; Diophantine monoids have been studied inĀ [9]. Monoids in of small rank were recently investigated inĀ [13]. Some other special subclasses of have been previously considered in the literature as they naturally arise in the study of algebraic curves, toric geometry, and homological algebra. Here we offer some examples.
Example 3.2**.**
If is a finitely primary monoid (see definition in SubsectionĀ 6.2), then is primary and satisfies that [27, TheoremĀ 2.9.2]. Hence contains all finitely primary monoids. The class of finitely primary monoids contains no (nontrivial) finitely generated monoids.
Example 3.3**.**
Good semigroups, which also form a subclass of , were first studied inĀ [16] under the name āsemigroup of valuesā in the context of singular curves and then generalized inĀ [3], where the term āgood semigroupā was coined. Good semigroups are submonoids of that naturally generalize semigroups of values of an algebraic curve in the sense that monoids on both classes satisfy certain common āgoodā properties. For instance, the semigroup of values of the commutative ring
[TABLE]
is represented in FigureĀ 1.
As is finite, the affine line ofĀ contains infinitely many atoms ofĀ . Hence the good semigroupĀ is not finitely generated (for more details on this example, seeĀ [4, pageĀ 8]). In addition, it has been verified inĀ [3, ExampleĀ 2.16] that the good semigroup with underlying set
[TABLE]
is not the semigroup of values of any algebraic curve. Good semigroups have received substantial attention since they were introduced; see for exampleĀ [3, 4, 17], and seeĀ [18, 45] for more recent studies.
A subclass of non-finitely generated monoids in naturally shows in connection with the Huneke-Wiegand conjecture.
Example 3.4**.**
From the structure theorem for modules over a PID, one obtains that if is a -dimensional integrally-closed local domain andĀ is a finitely generated torsion-free -module, thenĀ is free if and only if is torsion-free. In the same direction, Huneke and Wiegand claimed inĀ [43, pages 473ā474] that ifĀ is a -dimensional Gorenstein domain andĀ is a nonzero finitely generated non-projective -module, then has a nontrivial torsion submodule (this is known as the Huneke-Wiegand Conjecture). Given a numerical monoid and , consider the set
[TABLE]
which parameterizes all arithmetic progressions of step size contained in the monoidĀ . Clearly, is a submonoid of ; it is called the Leamer monoid of of step size . FigureĀ 2 shows the Leamer monoid of the numerical monoid of step size .
The atomic structure of Leamer monoids is connected to the Huneke-Wiegand Conjecture viaĀ [19, CorollaryĀ 7]. Leamer monoids are non-finitely generated [40, LemmaĀ 2.8] rank- monoids contained in the classĀ . Arithmetic properties of Leamer monoids have been studied inĀ [40] and, more recently, inĀ [10].
The following example has been kindly provided by Roger Wiegand and should appear in the forthcoming manuscriptĀ [2].
Example 3.5**.**
Let and be two positive irrational numbers such that , and consider the monoid defined as follows:
[TABLE]
Farkas-Minkowski-Weyl Theorem guarantees that is not finitely generated and, therefore, . In addition, is a primary FFM (see PropositionĀ 5.8 and PropositionĀ 6.1). The sequence of monoids obtained by setting
[TABLE]
shows up in the study of Betti tables of short Gorenstein algebras. In an ongoing project, Avramov, Gibbons, and Wiegand have proved that for each ,
[TABLE]
where is an automorphism of and . This suggests the following question.
Question 3.6**.**
For any irrational (or irrational and algebraic) numbers and with , can we generalize ExampleĀ 3.5 to describe the set of atoms of ?
3.2. The Cones of Monoids in
Let be an ordered field. We say that a monoidĀ is embedded into a vector space over if is a submonoid of the additive groupĀ . As mentioned in the introduction, a monoid in can be embedded into the finite-dimensional -vector space via
[TABLE]
where the flatness of as a -module ensures the injectivity of the second homomorphism. Thus, one can always think of a monoid in being embedded into and, therefore, one can refer to the conic hull of .
Let be a finite-dimensional vector space over . A cone inĀ is called positive with respect to a basis of provided that each can be expressed as a nonnegative linear combination of the vectors in . When for some , we say that is positive in (without specifying any basis) if is a positive cone with respect to the basis consisting of the canonical vectors .
Lemma 3.7**.**
Let be a finite-dimensional vector space over an ordered field , and let be a monoid in embedded into . Then there exists a basis of such that is positive with respect toĀ .
Proof.
Set . Since is in , PropositionĀ 3.1 guarantees the existence of a submonoid of and a monoid isomorphism . Extending to the Grothendieck groups of and , and then tensoring with the -module , we obtain a linear transformation that extends . It is clear that . Because is a positive cone in , it follows that is positive in with respect to the basis . Finally, extending the basis to a basis of one obtains that is positive in with respect to . ā
The cones of monoids in are pointed, as we argue now.
Proposition 3.8**.**
Let be a finite-dimensional vector space over an ordered field , and let be a monoid in embedded into . The following statements hold.
- (1)
The cone is pointed. 2. (2)
If is an intermediate field of the extension , then the cone is pointed.
Proof.
To argueĀ (1) suppose, without loss of generality, that . By LemmaĀ 3.7 there exists a basis of such that . Clearly, is a simplicial cone and, therefore, it does not contain any one-dimensional subspace of . This implies that does not contain any one-dimensional subspace of , and so is pointed.
To argueĀ (2) we first notice that (with notation as in the previous paragraph) is a closed cone of containing . So . As observed in the previous paragraph, the fact that is pointed forces to be pointed. ā
A lattice is a partially ordered set , in which every two elements have a unique join (i.e., least upper bound) and a unique meet (i.e., greatest lower bound). The latticeĀ is complete if each has both a join and a meet. Two complete lattices are isomorphic if there exists a bijection between them that preserves joins and meets. For background information on (complete) lattices and lattice homomorphisms, seeĀ [15, ChapterĀ 2].
Let be a finite-dimensional vector space over an ordered field . For a cone inĀ , the set of faces ofĀ , denoted by , is a complete lattice (under inclusion)Ā [48, pageĀ 164], where the meet is given by intersection and the join of a given set of faces is the smallest face in containing all of them. The lattice is called the face lattice of . Two cones and are combinatorially equivalent provided that their face lattices are isomorphic.
It turns out that the combinatorial and geometric structures of do not depend on the embedding proposed inĀ (3.1).
Proposition 3.9**.**
Let and be finite-dimensional vector spaces over an ordered field , and let and be isomorphic monoids in embedded into and , respectively. The following statements hold.
- (1)
The cone is affinely equivalent to the cone . 2. (2)
The cone is combinatorially equivalent to the cone . 3. (3)
The cone is homeomorphic to the cone when .
Proof.
For cones, being affinely equivalent, being combinatorially equivalent, and being homeomorphic are all equivalence relations. Hence it suffices to argue the proposition assuming that is a submonoid of and that for some .
Since , we can further assume that . Let be a monoid isomorphism. Extending to the Grothendieck groups of and , and then tensoring with the -module , one obtains a linear transformation that extends . Since is a flat -module, is trivial and, therefore, is an injective linear transformation satisfying that
[TABLE]
As a consequence, the cones and are affinely equivalent, from whichĀ (1) follows.
To argueĀ (2) it suffices to observe that because the map is a linear bijection taking onto , the assignment for any face of is an order-preserving bijection from the face lattice to the face lattice .
To verifyĀ (3), suppose that . Then partĀ (1) guarantees the existence of an invertible linear transformation mapping to . As , the subspace is dense in with respect to the Euclidean topology. Thus, the map must be a homeomorphism and, therefore, and are homeomorphic. ā
For a monoid in and a finite-dimensional vector space over an ordered fieldĀ , PropositionĀ 3.9 guarantees that the geometric and combinatorial aspects, and the topological aspects (when ) of do not depend on but only on . As a consequence, we shall sometimes write instead of , choosing without specifying the finite-dimensional vector space over where the conic hull ofĀ is embedded into.
Corollary 3.10**.**
Let be an ordered field, and let be a monoid in . Then the equality holds.
Proof.
Consider the -vector space . As the dimension of the -vector space equals , and the vector space can be obtained from by extending scalars from to , the equality holds. Therefore
[TABLE]
ā
Members of are finite-rank torsion-free monoids. However, not every finite-rank torsion-free monoid is in . The next two examples shed some light upon this observation.
Example 3.11**.**
A nontrivial submonoid of is obviously a rank- torsion-free monoid. It follows from PropositionĀ 3.1 that belongs to if and only if is isomorphic to a numerical monoid. HenceĀ [33, PropositionĀ 3.2] guarantees thatĀ is inĀ if and only if is finitely generated. As a result, non-finitely generated submonoids of such as are finite-rank torsion-free monoids that do not belong to the class . The atomic structure of submonoids of have been studied in [35, 36] and some of their factorization invariants have been investigated inĀ [8, 37]. In addition, their monoid algebras were recently considered inĀ [12, 32].
Clearly, the Grothendieck group of a non-finitely generated submonoid of cannot be free. The following example, courtesy of Winfried Bruns, shows that a finite-rank torsion-free monoid may not belong to even though its Grothendieck group is free.
Example 3.12**.**
Consider the additive monoid
[TABLE]
Note that is a submonoid of and, therefore, it has rank at mostĀ . In addition, it is clear that is torsion-free. On the other hand,
[TABLE]
which is the upper closed half-space. Thus, the cone is not pointed. As a consequence, it follows from PropositionĀ 3.8 that does not belong toĀ .
3.3. Cones Realized by Monoids in
Our next goal is to characterize the positive cones that can be realized as conic hulls of monoids inĀ . First, let us argue the following lemma.
Lemma 3.13**.**
Let be an intermediate field of the extension , and let be a -dimensional positive cone in for some . For each , there exists a -dimensional rational simplicial cone such that and .
Proof.
Take . For , it suffices to set . Then suppose that and write . AsĀ is positive and , one sees that for every . Let be the distance fromĀ to the complement of . Since is open, . Consider the -dimensional regular simplex
[TABLE]
and then choose sufficiently large such that . In addition, take such that for every and . Now set . Clearly, is an interior point of and, therefore, . This, along with the fact that , ensures that . Take and observe that is a polyhedral cone contained in . In addition, implies that . As , we find that . Hence the set of -dimensional faces of the polyhedral cone has size at least . On the other hand, the -dimensional faces ofĀ are determined by some of the vertices of . As the vertex of is contained in , the -dimensional faces of are precisely the nonnegative rays containing the points for each . Thus, is a -dimensional rational simplicial cone. ā
Notation: Let be an ordered field (whose prime field must be ), and take . Then we call a -dimensional subspace of (resp., an infinite ray) a rational line (resp., a rational ray) if it contains a nonzero vector of .
Theorem 3.14**.**
Let be an intermediate field of the extension , and let be a -dimensional positive cone in for some . Then can be generated by a submonoid of if and only if each -dimensional face of is a rational ray.
Proof.
Set . For the direct implication, suppose that , whereĀ is a maximal rank submonoid of . Let be a -dimensional face of , and letĀ be a nonzero point in . Now take and such that . If , then and, therefore,Ā is a rational ray. If , then after setting we can see that and
[TABLE]
As is a face of and the open line segment from to intersects , the closed line segment from to must be contained in . In particular, . Hence is a rational ray.
For the reverse implication, assume that all -dimensional faces of are rational rays. Consider the set . Clearly, is a submonoid of and . Take , and set . As the nonempty intersection of faces of is again a face of , there exists a minimal (under inclusion) face of containingĀ . Suppose, for the sake of a contradiction, that there exists a supporting hyperplaneĀ of such that but . In this case, would be a face of containingĀ . However, notice that is a face of containing that is strictly contained in , contradicting the minimality of . Hence each supporting hyperplane of containing also containsĀ . This implies that is in the relative interior of . Suppose now thatĀ has dimension . Then by LemmaĀ 3.13 there exists a rational cone with andĀ -dimensional faces such that . Now take such that the -dimensional faces of are precisely the rays . As we can write for some . Because for each , it follows that . Hence , which completes the proof. ā
The following example illustrates a positive cone in that cannot be generated by any monoid in .
Example 3.15**.**
Let be the cone in generated by the set , where . It is clear that is a positive cone. Note, in addition, that is a -dimensional face of . Finally, observe that contains no point with rational coordinates. Hence it follows from TheoremĀ 3.14 that cannot be generated by any monoid in .
4. Faces and Divisor-Closed Submonoids
4.1. Face Submonoids
Let be an ordered field, and let be a monoid in . We would like to understand the structure of the face lattice of in connection with the divisibility aspects of . In particular, the submonoids of obtained by intersecting with the faces of are relevant in this direction as they inherit many divisibility and atomic properties from .
Definition 4.1**.**
Let be an ordered field, and let be a nontrivial monoid in . A submonoid of is called a face submonoid of with respect to provided that for some face of .
Being a face submonoid of with respect to does not depend on the way is embedded into , as the following proposition indicates.
Proposition 4.2**.**
Let be a finite-dimensional vector space over an ordered field , and let be a monoid in embedded into . The following statements hold.
- (1)
A submonoid of is a face submonoid with respect to if and only if there exists a face of such that . 2. (2)
Face submonoids with respect to are preserved by monoid isomorphisms. In particular, face submonoids do not depend on the embedding . 3. (3)
If is a face submonoid of with respect to , and is a face of satisfying that , then . In particular, there exists a unique face of determining the face submonoid .
Proof.
Set . By the universality property of the Grothendieck group, the inclusion extends to an injective group homomorphism and, after tensoring with the flat -module , one obtains an injective linear transformation . For the direct implication ofĀ (1), suppose that is a face submonoid ofĀ , and let be a face of such that . Clearly, is a face of . In addition,
[TABLE]
For the reverse implication, we observe that if is a face of such that , then . As is a face of , one finds that is a face submonoid ofĀ .
In order to argueĀ (2), suppose that is a monoid in , and let be a monoid isomorphism. As we did in the previous paragraph, we can extend the isomorphism to a bijective linear transformation , where and . Now take to be a face submonoid of with respect to . By the previous part, there exists a face of such that . Since and is a face of , it follows that is a face submonoid of .
Finally, we proveĀ (3). Suppose that is a face of such that . Since and is a cone, . To show the reverse inclusion, take . Then for and . If , then . Otherwise, after setting and , we see that . Because is a face of intersecting the open line segment from to , both and must belong to . Now a simple inductive argument shows that . Therefore for each . This implies that . ā
The set of atoms of face submonoids can be nicely described in terms of the corresponding faces.
Proposition 4.3**.**
Let be a finite-dimensional vector space over an ordered fieldĀ , and let be a monoid in embedded into . If is a face submonoid of determined by a face of , then .
Proof.
Since , one obtains that . To verify the reverse inclusion, take and note that . Now take such that , and then take such that . Because is a face of and belongs to the intersection of and the open line segment , the atom must be contained inĀ . As a consequence, . Therefore implies that , which yields the desired inclusion. ā
For a monoid in , there may be submonoids of obtained by intersecting with certain non-supporting hyperplanes whose sets of atoms can still be obtained as in PropositionĀ 4.3.
Example 4.4**.**
Consider the submonoid of . It can be readily checked that . Now set , where is the hyperplane ofĀ . It is clear that is a submonoid of satisfying that . However, is not a face submonoid of .
4.2. Characterization of Face Submonoids
A submonoid of a monoid is said to be divisor-closed provided that for all and the condition implies that . For any monoid in , the definitions of a face submonoid and a divisor-closed submonoid are equivalent.
Theorem 4.5**.**
Let be an ordered field, and let be a monoid in . Then a submonoid of is divisor-closed inĀ if and only if is a face submonoid of with respect to .
Proof.
Let be the rank of . Since face submonoids of do not depend on the finite-dimensional vector space over that is embedded into, we can assume that . We first verify that face submonoids of with respect to are divisor-closed. To do so, take a face of and set . To argue that is a divisor-closed submonoid of , take and with . Then for some , which implies that is contained in both and the open line segment from to . Since is a face of , both and belong to and, therefore, . HenceĀ is divisor-closed.
Let us argue the reverse implication by induction. Notice that when has rankĀ , it is isomorphic to a numerical monoid, and the only submonoids of that are divisor-closed are the trivial and itself. These are precisely the face submonoids of inĀ corresponding to the origin and , respectively. Fix now , and assume that the divisor-closed submonoids of any monoid in with rank less than are face submonoids with respect to . Let be a maximal-rank submonoid of , and let be a submonoid of that is not a face submonoid.
CASE 1: . As is not a face submonoid of , it follows that . Take and a basis of with for scalars , which are rational numbers by Cramerās rule. We assume that and (not all zeros) for some index . Then
[TABLE]
where is the least common multiple of the denominators of all the nonzero ās. Since , the monoid cannot be divisor-closed.
CASE 2: . Take such that the hyperplane
[TABLE]
of contains linearly independent vectors such that , where . It is clear that . Now we consider the following two subcases.
CASE 2.1: is a supporting hyperplane of the cone . Consider the face of . It follows from partĀ (3) of PropositionĀ 4.2 that . Then each face of is a face of and, therefore, a face of . Thus, the fact that is not a face submonoid of implies that is not a face submonoid of . Because , our inductive assumption guarantees thatĀ is not a divisor-closed submonoid of . Hence cannot be a divisor-closed submonoid of .
CASE 2.2: is not a supporting hyperplane of the cone . In this case, there exist such that and . Because is a basis of and is a divisor-closed submonoid of , there exists contained in and satisfying that is linearly dependent. Clearly, . After relabeling the vectors (if necessary) and using Cramerās rule, we find that
[TABLE]
for some index and coefficients and (not all zeros). Observe that and are both different from zero. After taking the scalar product with in both sides ofĀ (4.1), one can see that . Hence and are both positive. Now we can multiplyĀ (4.1) by the common denominator of all the nonzero ās, to obtain that . Since , the submonoidĀ is not divisor-closed. ā
We have seen in PropositionĀ 3.9 that for an ordered field if a monoid in is embedded into two -vector spaces and , then is combinatorially equivalent to . Our next goal is to argue that the combinatorial structure of does not depend on the chosen ordered field. First, let us argue the following lemma.
Lemma 4.6**.**
Let be a finite-dimensional vector space over an ordered field , and let be a monoid in maximally embedded into . If and are two faces of , then if and only if ; in particular, if and only if .
Proof.
It suffices to argue the first statement, as the second statement is an immediate consequence of the first one. The direct implication is straightforward. For the reverse implication, assume that . Take . Since , there exist and such that . If , then and so . Otherwise, for every the open segment from to intersects at and, therefore, . As , it follows that . Hence , which completes our argument. ā
Proposition 4.7**.**
Let and be finite-dimensional vector spaces over ordered fieldsĀ and , respectively. If and are isomorphic monoids in embedded intoĀ andĀ , respectively, then and are combinatorially equivalent.
Proof.
Set . By PropositionĀ 3.1 there exists a submonoid of that is isomorphic to , i.e., . Now set and .
We first verify that and are combinatorially equivalent. Clearly, is a face of when is a face of . Then define via , where and are the face lattices of the cones and , respectively. IfĀ and are two faces of such that , then
[TABLE]
So it follows from LemmaĀ 4.6 that . Thus, is injective. Similarly one can verify that for any two faces and of , the inclusion holds if and only if . As a result, is a homomorphism of posets. To argue thatĀ is surjective, let be a face of . As is a divisor-closed submonoid ofĀ , there exists a face of such that . So we obtain that , and if follows from LemmaĀ 4.6 that . Because is a bijective homomorphism of posets, it is indeed a lattice isomorphism.
Now it follows from partĀ (2) of PropositionĀ 3.9 that is combinatorially equivalent to and, therefore, is combinatorially equivalent to . In a similar manner, one can argue that is combinatorially equivalent to , whence the proposition follows. ā
Remark 4.8**.**
By virtue of PropositionĀ 4.7, in order to study the combinatorial aspects of the cones of a monoid in one can simply embed into any finite-dimensional vector space over any ordered field. In particular, there is no loss in choosing the ordered field to be , and from now on we will do so.
5. Geometry and Factoriality
In this section we study the factoriality of members of in connection with the geometric properties of their corresponding conic hulls. We shall provide geometric characterizations of the UFMs, HFMs, and OHFMs in .
5.1. Unique Factorization Monoids
To begin with, let us characterize the UFMs in . Recall that a monoid is a UFM if and only if for all .
Theorem 5.1**.**
Let be a monoid in , and set . The following statements are equivalent.
- (a)
The monoid is a UFM. 2. (b)
Each face submonoid of is a UFM. 3. (c)
The equality holds.
Proof.
Set . By partĀ (2) of PropositionĀ 4.2, there is not loss of generality in assuming that is a submonoid of , in which case . It follows from CorollaryĀ 3.10 that .
(b) (a): It is obvious.
(a) (c): We first verify that . Since , the atoms in , when considered as vectors form a generating set of . As a consequence, . To argue the reverse inequality suppose, by way of contradiction, that . As the vectors in generate , one can take distinct atoms such that are linearly independent. Then there exist coefficients not all zeros such that . Since are linearly independent and , Cramerās rule guarantees that . There is no loss in assuming that there is an index such that for each and for each . Hence and are two distinct factorizations of the same element of , contradicting that is a UFM.
(c) (b): For this implication, suppose that . Let be a face submonoid of . Since and is finite, Farkas-Minkowski-Weyl Theorem ensures that is polyhedral. Then for some supporting hyperplane of determined by . Suppose that . Now if and for some , then and, therefore, . So . Because either or , whence . This implies that . Thus, is a UFM. ā
Corollary 5.2**.**
Let be a monoid in , and set . If is a UFM, then is rational and polyhedral.
Proof.
As we did in the proof of TheoremĀ 5.1, we assume that and that . By TheoremĀ 5.1, the monoid is finitely generated and so is the conic hull of a finite set. Therefore it follows from Farkas-Minkowski-Weyl Theorem that is polyhedral. In addition, is rational because each of its -dimensional faces contains an element of . ā
5.2. Half-Factorial Monoids
The notion of half-factoriality is a weaker version of the notion of factoriality (or being a UFD). The purpose of this subsection is to offer characterizations of half-factorial monoids in the class in terms of their face submonoids and in terms of the convex hulls of their sets of atoms.
Definition 5.3**.**
An atomic monoid is called an HFM (or a half-factorial monoid) if for all and , the equality holds.
Half-factoriality was first investigated by L.Ā Carlitz in the context of algebraic number fields; he proved that an algebraic number field is an HFD (i.e., a half-factorial domain) if and only if its class group has size at most twoĀ [6]. However, the term āhalf-factorial domainā is due to A.Ā ZaksĀ [52]. InĀ [53], Zaks studied Krull domains that are HFDs in terms of their divisor class groups. Parallel to this, L.Ā SkulaĀ [49] and J.Ā ÅliwaĀ [50], motivated by some questions of W.Ā Narkiewicz on algebraic number theoryĀ [46, ChapterĀ 9], carried out systematic studies of HFDs. Since then HFMs and HFDs have been actively studied (see [7] and references therein).
HFMs in can be characterized as follows.
Theorem 5.4**.**
Let be a nontrivial monoid in , and set . The following statements are equivalent.
- (a)
The monoid is an HFM. 2. (b)
Each face submonoid of is an HFM. 3. (c)
The inequality holds.
Proof.
By PropositionĀ 3.1, there is not loss in assuming that is a submonoid of , where . In this case, .
(a) (c): Suppose that is an HFM. Since , one can take linearly independent vectors in . Take also and such that the polytope is contained in the affine hyperplane . In addition, fix , and write for some coefficients (by Cramerās rule, the coefficients can be taken to be rationals). The equality , along with the fact that is an HFM, guarantees that . As a result,
[TABLE]
which means that . Hence , which implies that is at most . Thus, .
(c) (b): Suppose that . Then there exists an affine hyperplane containing . As in the previous paragraph, take and such that . Now if and is a factorization in , then
[TABLE]
Hence for all , and so is an HFM.
(b) (a): It is straightforward. ā
Corollary 5.5**.**
A nontrivial monoid in is an HFM if and only if is contained in an affine hyperplane of not containing the origin, in which case .
Proof.
The equivalence is an immediate consequence of TheoremĀ 5.4. It is clear that . For the reverse inclusion assume, as we did in the proof of TheoremĀ 5.4, that and (where is the rank ofĀ ) and then take and such that . As does not contain the origin, . If and , then . Hence . ā
Remark 5.6**.**
Fairly similar versions of CorollaryĀ 5.5 have been previously established by A.Ā Zaks inĀ [53] and by F.Ā Kainrath and G.Ā Lettl inĀ [44].
For , the convex hull in of finitely many points with integer coordinates is called a lattice polytope.
Example 5.7**.**
Take , and let be a finite subset of . Let be the lattice polytope one obtains after taking the convex hull of . Now let be the set of all points with integer coordinates contained inĀ , and consider the submonoid of defined as . Monoids constructed in this way are called polytopal affine monoids. Polytopal affine monoids may not be positive in general. However, they are positive when is contained in . If this is the case, then it follows from TheoremĀ 5.4 that is an HFM in , and it follows from CorollaryĀ 5.5 that . FigureĀ 3 illustrates a lattice pentagon in the first quadrant of along with the generators in of its polytopal affine monoid.
The chain of implicationsĀ (5.1), where being a UFM, an HFM, and an atomic monoid are included, has received a great deal of attention since it was first studied (in the context of integral domains) by Anderson, Anderson, and ZafrullahĀ [1]:
[TABLE]
The first two implications above are obvious, while the last two implications follow fromĀ [27, PropositionĀ 1.1.4] andĀ [27, CorollaryĀ 1.3.3]. In addition, none of the implications is reversible, and examples witnessing this observation (in the context of integral domains) can be found inĀ [1]. We have already seen that not every monoid in is an HFM. However, each monoid in is an FFM, as the following proposition illustrates.
Proposition 5.8**.**
Each monoid in is an FFM.
Proof.
By PropositionĀ 3.1, it suffices to show that for every , any submonoidĀ of is an FFM. Fix . It is clear that for all . Thus, implies that . As a result, the set is finite, and so is also finite. Hence is an FFM. ā
As an immediate consequence of PropositionĀ 5.8, each monoid in satisfies the last four conditions in the chain of implicationsĀ (5.1).
5.3. Other-Half-Factorial Monoids
Other-half-factoriality is a dual notion of half-factoriality that was introduced by Coykendall and Smith inĀ [14].
Definition 5.9**.**
An atomic monoid is called an OHFM (or an other-half-factorial monoid) if for all and the equality implies that .
Although an integral domain is a UFD if and only if its multiplicative monoid is an OHFMĀ [14, CorollaryĀ 2.11], in general an OHFM is not a UFM (or an HFM), as one can deduce from the next theorem.
A set of points in a -dimensional vector space over is said to be affinely independent provided that for every no of such points lie in a -dimensional affine subspace of . If a set is affinely independent, its points are said to be in general linear position.
Theorem 5.10**.**
Let be a nontrivial monoid in , and set . The following statements are equivalent.
- (a)
The monoid is an OHFM. 2. (b)
Every face submonoid of is an OHFM. 3. (c)
The points in are affinely independent in . 4. (d)
The cone is a simplex, whose dimension is either or .
Proof.
Set . By PropositionĀ 3.1, there exists a submonoid of such that . By tensoring both -modules and with , one can extend any monoid isomorphism from to to a linear isomorphism from to . Since the property of being affinely independent is clearly preserved by isomorphisms, there is no loss of generality in assuming that is a submonoid of , and we do so.
(a) (c): Assume that is an OHFM and suppose, by way of contradiction, that the points in are not affinely independent. Then there exist and distinct vectors contained in a -dimensional affine subspaceĀ of . Let denote now the submonoid of generated by the atoms . Since is a -dimensional subspace of , the vectors are linearly dependent in . This, along with Cramerās rule, guarantees that for some rational coefficients (not all zeros). After relabeling vectors and coefficients, we can assume the existence of such that are negative and are nonnegative. Set
[TABLE]
where is the least common multiple of the denominators of all the nonzero ās. Then
[TABLE]
are two factorizations in having the same length. As are also atoms ofĀ , it follows that and are also factorizations in , which contradicts thatĀ is an OHFM.
(c) (a): Suppose that the points in are affinely independent in . We have seen in the proof of TheoremĀ 5.1 that . So . If , then TheoremĀ 5.1 ensures that is a UFM and, therefore, an OHFM. Thus, we assume that . Let and suppose, by way of contradiction, that is not an OHFM. This guarantees the existence of two distinct nonzero -tuples and in satisfying that
[TABLE]
Assume, without loss of generality, that . Let be an affine hyperplane in containing . Take and such that . As the points are affinely independent, . Then
[TABLE]
As a result, , which contradicts that does not belong to . HenceĀ must be an OHFM.
(c) (b): Suppose that the points in are affinely independent. Let be a face submonoid of , and let be a face of satisfying that . PropositionĀ 4.3 ensures that . Since the set of points is affinely independent, the set of points is also affinely independent. As we have already proved the equivalence of (a) and (c), we can conclude that is an OHFM. Hence statementĀ (b) follows.
(b) (a): It is clear.
(c) (d): These two statements are obviously restatements of each other. ā
Corollary 5.11**.**
Let be a numerical monoid. Then is an OHFM if and only if the embedding dimension of is at most .
Remark 5.12**.**
TheoremĀ 5.10 was indeed motivated by CorollaryĀ 5.11, which was first proved by Coykendall and Smith inĀ [14].
The fact that every proper face submonoid of a monoid in is an OHFM does not guarantee that is an OHFM, as one can see in the following example.
Example 5.13**.**
Consider the submonoid of . It is easy to argue that . Observe that the -dimensional faces of are and . Then there are two face submonoids of corresponding to -dimensional faces of , and they are both isomorphic to the numerical monoid , which is an OHFM by CorollaryĀ 5.11. Hence every proper face submonoid of is an OHFM. However, is not a simplex and, therefore, it follows from TheoremĀ 5.10 that is not an OHFM.
We conclude this section with the following proposition.
Proposition 5.14**.**
Let be an OHFM in , and set . Then the faces of whose corresponding face submonoids are not UFMs form a (possibly empty) interval in the face lattice .
Proof.
In light of PropositionĀ 3.1 and PropositionĀ 3.9, one can assume that is a submonoid of , where . In this case, .
Let consist of all faces of whose corresponding face submonoids are not UFMs. If is a UFM, it follows from TheoremĀ 5.1 that every face submonoid of is also a UFM and, therefore, is empty. So we assume that is not a UFM.
Among all the faces in , let and be minimal in . Suppose, by way of contradiction, that . Set and . It follows from PropositionĀ 4.3 that and . Since and are minimal, they are not comparable and so we can take and . Once again, one can rely on the minimality of and to obtain
[TABLE]
As a result, the rank of the set is at most . Set , and let be the real matrix whose columns are the vectors in (after some order is fixed). Then . Thus, . Consider the hyperplane of defined by
[TABLE]
and notice that
[TABLE]
Therefore there is a nonzero vector satisfying that . First, taking such that and , then takingĀ to be the least common multiple of the denominators of all the nonzero ās, and finally proceeding as we did in the second paragraph of the proof of TheoremĀ 5.10, we can obtain two distinct factorizations of the same element of having the same length. However, this contradicts that is an OHFM. Hence there exists only one minimal face of whose face submonoid is not a UFM, namely, . Clearly, the face submonoid of any face containing cannot be a UFM. This implies that . The reverse inclusion follows from the uniqueness of a minimal face in . Hence is the interval . ā
The reverse implication of PropositionĀ 5.14 does not hold, as the following example illustrates.
Example 5.15**.**
Consider the submonoid M:=\big{\langle}3e_{1},3e_{2},2e_{3},3e_{3}\big{\rangle} of . It can be readily verified that . Since is an affinely dependent set, it follows from TheoremĀ 5.10 that is not an OHFM. However, the non-UFM face submonoids of are precisely those determined by the faces of contained in the interval . The face lattice of is shown in FigureĀ 4.
6. Cones of Primary Monoids and Finitary Monoids
As mentioned at the beginning of this paper, the classes of primary monoids and finitary monoids have been crucial in the development of factorization theory as the arithmetic structure of their members abstracts certain properties of important classes of integral domains. The first part of this section is devoted to investigate some geometric aspects of primary monoids in . Then we shift our focus to the study of finitary monoids of .
6.1. Primary Monoids
Recall that a monoid is primary if is nontrivial and for all there exists such that . The study of primary monoids was initiated by T.Ā TamuraĀ [51] and M.Ā PetrichĀ [47] in the 1970s and has received a great deal of attention since thenĀ [41, 42, 23]. Primary monoids naturally appear in commutative algebra: an integral domain is -dimensional and local if and only if its multiplicative monoid is primary [23, TheoremĀ 2.1].
The primary monoids in are precisely those minimizing the number of face submonoids.
Proposition 6.1**.**
Let be a nontrivial monoid in , and set . The following statements are equivalent.
- (a)
The monoid is a primary monoid. 2. (b)
The only face submonoids of are and . 3. (c)
The cone is an open subset of .
Proof.
By using PropositionĀ 3.1 and PropositionĀ 3.9, we can assume that is a submonoid of , where . In this case, .
(a) (b): It follows fromĀ [27, LemmaĀ 2.7.7] that is primary if and only if the only divisor-closed submonoids of are and . This, along with TheoremĀ 4.5, implies that the conditionsĀ (a) andĀ (b) are equivalent.
(b) (c): Take . Since is the disjoint union of the relative interiors of all its faces, there exists a face of such that . As , the dimension of is at least and, therefore, is a nontrivial face submonoid of . It follows now from partĀ (b) that . As a consequence, belongs to the relative interior of . Hence is open.
(c) (b): Since every proper face of is contained in the boundary of , the fact that is open implies that the only proper face of is the origin, from whichĀ (b) follows. ā
Remark 6.2**.**
We want to emphasize that the equivalence (a) (c) in PropositionĀ 6.1 was first established by Geroldinger, Halter-Koch, and Lettl [29, TheoremĀ 2.4]. However, our approach here is quite different as we have obtained the same result based primarily on the combinatorial structure of the face lattice of .
Primary monoids in account for all primary submonoids of any (non-necessarily finite-rank) free (commutative) monoid, as the next proposition illustrates.
Proposition 6.3**.**
Let be a primary submonoid of a free (commutative) monoid. ThenĀ has finite rank, and can be embedded into , where .
Proof.
Let be a free (commutative) monoid on an infinite set such that is a submonoid of . For and , write
[TABLE]
Suppose, by way of contradiction, that contains infinitely many elements. Fix . Since is free and, therefore, a UFM, the set must be finite. Then we can take such that . Because is a prime element ofĀ , it is not hard to verify that the set is a divisor-closed submonoid of . The fact that implies that is a nonzero submonoid of , and the fact that implies that is a proper submonoid of . Therefore the monoid contains a proper nonzero divisor-closed submonoid, which contradicts that is primary. As a consequence, must be finite, and so can be naturally embedded into the finite-rank free (commutative) monoid , where are the prime elements in . It follows now from PropositionĀ 3.1 that can be embedded into . ā
6.2. Finitely Primary Monoids
Now we restrict our attention to a special subclass of primary monoids that has been key in the development of factorization theory, the class consisting of finitely primary monoids. The initial interest in this class originated from commutative algebra: the multiplicative monoid of a -dimensional local Mori domain with nonempty conductor is finitely primaryĀ [27, PropositionĀ 2.10.7.6]. Finitely primary monoids were introduced inĀ [23] by Geroldinger.
The complete integral closure of a monoid , denoted by , is defined as follows:
[TABLE]
Clearly, is a submonoid of containing , and so . A monoid is called finitely primary if there exist and a UFM , where are pairwise distinct prime elements in , such that the following conditions hold:
- (1)
the monoid is a submonoid of , 2. (2)
the inclusion holds, and 3. (3)
the inclusion holds for some .
In this case, it follows from [27, TheoremĀ 2.9.2] that . Then and, moreover, any finitely primary monoid of rank belongs to . On the other hand, it also follows fromĀ [27, TheoremĀ 2.9.2] that finitely primary monoids are primary. Therefore PropositionĀ 6.1 guarantees that for any finitely primary monoid the set is open in the finite-dimensional -vector space . This implies, in particular, that nontrivial finitely primary monoids cannot be finitely generated. As the following theorem reveals, the closures of their cones happen to be simplicial cones.
Theorem 6.4**.**
Let be a finitely primary monoid, and set . ThenĀ belongs to , and the set is a rational simplicial cone in .
Proof.
Let be the rank of . We have already observed that is in the class . Then by virtue of PropositionĀ 3.1 and PropositionĀ 3.9, we can assume that is a submonoid of and, therefore, that . In addition, there is no loss in assuming that .
Because , one can take distinct prime elements of such that . It follows from [27, TheoremĀ 2.9.2] that
[TABLE]
for some . Let be the cone in generated by . Clearly, is a rational simplicial cone of dimensionĀ . We claim that . Since
[TABLE]
the inclusion holds. As a consequence, and, as the cone is a closed set in , the inclusion follows. Let us proceed to argue that . To do so, fix and fix also an index . Let be the -dimensional face of in the direction of the vector , and consider the conical open ball with central axis given by
[TABLE]
where is the linear projection of onto its subspace . It is clear that the set \{0\}\cup\big{(}B(p_{j},\epsilon)\cap\mathsf{int}\,C_{p}\big{)} is a -dimensional subcone of and, therefore, it must intersect . Then one can take such that . Because
[TABLE]
. As a result, . As and every open conical ball with central axis have an open ray in common, . Because the indexĀ was arbitrarily taken, for every , and so . Hence is a rational simplicial cone. ā
With notation as in TheoremĀ 6.4, the facts that is primary and is a rational simplicial cone do not guarantee that is finitely primary. The following example sheds some light upon this observation.
Example 6.5**.**
Consider the subset of defined by
[TABLE]
From the fact that is a convex function, one can readily verify that is a submonoid of . Since contains for every , the ray is contained in . On the other hand, the fact that , along with , guarantees that the ray is contained in . Thus, is the closure of the first quadrant and so
[TABLE]
Because is an open set in , it follows from PropositionĀ 6.1 that is a primary monoid. On the other hand, the equality holds, and so is a rational simplicial cone.
To argue that is not finitely primary, it suffices to verify that . To do so, fix , and then take large enough so that for every . Note that belongs to . Moreover,
[TABLE]
for every . Therefore for every . On the other hand, for any and ,
[TABLE]
Hence implies that . As a result, . Since contains infinitely many elements, . Consequently,Ā cannot be finitely primary.
6.3. Finitary Monoids
Let be a monoid. Recall that is finitary if it is a BFM and there exist a finite subset of and a positive integer satisfying that . Geroldinger et al. introduced and studied the class of finitary monoids inĀ [28] motivated by the fact that monoids in this class naturally show in commutative ring theory: the multiplicative monoid of a Noetherian domain is finitary if and only ifĀ is -dimensional and semilocalĀ [28, PropositionĀ 4.14]. In addition, finitary monoids conveniently capture certain aspects of the arithmetic structure of more sophisticated monoids, including -Noetherian -monoidsĀ [24] and congruence monoidsĀ [26]. Every finitely generated monoid is finitary. In particular, affine monoids are finitary.
The monoid is said to be weakly finitary if there exist a finite subset of and such that for all . Clearly, every finitary monoid is weakly finitary. The face submonoids of a monoid in inherit the condition of being (weakly) finitary.
Proposition 6.6**.**
Let be a monoid in . Then is finitary (resp., weakly finitary) if and only if each face submonoid of is finitary (resp., weakly finitary).
Proof.
We will prove only the finitary version of the proposition as the weakly finitary version follows similarly. By PropositionĀ 3.1 we can assume that is a submonoid of , where is the rank of .
Suppose that is finitary. TakeĀ to be a face of , and consider the face submonoid . Since is finitary, there exist and a finite subset ofĀ such that . We claim that , where . Take . Because , there exist and such that . Since is a divisor-closed submonoid of , we find that . Therefore and ; this implies that . Hence is a finitary monoid. The reverse implication follows trivially as is a face of itself. ā
Our next goal is to give a sufficient geometric condition for a monoid in to be finitary. First, let us recall the notion of triangulation. Let be a finite-dimensional vector space over an ordered field . A conical polyhedral complex in is a collection of polyhedral cones in satisfying the following conditions:
- (1)
every face of a polyhedron in is also in , and 2. (2)
the intersection of any two polyhedral cones and in is a face of both andĀ .
Clearly, the underlying set of the face lattice of a given polyhedral cone is a conical polyhedral complex. For a conical polyhedral complex in , we set . Let and be two conical polyhedral complexes. The complex is said to be a polyhedral subdivision of provided that and each face of is the union of faces of . A polyhedral subdivision ofĀ is called a triangulation of provided that consists of simplicial cones. Every conical polyhedral complex has the following special triangulations.
Theorem 6.7**.**
[5, TheoremĀ 1.54]** Let be a conical polyhedral complex in for some , and let be a finite set of nonzero vectors such that generates for each . Then there exists a triangulation of such that is the set of -dimensional faces of .
We are in a position now to offer a sufficient geometric condition for a monoid in to be finitary.
Theorem 6.8**.**
Let be a monoid in , and set . If is polyhedral, then is finitary.
Proof.
Let be the rank of . Based on PropositionĀ 3.1 and PropositionĀ 3.9, one can assume that . In this case, . Since is polyhedral, it follows by Farkas-Minkowski-Weyl Theorem that is the conic hull of a finite set of vectors. As the vectors in such a generating set are nonnegative rational linear combinations of vectors in , there exists with such that . By TheoremĀ 6.7, there exists a triangulation of the face lattice of whose set of -dimensional faces is . Then for any there are unique indices satisfying that
[TABLE]
and we can use this to assign to the parallelepiped
[TABLE]
It is clear that
[TABLE]
Then we can choose sufficiently large so that for every . Now take and set . In order to show that is finitary, it suffices to verify that .
Take (possibly repeated) elements . For every , there exists with . Let for be a simplicial cone inĀ . Observe that we can naturally partition into (translated) copies of the parallelepiped , that is, equals the disjoint union of the sets for every . As a result, there exist and coefficients satisfying that
[TABLE]
Hence for , we can write for some and . Since , there exists such that
[TABLE]
Consider now the equivalence relation on the set of indices defined by whenever . The fact that guarantees the existence of a classĀ determined by the relation and containing at least distinct indices. Take such that . Setting for some , we see that
[TABLE]
and, therefore, for some and . As a result, one can set to obtain that
[TABLE]
Since the elements were arbitrarily taken in , the inclusion holds. Hence the monoid is finitary. ā
According to the characterization of cones generated by monoids in we have provided in TheoremĀ 3.14, every -dimensional positive cone of with open can be generated by a monoid in . Indeed, any such a cone can be generated by a finitary monoid in .
Proposition 6.9**.**
For , let be a positive cone in . If is open in , thenĀ can be generated by a finitary monoid in .
Proof.
Assume that is open in . Take . It is clear that . Now take , and consider the monoid . Let be the cone generated by . Notice that and are the cones generated by and over , respectively. So proving that amounts to showing that (seeĀ [5, PropositionĀ 1.70]). Since it follows that . Now let be the distance from to . As is closed and is compact, . Now take such that , and let be the distance from to . By a similar argument, . Notice that the conical ball
[TABLE]
is contained in ; here is the projection of onto its one-dimensional subspace . Take such that
[TABLE]
and . Now set . Notice that . Then
[TABLE]
Hence , and so there exist coefficients and elements such that . As a consequence, one has that for some and, therefore, . Hence .
As generates , we only need to verify that is finitary. Take , and then such that and . Then
[TABLE]
As a result, , which implies that is a finitary monoid. ā
TheoremĀ 6.8 and PropositionĀ 6.9 indicate that there is a huge variety of finitary monoids inĀ . We proceed to exhibit a monoid in that is not even weakly finitary. First, let us introduce the following notation.
Notation: For , we let denote the slope of the line , and for we set
[TABLE]
Example 6.10**.**
Construct a sequence of vectors in as follows. Set and suppose that for some and for every we have chosen vectors satisfying that and . Then take in such a way that , , and . Now one can consider the additive submonoid of . Clearly, . On the other hand, the fact that when implies that only atoms in can divide in . This, along with the fact that
[TABLE]
for every , guarantees that . Finally, let us verify that is not weakly finitary. Assume for a contradiction that there exist and a finite subset of such that for all . We can assume without loss of generality that , so we let , where . Take . Then write for some and such that and . Since , there exists such that . Therefore
[TABLE]
which is a contradiction. Hence is not weakly finitary.
6.4. Strongly Primary Monoids
We conclude this paper with a few words about strongly primary monoids in . Recall that a monoid is strongly primary if it is simultaneously finitary and primary. Numerical monoids and -Noetherian primary monoids are strongly primary. On the other hand, the multiplicative monoid of a -dimensional local Mori domain is strongly primary. Finally, the class of strongly primary monoids also contains the class of finitely primary monoidsĀ [27, TheoremĀ 2.9.2]. Strongly primary monoids have been investigated inĀ [25, 30, 31].
Let be a monoid. For the smallest satisfying that is denoted by . When such does not exist, we set . If is strongly primary, then for all Ā [27, LemmaĀ 2.7.7]. In addition, set
[TABLE]
Example 6.11**.**
Consider the monoid
[TABLE]
It is clear that
[TABLE]
On the other hand, if , then and, therefore,
[TABLE]
Hence . In addition, the fact that for all implies that . The inclusion implies that is a finitary monoid. On the other hand, is the open first quadrant, which implies via PropositionĀ 6.1 that is a primary monoid. As a result, is strongly primary. Now fix . Note that if for some , then . Thus, . On the other hand, if , then and , which implies that . As a result, and, by a similar argument, . Hence for every and, in particular, .
Unlike the computations shown in ExampleĀ 6.11, an explicit computation of the set for a monoid in can be hard to carry out. However, for most monoids in one can argue that without performing such computations.
Proposition 6.12**.**
Let be a strongly primary monoid in , and set . The following statements are equivalent.
- (a)
The inequality holds. 2. (b)
The equality holds. 3. (c)
The monoid is isomorphic to a numerical monoid.
Proof.
As a result of PropositionĀ 3.1 and PropositionĀ 3.9, one can assume that is a submonoid of , where is the rank of . Then .
(b) (c): It is clear.
(a) (b): To argue this suppose, by way of contradiction, that . Since is strongly primary is not empty and, thus, . As is primary, is an open set of by PropositionĀ 6.1. Therefore cannot be finitely generated, which means that . Since is a finite set for every , there exists a sequence of atoms of satisfying that . Now fix . Because for some ,
[TABLE]
Hence , which is a contradiction.
(b) (a): To argue this, suppose that . In this case, is isomorphic to a numerical monoid. Since numerical monoids are finitely generated, the inequality holds. ā
Acknowledgments
While working on this paper, the author was supported by the NSFĀ AGEP and the UC Year Dissertation Fellowship. The author would like to thank an anonymous referee for her/his useful comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. D. Anderson, D. F. Anderson, and M. Zafrullah: Factorizations in integral domains , J. Pure Appl. Algebra 69 (1990) 1ā19.
- 2[2] L. L. Avramov, C. Gibbons, and R. Wiegand: Monoids of Betti tables over short Gorenstein algebras . Under preparation.
- 3[3] V. Barucci, M. DāAnna, and R. Frƶberg: Analitically unramifed one-dimensional semilocal rings and their value semigroups , J. Pure Appl. Algebra 147 (2000) 215ā254.
- 4[4] V. Barucci, M. DāAnna, and R. Frƶberg: The Apery Algorithm for a Plane Singularity with Two Branches , BeitrƤge zur Algebra und Geometrie 46 (2005) 1ā18.
- 5[5] W. Bruns and J. Gubeladze: Polytopes, Rings and K-theory , Springer Monographs in Mathematics, Springer, Dordrecht, 2009.
- 6[6] L. Carlitz: A characterization of algebraic number fields with class number two , Proc. Amer. Math. Soc. 11 (1960) 391ā392.
- 7[7] S. T. Chapman and J. Coykendall: Half-Factorial Domains, a Survey . In: Non-Noetherian Commutative Ring Theory (eds: S. T. Chapman and S. Glaz) pp. 97ā115. Mathematics and Its Applications, vol. 520, Kluwer Academic Publishers, 2000.
- 8[8] S. T. Chapman, F. Gotti, and M. Gotti: Factorization invariants of Puiseux monoids generated by geometric sequences , Comm. Algebra 48 (2020) 380ā396.
