On automorphisms of strong semilattice of groups
Abstract
In this paper, we consider the automorphisms of the strong semilattice of groups and relate them to the isomorphisms and automorphisms of underlying groups. We also provide a construction for non-trivial automorphisms of semilattices.
1. Introduction
Let (Ω,≤) be a poset. Following [2] we say that (Ω,≤) is a lower (meet) semilattice if a∧b∈Ω for all a,b∈Ω. Dually, one can define an upper (join) semilattice. In this paper by a semilattice, we shall always mean a lower semilattice. It is well known (see [2, Proposition 1.3.2]) that if (Ω,≤) is a semilattice, then a binary operation may be defined on Ω as αβ=α∧β for all α,β∈Ω under which Ω becomes a commutative semigroup of idempotents and conversely if (Ω,∧) is a commutative semigroup of idempotents, then (Ω,≤), where α≤β if and only if αβ=α for all α,β∈Ω, is a semilattice.
Let Ω be a semilattice and {Sα,α∈Ω} be the family of semigroups. A semigroup S is said to be the semilattice of semigroups Sα, α∈Ω, if S=⋃α∈ΩSα where Sα∩Sβ=∅ for α≠β and SαSβ⊆Sαβ. If for each pair β≤α in Ω, ϕα,β:Sα→Sβ is a semigroup homomorphism such that
(i) | ϕα,α=idSα for any α∈Ω. | ||||
(ii) | The homomorphisms are transitive: For any α,β,γ∈Ω with γ≤β≤α ϕβ,γ∘ϕα,β=ϕα,γ. |
On S=⋃α∈ΩSα define a multiplication ∗ where for s∈Sα and t∈Sβ,
An element a of a semigroup S is called regular if there exists x∈S such that axa=a and S is called regular if all its elements are regular. A regular semigroup S is Clifford if ES is central, that is, if idempotents commute with every element of S. The property of being Clifford has a number of alternate statements, to which we give only one.
Theorem 1.1 ([2, Theorem 4.2.1]). Let S be a semigroup. Then the following statements are equivalent :
(i) | S is a Clifford semigroup. | ||||
(ii) | S is a semilattice of groups. | ||||
(iii) | S is a strong semilattice of groups. | ||||
(iv) | S is regular and the idempotents of S are central. | ||||
(v) | S is regular and 𝒟S∩(ES×ES)=1ES. |
In this paper, motivated by Theorem 1.1, we shall take the definition of a Clifford semigroup as a strong semilattice of groups. After looking for automorphisms of the strong semilattice of groups, we relate them to the isomorphisms and automorphisms of underlying groups, and provide a construction for non-trivial automorphisms of semilattices. We also illustrate our results with some particular examples.
2. Isomorphism of Strong Semilattice of Groups
In this section, first we mention a well-known result which provides the necessary and sufficient condition for two strong semilattices of groups to be isomorphic. For this, we first fix some notations without further mention. Let S=[Ω,{Sα}α∈Ω,{ϕα,β}β≤α] and T=[Λ,{Tγ}γ∈Λ,{ψγ,δ}δ≤γ] be two strong semilattices of groups. Now onwards by S or T, we mean the semigroups which are strong semilattice of groups.
A mapping ΘL of semilattice Ω to a semilattice Λ is called a semilattice homomorphism if ΘL(α∧β)=ΘL(α)∧ΘL(β) for all α,β∈Ω, and ΘL is an isomorphism if it is bijective. An isomorphism of semilattice Ω onto itself is called an automorphism of Ω.
Theorem 2.1 ([6, Proposition II.2.8]). Two strong semilattices of groups S and T are isomorphic if and only if there exists a semilattice isomorphism ΘL:Ω→Λ and a family of group isomorphisms {Θα:α∈Ω}, where Θα:Sα→TΘL(α) such that the diagram

The isomorphism ΘL:Ω→Λ could be realized as: ΘL(α)=τ, where if Θ:S→T is an isomorphism of strong semilattice of groups, then Θ(eα)=eτ. Also the group isomorphism Θα could be realized as Θ|Sα, where α∈Ω.
In the following result, we find the relationship between the images and kernels of the structure homomorphisms, respectively.
Corollary 2.2. Let Θ:S→T be an isomorphism of strong semilattices of groups. If α,β∈Ω with β≤α, then
(1) | Θβ(imϕα,β)=imψΘL(α),ΘL(β); | ||||
(2) | Θα(kerϕα,β)=kerψΘL(α),ΘL(β). |
Proof. (i) Θβ(imϕα,β)⊆imψΘL(α),ΘL(β) follows directly from diagram (1). For reverse inclusion, since Θ is an isomorphism so by Theorem 2.1, Θ−1β exists and by diagram (1), we have imψΘL(α),ΘL(β)⊆Θβ(imϕα,β). Hence, Θβ(imϕα,β)=imψΘL(α),ΘL(β).
(ii) Let sα∈kerϕα,β. Then ϕα,β(sα)=eβ. Let us assume to the contrary that Θα(sα)∉kerψΘL(α),ΘL(β). This implies that ψΘL(α),ΘL(β)(Θα(sα))≠eΘL(β). Therefore, by diagram (1), we have Θβ(ϕα,β(sα))≠eΘL(β). This implies that Θβ(eβ)≠eΘL(β), a contradiction as Θβ is a homomorphism. Thus, we have Θα(kerϕα,β)⊆kerψΘL(α),ΘL(β), as required. For reverse inclusion, since Θ is an isomorphism so by Theorem 2.1, Θ−1α exists and so we have Θ−1α(kerψΘL(α),ΘL(β))⊆kerϕα,β, hence we have Θα(kerϕα,β)=kerψΘL(α),ΘL(β). □
It is well known that every automorphism of a finite chain (a finite semilattice in which every pair of elements is comparable) is trivial. So if the semilattice Ω is a finite chain and Θ∈Aut(S), then ΘL is a trivial semilattice automorphism. A chain semilattice is a semilattice in which every pair of elements is comparable. The most natural example of a chain semilattice is (ℕ,≤), where ≤ is natural order. Any finite subset of ℕ with natural order is also a chain semilattice. It is well known that every automorphism of (ℕ,≤) or any of its finite subsemilattice is trivial. Therefore, if the semilattice Ω has trivial automorphism, then we have the following corollary which immediately follows from Theorem 2.1.
Corollary 2.3. Θ∈Aut(S) if and only if Θα∈Aut(Sα) with
Next we illustrate with the help of examples that while obtaining Eq. (2) in the above corollary the structure homomorphisms play a vital role, i.e. cardinality of Aut(S) changes with choice of structure homomorphisms.
Example 2.1. Let Ω={α,β}β≤α and S=Sα∪Sβ, where Sα={0α,1α,2α} is the cyclic group of order 3 and Sβ={eβ,rβ,r2β,sβ,rβsβ,r2βsβ} is the dihedral group of order 6. Let the structure homomorphism ϕα,β be defined as ϕα,β(sα)=eβ for all sα∈Sα. Table 1 illustrates the group Aut(S), where in each case Θi|Sj∈Aut(Sj) for all 1≤i≤12 and j∈Ω.
eβ | rβ | r2β | sβ | rβsβ | r2βsβ | 0α | 1α | 2α | |
---|---|---|---|---|---|---|---|---|---|
Θ1 | eβ | rβ | r2β | sβ | rβsβ | r2βsβ | 0α | 1α | 2α |
Θ2 | eβ | rβ | r2β | sβ | rβsβ | r2βsβ | 0α | 2α | 1α |
Θ3 | eβ | r2β | rβ | sβ | r2βsβ | rβsβ | 0α | 1α | 2α |
Θ4 | eβ | r2β | rβ | sβ | r2βsβ | rβsβ | 0α | 2α | 1α |
Θ5 | eβ | rβ | r2β | rβsβ | r2βsβ | sβ | 0α | 1α | 2α |
Θ6 | eβ | rβ | r2β | rβsβ | r2βsβ | sβ | 0α | 2α | 1α |
Θ7 | eβ | r2β | rβ | rβsβ | sβ | r2βsβ | 0α | 1α | 2α |
Θ8 | eβ | r2β | rβ | rβsβ | sβ | r2βsβ | 0α | 2α | 1α |
Θ9 | eβ | rβ | r2β | r2βsβ | sβ | rβsβ | 0α | 1α | 2α |
Θ10 | eβ | rβ | r2β | r2βsβ | sβ | rβsβ | 0α | 2α | 1α |
Θ11 | eβ | r2β | rβ | r2βsβ | rβsβ | sβ | 0α | 1α | 2α |
Θ12 | eβ | r2β | rβ | r2βsβ | rβsβ | sβ | 0α | 2α | 1α |
From Table 1, we know that |Aut(Sβ)|=6, |Aut(Sα)|=2 and the structure homomorphism is defined as ϕα,β(sα)=eβ for all sα∈Sα. Since, for any Θβ∈Aut(Sβ) and Θα∈Aut(Sα), the equation Θβϕα,β=ϕα,βΘα is satisfied, we have |Aut(S)|=12.
Now if we take the structure homomorphism as
Also with same ϕα,β and the group automorphisms Θα and Θβ as
eβ | rβ | r2β | sβ | rβsβ | r2βsβ | 0α | 1α | 2α | |
---|---|---|---|---|---|---|---|---|---|
Θ1 | eβ | rβ | r2β | sβ | rβsβ | r2βsβ | 0α | 1α | 2α |
Θ4 | eβ | r2β | rβ | sβ | r2βsβ | rβsβ | 0α | 2α | 1α |
Θ5 | eβ | rβ | r2β | rβsβ | r2βsβ | sβ | 0α | 1α | 2α |
Θ8 | eβ | r2β | rβ | rβsβ | sβ | r2βsβ | 0α | 2α | 1α |
Θ9 | eβ | rβ | r2β | r2βsβ | sβ | rβsβ | 0α | 1α | 2α |
Θ12 | eβ | r2β | rβ | r2βsβ | rβsβ | sβ | 0α | 2α | 1α |
Next we compute the cardinality of Aut(S) where S is the strong semilattice of finite and infinite cyclic groups, respectively.
Proposition 2.4. Let S=⋃∞i=1ℤki be a semilattice of groups ℤki, where ℤki is the cyclic group of order ki. If all the structure homomorphisms are identically zero, then |Aut(S)|=∏∞i=1φ(ki), where φ(ki) is Euler’s totient function.
Proof. Let S=⋃∞i=1ℤki be a semilattice of groups ℤki, where ℤki is the cyclic group of order ki. Let all the structure homomorphisms be identically zero. Then, for any Θki∈Aut(ℤki) and Θkj∈Aut(ℤkj), the equation Θkjϕki,kj=ϕki,kjΘki is satisfied. Therefore, by Corollary 2.6 and the fact that |Aut(ℤki)|=φ(ki), we have |Aut(S)|=∏∞i=1φ(ki). This completes the proof. □
Corollary 2.5. Let S=⋃∞i=1ℤki be a semilattice of groups ℤki, where ℤki is a cyclic group of order ki. If gcd(ki,kj)=1 for all 1≤i,j<∞ with i≠j, then |Aut(S)|=∏∞i=1φ(ki) with φ(ki) as the Euler’s totient function.
Proof. Suppose that S=⋃∞i=1ℤki be a semilattice of groups ℤki, where ℤki is a cyclic group of order ki. Since we know that |Aut(ℤki)|=φ(ki) and gcd(ki,kj)=1 for all 1≤i,j<∞ with i≠j, all structure morphisms are identically zero. Therefore, by Proposition 2.7, we have |Aut(S)|=∏∞i=1φ(ki), as required. □
Proposition 2.6. Let S=⋃∞i=1𝔾i be a semilattice of groups 𝔾i, where each 𝔾i is an infinite cyclic group. Then |Aut(S)|=2.
Proof. Let 𝔾i is an infinite cyclic group, then for each i, 𝔾i behaves like ℤ. Therefore, in this case, S≅ℤ and, hence, |Aut(S)|=2=|Aut(ℤ)|. □
3. Constructing Automorphism from Structure Homomorphisms and Component Isomorphisms
Let Y be a non-empty subset of a partially ordered set (Ω,≤). An element a of Y is called minimum if a≤y, for all y∈Y. An element a′ of Y is called maximum if y≤a′, for all y∈Y. In this section, we consider Aut(S), the group of automorphisms of strong semilattices of groups S and take Ω an arbitrary semilattice not necessarily a chain. The condition (1) thus becomes
Now, by putting restrictions on the semilattice and the structure homomorphisms, we have
Theorem 3.1. Let the semilattice Ω have the minimum element κ and S be the strong semilattice of groups with all the structure homomorphisms one-to-one. Then every group isomorphism Θα associated with the automorphism Θ of S is determined by Θκ and is given
Proof. Let the semilattice Ω have the minimum element κ. Then, by Eq. (3), we have Θκϕα,κ=ϕΘL(α),ΘL(κ)Θα. As the structure homomorphism ϕΘL(α),ΘL(κ) is one-to-one, ϕΘL(α),ΘL(κ) restricted to imϕΘL(α),ΘL(κ) has an inverse. So, by Corollary 2.2, we have Θα=ϕ−1ΘL(α),ΘL(κ)Θκϕα,κ, as required. □
Next we have the lemma which helps us to prove the dual of Theorem 3.1 where all the structure homomorphisms are taken to be onto and the semilattice is assumed to have a maximum element.
Lemma 3.2. Let the semilattice Ω have the maximum element η and let all the structure homomorphisms be onto. Then
Proof. Let the semilattice Ω have the maximum element η. For each gα∈Sα, and as the structure homomorphism ϕη,α is onto, there exist h∈Sη such that ϕη,α(h)=gα. Define ϕ−1η,α(gα)=h. Now we have the following cases:
Case (i). If ϕη,α is one-to-one, then we are done.
Case (ii). If ϕη,α is not one-to-one, then there may exist h1,h2∈Sη such that ϕη,α(h1)=gα=ϕη,α(h2). Let us suppose that ϕΘL(η),ΘL(α)Θηϕ−1η,α(gα)=ϕΘL(η),ΘL(α)Θη(hi) for i=1,2. Since h1∈Sη and Sη is a group, so h−11 in Sη exists. Therefore, ϕη,α(h1h−11)=ϕη,α(h2h−11) which implies that ϕη,α(eη)=ϕη,α(h2h−11); that is, ϕη,α(h2h−11)=eα. Thus, we have h2h−11∈kerϕη,α and, so Θη(h2h−11)∈Θη(kerϕη,α). As, by Corollary 2.2, Θη(kerϕη,α)⊆kerϕΘL(η),ΘL(α), we have
The following theorem is the dual of Theorem 3.1.
Theorem 3.3. Let the semilattice Ω have the maximum element η and S be the strong semilattice of groups with all the structure homomorphisms onto. Then every group isomorphism Θα associated with the automorphism Θ of S is determined by Θη and is given by
Proof. Let the semilattice Ω have the maximum element η. Then, by Eq. (3), we have Θαϕη,α=ϕΘL(η),ΘL(α)Θη. By Lemma 3.2, we have ϕΘL(η),ΘL(α)Θηϕ−1η,α is a well-defined map. Since the structure homomorphism ϕη,α is surjective thus for any gα∈Sα the set ϕ−1η,α(gα)={h∈Sη:ϕη,α(h)=gα} is non-empty. Now let gα∈Sα, then we have
In the following theorem, we take the structure homomorphisms as isomorphisms.
Theorem 3.4. Let S be the strong semilattice of groups with all the structure homomorphisms bijective. Then every group isomorphism Θα associated with the automorphism Θ of S is given by
Proof. By Eq. (3), we have Θκϕα,κ=ϕΘL(α),ΘL(κ)Θα and Θκϕβ,κ=ϕΘL(β),ΘL(κ)Θβ. Since all the structure homomorphisms are bijective, we have
Now we provide a construction for the automorphisms of S from the automorphisms of underlying groups Sα:
Theorem 3.5. Suppose Ω={α,β}α≤β. Consider S as the strong semilattice of Sα and Sβ with all the structure homomorphisms bijective. Then each automorphism of Sα (respectively,Sβ) provides an automorphism of S.
Proof. Suppose all the structure homomorphisms are bijective. Then Sα≅Sβ≅𝔾 (say). Let ψ∈Aut(𝔾) be any arbitrary automorphism of 𝔾. Since Sα≅Sβ≅𝔾, therefore we have isomorphisms Θα:𝔾→Sα and Θβ:𝔾→Sβ.
Since Θβ:𝔾→Sβ and ϕβ,α:Sβ→Sα are isomorphisms, the morphism ϕβ,αΘβ:G→Sβ is an isomorphism. Therefore, we may let Θα=ϕβ,αΘβ. Let ψΘ:S→S be the map defined by
It is clear that ψΘ is bijective. Now we show that ψΘ is a homomorphism. For this, we consider the following cases:
Case (i). If s,t∈Sα (s,t∈Sβ), then
Next, we prove the lemma which helps us to prove Theorem 3.5 for arbitrary semilattices.
Lemma 3.6. Let Ω be any semilattice and S be a strong semilattice of groups with all the structure homomorphisms being bijective. Then, for any α∈Ω, we have S≅Ω×Sα(≅Ω×𝔾).
Proof. Fix α∈Ω. Then, for each λ∈Ω, we have an isomorphism
Finally to show that χ is a homomorphism and, hence, an isomorphism, take any s,t∈S. Then s∈Sλ and t∈Sδ for some λ,δ∈Ω. If λ=δ, then there is nothing to prove. So we suppose that λ≠δ. Now
The proof of the following corollary follows from Theorem 3.5 and Lemma 3.6.
Corollary 3.7. Let Ω be any semilattice and S be a strong semilattice of groups with all the structure homomorphisms are bijective. Then each automorphism of Sα (α∈Ω) gives rise to an automorphism of S.
4. Constructing Non-Trivial Automorphisms of Semilattices
Let Ω be a semilattice and Fα denote a set of non-comparable elements of Ω such that each pair of elements of Fα has to meet α. Let ℱ={Fα}α∈Ω and Fτ∈ℱ satisfy the following two conditions:
(i) | for any α∉Fτ if η≤α or (α≤η) for some η∈Fτ, then δ≤α or (α≤δ) for all δ∈Fτ; | ||||
(ii) | for any α∉Fτ, if α∧β=γ for some β∈Fτ, then α∧δ=γ for all δ∈Fτ. |
Now we have the theorem which provides a construction for non-trivial automorphisms of semilattices.
Theorem 4.1. Let Ω, ℱ={Fα}α∈Ω be as above and Fτ∈ℱ satisfies conditions (i) and (ii). Any mapping ξ on Ω, which fixes every element of Ω∖Fτ and permutes bijectively the elements of Fτ is a semilattice automorphism of Ω.
Proof. We only need to show that ξ is a semilattice homomorphism. Take any α1,α2∈Ω, the following cases arise:
Case (i). α1,α2∉Fτ. Then we claim that α1α2∉Fτ. For if α1α2∈Fτ, then α1α2=λ for some λ∈Fτ; that is, λ≤α1 and λ≤α2. Now by condition (i), we have x≤α1 and x≤α2 for all x∈Fτ. As α1α2=λ, we have x≤λ for all x∈Fτ. This is a contradiction to the choice of Fτ, hence α1α2∉Fτ. Now
Case (ii). α1,α2∈Fτ. By the definition of ξ, we have ξ(α1),ξ(α2)∈Fτ and by the choice of Fτ, we have α1α2=τ∉Fτ. Thus, ξ(α1α2)=ξ(τ)=τ and therefore ξ(α1)ξ(α2)=τ=ξ(α1α2). Hence, ξ is a homomorphism.
Case (iii). One of α1 or α2 is in Fτ. Without loss assume that α1∉Fτ and α2∈Fτ. Then, we have the following two subcases:
(a) | either α1≤α2 or α2≤α1; and | ||||
(b) | α1 and α2 are not comparable and α1∧α2=η(η≠τ). |
Subcase (a). If α1≤α2, then α1∧α2=α1. So ξ(α1∧α2)=ξ(α1)=α1. Also ξ(α1)∧ξ(α2)=α1∧y, where y=ξ(α2) and y∈Fτ. Therefore, by Condition (ii), we have α1∧y=α1. Thus ξ(α1∧α2)=ξ(α1)=α1=α1∧y=ξ(α1)∧ξ(α2), as required.
Again, when α2≤α1, we have ξ(α1∧α2)=ξ(α2)=y, where ξ(α2)=y and y∈Fτ. Again, as α1∧α2=α2, we have α2≤α1 whence, by Condition (i), y≤α1. So α1∧y=y. Thus ξ(α1)∧ξ(α2)=α1∧y=y. Now ξ(α1∧α2)=ξ(α2)=y=ξ(α1)∧ξ(α2), as required.
Subcase (b). First we show that η∉Fτ. Suppose to the contrary that η∈Fτ. As α1∧α2=η, by Condition (ii), we have α1∧x=η for all x∈Fτ. This implies η≤x for all x∈Fτ, a contradiction to the fact that no pair of members of Fτ is comparable. Thus, η∉Fτ. Now ξ(α1∧α2)=ξ(η)=η. Also ξ(α1)∧ξ(α2)=α1∧y, where ξ(α2)=y∈Fτ. As α1∧α2=η, by Condition (ii), we have α1∧y=η. Thus, ξ(α1∧α2)=ξ(η)=η=α1∧y=ξ(α1)∧ξ(α2), as required.
Hence, in all cases, ξ is a homomorphism and therefore ξ∈Aut(Ω). □
We hasten to note that if ℱ has only one element satisfying conditions (i) and (ii), then we have the following corollary which provides the number of such automorphisms of a semilattice.
Corollary 4.2. Let Ω, ℱ={Fα}α∈Ω be as in the above theorem, if there exists unique Fτ∈ℱ satisfying conditions (i) and (ii) with |Fτ|=n, then |Aut(Ω)|=n!.
Proof. Since any ξ∈Aut(Ω) fixes every element of Ω∖Fτ and permutes bijectively the elements of Fτ, so ξ has n! possible choices. Therefore, we have |Aut(Ω)|=n!, as required. □
Next we illustrate the above corollary with some particular examples.
Example 4.1. Let Ω={α,λ,𝜖,δ,ρ,χ,β,o} be a semilattice defined in Fig. 1.
We have that Fβ={λ,𝜖,δ} and Fo={ρ,χ} are the elements of the family ℱ. Also the element Fβ of ℱ satisfies the conditions of Theorem 4.1, and so we have the map ξ:Ω→Ω, defined by ξ(α)=α for α∉Fβ and ξ|Fβ is a permutation on Fβ, is an automorphism of Ω and by Corollary 4.2, |Aut(Ω)|=6.

Fig. 1. 9-element antichain semilattice.
Now we provide an example to validate the Theorems 3.1, 3.3 and 3.4.
Example 4.2. Let Ω={0,1,2,3,4} be the semilattice defined in Fig. 2.
Then {1,2,3} is the subset of Ω in which elements are not comparable to each other with meet 0. Let S=[Ω,{Sα}α∈Ω,{ϕα,β}α≥β] be a strong semilattice of groups with all structure morphisms being bijective. Then, by Corollary 4.2, we have |Aut(Ω)|=3!=6. Suppose that Aut(Ω)={ΘL1,ΘL2,…,ΘL6}. Thus for every Θ∈Aut(S), we may consider the following correspondence:
Now we validate Theorem 3.3 by showing that any group isomorphism of Sα (α∈Ω) can be determined by Θ4, where 4 is the maximum element in Ω. For instance, let us choose any group isomorphism Θ3, say, associated with an automorphism Θ of S and ΘLk for some k∈{1,2,…,6}. Suppose ΘLk(3)=2 and ΘLk(4)=4. Then Θ3 can be determined by Θ4 as
Again, by Theorem 3.4, any group isomorphism of Sα (α∈Ω) can be determined by Θβ, where α,β∈Ω. For instance, let us choose α=2 and β=3. Then 2∧3=0. Let Θα is associated with an automorphism Θ of S and ΘLp for some p∈{1,2,…,6}. Suppose ΘLp(2)=1, ΘLp(3)=2 and ΘLp(0)=0. Then, Θ2 can be determined by Θ3 as

Fig. 2. 5-element antichain semilattice.