In this paper
AbstractIntroductionNotation and preliminary resultsMain ResultsAI DeclarationReferencesWorksMathematics
Automorphism of reduced finitary power monoids
Abstract
Let be a multiplicatively written monoid with identity element . The family of all finite subsets of containing is a monoid with identity under the setwise multiplication induced by . We prove that whenever satisfies either of the following two conditions: (1) is commutative, cancellative, and contains an invertible element of infinite order; (2) is an abelian group which is not isomorphic to the Klein four-group.
Introduction
Let be a semigroup. Endowed with the setwise multiplication induced by , the family of all nonempty subsets of forms a semigroup, hereinafter denoted by . The family of all nonempty finite subsets of is a subsemigroup of . More explicitly, the operation is defined by
for all . We call and the large power semigroup and the finitary power semigroup of , respectively.
In particular, if is a monoid with identity then and are monoids too; their identity is the singleton . Moreover,
are submonoids of and , respectively. We call the reduced large power monoid and the reduced finitary power monoid of .
Remark 1.1. When is an additively written semigroup, the same convention is adopted for and its subsemigroups. The operation on is then called setwise addition, and it is explicitly defined by
for all . Accordingly, if is a monoid, we use in place of and in place of .
Power semigroups first appeared explicitly in a 1950 paper of Ballieu [2], and their systematic study was started by Tamura and Shafer [15, 16] in the late 1960s. In recent years, they have been studied from several perspectives, including their algebraic structure, their factorization properties, and their connections with arithmetic combinatorics; see [1, 7, 8]. For more details about the arithmetic of power monoids, we refer the reader to the survey [17].
Let and be the additive monoid of nonnegative integers and the additive group of integers, respectively. Denote by the automorphism group of a semigroup . The study of the automorphisms of power semigroups can be traced back to Byrd et al. In particular, it is proved in [5 Theorem 4] that is isomorphic to for a locally finite group with , and in [6 Theorem 9] that is a splitting extension of by the Klein four-group. The latter result does not completely determine the structure of . This was recently achieved by Tringali and Wen [18 Theorem 3.5], who proved that is isomorphic to the direct product of a cyclic group of order two and the infinite dihedral group. Wong et al. [24] showed that for a numerical semigroup (that is, a cofinite subsemigroup of the nonnegative integers under addition), is a cyclic group of order if is a discrete interval; otherwise is trivial. Tringali and Wen [19] proved that is trivial for every numerical semigroup , and that is trivial whenever .
In this paper, we focus on the relation between the automorphism group of a monoid and the automorphism group of the reduced finitary power monoid . Each induces an automorphism of defined as follows:
We call the augmentation of and we say that an automorphism of is inner if it is the augmentation of an automorphism of .
It is easy to verify that this gives a group monomorphism
It is natural to ask whether is an isomorphism. In other words, is each automorphism of inner? Tringali and Yan [21] showed that the only non-trivial automorphism of is given by . This proves that, in general, is not surjective since is trivial. In fact, the same result was also obtained in [6 Theorem 1] but this paper went unnoticed until April 2026. More recently, Bhowmik and Tringali [4 Theorem 1.2] showed that is trivial for every numerical monoid , which confirmed a conjecture proposed in [21].
Wong et al. [23 Theorem 1.3] proved that all automorphisms of are inner and hence gave an affirmative answer to a conjecture proposed by Tringali and Wen [18]. In a remarkable feat, Rago [12 Theorem 13] established that if is a finite abelian group, then all automorphisms of are inner, except when is the Klein four-group, in which case is isomorphic to the direct product of two copies of the symmetric group of degree three.
In this paper, we show that all automorphisms of are inner if is a commutative and cancellative monoid containing an invertible element of infinite order or is an infinite abelian group.
Notation and preliminary results
We use the conventions of [10] for semigroups and monoids. Let be a monoid written multiplicatively. Then an element is right (resp. left) cancellative if (resp. ) for any . We call cancellative if each of its elements is both right and left cancellative. Let be a nonempty subset of and let . We write
We denote by the cyclic group of order . The cardinality of a set is denoted by .
We start with a result of Tringali and Yan [22].
Lemma 2.1. [22 Corollary 3.3] Let and be monoids, and let be an isomorphism. Then there is a unique bijection , called the pullback of , such that
In particular, .
The pullback of the isomorphism has many interesting properties and is remarkably helpful in the study of reduced finitary power monoids. In particular, we will need the following result by Tringali and Yan [22].
Theorem 2.2. [22 Theorem 5.1] Let and be cancellative monoids, and suppose at least one of them is torsion. Let be an isomorphism from to . Then the pullback of is an isomorphism from to , and both and are groups.
Rago [12, 14] continued the study of the properties of the pullback and proved the following results.
Theorem 2.3. [12 Theorem 13] Let be a finite abelian group with . Then all automorphisms of are inner.
Theorem 2.4. [14 Theorem 14] Let and be commutative and cancellative monoids, each containing an element of infinite order. Suppose that at least one of them has a nontrivial unit group. Then the pullback of every isomorphism is an isomorphism.
Let be a finite abelian group with . Indeed, Rago [12] showed that every whose pullback is the identity map is itself the identity map, and Theorem 2.3 comes from this fact and Theorem 2.2. We summarize it as follows.
Lemma 2.5. Let be a monoid. Assume that the pullback of every automorphism of is an automorphism of . Then the following are equivalent:
(1) , , is an isomorphism;
(2) every whose pullback is the identity map is itself the identity map;
(3) if the pullbacks of coincide, then ;
(4) if is the pullback of an automorphism of , then for any .
Proof. (1) (2) is obvious.
(2) (3). Let be pullback of . By hypothesis, is also the pullback of . On the other hand, it is clear that is the pullback of , and hence is the pullback of . So is the identity map and .
(3) (4). By assumption, is also an automorphism of . So and share the same pullback . Hence, for any .
(4) (1) is clear. □
We also need the following results about the reduced finitary power monoid of a cancellative monoid containing an element of infinite order. The results were first proved by Rago in the commutative setting, see the proof of [14 Lemma 4] and then generalized to the non-commutative setting by Bhowmik and Tringali [4 Lemma 2.2].
Lemma 2.6. Let be a cancellative monoid. Suppose is invertible of infinite order and is a finite nonempty subset of . Then there exists a positive integer such that
for all and with .
Proof. Lemma 2.2 in [4] gives that there exists a positive integer such that for all integers and with . Therefore, taking into account that is a unit of , we get that and are also disjoint for all with , and , which is the desired conclusion. □
Lemma 2.7. [4 Proposition 2.4] Let and be cancellative monoids and assume that contains an element of infinite order. Then each isomorphism is cardinality-preserving, that is, for any .
Main Results
Let be a semigroup and let . The “correlation function”
was first introduced in [4 Definition 2.5]. This function is closely related to the discrete covariogram in convex geometry [3 Section 6.1] and to difference representation functions in additive combinatorics [11 Section 6.1]. We need the following properties of .
Lemma 3.1. Let be a commutative and cancellative monoid. Then for any and ,
(1) ;
(2) ;
(3) if is a disjoint union, and for all with , then
Proof. (1) is a special case of [4 Lemma 2.6].
(2) Since is commutative and cancellative, the map
is a bijection, so (2) follows from (1).
(3) By the assumptions, we see that
Hence,
□
Lemma 3.2. [4 Corollary 2.8] Let be a commutative and cancellative monoid containing an element of infinite order, and let be an automorphism of with identity pullback. Then
for any and .
Now we can state and prove our main results.
Theorem 3.3. Let be a commutative and cancellative monoid, and suppose that contains an invertible element of infinite order. Then all automorphisms of are inner.
Proof. Let for any and let be an invertible element of infinite order.
By Theorem 2.4, the pullback of every isomorphism of is an automorphism of . Thus, by Lemma 2.5, it suffices to show that if an automorphism of has trivial pullback, then is the identity map. Accordingly, we assume below that
Fix and let . We proceed to show that . Take . Suppose , otherwise the conclusion is obvious. The proof is divided into two cases.
Case 1: is invertible. Since is also finite, by Lemma 2.6 there exists a positive integer such that for any pairwise distinct . Put . Then we have
Put . Since , we have . Thus,
Applying to the above equation and using (1) gives that
where . That is,
By (2) and (4), we obtain that
and thus . So . By the same argument, we have and thus . It follows that and .
We have shown and . Combining these with (4) gives
where . Substituting into equation (4) yields that
Since , we have for any integers by (2). We conclude that and . Combining with that , we obtain and thus .
Case 2: is not invertible. By Lemma 2.6 and the same arguments at the begin of Case 1, we may choose such that
where .
Put
We have the following claim.
Claim: For given and ,
if and only if
Proof of the Claim. It is easy to verify that the form given in (7) satisfies (6) and belongs to . Conversely, suppose and . That is,
We need to show that , and . If and , then . By (8), it follows that
which contradicts to (5). So , and thus by (8). We obtain .
Similarly, if , then for any . By (8), it follows that , which contradicts to (5). So and we get by (8).
Combining (8) with that , and , we have
This completes the proof of the Claim.
Let . Since , by the Claim we have
Note that . Applying to (9) and using (1) gives that
where . By the Claim again,
By {(xref)}(3.5), both and are disjoint unions. Since is cardinality-preserving by Lemma 2.7, we assert that and
It follows that and thus for some non-identity element . We are now in a position to show that . By {(xref)}(3.5), we have for distinct . By (2), (3) of Lemma 3.1,
By the same discussion, we also have
By Lemma 3.2, and . Hence
Since is not invertible, and . Therefore,
It is clear that implies is invertible. So and . We thus get .
We have shown that . Since , we have . Therefore, is the identity map. □
Theorem 3.4. Let be an abelian group which is not isomorphic to the Klein four-group. Then
is an isomorphism.
Proof. By Theorem 2.3 and Theorem 3.3, we only need to deal with the case that is infinite and torsion. By Theorem 2.2, the pullback of an automorphism of is also an automorphism of since is torsion. By Lemma 2.5, it suffices to prove that if is an automorphism of with identity pullback, then is the identity map.
Let and let for . Since is infinite, abelian, and torsion, there exists a finite subgroup of such that and . Since , and fixes , it follows that
Since is a subgroup of , we have if and only if for any . Therefore maps into itself. The same argument applied to shows that the restriction is also an automorphism of with identity pullback. Since , by Theorem 2.3 the restriction itself is the identity map. Hence, , which completes the proof. □
Bhowmik and Tringali [4, Theorem 1.2] showed that is trivial for every numerical monoid . Together with our results, this motivates the following conjecture.
Conjecture 3.5. Let be a commutative and cancellative monoid with nontrivial torsion unit group. Suppose that is not isomorphic to . Then all automorphisms of are inner.
AI Declaration
During the preparation of this manuscript, the authors used ChatGPT and Kimi to assist with checking the set equation involving four translates in the proof of Theorem 3.3, verifying reference formats, and improving English grammar. The main mathematical results and their proofs were developed by the authors independently of these tools. The authors reviewed and edited all AI-assisted material and takes full responsibility for the final manuscript.
References
References
- [1]A. A. Antoniou and S. Tringali, On the Arithmetic of Power Monoids and Sumsets in Cyclic Groups, Pacific J. Math. 312 (2021), No. 2, 279–308.DOI
- [2]R. Ballieu, Sur les groupes de parties d’un demi-groupe (French), Ann. Soc. Sci. Bruxelles, Sér. I 64 (1950), 139–147.
- [3]G. Bianchi, The covariogram problem, pp. 37–82 in: A. Koldobsky and A. Volberg (eds.), Harmonic Analysis and Convexity, De Gruyter, Boston, 2023.DOI
- [4]A. Bhowmik and S. Tringali, On the automorphisms of numerical power monoids, preprint (arXiv: 2607.23301).
- [5]R. D. Byrd, J. T. Lloyd, F. D. Pedersen, and J. W. Stepp, Automorphisms of the semigroup of finite complexes of locally finite groups, J. Reine Angew. Math. 299/300 (1978), 151–160.
- [6]R. D. Byrd, J. T. Lloyd, F. D. Pedersen, and J. W. Stepp, The automorphism group of some semigroups, Fund. Math. 124 (1984), 187–195.
- [7]L. Cossu and S. Tringali, On the arithmetic of power monoids, J. Algebra 686 (2026), 793–813.DOI
- [8]Y. Fan and S. Tringali, Power monoids: A bridge between Factorization Theory and Arithmetic Combinatorics, J. Algebra 512 (2018), 252–294.DOI
- [10]J. M. Howie, Fundamentals of Semigroup Theory, London Math. Soc. Monogr. Ser. 12, Oxford Univ. Press, 1995.DOI
- [11]M. B. Nathanson, Problems in additive number theory, III, pp. 279–297 in: A. Geroldinger and I.Z. Ruzsa, Combinatorial Number Theory and Additive Group Theory, Birkhäuser, 2009.
- [12]B. Rago, The automorphism group of reduced power monoids of finite abelian groups, preprint (arXiv: 2510.17533).arxiv.org/abs/2510.17533
- [14]B. Rago, The isomorphism problem for reduced finitely power monoids, preprint (arXiv: 2601.22469).arxiv.org/abs/2601.22469
- [15]J. Shafer, Note on power semigroups, Math. Japon. 12 (1967), 32.
- [16]T. Tamura and J. Shafer, Power semigroups, Math. Japon. 12 (1967), 25–32; Errata, ibid. 29 (1984), No. 4, 679.
- [17]S. Tringali, Power monoids and their arithmetic: a survey, Amer. Math. Monthly, to appear (https://arxiv.org/abs/2602.15754).
- [18]S. Tringali and K. Wen, The additive group of integers and the automorphisms of its power monoids, preprint(arXiv:2504.12566).
- [19]S. Tringali and K. Wen, On the automorphisms of the power semigroups of a numerical semigroup, Trans. London Math. Soc. 13 (2026), No. 1, Art. ID e70030, 11 pp.DOI
- [21]S. Tringali and W. Yan, On power monoids and their automorphisms, J. Combin. Theory Ser. A 209 (2025), 105961, 16 pp.DOI
- [22]S. Tringali and W. Yan, Torsion groups and the Bienvenu-Geroldinger conjecture, Bull. London Math. Soc. 58 (2026), No. 7, Art. ID e70439, 16 pp.DOI
- [23]D. Wong, S. Xu, C. Zhang, and Z. Wang, On automorphism group of the reduced finitely power monoid of the additive group of integers, preprint (arXiv: 2602.19493).arxiv.org/abs/2602.19493
- [24]D. Wong, S. Xu, C. Zhang and J. Zhao, On automorphism groups of numerical power semigroups, J. Algebra 713 (2027), 356–367.DOI