Salvatore Tringali
11institutetext: School of Mathematical Sciences, Hebei Normal University
Shijiazhuang, Hebei province, 050024 China
11email: [email protected],
WWW home page:
http://imsc.uni-graz.at/tringali
On the isomorphism problem
for power semigroups
Abstract
Let be the semigroup obtained by equipping the family of all non-empty subsets of a (multiplicatively written) semigroup with the operation of setwise multiplication induced by itself. We call a subsemigroup of downward complete if any element of lies in at least one set and any non-empty subset of a set in is still in .
We obtain, for a commutative semigroup , a characterization of the cancellative elements of a downward complete subsemigroup of in terms of the cancellative elements of . Consequently, we show that, if and are cancellative semigroups and either of them is commutative, then every isomorphism from a downward complete subsemigroup of to a downward complete subsemigroup of restricts to an isomorphism from to . This solves a special case of a problem of Tamura and Shafer from the late 1960s and generalizes a recent result by Bienvenu and Geroldinger, where it is assumed, among other conditions, that and are numerical monoids.
keywords:
Isomorphism problems, numerical monoids, power algebras, cancellative semigroups, sumsets, setwise products.1 Introduction
Let be a semigroup (see the end of the section for notation and terminology). Equipped with the binary operation of setwise multiplication induced by on its own power set and defined by
the non-empty subsets of form a semigroup, herein denoted by and called the large power semigroup of . Furthermore, the non-empty finite subsets of make up a subsemigroup of , which we denote by and call the finitary power semigroup of (see Example 1.3 for a generalization). Below, we will refer to either of these structures as a power semigroup of .
Power semigroups offer a natural algebraic framework for many important problems in additive combinatorics and related fields, from Ostmann’s conjecture [18, p. 13] on the “asymptotic additive irreducibility” of the set of (positive rational) primes to Sárközy’s conjecture [21, Conjecture 1.6] on the “additive irreducibility” of the set of quadratic residues modulo for all large . More broadly, the arithmetic of power semigroups — with a focus on questions related to the possibility or impossibility of factoring certain sets as a product of other sets that are, in a way, “irreducible” — is a rich topic in itself [9] [2] [3] [29] and has been serving as a guiding example in the development of a “unifying theory of factorization” [27] [5] [6] [7] [28] whose primary aim is to extend the classical theory [11] [12] beyond its current boundaries and make it usable in non-traditional settings.
As it turns out, was first systematically studied by Tamura and Shafer [23] [13] in the 1960s (its definition can at least be traced back to the early literature on power algebras [4, Sect. 2]) and gained substantial attention in the 1980s and 1990s due to its role in the theory of automata and formal languages [1] [20]. This led to the following question, arisen from Tamura and Shafer’s work and commonly known as the isomorphism problem for power semigroups.
Question 1.1.
Suppose that a semigroup is globally isomorphic to a semigroup , meaning that is (semigroup-)isomorphic to . Is it necessarily true that is isomorphic to ?
The question was quickly answered in the negative by Mogiljanskaja [17], but remains open for finite semigroups [13, p. 5] (despite some authors claiming differently based on results that Tamura himself announced, without proof, in [25]). More generally, one can ask:
Question 1.2.
Given a class of semigroups, prove or disprove that is globally isomorphic to , for some , if and only if is isomorphic to .
It is easy to check (see Remark 2.6 and cf. [29, Remark 1.1]) that, if is a semigroup isomorphism, then the same is true of the function
where is the (direct) image of under . Therefore, the interesting aspect of Question 1.2 lies entirely in the “only if” condition. E.g., the answer to the question is positive for groups [22], completely -simple semigroups [24] [26], and Clifford semigroups [10]; is negative for involution semigroups [8]; and appears to be unknown for cancellative semigroups (see https://mathoverflow.net/questions/456604/ for further discussion).
The present paper adds to this line of research. More precisely, we say that a subsemigroup of the large power semigroup of a semigroup is downward complete if each element of lies in at least one set and every non-empty subset of a set in is itself in . The following examples illustrate the property of downward completeness and will come in handy later.
Example 1.3.
and are downward complete subsemigroups of for any semigroup ; and so is the set of all one-element subsets of , which is obviously isomorphic to through the embedding .
More generally, let be an infinite cardinal number. By basic principles of set theory (in any of the standard foundations of mathematics), each of the families
and
is a downward complete subsemigroup of . In particular, we have that when is the cardinality of , and when is the maximum between and .
Example 1.4.
Let be a semigroup and be an equivalence relation on (the carrier set of) with the additional property that and imply , i.e., is a (semigroup) congruence on . Denote by the family of all non-empty sets such that for any .
Every non-empty subset of a set in is, of course, itself in ; and since equivalence relations are reflexive, it is also clear that for each . On the other hand, we are guaranteed by the general properties of congruences that for all , because for every and , where is the equivalence class of an element in the quotient set . Therefore, is a downward complete subsemigroup of .
Example 1.5.
Given a semigroup , the intersection of any indexed family of downward complete subsemigroups of is itself a downward complete subsemigroup of . The proof is straightforward, on account of the fact that a downward complete subsemigroup of contains, a fortiori, every one-element subset of (further details are left to the reader).
That being said, we obtain, for a commutative semigroup , a characterization of the cancellative elements of a downward complete subsemigroup of in terms of the the cancellative elements of (Proposition 2.2); and we use it in Theorem 2.8 to prove that, if and are cancellative semigroups and either of them is commutative, then any isomorphism from a downward complete subsemigroup of to a downward complete subsemigroup of maps singletons to singletons and hence restricts to an isomorphism from to (up to the embedding mentioned in Example 1.3). It follows (Corollary 2.10) that and are globally isomorphic if and only if they are isomorphic, if and only if is isomorphic to . We can thus give a positive answer to Question 1.2 for the class of cancellative commutative semigroups and extend a recent result of Bienvenu and Geroldinger [3, Theorem 3.2(3)], where and are numerical monoids (i.e., submonoids of the additive monoid of non-negative integers with finite complement in ) with isomorphic to (see the comments at the end of Sect. 2).
Generalities
We denote by the (set of) non-negative integers, by the positive integers, and by the cardinality of a set. Unless otherwise specified, we write all semigroups multiplicatively. We refer to Howie’s monograph [15] for the basic theory of semigroups and monoids. In particular, we recall that, given a semigroup , an element is left (resp., right) cancellative if the map (resp., ) is injective; and is cancellative if it is left and right cancellative. The semigroup itself is then said to be cancellative if each of its elements is cancellative. Further notation and terminology, if not explained upon first use, are standard or should be clear from the context.
2 Results
The main result of the paper (namely, Theorem 2.8) is actually a direct consequence of Proposition 2.2 below, which may be of independent interest. Let us start with a basic remark.
Remark 2.1.
Let be a left (resp., right) cancellative element in a semigroup , and assume (resp., ) for some . Given , there then exists such that (resp., ). It follows (by the hypothesis on ) that and hence . By symmetry, we can thus conclude that , which ultimately shows that is a left (resp., right) cancellative element in .
The key idea, simple as it may be, is to establish that, in a downward complete subsemigroup of the large power semigroup of a cancellative commutative semigroup , the cancellative elements are all and only the one-element subsets of . In fact, we will prove something slightly more general.
Proposition 2.2.
Let be a commutative semigroup. The cancellative elements of a downward complete subsemigroup of are all and only the singletons such that is a cancellative element in .
Proof 2.3.
Let be a downward complete subsemigroup of . If for some with , then in . Since all one-element subsets of are in , it is thus clear from Remark 2.1 that is a cancellative element in if and only if is cancellative in .
It remains to check that every cancellative element of is a singleton. For, fix with . We have to prove that the function
is non-injective. We distinguish two cases.
Case 1: There exist with and . Set . If , then and hence (by the commutativity of ). Moreover, (since yields ). It follows that and hence , namely, . But this means that is not an injection (as wished), because is a downward complete subsemigroup of and is a non-empty proper subset of (with the result that and ).
Case 2: We are not in Case 1. Pick with (recall that ) and set . Since (or else we would fall back to Case 1), we have and hence . Given that is a downward complete subsemigroup of , it follows that and .
Now, let . If , then it is obvious that (by the fact that ). Otherwise, and again (by the commutativity of ). Consequently, we find that and hence , namely, . So, is a non-cancellative element of (as we have already observed that and ).
The next example demonstrates that Proposition 2.2 does not hold for non-commutative cancellative semigroups. This suggests that addressing Question 1.2 in the cancellative, non-commutative case (assuming the answer is still affirmative) may necessitate a somewhat different approach than the one envisaged in this work for the commutative case.
Example 2.4.
Let be a non-empty set and be the free semigroup over . The underlying set of consists of all the non-empty finite tuples with components in ; and the semigroup operation, hereby denoted by the symbol , is the (ordered) concatenation of such tuples.
As a matter of fact, is a cancellative semigroup. We claim that every non-empty subset of is a cancellative element in the large power semigroup of , whose operation we continue to denote by . In particular, this will prove (taking ) that a cancellative element of the large power semigroup of a cancellative semigroup need not be a singleton (in contrast with Proposition 2.2).
For the claim, assume for some non-empty sets (the case when is symmetric). We need to check that . To this end, it is clear that, since the elements of can be uniquely represented as a (non-empty, finite, ordered) concatenation of elements of , the sets and are disjoint for all with . It follows that if and only if for each , which, by Remark 2.1 and the non-emptiness of , implies (as wished).
We continue with a few additional observations that will prove useful shortly afterwards.
Remark 2.5.
Let be a semigroup isomorphism and be a left cancellative element of , and pick . Since is onto, there exist such that and . Consequently, if and only if , which implies, by the injectivity of , that . It is thus obvious from the left cancellativity of in that and hence .
By the left-right symmetry inherent in the previous argument, we can therefore conclude that maps left (resp., right) cancellative elements of to left (resp., right) cancellative elements of . In particular, it maps cancellative elements to cancellative elements.
Remark 2.6.
Let and be semigroups, and let be an isomorphism from a downward complete subsemigroup of to a downward complete subsemigroup of . In addition, assume is commutative. Given , there then exist with and , since is surjective and contains every one-element subset of . On the other hand, it is straightforward from the commutativity of that . As a result, we have and hence , which ultimately proves that is itself a commutative semigroup (cf. Proposition 1.3(a) in [19]).
Remark 2.7.
Assume is a semigroup homomorphism and let be the function . It is immediate that
for all . Consequently, is a homomorphism .
On the other hand, if is injective and for some , then , and hence is itself injective; otherwise, there would exist either with or with . Moreover, if is surjective and is a non-empty subset of , then is a non-empty subset of with , which ultimately means that also is surjective.
Now, suppose that is an isomorphism. It then follows from the above that is an isomorphism from to . In addition, being a bijection implies that a subset of and its image under have the same cardinality.
It is therefore clear (see Example 1.3 for the notation) that, for every infinite cardinal , the function restricts to an isomorphism as well as to an isomorphism . Most notably, restricts to an isomorphism from to .
We are finally ready to prove our main result and show, in the subsequent corollary, that Question 1.2 has a positive answer in the class of cancellative commutative semigroups.
Theorem 2.8.
If and are cancellative semigroups and either of them is commutative, then every isomorphism from a downward complete subsemigroup of to a downward complete subsemigroup of restricts to an isomorphism .
Proof 2.9.
Let be a downward complete subsemigroup of and be a downward complete subsemigroup of , and suppose that there is an isomorphism from to . Since either of and is commutative (by hypothesis), we have from Remark 2.6 that both and are. On the other hand, each of and is cancellative. Therefore, we gather from Proposition 2.2 that the cancellative elements of (resp., of ) are all and only the one-element subsets of (resp., of ). It then follows by Remark 2.5 that, for every , there is a uniquely determined such that . Considering that the same argument also applies to the functional inverse of , this suffices to conclude that restricts to an isomorphism from to (as wished).
Corollary 2.10.
If and are cancellative semigroups and either of them is commutative, then the following conditions are equivalent:
-
(a)
and are globally isomorphic, i.e., is isomorphic to .
-
(b)
is isomorphic to .
-
(c)
is isomorphic to .
Proof 2.11.
Corollary 2.10 is a generalization of a theorem of Bienvenu and Geroldinger [3, Theorem 3.2(3)] according to which the finitary power semigroups of two numerical monoids and are isomorphic if and only if . But there is a subtle detail here to work out.
In fact, Bienvenu and Geroldinger’s result is actually about monoid isomorphisms (note that the finitary power semigroup of a monoid with identity is a monoid with identity ). However, two numerical monoids are isomorphic if and only if they are equal [14, Theorem 3]; and it is easy to show that a surjective semigroup homomorphism from a monoid to a monoid is, a fortiori, a monoid homomorphism, i.e., it maps the identity of to the identity of .
For, set . Each is the image under of an element , which implies . It follows, by taking , that .
Acknowledgements
References
- [1] Almeida, J.: Some Key Problems on Finite Semigroups. Semigroup Forum 64, 159–179 (2002).
- [2] Antoniou, A. A., Tringali, S.: On the Arithmetic of Power Monoids and Sumsets in Cyclic Groups. Pacific J. Math. 312, No. 2, 279–308 (2021).
- [3] Bienvenu, P.-Y., Geroldinger, A.: On algebraic properties of power monoids of numerical monoids. Israel J. Math., to appear (https://arxiv.org/abs/2205.00982).
- [4] Brink, C.: Power structures. Algebra Universalis 30, 177–216 (1993).
- [5] Cossu, L., Tringali, S.: Abstract Factorization Theorems with Applications to Idempotent Factorizations. Israel J. Math., to appear (doi: https://doi.org/10.1007/s11856-024-2623-z).
- [6] Cossu, L., Tringali, S.: Factorization under local finiteness conditions. J. Algebra 630, 128–161 (Sep 2023).
- [7] Cossu, L., Tringali, S.: On the finiteness of certain factorization invariants. Ark. Mat. 62, No. 1, 21–38 (2024).
- [8] Crvenković, S., Dolinka, I., Vinčić, M.: Involution semigroups are not globally determined. Semigroup Forum 62, 477–481 (2001).
- [9] Fan, Y., Tringali, S.: Power monoids: A bridge between Factorization Theory and Arithmetic Combinatorics. J. Algebra 512, 252–294 (Oct 2018).
- [10] Gan, A., Zhao, X.: Global determinism of Clifford semigroups. J. Aust. Math. Soc. 97, 63–77 (2014).
- [11] Geroldinger A., Halter-Koch, F.: Non-Unique Factorizations. Algebraic, Combinatorial and Analytic Theory. Pure Appl. Math. 278. Chapman & Hall/CRC, Boca Raton (2006).
- [12] Geroldinger, A. Zhong, Q.: Factorization theory in commutative monoids. Semigroup Forum 100, 22–51 (2020).
- [13] Hamilton, H. B., Nordahl, T. E.: Tribute for Takayuki Tamura on his th birthday. Semigroup Forum 79, 2–14 (2009).
- [14] Higgins, J. C.: Representing -semigroups. Bull. Austral. Math. Soc. 1, 115–125 (1969).
- [15] Howie, J. M.: Fundamentals of Semigroup Theory. London Math. Soc. Monogr. New Ser. 12. Oxford Univ. Press, Oxford (1995).
- [16] Lam, T. Y.: Exercises in Classical Ring Theory. Problem Books in Math., Springer-Verlag, New York (2003).
- [17] Mogiljanskaja, E. M.: Non-isomorphic semigroups with isomorphic semigroups of subsets. Semigroup Forum 6, 330–333 (1973).
- [18] Ostmann, H.-H.: Additive Zahlentheorie, 1. Teil: Allgemeine Untersuchungen. Springer-Verlag, Berlin (1968).
- [19] Pin, J.-E.: Power semigroups and related varieties of finite semigroups. In: Goberstein, S. M., Higgins, P. M. (eds.) Semigroups and their applications, pp. 139–152. Reidel Publishing Company, Dordrecht (1987).
- [20] Pin, J.-E.: : A success story. In: Fountain, J. (ed.) Semigroups, Formal Languages and Groups. NATO ASI Ser., Ser. C, Math. Phys. Sci., vol. 466, pp. 33–47. Kluwer, Dordrecht (1995).
- [21] Sárközy, A.: On additive decompositions of the set of quadratic residues modulo . Acta Arith. 155, No. 1, 41–51 (2012).
- [22] Shafer, J.: Note on power semigroups. Math. Japon. 12, 32 (1967).
- [23] Tamura, T., Shafer, J.: Power semigroups. Math. Japon. 12, 25–32 (1967). Errata, ibid. 29, No. 4, 679 (1984).
- [24] Tamura, T.: Isomorphism problem of power semigroups of completely -simple semigroups. J. Algebra 98, 319–361 (1986).
- [25] Tamura, T.: On the recent results in the study of power semigroups. In: Goberstein, S. M., Higgins, P. M. (eds.) Semigroups and their applications, pp. 191–200. Reidel Publishing Company, Dordrecht (1987).
- [26] Tamura, T.: The regular -class of the power semigroup of a completely -simple semigroup. Math. Nachr. 149, 7–27 (1990).
- [27] Tringali, S.: An abstract factorization theorem and some applications. J. Algebra 602, 352–380 (July 2022).
- [28] Tringali, S.: A characterisation of atomicity. Math. Proc. Cambridge Phil. Soc. 175, No. 2, 459–465 (2023).
- [29] Tringali, S., Yan, W.: A conjecture by Bienvenu and Geroldinger on power monoids. Proc. Amer. Math. Soc., to appear (https://arxiv.org/abs/2310.17713).