Homogeneity of Inverse Semigroups
Thomas Quinn-Gregson

TL;DR
This paper investigates the conditions under which inverse semigroups are homogeneous, exploring their classifications and extending known results from semilattices and groups to this broader algebraic context.
Contribution
It establishes when different notions of homogeneity in inverse semigroups are equivalent and classifies certain types of homogeneous inverse semigroups, including periodic commutative ones.
Findings
Homogeneity notions are equivalent under certain conditions.
Classification of periodic commutative inverse semigroups.
Extension of classifications from semilattices and groups.
Abstract
An inverse semigroup is a semigroup in which every element has a unique inverse in the sense of semigroup theory, that is, if then there exists a unique such that and . We say that an inverse semigroup is a homogeneous (inverse) semigroup if any isomorphism between finitely generated (inverse) subsemigroups of extends to an automorphism of . In this paper, we consider both these concepts of homogeneity for inverse semigroups, and show when they are equivalent. We also obtain certain classifications of homogeneous inverse semigroups, in particular periodic commutative inverse semigroups. Our results extend both the classification of homogeneous semilattices and the classification of certain classes of homogeneous groups, in particular the homogeneous abelian groups and homogeneous finite groups.
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.
Homogeneity of Inverse Semigroups
Thomas Quinn-Gregson
Department of Mathematics
University of York
York YO10 5DD
UK
Abstract.
An inverse semigroup is a semigroup in which every element has a unique inverse in the sense of semigroup theory, that is, if then there exists a unique such that and . We say that an inverse semigroup is a homogeneous (inverse) semigroup if any isomorphism between finitely generated (inverse) subsemigroups of extends to an automorphism of . In this paper, we consider both these concepts of homogeneity for inverse semigroups, and show when they are equivalent. We also obtain certain classifications of homogeneous inverse semigroups, in particular periodic commutative inverse semigroups. Our results may be seen as extending both the classification of homogeneous semilattices and the classification of certain classes of homogeneous groups, in particular the homogeneous abelian groups and homogeneous finite groups.
Key words and phrases:
Homogeneous, inverse semigroups, strong amalgamation
2010 Mathematics Subject Classification:
Primary 20M18; Secondary 03C10
This work forms part of my PhD at the University of York, supervised by Professor Victoria Gould, and funded by EPSRC
1. Introduction
A structure is a set together with a collection of finitary operations and relations defined on . A countable structure is homogeneous if any isomorphism between finitely generated (f.g.) substructures extends to an automorphism of . There are strong links between homogeneity and model theoretic concepts such as -categoricity and quantifier elimination (see, for example, [17, Theorem 6.4.1]). As a consequence, homogeneity has been studied by several authors, and complete classifications have been obtained for a number of structures including graphs [20], partially ordered sets [30] and semilattices [11]. There has also been much progress in the classification of homogeneous groups and rings (see, for example, [5], [29]) and the classification has been completed for finite groups in [6] and [21] and solvable groups in [4]. Homogeneous idempotent semigroups (bands) have been classified by the author in [25]. In [9], a generalization of Hall’s group for inverse semigroups is constructed. However, it is worth noting that the inverse semigroup obtained in [9] is not a homogeneous inverse semigroup.
An inverse semigroup is a semigroup in which every element has a unique inverse in the sense of semigroup theory, that is, if then there exists a unique such that and . We denote the inverse of as . It is clear that groups are inverse semigroups, as indeed are semilattices with binary operation of meet. The aim of this paper is to consider the homogeneity of inverse semigroups. Since an inverse semigroup can be viewed as either a semigroup or as a unary semigroup (a semigroup equipped with a basic unary operation), we have two concepts of homogeneity for inverse semigroups: as semigroups and as inverse semigroups.
This paper proceeds as follows: in Section 2 the theory of inverse semigroups required for this paper is given, and used in Section 3 to consider the substructure of a homogeneous inverse semigroup (HIS). In particular, we show that a HIS is either Clifford or bisimple. In Section 4 the homogeneity of Clifford semigroups is considered and, in the case where every element has finite order, is shown to depend only on Clifford semigroups with either surjective or trivial connecting morphisms. These results are then applied to inverse semigroups with finite maximal subgroups and, in Section 5, to commutative inverse semigroups, where a partial classification is obtained. Finally, in Section 6, we consider non-periodic inverse semigroups that are homogeneous as semigroups, showing that they are necessarily groups. In particular we find exactly when the two concepts of homogeneity for inverse semigroups intersect. All structures will be assumed to be countable.
2. Basics of inverse semigroups
In this section we give a brief outline of the required theory of inverse semigroups (see [18, Chapter 5] for a more complete overview). Throughout this section, we let denote an inverse semigroup.
Lemma 2.1**.**
[18, Proposition 5.1.3 (1)]** For any we have and .
The following equivalence relations on , known as the Green’s relations, are fundamental to the study of semigroups:
[TABLE]
Furthermore, we let . For we let denote the -class containing , and similarly for . An element is an idempotent if , and we denote the set of idempotents of by . If then is the maximal subgroup of with identity [18, Corollary 2.2.6]. A commutative semigroup of idempotents is called an (algebraic) semilattice. Every semilattice comes equipped with a partial order, called the natural order on , by if and only if . A lower semilattice is a poset in which the meet (denoted ) of any pair of elements exists. The close link between algebraic semilattices and lower semilattices is highlighted in the following result.
Proposition 2.2**.**
Let be an algebraic semilattice. Then is a lower semilattice, where is the natural order on and the meet of and in is their product . Conversely, suppose is a lower semilattice. Then is an algebraic semilattice under the operation of meet, and if and only if for each .
If with and then we say that * and are incomparable*, and denote this by . The set of idempotents of any inverse semigroup forms a semilattice [18, Theorem 5.1.1]. We may define a partial order on , called the natural order on , given by if there exists such that . Note that is compatible with the multiplication , that is, if and then and . Moreover, restricts to the natural order on .
Given a subset of , we denote and as the subsemigroup and inverse subsemigroup, respectively, generated by . If , then it follows from Lemma 2.1 that
[TABLE]
Hence all f.g. inverse semigroups are also f.g. semigroups, and thus every inverse homogeneous semigroup is a HIS (since we are required to consider isomorphisms between all f.g. subsemigroups, not only the inverse ones).
Given an inverse subsemigroup of , we call -generated () if there exists such that .
The order of an element of , denoted , is the cardinality of the monogenic inverse subsemigroup . If all elements of are of finite order then is called periodic, otherwise we call non-periodic.
A semigroup is bisimple if it has a single -class. A fundamental example of a bisimple inverse semigroup is the bicylic monoid, the inverse monoid presented as an inverse monoid by , with identity element [7]. In particular, bicyclic monoids are non-periodic inverse semigroups with chain of idempotents .
The inverse semigroup is completely semisimple if no distinct -related idempotents are related under the natural order on . This is equivalent to not containing a copy of the bicyclic monoid. Indeed, if is such that and then there exists with and , and it follows that is isomorphic to the bicyclic monoid (see [13], for example). The converse is immediate.
We say that is Clifford if for all or, equivalently by [18, Theorem 4.2.1], if each -class is a group. In this case the idempotents of are central and forms a semilattice.
3. Properties of Homogeneity
Our methods for proving homogeneity comes in two forms: either we prove it directly from certain isomorphism theorems or we use the general method of Fraïssé. We shall now outline the later method. Here we apply this only to inverse semigroups, and for the general case we refer to [16, Chapter 7].
Let be a class of f.g. inverse semigroups. Then we say
- (1)
is countable if it contains only countably many isomorphism types. 2. (2)
is closed under isomorphism if whenever and then . 3. (3)
has the hereditary property (HP) if given and a f.g. inverse subsemigroup of then . 4. (4)
has the joint embedding property (JEP) if given , then there exists and embeddings (). 5. (5)
has the amalgamation property111This is also known as the weak amalgamation property. (AP) if given , where is non-empty, and embeddings (), then there exists and embeddings such that
[TABLE]
The age of an inverse semigroup is the class of all f.g. inverse semigroups which can be embedded in . We may now apply Fraïssé’s Theorem [12] to the case of inverse semigroups.
Theorem 3.1** (Fraïssé’s Theorem for inverse semigroups).**
Let be a non-empty countable class of f.g. inverse semigroups which is closed under isomorphism and satisfies HP, JEP and AP. Then there exists a unique, up to isomorphism, countable HIS such that is the age of . Conversely, the age of a countable HIS is closed under isomorphism, is countable and satisfies HP, JEP and AP.
We call the Fraïssé limit of .
Example 3.2**.**
Let be a Fraïssé class of commutative inverse semigroups. Then the Fraïssé limit of is also commutative inverse, for if then , and so (this may be generalised to arbitrary varieties of inverse semigroups). **
Example 3.3**.**
The class of all finite semilattices forms a Fraïssé class, with Fraïssé limit the universal semilattice (see [15], for example). **
Example 3.4**.**
Let be the class of all f.g. Clifford semigroups. Then is closed under both substructure and (finite) direct product, and thus has JEP. However it was shown in [15] that AP does not hold. Similarly, the class of all f.g. inverse semigroups is not a Fraïssé class. **
Fraïssé’s Theorem will be of particular use when we consider the homogeneity of commutative inverse semigroups in Section 5. We now consider the substructure of a HIS.
Given a structure , we call a subset characteristic it is invariant under each automorphism of , that is, for each .
It is easily shown that every characteristic subset generates a characteristic substructure. Moreover, the homogeneity of a structure will pass to characteristic substructures (the result for groups is given in [4, Lemma 1]). However we shall view a larger class of substructures:
Definition 3.5**.**
Let be a structure with substructure such that if is an automorphism of and there exists with , then is an automorphism of . Then we call a quasi-characteristic substructure of . **
Lemma 3.6**.**
Let be a substructure of . Then the following are equivalent:
- (i)
* is a quasi-characteristic substructure of ;* 2. (ii)
if is such that there exists with , then for all .
Proof.
(i) (ii). Trivial.
(ii) (i). Let be such that there exists with . Then by our hypothesis is a map from to and, being a restriction of an automorphism, is an injective morphism. Moreover, as and , we have that for all . Hence is surjective, and thus an automorphism. ∎
Example 3.7**.**
Let be an inverse semigroup with semilattice of idempotents . Then for any and we have
[TABLE]
and it follows that is a characteristic subsemigroup, and thus quasi-characteristic. **
Example 3.8**.**
Let be an inverse semigroup and an idempotent of . Then the maximal subgroup of is quasi-characteristic. Indeed, note that (and indeed each Green’s relation) is preserved by morphisms of , since if is a morphism to an inverse semigroup then, for ,
[TABLE]
since . Hence, if is an automorphism of and for some , then for any we have
[TABLE]
and so as required. **
Lemma 3.9**.**
Let be a homogeneous structure with a quasi-characteristic substructure . Then is homogeneous.
Proof.
Let be an isomorphism between f.g. substructures and of . Then as and are f.g. substructures of , we may extend to . Since and is quasi-characteristic we have , and so is homogeneous. ∎
Given a subset of , we say that Aut() acts transitively on if for any , there exists an automorphism of such that .
Lemma 3.10**.**
If is a HIS then acts transitively on .
Proof.
Given , we have , and so the result follows by the homogeneity of . ∎
Corollary 3.11**.**
The maximal subgroups of a HIS are isomorphic.
Proof.
Let and be maximal subgroups of a HIS for some idempotents . Then by Lemma 3.10 there exists an automorphism of such that . Hence since is preserved by automorphisms. ∎
We now consider the property of homogeneity as an inverse semigroup for two key classes of inverse semigroups: groups and semilattices. Note that, for a group, the two notions of an inverse of an element coincide. Moreover, since a finitely generated inverse subsemigroup of a group will contain a unique idempotent, it will be a subgroup [18, page 62]. Hence a group is a HIS if and only if it is a homogeneous group.
Homogeneity of lower semilattices was first considered by Droste in [10] and, together with Truss and Kuske, in [11]. Note that both articles consider the homogeneity of the corresponding structure . Since any morphism of the corresponding (algebraic) semilattice preserves , their work effectively considers homogeneity of (algebraic) semilattices. Moreover, for each , as we have for any . Hence a semilattice is a HIS if and only if it is a homogeneous semigroup.
We shall therefore refer simply to homogeneous semilattices without ambiguity. Note however, that a homogeneous semilattice need not be homogeneous as a poset.
Every linearly ordered set is a semilattice, where the meet function is the minimum of two elements. The unique, up to isomorphism, non-trivial homogeneous linear order is (where is the natural order on ). Moreover, is the unique homogeneous semilattice also being homogeneous as a poset.
A semilattice with associated partial order is called a semilinear order if is non-linear and, for all , the set is linearly ordered. This is equivalent to not containing a diamond, that is, distinct such that and with . In [10], every homogeneous semilattice forming a semilinear order was constructed, which lead to the following classification.
Proposition 3.12** ([10, 11]).**
A non-trivial homogeneous semilattice is isomorphic to either , the universal semilattice, or a semilinear order.
Note that not every semilinear order is a homogeneous semilattice. Moreover, a non-trivial homogeneous semilattice is dense, that is, for any , there exists such that . We will use this property of homogeneous semilattices throughout the paper without reference. The universal semilattice is the unique homogeneous semilattice which contains a diamond, and we have the following consequence of its universal property.
Lemma 3.13**.**
Let be the universal semilattice and a finite subsemilattice of . Then for any finite semilattice in which embeds, there exists such that .
Proof.
Let be a finite semilattice and an embedding. Since is universal, there exists an embedding . Hence is an isomorphism between and , which we can extend to an automorphism of , since the universal semilattice is homogeneous. Then is a subsemilattice of since
[TABLE]
Moreover, is isomorphic to , and the result follows by taking . ∎
We summarise our findings on an arbitrary HIS.
Corollary 3.14**.**
Let be a HIS with semilattice of idempotents . Then is a homogeneous semilattice and the maximal subgroups of are pairwise isomorphic homogeneous groups.
Since a homogeneous finite semilattice is trivial, and an inverse semigroup with a unique idempotent is a group we obtain:
Corollary 3.15**.**
Let be a finite inverse semigroup. Then is a HIS if and only if it is a homogeneous group.
Theorem 3.16**.**
Let be a HIS. If is completely semisimple then it is Clifford, otherwise is bisimple.
Proof.
Let be completely semisimple HIS. Suppose for contradiction that there exist distinct -related idempotents , so that . Since is preserved by automorphisms of , it follows by Lemma 3.10 that each -class contains the same number of idempotents. Hence there exists with and . Then as , and so by the semisimplicity of .
We claim that . Indeed, if then , contradicting being completely semisimple. If then then there exists an isomorphism between and , which fixes and sends to . Extending to an automorphism of , we have
[TABLE]
contradicting , and the claim follows. Similarly, , so that as is compatible with multiplication, and so , a contradiction. Hence and is Clifford.
Suppose instead that is not completely semisimple, so that there exists -related idempotents with . Let . If or then and so by homogeneity. On the other hand, if then yields . Thus is bisimple. ∎
Proposition 3.17**.**
Let be a bisimple HIS. Then each maximal subgroup of is infinite and is not a congruence.
Proof.
Since is bisimple, there exists with isomorphic to the bicyclic monoid, with chain of idempotents . For each , let be an automorphism of extending the unique isomorphism between the chain of idempotents and (such a list of automorphisms exist by the homogeneity of ). Let . Then and similarly , so that for each . Furthermore,
[TABLE]
so that if then , and so . Hence is an infinite subset of , and thus each -class (and in particular each maximal subgroup) is infinite by [18, Lemma 2.2.3].
Suppose for contradiction that is a congruence on . Then as we have , and so by (3.1)
[TABLE]
a contradiction. ∎
Open Problem 1**.**
Is a bisimple HIS a group?
4. The Clifford case
In this section we consider the homogeneity of Clifford semigroups. The following construction is taken from [18, Chapter 4].
Let be a semilattice. To each associate a group with identity element , and assume that if . For each pair with , let be a homomorphism, and assume that the following conditions hold:
[TABLE]
[TABLE]
On the set define a multiplication by
[TABLE]
for , and denote the resulting structure by . Then is a semigroup, and is called a strong semilattice of groups ().
We follow the usual convention of denoting element an element of as . By [23, Lemma IV.1.7], the natural order on is equivalent to
[TABLE]
for each . It follows immediately that the natural order on restricts to equality on maximal subgroups.
Theorem 4.1**.**
[18, Theorem 4.2.1]** A semigroup is Clifford if and only if it is isomorphic to a strong semilattice of groups.
To understand homogeneity of Clifford semigroups, we require a better understanding of their f.g. inverse subsemigroups. Since the class of all Clifford semigroups forms a variety of inverse semigroups [18], the inverse subsemigroups are also Clifford.
Lemma 4.2**.**
Let be an inverse subsemigroup of a Clifford semigroup . Then there exists a subsemilattice of , and subgroups of for each such that
[TABLE]
Proof.
Since is inverse, there exists a subsemilattice of such that . If then since is inverse, so . It follows that the maximal subgroup of containing is a subgroup of . Moreover, if in then and so if then
[TABLE]
and so . Hence the homomorphism is well defined, and the result follows. ∎
The following isomorphism theorem for Clifford semigroups is a simple consequence of [23, Lemma IV.1.8].
Theorem 4.3**.**
Let and be a pair of Clifford semigroups. Let be an isomorphism and, for each , let be an isomorphism. Assume also that for any , the diagram
[TABLE]
commutes. Define a map on by
[TABLE]
Then is an isomorphism from into , denoted . Conversely, every isomorphism from to can be so constructed.
We denote the diagram (4.7) by , or if the semigroup needs highlighting. The isomorphism is called the induced isomorphism from to . Note that the diagram commutes for any isomorphism and isomorphisms ( since
[TABLE]
Consequently, we need only check that the diagram commute for each .
Remark 4.4**.**
If and for each then the isomorphism theorem above can be used to construct a Clifford semigroup isomorphic to with maximal subgroups . Formally, if is an isomorphism for each then is an isomorphism from to , where
[TABLE]
In particular, maximal subgroups which can be written as a direct sum (d.s.) or a direct product (d.p.) of groups, can be considered as an internal or external d.s./d.p. without problems arising.
We adopt a non standard notation by denoting the internal d.s. and internal d.p. of a pair of groups and as and , respectively. We also denote the internal direct sum of copies of a group by , where . Unless stated otherwise, we assume that all d.s.’s of groups are internal. **
If is a HIS, then as the groups are the maximal subgroups of and , Corollary 3.14 may be rewritten as:
Corollary 4.5**.**
If is a HIS then is homogeneous and the groups are pairwise isomorphic homogeneous groups.
Hence, if is a HIS and then, by Remark 4.4, we may consider each group to be a labelling of , and the morphisms to be a labelling of an endomorphism of .
Definition 4.6**.**
Let be a Clifford semigroup. We may consider a stronger form of homogeneity by saying that is a structure-HIS if, given any pair of f.g. inverse subsemigroups and of and any isomorphism from to , then for any automorphism extending , there exists an automorphism of extending .**
Note that if is a structure-HIS then for every automorphism of , there exists an automorphism of with induced automorphism . Indeed, for any , the isomorphism between the trivial inverse subsemigroups and has induced isomorphism (from to ). The result is then immediate by the structure-homogeneity of .
This form of homogeneity will be particularly useful for the construction of a Clifford HIS from particular Clifford semigroups. We first consider how the characteristic subgroups of the maximal subgroups of a Clifford semigroup give rise to characteristic inverse subsemigroups.
A subset of a Clifford semigroup will be called order-characteristic if whenever contains an element of order , then every element of order in belongs to .
Given a group with subset , then we set
[TABLE]
Note that if then, as is contained in the group , the inverse subsemigroup is a cyclic group. In particular, our definition of the order of an element intersects with the group theory definition, that is is the minimal such that . Hence, as cyclic groups of the same cardinality are isomorphic, the following generalization of [6, Lemma 1] and its corollary are easily verifiable:
Lemma 4.7**.**
Let a Clifford HIS with characteristic subset . Then is order-characteristic.
Corollary 4.8**.**
Let and be a pair of isomorphic Clifford HIS’s with characteristic inverse subsemigroups and , respectively such that . Then , and if then .
Lemma 4.9**.**
Let be a Clifford semigroup. For each , let be an order-characteristic subgroup of such that for all . Then
[TABLE]
is an order-characteristic inverse subsemigroup of . In particular, if is a HIS then so is .
Proof.
Notice that as each are isomorphic order-characteristic subgroups, and as , it follows that for all in , and so is well defined. The result is then immediate. ∎
In particular, if in Lemma 4.9 is a HIS, then the result holds if is characteristic by Lemma 4.7.
A pair of subsets and of a group are of coprime order if . If is periodic then this is equivalent to being of relatively prime exponent, defined in [4], but does not require the theory of supernatural numbers. Note that if where and are periodic of coprime order, then clearly and are order-characteristic subgroups of , and so the lemma above may be used in this case.
Corollary 4.10**.**
Let be a homogeneous group with characteristic subsets and such that . Then and are of coprime order.
Proof.
If and both have order , then by Lemma 4.7 and both contain all elements of order . Since and intersect trivially, it follows that , and so the subgroups are coprime. ∎
The subsequent pair of lemmas will be vital to our work, and proofs will be omitted.
Lemma 4.11**.**
Let be a group with and periodic of coprime order. Then, for each subgroup of , there exists subgroups and of and , respectively, such that .
Lemma 4.12**.**
Let and be a pair of groups with the and periodic of coprime orders for each , and , . Let and be subgroups of and , respectively, and and be a pair of morphisms. Then the map given by
[TABLE]
is a morphism from to , and every morphism can be so constructed.
The homomorphism in the lemma above will often be denoted as . We observe that Lemmas 4.11 and 4.12 fail in general if we drop the periodic condition.
If is a group with and periodic of coprime order then clearly and are characteristic subgroups. The following simplification of [4, Lemma 1] then follows from the pair of lemmas above.
Corollary 4.13**.**
Let be a group with the and periodic of coprime order. Then is homogeneous if and only if and are homogeneous.
Given a group where and are periodic of coprime order, consider the Clifford semigroup with for each . Then where and , and by Lemma 4.12 we may let where and . Since and are order-characteristic subgroups of , it follows that the sets
[TABLE]
are characteristic inverse subsemigroups of by Lemma 4.9.
Corollary 4.14**.**
Let be a periodic Clifford semigroup, where each and are of coprime order. Let be an automorphism of and and be automorphisms of and , respectively. Letting , then is an automorphism of , and all automorphisms of can be constructed in this way.
Proof.
We show first that is an automorphism of . By Lemma 4.12 each is an isomorphism, so it remains to prove that the diagram commutes for any . Let , say, (). Then
[TABLE]
since and commutes. Hence commutes and is an automorphism of . The converse follows from Theorem 4.3 and the fact that and are characteristic inverse subsemigroups of . ∎
Proposition 4.15**.**
Let be a periodic Clifford semigroup, where each and are of coprime order. Then is a structure-HIS if and only if and are structure-HIS.
Proof.
() Follows immediately as and are characteristic and have structure semilattice .
() Let and be a pair of f.g. inverse subsemigroups of . It follows from Lemmas 4.2, 4.11 and 4.12 that we may take
[TABLE]
where and are subgroups of and , respectively, and . Similarly for .
Let be an isomorphism from to , and an automorphism of which extends . Then for some isomorphisms and . Hence is an isomorphism from onto and similarly for .
Since is an isomorphism between f.g. inverse subsemigroups of the structure-HIS , we may extend to an automorphism of , and similarly extend to an automorphism of . Hence is an automorphism of by Corollary 4.14, and extends as required. ∎
An simple adaptation of the proof above also gives the following result.
Proposition 4.16**.**
Let be a periodic Clifford semigroup, where and are of coprime order, and is a structure-HIS. Then is a HIS if and only if is a HIS.
Given a Clifford semigroup then, for each , we let
[TABLE]
be the image and kernel of the connecting morphism , respectively. Given in and , then
[TABLE]
and so . Thus , and similarly .
We also define the absolute image and the absolute kernel of as the subsets of given by
[TABLE]
The set , being an intersection of subgroups of , forms a subgroup, while may not.
Notation 4.17**.**
Throughout the remainder of this subsection we let denote a Clifford HIS, so that is a homogeneous semilattice and the are pairwise isomorphic homogeneous groups.**
The following lemma will be vital in our understanding of the images and kernels of the connecting morphisms.
Lemma 4.18**.**
Let be such that , and let be of the same order. Then the map
[TABLE]
given by and for , is an isomorphism.
Proof.
Note that and are isomorphic cyclic groups. Moreover, is the identity in since and so
[TABLE]
Similarly for , and it is routine to check that is indeed an isomorphism. ∎
Lemma 4.19**.**
Let be such that . Then .
Proof.
Let . By the lemma above, there is an isomorphism determined by and . Extend to an automorphism of , so that and . Then
[TABLE]
since the diagram commutes. Hence and . The dual gives equality. ∎
For each , we let denote the subgroup for (any) . Since has no maximal elements, is non-empty for all .
Lemma 4.20**.**
For each , the subgroups and are characteristic subgroups of , and are thus homogeneous. Moreover, for each , the subgroup is homogeneous.
Proof.
Let and for some . Then, by Lemma 4.18, we may take an isomorphism fixing and with . Extending to , then as commutes, we have
[TABLE]
and so is characteristic. Now let , and extend the isomorphism between and which sends to , to . Then as commutes for any , and as , we have
[TABLE]
Hence for all , that is, , and so is characteristic.
Finally, let be an isomorphism between f.g. subgroups and of . Then the map such that and is an isomorphism between f.g. inverse subsemigroups of . By extending to an automorphism of , the result follows from Theorem 4.3. ∎
Lemma 4.21**.**
If and in then there exists a pair of isomorphisms and such that . In particular, if is injective/surjective then so is , and , and .
Proof.
Clearly the map given by and is an isomorphism. By extending to an automorphism of , the first result follows immediately from the commutativity of . The injective/surjective properties of the connecting morphisms also follow. We observe that
[TABLE]
so that . If then
[TABLE]
so that . If , then there exists with , so that
[TABLE]
Hence , and so . We have thus shown that , and so . Finally,
[TABLE]
since is an automorphism of . Thus as required.
∎
We say that a subset of a group is closed under prime powers if, whenever for some prime , then every power of in also lies .
Lemma 4.22**.**
The subgroups and are closed under prime powers and . Moreover, every element in of prime order is contained in either or .
Proof.
Let . Proceeding by induction, suppose , so that every element of of order for is in by Lemma 4.7. Let be of order . Then is of order , so that . In particular, for any we have . If then for any with we have and thus (as ). Hence , a contradiction, and so . The inductive step is thus complete, and so is closed under prime powers.
Suppose for contradiction that for some prime , so that contains every element of of order by Lemma 4.7. Let be of order , so that if then there exists with . Suppose first that is finite, where hcf. Then has order , while has order . Since is closed under prime order we have , a contradiction. It follows that the pre-images of elements of order under the connecting morphisms are of infinite order. Let and let be of order . The map from to which fixes and sends to is an isomorphism by Lemma 4.18. By extending it to an automorphism of , we have that is such that , so that and . Since , it follows that the map between and which fixes and sends to is an isomorphism, and we may thus extend it to an automorphism of . Then and, by the commutativity of ,
[TABLE]
Hence is of order , however , so that is of infinite order, and a contradiction is achieved.
Now suppose has order . If is finite, then there exists a prime with , and so has order , a contradiction. If is infinite then there exists and with , so that is of infinite order. Since the absolute kernels are pairwise isomorphic we have for each . Hence contains every element of infinite order in by Lemma 4.7, and so , a contradiction. Hence and have trivial intersection.
We may now prove that is closed under prime powers. Let for some prime , and let be of order . If for all then , a contradiction. Hence there exists with of order , so that . By Lemma 4.21 and so is closed under prime powers.
Finally, let be of prime order . If then has order for some , and so by the usual argument , thus completing the final result. ∎
Consequently, by Corollary 4.10, the subgroups and are of coprime order. Hence, as and are characteristic subgroups of , they are invarient under inner automorphisms of and thus are normal, we have .
Lemma 4.23**.**
If is periodic then . If is non-periodic then either or or is the precisely set of elements of finite order in .
Proof.
If has finite order for some primes then, by the Fundamental Theorem of Finite Abelian Groups, for some of order . By the previous corollary we have , and so . Consequently, the subgroup contains every element of of finite order, and so if is periodic then .
Now suppose that contains an element of infinite order. Suppose first that , say . Then either or has infinite order, as and are of coprime order. Hence, by Lemma 4.7, either or contains all elements of infinite order, and so . If is of infinite order, then for any we have that has infinite order. Hence and , being of infinite order, are in , and thus so is . Thus , and so . The case where is of infinite order is proven similarly.
If no such element exists, then is precisely the elements of finite order as required.
∎
We may say more about the final case in Lemma 4.23, in particular that each maximal subgroup is the union of its kernel subgroups:
Lemma 4.24**.**
If is non-periodic and periodic, then the inverse subsemigroup of is a HIS. Moreover, the absolute image of is trivial and .
Proof.
The first result is immediate from Lemma 4.9 since , being the subgroup containing all periodic elements of , is order-characteristic.
We claim that each element of infinite order in is contained in the kernel of some connecting morphism. For any we have that has finite order, say , since . Hence is an element of infinite order with . The claim easily follows by homogeneity.
Now suppose that . Then has infinite order, since otherwise is an element of , and thus so is . By the previous claim, and for some . Hence
[TABLE]
and so . Hence is trivial as required.
Finally, if there exists then for some , a contradiction, and the final result is obtained. ∎
We call a Clifford semigroup in which each connecting morphism is surjective a surjective Clifford semigroup.
Corollary 4.25**.**
Let be a surjective Clifford HIS. Then the absolute kernels of are trivial.
Proof.
Immediate from Lemma 4.22. ∎
Lemma 4.26**.**
The inverse subsemigroup of is a surjective Clifford semigroup, where .
Proof.
By definition . Let . If is periodic then by Lemma 4.23 (and as Im ) there exists and such that . Hence and is surjective. If is non-periodic, then the result is trivially true when , or when , since in this case , so we suppose . Then as forms a periodic HIS by the previous lemma, the result follows by the periodic case. ∎
For each in , we let denote the trivial morphism from to , and let . We shall call a Clifford semigroup in which each connecting morphism is trivial an image-trivial Clifford semigroup.
We observe that, for each , and then . Hence has two important inverse subsemigroups,
[TABLE]
which are HIS by Lemma 4.9. Moreover, if is periodic then .
We summarise the findings thus far in this section as follows:
Theorem 4.27**.**
Let be a periodic Clifford HIS. Then , where:
- (i)
* is a homogeneous semilattice;* 2. (ii)
* is a surjective Clifford HIS;* 3. (iii)
* is an image-trivial Clifford HIS;* 4. (iv)
there exists a homogeneous group where and are of coprime order, such that , and for all .
A non-periodic Clifford semigroup is a HIS if and only if it is isomorphic to either a surjective Clifford HIS, or an image-trivial Clifford HIS, or a Clifford HIS with no elements of infinite order lying in the images or absolute kernels.
In the next subsection we shall prove a converse to the first result of Theorem 4.27. This relies on proving the stronger property of homogeneity for image-trivial Clifford semigroups.
Lemma 4.28**.**
Let and be isomorphic homogeneous groups. Then any isomorphism between f.g. subgroups and of and , respectively, can be extended to an isomorphism between and .
Proof.
Let be an isomorphism and consider any isomorphism . Then is an isomorphism between f.g. subgroups of , which can thus be extended to an automorphism of . The isomorphism extends , since if then
[TABLE]
∎
Lemma 4.29**.**
Let be an image-trivial Clifford semigroup. Then the following are equivalent:
- (i)
* is a structure-HIS;* 2. (ii)
* is a HIS;* 3. (iii)
* is homogeneous and there exists a homogeneous group such that for all .*
Proof.
Immediate, as every structure-HIS is a HIS.
Immediate from Corollary 4.5.
Let and be a pair of f.g. inverse subsemigroups of , where the maps and , being restrictions of trivial morphisms, are trivial. Let be an isomorphism from to and let be an automorphism of which extends . By Lemma 4.28 we may extend each to an isomorphism . For each , let be any isomorphism from to . We claim that is an automorphism of . Indeed, for any and we have
[TABLE]
and so the diagram commutes and thus is indeed an automorphism. Moreover, by construction extends , and so extends . Hence is a structure-HIS. ∎
Let be an image-trivial Clifford semigroup such that for each . Let be an isomorphism for each , and define a bijection by
[TABLE]
for each , . Then we may use to endow the set with a multiplication
[TABLE]
We denote the resulting semigroup as . We have thus shown that:
Lemma 4.30**.**
Let be an image-trivial Clifford semigroup such that for each . Then .
4.1. Spined product
We now consider a more succinct form of a periodic Clifford HIS semigroup using spined products.
Definition 4.31**.**
[2]** Given a pair of semigroups and , with common morphic image , then the spined product of and w.r.t. is the subsemigroup
[TABLE]
of , where and are morphisms onto .**
Let () be a pair of Clifford semigroups. Then the map such that for each is a morphism (and is the natural map associated with the congruence ), and the spined product of and with respect to is then given by
[TABLE]
which we denote as .
Lemma 4.32**.**
Let and be defined as above. Then is isomorphic to the Clifford semigroup .
Proof.
The map given by for each is easily shown to be an isomorphism. ∎
Note 4.33**.**
Let and be Clifford semigroups () and consider a pair of isomorphisms
[TABLE]
Then the map given by is clearly an isomorphism by Theorem 4.3, which we denote as . Note that the induced semilattice isomorphisms of and are required to be equal in this construction. **
Corollary 4.34**.**
Let and be a pair of spined products of Clifford semigroups such that and are structure-HIS’s. Then if and .
Proof.
Let have structure semilattice , and be an isomorphism from to and an isomorphism from to . Then is an automorphism of , and so as is a structure-HIS there exists an automorphism of with induced automorphism . Hence is an isomorphism, with induced isomorphism , and so from the note above is an isomorphism from to as required. ∎
If is a periodic HIS then by Lemma 4.32 is isomorphic to and thus, by Corollary 4.34 and the structure-homogeneity of , to , where .
We have thus proven the forward half of the periodic case of the following:
Theorem 4.35**.**
A periodic Clifford semigroup is a HIS if and only if there exists a homogeneous group , where and are of coprime order, and a surjective Clifford HIS with such that
[TABLE]
A non-periodic Clifford semigroup is a HIS if and only if is isomorphic to either a surjective Clifford HIS, or for some homogeneous semilattice and group , or a Clifford HIS with no elements of infinite order lying in the images or absolute kernels.
Proof.
We first prove the backwards half of the periodic case. Let and be as in the hypothesis of the theorem. Then as is structure-HIS semigroup by Lemma 4.29, the semigroup is a HIS if and only if is a HIS by Proposition 4.16. The non-periodic case follows immediately from Theorem 4.27 and Lemma 4.29.
∎
It thus suffices to consider the homogeneity of both surjective Clifford semigroups with trivial absolute kernels, and the case where there exists elements of infinite order lying outside the images and absolute kernels.
4.2. Connecting isomorphisms
In this subsection we consider the homogeneity of a surjective Clifford semigroup such that a non-trivial connecting morphism is an isomorphism. By Lemma 4.21 this focces all connecting morphisms to be isomorphisms. In [25], strong semilattices of rectangular bands with connecting morphisms being isomorphisms were considered. This work relied only on the fact that, for strong semilattices of rectangular bands, an isomorphism theorem exists of the form in Theorem 4.3, and not on the behaviour of the rectangular bands. As such, the proofs of Lemmas 4.36 and 4.38 and Proposition 4.37 are mirrored in Lemmas 4.16 and 4.18 and Proposition 4.17 of [25], and as such are omitted.
Lemma 4.36**.**
Let be a Clifford semigroup such that each is an isomorphism. Let and, for a fixed , let be an isomorphism. For each , let be given by
[TABLE]
Then is an automorphism of . Conversely, every automorphism of can be so constructed.
Proposition 4.37**.**
Let be a Clifford semigroup such that each connecting morphism is an isomorphism. Then is a structure-HIS if and only if and are homogeneous for (any) .
Lemma 4.38**.**
Let be a Clifford semigroup such that each connecting morphism is an isomorphism. Then for any group isomorphic to .
Hence by Proposition 4.37 and Corollary 4.5, we have that is a structure-HIS if and only if is a HIS if and only if and are homogeneous.
Since all surjective morphisms between finite groups are isomorphisms, we thus have by Proposition 3.17 and Theorem 4.35:
Theorem 4.39**.**
Given a homogeneous semilattice and a pair of finite homogeneous groups and of coprime orders, the Clifford semigroup is a HIS. Conversely, every HIS with finite maximal subgroups is isomorphic to an inverse semigroup constructed in this way.
4.3. Non-injective surjective Clifford semigroups
Throughout this subsection we let be a surjective Clifford HIS such that each is non-injective. Recall that the absolute kernels of are trivial by Corollary 4.25. Following in line with the general case, we shall attempt to decompose the maximal subgroups into direct products of characteristic subgroups.
The group contains two key subsets: the absolute image and
[TABLE]
The set forms a subgroup of , since if and then . While may not form a subgroup, it is closed under powers, since if then for each and ,
[TABLE]
so that .
By the usual arguments we have:
Lemma 4.40**.**
For each , is a characteristic subgroup of and is a characteristic subset of with . Moreover, and for each .
Consequently, for each and is a characteristic subgroup of . Moreover, and are coprime by Corollary 4.10. We fix the following subsets of .
[TABLE]
where and .
Lemma 4.41**.**
For each , the subsets and of are Clifford HIS’s. Moreover, if is periodic then and are surjective.
Proof.
To prove that and are inverse subsemigroups, it suffices to show that and are maps to and , respectively. If , say, , then . If then as we have by Lemma 4.7, and so as required. Hence and are inverse subsemigroups and, by Lemma 4.9, are HISs.
Finally, as has trivial absolute kernel, so do and . Hence as is periodic then it follows from Theorem 4.35 that and are surjective. ∎
Lemma 4.42**.**
If in then .
Proof.
If , then it follows by a simple application of homogeneity that for all . Hence is the absolute kernel of which, being trivial, implies that each connecting morphism is injective, a contradiction. ∎
Lemma 4.43**.**
For each we have . Consequently, if forms a subgroup then and, if in addition is non-periodic, then is trivial, so that .
Proof.
Let have finite order . Then there exists such that has order , say, . We choose so that is of minimal order, noting that as . Then , since if for some then , contradicting the minimality of . Since , it follows from Lemma 4.7 that . Moreover , so . Hence as is characteristic , contains all elements of order . Hence as is characteristic by Lemma 4.40, contains all elements of order by Lemma 4.7. Since and are coprime, there exists such that , and so
[TABLE]
Now let be an element of infinite order. If there exists such that has finite order then and so contains all elements of infinite order. Otherwise, no such exists, so that and contains all elements of infinite order. Hence .
Now suppose forms a subgroup. Then as and are trivial intersecting characteristic, and thus normal, subgroups of and , it follows that . If is non-periodic, then we have shown that every element of of infinite order lies in . It follows by a similar argument to the proof of Lemma 4.23 that equals or . Since the connecting morphisms are non-injective we thus have and is trivial. ∎
Lemma 4.44**.**
The subset is closed under prime powers. Moreover, forms a subgroup if and only if and intersect trivially.
Proof.
Suppose for some prime , and let be of order . Then has order , and is therefore an element of by Lemma 4.7. Hence is of order for any , and , so that . We thus have that , and so is closed under prime powers
Now suppose and let . If has finite order for some then . However, and so . It follows that has order , since its order is at least the order of its image, and so . Otherwise, has infinite order for all , so that is also of infinite order, and so . The converse is immediate from Lemma 4.40. ∎
This lemma points towards a positive answer to the following question.
Open Problem 2**.**
Are the absolute images of a surjective Clifford HIS with non-injective connecting morphisms necessarily subgroups?
Lemma 4.45**.**
If the absolute images of form subgroups isomorphic to then
[TABLE]
where if is non-periodic then is trivial.
Proof.
Suppose first that is periodic. Since is a subgroup, is a surjective Clifford subsemigroup of by Lemma 4.41. By Lemma 4.43 we have , where and are coprime, so that by Lemma 4.12. Hence by Lemma 4.32. Moreover, we have by Lemma 4.40, so in particular , and so each connecting morphism is injective, and thus an isomorphism. Hence by Lemma 4.38, and the first result then follows from Corollary 4.34 and the fact that is a structure-HIS by Proposition 4.37.
The final result is immediate from Lemma 4.43. ∎
We have proven the forward direction direction of the subsequent Theorem. The converse holds by Proposition 4.16, since the inverse semigroup is a structure-HIS when and are homogeneous.
Theorem 4.46**.**
Let be a surjective Clifford semigroup such that each absolute image forms a subgroup and the connecting morphisms are surjective but not injective. Then is a HIS if and only if there exists a homogeneous semilattice , a homogeneous group where and are of coprime order if is periodic, or is trivial otherwise, such that is isomorphic to
[TABLE]
where for each and is a surjective Clifford HIS with being the union of the kernels, none of which are equal.
In the case when the absolute images forms subgroups, it consequently suffices to consider the homogeneity of a surjective Clifford semigroup , with and homogeneous and being a (dense) union of the kernels of the connecting morphisms, none of which are equal.
Open Problem 3**.**
Which homogeneous groups are a dense union of isomorphic normal subgroups?
A group is co-Hopfian if it is not isomorphic to a proper subgroup222Non co-Hopfian groups are also known as -groups.. This is equivalent to every injective morphism being an automorphism. Dually, a group is Hopfian if it is not isomorphic a proper quotient or, equivalently, if every surjective morphism is an automorphism. An immediate consequence of the following lemma is that is both non Hopfian and non co-Hopfian:
Lemma 4.47**.**
Let be a HIS with each connecting morphism surjective but not injective and such that Ker for each . Then is non hopfian and non co-Hopfian, with Ker .
Proof.
For each , let Ker , noting that is homogeneous by Lemma 4.20. We claim that age()=age(), so that by Fraïssé’s Theorem. Indeed, as is a subgroup of we have that age() is a subclass of age(). Let age(). Then there exists a f.g. inverse subsemigroup of isomorphic to . For each there exists such that . Letting , then for all and so . Hence, as by Lemma 4.21 we have age(. Since the age of a structure is closed under isomorphism, we have age(, thus completing the proof of the claim, and so is non co-Hopfian.
By Corollary 4.5 we may pick an isomorphism . The endomorphism of given by is a surjective non-automorphism, and thus is non Hopfian. ∎
5. Homogeneity of commutative inverse semigroups
Given that a full classification of homogeneous abelian groups is known, it is natural to consider an extension of this to commutative inverse semigroups. As an immediate consequence of [18, Theorem 4.2.1], commutative inverse semigroups are Clifford, and as such we may use the results of the previous sections to attempt to classify commutative HIS. For consistency with earlier work, we continue with the multiplicative notation, so that the operation is denoted by juxtaposition.
By Theorem 4.35 it suffices to consider the homogeneity of either surjective Clifford semigroups or non-periodic Clifford semigroups with elements of infinite order not lying in the images or absolute-kernels of the maximal subgroups. We first give an overview of homogeneous abelian groups, and consider when such groups are (co-)Hopfian.
Given a prime , the Prüfer group is an abelian -group with presentation
[TABLE]
Alternatively, can be thought of as a union of a chain of cyclic -groups of orders , so that is the set of all powers of . Each Prüfer group is divisible, that is, for each and , there exists such that . The Prüfer groups, along with , form the building blocks for all divisible abelian groups (see [28] for an in depth study of divisible groups).
By [4, Theorem 2], an abelian group is homogeneous if and only if its isomorphic to some
[TABLE]
where and partition the set of primes, and . For example, if for each then is the universal abelian group, that is the homogeneous abelian group in which every f.g. abelian group embeds.
Note that the groups and are indecomposable, that is, they are not isomorphic to a direct sum of two non-trivial groups (again see [28]).
It follows by the work in [1] that the group is co-Hopfian if and only if and are finite, for all . We shall call component-wise non co-Hopfian if for each . That is, is component-wise non co-Hopfian if and only if each of its non-trivial -components are non co-Hopfian and .
Let be an abelian group with subset for some index set . We call a disjoint subset if , or equivalently, if and have trivial intersection for each . Note that if form a disjoint subset of then lcm , where we define lcm for all .
For example, if , where and is either a finite cyclic -group, a Prüfer group or , then a maximal disjoint subset of is of size since is indecomposable.
5.1. Surjective commutative inverse semigroups
Throughout this subsection we let be a surjective commutative HIS with each isomorphic to the group in (5.1) and connecting morphisms non-injective. Recall that as is surjective, each absolute kernel is trivial by Corollary 4.25.
Lemma 5.1**.**
For each , the absolute image of is a subgroup.
Proof.
By Lemma 4.43 the result is immediate if is non-periodic, and so we may assume is periodic. Let be of orders and , respectively. Suppose for contradiction that , so that there exists and such that . However, divides , which in turn divides since is abelian. It easily follows that and are not of coprime orders, contradicting the work after Lemma 4.40, and so is indeed a subgroup. ∎
By Theorem 4.46, it suffices to consider the case where the absolute image of each maximal subgroup is trivial, so that for each . Hence, by Lemma 4.47, is non Hopfian and non co-Hopfian.
Lemma 5.2**.**
The group is component-wise non co-Hopfian.
Proof.
For each , let denote the -component of , and let be non-trivial for some . Then is an order-characteristic subgroup of , so that the set of elements of of order some power of forms a HIS by Lemma 4.9. Since is periodic with trivial absolute kernel and absolute image, it follows from Theorem 4.35 and Theorem 4.46 that is a surjective Clifford semigroup with each a union of kernel subgroups. In particular, is non co-Hopfian, and thus so is the -component of , forcing by [1].
Suppose for contradiction that , so that is non-periodic, and let in . Pick a disjoint subset of with , and let for each , so that forms a disjoint subset of . Then for any of infinite order we have for some large enough , since otherwise forms a disjoint subset of of size . Hence
[TABLE]
contradicting being a disjoint subset. Hence is infinite as required. ∎
In particular, age is precisely the class of all f.g. abelian groups with elements of order from . Note also that if is divisible, that is either periodic with for each or non-periodic, then is a characteristic subgroup of the universal abelian group.
Lemma 5.3**.**
The semilattice is the universal semilattice.
Proof.
Suppose for contradiction that is a linear or semilinear order and let in . Let be of order . Since the absolute kernel is trivial, there exists such that . Then , since otherwise . Hence as forms a chain, we have , so that by Lemma 4.42. Since by Lemma 4.21 there exists an element of order .
Suppose first that for some prime . If there exists such that then
[TABLE]
and so . However has order , and thus , so that . Hence as is of order , and it follows that . In particular, we may extend the isomorphism swapping and to an automorphism of . Since is linear or semilinear either or . By the commutativity of the diagram we have
[TABLE]
as . Hence , and similarly as we attain . If then , while if then , both giving contradictions. Consequently no element of can have prime order, and so is torsion free with by Lemma 5.2.
If for some then , and so , contradicting being torsion free. Thus , and we argue in much the same way as above to arrive at a contradiction. ∎
Let denote the age of the group , which is a Fraïssé class by the homogeneity of . Let denote the class of all f.g. commutative inverse semigroups with maximal subgroups from . That is, is the class of all f.g. commutative inverse semigroups with elements of order from .
Given a semigroup , then we may adjoin an extra element to to form a monoid , with multiplication extending that of and with for all and .
Proposition 5.4**.**
The class forms a Fraïssé class.
Proof.
Since is closed under substructure and direct product, so is . It is then immediate that has HP and JEP. To show closure under amalgamation, we follow the construction by Imaoka in [19, Section 2]. Given with common inverse subsemigroup , we may assume w.l.o.g. that and are strong semilattice of groups, say, and . We may also assume w.l.o.g. that . Note that has maximal subgroups and (), which are members of , and so is a member of , and similarly so is . Hence , as an inverse subsemigroup of is a member of , and is isomorphic to the free commutative inverse semigroup product of and . Imaoka then showed that there exists a congruence on such that is isomorphic to the free product of and amalgamating in the variety of commutative inverse semigroups, denoted . Moreover, the maps and given by and () are embeddings such that . Hence is generated by the elements and , which are of orders from , and so since is closed under product we have . Consequently is a member of , and AP holds.
Finally, it is somewhat folklore that the class of all f.g. commutative semigroups is countable. In fact this result can be deduced from Rédei’s Theorem [26], which states that every f.g. commutative semigroup is finitely presented (see also [8, Theorem 9.28]). In particular the subclass of is countable. ∎
We shall denote the Fraïssé limit of as , noting that if and only if . We now prove that is isomorphic to .
Lemma 5.5**.**
Let be such that either or . Then:
- (i)
If then for every of order there exists an infinite disjoint subset of of elements of order which are the pre-image of under ; 2. (ii)
If forms a diamond in , then for any of order , there exists of order such that .
Proof.
Let and be of order . We first claim that there exists of order with . If then the result is immediate as is surjective. Let for some prime and (the case being trivial). Suppose for contradiction that for all we have . Then for all , contradicting the absolute kernel being trivial. Hence there exists of order . By Lemma 4.18 we may extend the isomorphism from to , determined by and , to an automorphism of . Then commutes and so
[TABLE]
Since has order , the claim holds in this case. Now suppose for some primes and . By the Fundamental Theorem of Finite Abelian Groups, for some of order and so, by the previous case, there exists of order with for each . Then has order and is such that , and the claim holds in all cases.
Notice that the set is precisely the elements of mapped to . Since by Lemma 4.47, is component-wise non co-Hopfian. By Lemma 5.2 there exists an infinite disjoint subset of of elements of order . If for some and then , a contradiction. It follows that each has order . We claim that forms an infinite disjoint subset of . If
[TABLE]
for some , then by commutativity, and so . Hence , so that , and we thus have
[TABLE]
contradicting being disjoint, and the claim holds. The result then follows as .
Let form a diamond in and be of order . By part there exists of order such that , so that . Let , so . Then there exists with and such that , else is a maximal element in the subsemilattice of , which would clearly contradict homogeneity. Extend the isomorphism between and which sends to and fixes all other elements, to an automorphism of . Then is of order with by the commutativity of (as ), and by the commutativity of . ∎
Lemma 5.6**.**
Let be a diamond in and let and be of orders , respectively, such that . Then, for any such that either () or , there exists of order such that and .
Proof.
We may assume that . Indeed, as is the universal semilattice we may pick with , and by Lemma 3.13. By the previous lemma there exists and of order with and , and so it would suffice to consider and instead.
By Lemma 5.5 there exists of order such that , so that . Let . Then there exists such that and , else would be a maximal element in the set , thus contradicting the homogeneity of . Let , and pick of order , noting that such an element exists as . Arguing in much the same way as in the proof of Lemma 5.5 , the element has order . By Lemma 5.5 there exists of order with . Then as has order , it easily follows that has order , and is such that
[TABLE]
The map between the f.g. inverse subsemigroups and which sends to and fixes all other elements, is clearly an isomorphism. Extend the isomorphism to an automorphism of . Then gives the required element. ∎
Corollary 5.7**.**
Let be such that for each , and be such that if then . Then for any with for all , and any with either for all or , there exists an infinite disjoint subset of of elements of order which are the pre-image of under .
Proof.
By Lemma 5.5 () the result holds when . We proceed by induction by supposing that the result holds when , and letting and satisfy the conditions of the corollary. Since is the universal semilattice there exists with but by Lemma 3.13. By the induction hypothesis there exists of order such that for all . Since forms a diamond in , there exists of order such that and by the previous lemma. Hence for all . Let be such that for each (again such an element exists by Lemma 3.13), and let . By Lemma 5.5 there exists an infinite disjoint subset of of elements of order which are mapped to , and thus to each . This completes the inductive step. ∎
Proposition 5.8**.**
The age of is .
Proof.
Let denote the age of , noting that clearly is a subclass of . Since a 1-generated Clifford semigroup is a cyclic group, each 1-generated member of is a member of , and thus of . Proceeding by induction, assume that every -generated member of is contained in , for some . Let be an -generated member of . To avoid trivially being a member of we may assume that is non-trivial. Let be maximal in and suppose is an -generated abelian group, where each is a cyclic subgroup. Let be the inverse subsemigroup of given by
[TABLE]
Then is -generated and with structure semilattice , where if , and else. By the inductive hypothesis there exists an embedding , with induced embedding . Since is the universal semilattice there exists such that by Lemma 3.13, where we take if . Let be an upper cover of in , and for each . By Corollary 5.7, there exists a infinite disjoint subset of with which are the pre-image of each under (). Note that is f.g. since it is either empty or equal to . On the other hand, is infinitely generated, and it follows that there exists only finitely many with . Hence, for some , we have that is isomorphic to , and its easily shown that the map given by and is an embedding, thus completing the inductive step. ∎
A full classification of surjective commutative HIS is now achieved. In particular we may describe all periodic commutative HIS as follows (the non-periodic case will be considered separately in the next subsection).
Theorem 5.9**.**
Let and be periodic homogeneous abelian groups of pairwise coprime orders and component-wise non co-Hopfian. Let be a homogeneous semilattice, and let denote the universal semilattice. Then the following inverse semigroups are HIS:
- (i)
; 2. (ii)
;
Conversely, every periodic commutative HIS is isomorphic to an inverse semigroup constructed in this way.
Proof.
Let be a periodic commutative HIS. Then by Theorem 4.35 , where is a surjective Clifford HIS and is coprime to the homogeneous group . By Corollary 4.25 the absolute kernels of are trivial. If each is an isomorphism, then by Lemma 4.38, which is structure-HIS by Proposition 4.37. We then have case by Corollary 4.34. Otherwise, as the absolute images form subgroups by Lemma 5.1 we have by Theorem 4.46, where has trivial absolute image and is of coprime order to . Each is isomorphic to some component-wise non co-Hopfian group by Lemma 5.2. By Propositions 5.4 and 5.8 we have , and we thus obtain case () again by Corollary 4.34.
Conversely, the inverse semigroups and are structure-HIS by Proposition 4.37 and Lemma 4.29, and the semigroup is a HIS by Proposition 5.4. The result then follows by Proposition 4.16. ∎
5.2. An open case
We now consider the final case, where is a commutative HIS such that each is isomorphic to the group in (5.1) and elements of infinite order are not contained in the image or absolute kernel of . We observe that as , the subgroup is non-trivial.
By Lemma 4.24 the absolute images of are trivial, so that and by Lemma 4.47. By Lemma 4.23, the elements of of finite order form precisely the subgroup , which is clearly a characteristic subgroup of . It follows by Lemma 4.9 that elements of of finite order forms a HIS
[TABLE]
where . The inverse subsemigroup of is a periodic surjective commutative HIS with trivial absolute-images and, by Corollary 4.25, trivial absolute kernels. It then follows by Theorem 5.9 that , where is component-wise non co-Hopfian, and that is isomorphic to universal semilattice by Lemma 5.3. Hence is isomorphic to the structure-HIS by Lemmas 4.29 and 4.30, where . By Corollary 4.34, we have that , and it follows that
[TABLE]
where and for some , where and are disjoint subsets of .
We let denote the class of all f.g. commutative inverse semigroups with maximal subgroups in , where is as in (5.2), and satisfying the following properties:
- (1)
every element of infinite order is maximal in ; 2. (2)
for each , every element of order some power of is maximal in ;
where is the natural order on . In particular, if then every element of infinite order is mapped to an element of finite order by non-trivial connecting morphisms by (1) and, for each , every non-trivial element of order some power of is not contained in an image of any connecting morphism by (2), and so is contained in the absolute kernel of its maximal subgroup. Note also that is a subclass of .
Open Problem 4**.**
For which conditions on and does form a Fraïssé class?
The problem we face when tackling this is open problem that the method in the proof of Proposition 5.4 no longer applies. For example, let and be a pair of chains, and let and be f.g. Clifford semigroups, with of infinite order. Note that . Let be the congruence on as given by Imaoka. Then and have infinite order and . Hence does not satisfy (2), and is thus not a member of .
We shall now prove that age() is by following the methods of the previous subsection.
Proposition 5.10**.**
Let be such that for each . Let be such that if then . Then for any with for all , and any with either for all or , there exists a disjoint subset of of size if is finite, and size otherwise, consisting of elements of order which are the pre-image of under .
Proof.
Recall that contains the inverse subsemigroup isomorphic to , where . Hence if is finite, then the result easily follows by Corollary 5.7, where the required disjoint subset of is contained in .
Suppose instead that . By the previous case we may fix of finite order with for all . Since is the universal semilattice, we may pick with by Lemma 3.13. Let be a disjoint set of size consisting of elements of infinite order and such that . Note that such a set exists as . Then is a disjoint set of size consisting of elements of infinite order, and for each . ∎
By a simple adaptation of Proposition 5.8 we thus obtain:
Corollary 5.11**.**
The age of is .
Theorem 5.12** (Classification Theorem of commutative HIS).**
Let be an homogeneous non-periodic abelian group, a homogeneous semilattice and be the universal semilattice. Then the following inverse semigroups are HIS:
- (i)
; 2. (ii)
; 3. (iii)
, with component-wise non co-Hopfian; 4. (iv)
the Fraïssé limit of a Fraïssé class , where and is component-wise non co-Hopfian.
Conversely, every non-periodic commutative HIS is isomorphic to an inverse semigroup constructed in this way.
Proof.
By Theorem 4.35, A non-periodic commutative Clifford semigroup is a HIS if and only if isomorphic to either a surjective Clifford HIS, or for some homogeneous semilattice and group , or a Clifford HIS with no elements of infinite order lying in the images or absolute kernels. By the usual argument, a surjective commutative Clifford is a HIS if and only if is isomorphic to either for some homogeneous and , or a HIS with connecting morphisms non-injective, and being a dense union of kernels by Theorem 4.46 (since the absolute image forms a subgroup by Lemma 5.1). By Propositions 5.4 and 5.8 the second possibility holds if and only if isomorphic to , where is component-wise co-Hopfian by Lemma 5.2. It thus suffices to consider the case where has no elements of infinite order lying in the images or absolute kernels. If is a HIS then age() is by Corollary 5.11, and thus is isomorphic to the Fraïssé limit of the Fraïssé class . The converse is trivial by Fraïssé’s Theorem. ∎
6. Inverse Homogeneous Semigroups
In this section we study the differences between the two concepts of homogeneity for inverse semigroups, in particular when a HIS has the stronger property of being an inverse homogenous semigroup (HS).
Lemma 6.1**.**
Let be a periodic inverse semigroup. Then is a HS if and only if it is a HIS.
Proof.
Suppose is a HIS, so that, being periodic, is a Clifford semigroup by Theorem 3.16. Note that a subsemigroup of a periodic group is a subgroup, since some power of each element is its inverse. Hence, for any finitely generated subsemigroup of , we have , and the result follows. The converse is trivial. ∎
Now consider an arbitrary (not necessarily inverse) semigroup , and let
[TABLE]
We observe that if is a HS then Aut() acts transitively on . Indeed, for each , we have
[TABLE]
and the result then follows by the homogeneity of . In particular, either all elements of lie in subgroups of , or none of them do. Indeed, if are such that for some then by taking an automorphism of sending to we have since is preserved under automorphisms (noting that ).
The set of idempotents of an arbitrary semigroup forms a partially ordered set under the natural order, given by if and only if (so that if is inverse then is the usual natural order on , discussed in Section 2). We call an idempotent of primitive if, for all ,
[TABLE]
If all idempotents of are primitive, then we call a primitive semigroup.
Lemma 6.2**.**
Let be a HS with a non-periodic element contained in a maximal subgroup of . Then is a primitive semigroup.
Proof.
Since for any , the results of Lemma 3.10 and Corollary 3.11 easily extend to homogeneous semigroups, that is, Aut() acts transitively on and the maximal subgroups of are pairwise isomorphic. In particular, each maximal subgroup of is non-periodic. Let be such that , and let . Then
[TABLE]
and so the map
[TABLE]
determined by and is an isomorphism. By the homogeneity of we may extend to an automorphism of . Since is preserved under we have and . Hence and it follows that as required. ∎
A regular semigroup which contains a primitive idempotent is called completely simple, and we therefore obtain the following corollary to Lemma 6.2
Corollary 6.3**.**
Let be a regular homogeneous semigroup. If contains a non-periodic element in a subgroup of then is completely simple.
Corollary 6.4**.**
A non-periodic inverse HS is a group, homogeneous as a semigroup.
Proof.
Let be a non-periodic inverse HS. Then is a HIS, and is either bisimple or Clifford by Theorem 3.16. If is bisimple, then there exists such that is isomorphic to the bicyclic monoid with . Since Aut() acts transitively on Inf(), there exists an automorphism of with . Hence as is inverse, and so and . This contradicts preserving the natural order on , and so is Clifford. Since is a union of groups, elements of infinite order are certainly contained in maximal subgroups, and thus is primitive by Lemma 6.2. However the semilattice is primitive if and only if it is trivial, and so is a group. ∎
However the converse is not known, that is, is a homogeneous group an inverse HS? We give a positive answer for the class of abelian groups, thus completing our study into the homogeneity of commutative inverse semigroups:
Proposition 6.5**.**
A homogeneous abelian group is a HS.
Proof.
If is periodic then the result is clear, and so we assume is a non-periodic abelian homogeneous group with identity 1. Let be an isomorphism between f.g. subsemigroups of , and let denote the finitely generated subgroups of generated by and , respectively. Since is abelian, each element of is of the form for some and so we may take the map given by
[TABLE]
Then is well defined and injective since, for any we have
[TABLE]
If , then there exists such that and since is surjective. Hence and is surjective. Finally,
[TABLE]
and for any . It follows that is an isomorphism, and extends since for all ,
[TABLE]
Since any automorphism of which extends additionally extends , we have that is a HS by the homogeneity of . ∎
From the proposition above and Theorem 5.9 we obtain a complete classification of all commutative inverse HS, as either a periodic commutative HIS or a homogeneous non-periodic abelian group.
Open Problem 5**.**
Is a non-periodic homogeneous group a HS?
We have an number of open problems, and we hope to answer these in due course.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. A. Beaumond, ‘Groups with isomorphic proper subgroups’, Bull. Amer. Math. Soc. 51 (1945) 381–387.
- 2[2] S. Bogdanović, M. Ćirić, ‘Spined products of some semigroups’, Proc. Japan Acad. 69 (1993) 357–362.
- 3[3] G. Cherlin, U. Felgner, ‘Quantifier eliminable groups’, Logic colloquium (1980) 69–81.
- 4[4] G. Cherlin, U. Felgner, ‘Homogeneous solvable groups’, J. London Math. Soc. 44 (1991) 102–120.
- 5[5] G. Cherlin, D. Saracino, C. Wood, ‘On homogeneous nilpotent groups and rings’, Proc. Amer. Math. Soc. 119 (1993) 1289–1306.
- 6[6] G. Cherlin, U. Felgner, ‘Homogeneous finite groups’, J. London Math. Soc. 62 (2000) 784–794.
- 7[7] A. H. Clifford and G. B. Preston, ‘The algebraic theory of semigroups, Vol 1’, Amer. Math. Soc. (1961).
- 8[8] A. H. Clifford and G. B. Preston, ‘The algebraic theory of semigroups, Vol 2’, Amer. Math. Soc., Province (1967).
