Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

On automorphisms of strong semilattice of groups

    https://doi.org/10.1142/S281100722250002XCited by:2 (Source: Crossref)

    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 abΩ 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 sSα and tSβ,

    st=ϕα,αβ(s)ϕβ,αβ(t).
    Then S forms a semigroup, denoted S=[Ω;Sα,ϕα,β], known as a strong semilattice of semigroups. The homomorphisms ϕα,β are called structure homomorphisms, Ω is called the structure semilattice of S, and the semigroups Sα are called the components of S. If each component Sα of S is a group, then S forms a semigroup known as strong semilattice of groups. If S is strong semilattice of groups then unless stated otherwise the identity element of a component Sα will be denoted eα, and is the unique idempotent of Sα, so that the set of idempotents ES of S is {eα;αΩ}.

    An element a of a semigroup S is called regular if there exists xS 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

    commutes, i.e. Θβϕα,β=ψΘL(α),ΘL(β)Θα for all βα.

    The isomorphism ΘL:ΩΛ could be realized as: ΘL(α)=τ, where if Θ:ST 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 Θ:ST 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

    Θβϕα,β=ϕα,βΘα(2)
    for each α,βΩ.

    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|SjAut(Sj) for all 1i12 and jΩ.

    Table 1. Aut(S) with trivial structure morphism.

    eβrβr2βsβrβsβr2βsβ0α1α2α
    Θ1eβrβr2βsβrβsβr2βsβ0α1α2α
    Θ2eβrβr2βsβrβsβr2βsβ0α2α1α
    Θ3eβr2βrβsβr2βsβrβsβ0α1α2α
    Θ4eβr2βrβsβr2βsβrβsβ0α2α1α
    Θ5eβrβr2βrβsβr2βsβsβ0α1α2α
    Θ6eβrβr2βrβsβr2βsβsβ0α2α1α
    Θ7eβr2βrβrβsβsβr2βsβ0α1α2α
    Θ8eβr2βrβrβsβsβr2βsβ0α2α1α
    Θ9eβrβr2βr2βsβsβrβsβ0α1α2α
    Θ10eβrβr2βr2βsβsβrβsβ0α2α1α
    Θ11eβr2βrβr2βsβrβsβsβ0α1α2α
    Θ12eβ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

    ϕα,β=(0α1α2αeβrβr2β),
    and the group automorphisms as
    Θβ(rβ)=r2βandΘα=idSα,(A)
    then with this choice of ϕα,β together with condition (A), Θ3,Θ7 and Θ11 in Table 1 do not satisfy Eq. (2) so cannot be candidates for the group Aut(S).

    Also with same ϕα,β and the group automorphisms Θα and Θβ as

    Θα=(0α1α2α0α2α1α)andΘβ=idUβ,(B)
    where Uβ={eβ,rβ,r2β} is the image of ϕα,β and is a cyclic subgroup of Sβ. The automorphisms Θ2,Θ6 and Θ10 in Table 1 again do not satisfy Eq. (2) so we exclude them from Aut(S). Rest, with ϕα,β as above and any choice of Θα and Θβ in Table 1, Eq. (2) holds. So we conclude that with ϕα,β chosen as above the cardinality of Aut(S) reduces to 6 as illustrated below.

    Table 2. Aut(S) with nontrivial structure morphism.

    eβrβr2βsβrβsβr2βsβ0α1α2α
    Θ1eβrβr2βsβrβsβr2βsβ0α1α2α
    Θ4eβr2βrβsβr2βsβrβsβ0α2α1α
    Θ5eβrβr2βrβsβr2βsβsβ0α1α2α
    Θ8eβr2βrβrβsβsβr2βsβ0α2α1α
    Θ9eβrβr2βr2βsβsβrβsβ0α1α2α
    Θ12eβ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=1ki 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=1ki 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 ΘkiAut(ki) and ΘkjAut(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=1ki be a semilattice of groups ki, where ki is a cyclic group of order ki. If gcd(ki,kj)=1 for all 1i,j< with ij, then |Aut(S)|=i=1φ(ki) with φ(ki) as the Euler’s totient function.

    Proof. Suppose that S=i=1ki 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 1i,j< with ij, 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 ay, for all yY. An element a of Y is called maximum if ya, for all yY. 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

    Θβϕα,β=ϕΘL(α),ΘL(β)Θα(3)
    for all α,βΩ,βα.

    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

    Θα=ϕ1ΘL(α),ΘL(κ)Θκϕα,κ.

    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

    ϕΘL(η),ΘL(α)Θηϕ1η,α
    defines a map from Sα to SΘL(α), where ϕ1η,α is the set of inverse images of the structure homomorphism ϕη,α.

    Proof. Let the semilattice Ω have the maximum element η. For each gαSα, and as the structure homomorphism ϕη,α is onto, there exist hSη 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,h2Sη such that ϕη,α(h1)=gα=ϕη,α(h2). Let us suppose that ϕΘL(η),ΘL(α)Θηϕ1η,α(gα)=ϕΘL(η),ΘL(α)Θη(hi) for i=1,2. Since h1Sη and Sη is a group, so h11 in Sη exists. Therefore, ϕη,α(h1h11)=ϕη,α(h2h11) which implies that ϕη,α(eη)=ϕη,α(h2h11); that is, ϕη,α(h2h11)=eα. Thus, we have h2h11kerϕη,α and, so Θη(h2h11)Θη(kerϕη,α). As, by Corollary 2.2, Θη(kerϕη,α)kerϕΘL(η),ΘL(α), we have

    eΘL(α)=ϕΘL(η),ΘL(α)Θη(h2h11)=ϕΘL(η),ΘL(α)(Θη(h2)Θη(h11))(asΘηis a homomorphism)=ϕΘL(η),ΘL(α)(Θη(h2)Θη(h1)1)(asΘηis a homomorphism)=(ϕΘL(η),ΘL(α)Θη(h2))(ϕΘL(η),ΘL(α)(Θη(h1)1))×(asϕΘL(η),ΘL(α)is a homomorphism)=(ϕΘL(η),ΘL(α)Θη(h2))(ϕΘL(η),ΘL(α)Θη(h1))1×(asϕΘL(η),ΘL(α)is a homomorphism).
    Therefore, we have eΘL(α)=ϕΘL(η),ΘL(α)Θη(h2)(ϕΘL(η),ΘL(α)Θη(h1))1; that is
    ϕΘL(η),ΘL(α)Θη(h2)=ϕΘL(η),ΘL(α)Θη(h1).
    Hence, ϕΘL(η),ΘL(α)Θηϕ1η,α is a well-defined map. □

    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

    Θα=ϕΘL(η),ΘL(α)Θηϕ1η,α.(4)

    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α)={hSη:ϕη,α(h)=gα} is non-empty. Now let gαSα, then we have

    Θα(gα)=Θα(ϕη,α(h))(ashϕ1η,α(gα))=ϕΘL(η),ΘL(α)Θη(h)(by Eq.(3))=ϕΘL(η),ΘL(α)Θηϕ1η,α(gα)(by substituting forh).
    Therefore, we get the required equality as Θα=ϕΘL(η),ΘL(α)Θηϕ1η,α. □

    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

    Θα=ϕ1ΘL(α),ΘL(κ)ϕΘL(β),ΘL(κ)Θβϕ1β,κϕα,κ,whereκ=αβ.

    Proof. By Eq. (3), we have Θκϕα,κ=ϕΘL(α),ΘL(κ)Θα and Θκϕβ,κ=ϕΘL(β),ΘL(κ)Θβ. Since all the structure homomorphisms are bijective, we have

    Θα=ϕ1ΘL(α),ΘL(κ)Θκϕα,κ(5)
    and Θκ=ϕΘL(β),ΘL(κ)Θβϕ1β,κ. Now substituting the value of Θκ in Eq. (5), we have Θα=ϕ1ΘL(α),ΘL(κ)ϕΘL(β),ΘL(κ)Θβϕ1β,κϕα,κ, as required. □

    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 ϕβ,αΘβ:GSβ is an isomorphism. Therefore, we may let Θα=ϕβ,αΘβ. Let ψΘ:SS be the map defined by

    ψΘ(s)={ΘαψΘ1α(s),ifsSα;ΘβψΘ1β(s),ifsSβ.
    We show that ψΘAut(S). For this, we first show that for all sSβ
    ψΘϕβ,α(s)=ϕβ,αψΘ(s).(6)
    Therefore, we have
    Θ1α=(ϕβ,αΘβ)1Θ1α=Θ1βϕ1β,αΘαψΘ1α=ΘαψΘ1βϕ1β,αΘαψΘ1α=ϕβ,αΘβψΘ1βϕ1β,αΘαψΘ1αϕβ,α=ϕβ,αΘβψΘ1β.
    Now, for any sSβ, we have
    ΘαψΘ1αϕβ,α(s)=ϕβ,αΘβψΘ1β(s)ΘαψΘ1α(ϕβ,α(s))=ϕβ,αψΘ(s)ψΘ(ϕβ,α(s))=ϕβ,αψΘ(s).
    Hence, for all sSβ, we have ψΘϕβ,α(s)=ϕβ,αψΘ(s).

    It is clear that ψΘ is bijective. Now we show that ψΘ is a homomorphism. For this, we consider the following cases:

    Case (i). If s,tSα (s,tSβ), then

    ψΘ(st)=ΘαψΘ1α(st)=(ΘαψΘ1α(s))(ΘαψΘ1α(t))=ψΘ(s)ψΘ(t).
    Case (ii). If sSα and tSβ, then
    ψΘ(st)=ψΘ(ϕα,α(s)ϕβ,α(t))=ψΘ(sϕβ,α(t))=ψΘ(ssα)(wheresα=ϕβ,α(t))=(ΘαψΘ1α)(ssα)=(ΘαψΘ1α(s))(ΘαψΘ1α(sα))=ψΘ(s)ψΘ(ϕβ,α(t))=ψΘ(s)ϕβ,αψΘ(t)(by Eq. (6))=ψΘ(s)(ϕβ,αψΘ(t))=ψΘ(s)ψΘ(t)(by the definition of products inS).
    Hence, ψΘAut(S) and every automorphism of S can be constructed in this way. □

    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

    σλ=ϕ1α,αλϕλ,αλ:SλSα.
    Now define a map χ:SΩ×Sα by χ(s)=(λ,σλ(s)) if sSλ. We show that χ is an isomorphism. To show this, take any s1,s2S. If s1=s2, then s1,s2Sλ for some λΩ. Since σλ:SλSα is an isomorphism, we have
    s1=s2σλ(s1)=σλ(s2)(λ,σλ(s1))=(λ,σλ(s2)).
    That is, χ is well-defined and injective. Next take any (λ,t)Ω×Sα. As σλ is surjective, t=σλ(s) for some sSλ. Therefore (λ,t)=(λ,σλ(s))=χ(s); that is, χ is surjective.

    Finally to show that χ is a homomorphism and, hence, an isomorphism, take any s,tS. Then sSλ and tSδ for some λ,δΩ. If λ=δ, then there is nothing to prove. So we suppose that λδ. Now

    χ(st)=(λδ,σλδ(st))=(λδ,σλ(s)σδ(t))(as all the linking morphisms are bijective)=(λ,σλ(s))(δ,σδ(t))=χ(s)χ(t).
    Therefore, χ is an isomorphism. □

    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,α2Fτ. Then we claim that α1α2Fτ. For if α1α2Fτ, then α1α2=λ for some λFτ; that is, λα1 and λα2. Now by condition (i), we have xα1 and xα2 for all xFτ. As α1α2=λ, we have xλ for all xFτ. This is a contradiction to the choice of Fτ, hence α1α2Fτ. Now

    ξ(α1α2)=α1α2(asα1α2Fτ)=ξ(α1)ξ(α2),
    as required.

    Case (ii). α1,α2Fτ. 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 α1Fτ and α2Fτ. 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)=α1y, where y=ξ(α2) and yFτ. Therefore, by Condition (ii), we have α1y=α1. Thus ξ(α1α2)=ξ(α1)=α1=α1y=ξ(α1)ξ(α2), as required.

    Again, when α2α1, we have ξ(α1α2)=ξ(α2)=y, where ξ(α2)=y and yFτ. Again, as α1α2=α2, we have α2α1 whence, by Condition (i), yα1. So α1y=y. Thus ξ(α1)ξ(α2)=α1y=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 α1x=η for all xFτ. This implies ηx for all xFτ, a contradiction to the fact that no pair of members of Fτ is comparable. Thus, ηFτ. Now ξ(α1α2)=ξ(η)=η. Also ξ(α1)ξ(α2)=α1y, where ξ(α2)=yFτ. As α1α2=η, by Condition (ii), we have α1y=η. Thus, ξ(α1α2)=ξ(η)=η=α1y=ξ(α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.

    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:

    Θ{ΘLi;{Θα}αΩ},wherei=1,2,,6.
    Now consider the product of elements in Aut(S). Let λ,μAut(S) and sS. Then sSα for some αΩ. For instance, if α=2, then sS2. Now consider ΘL4Aut(Ω) associated with λ such that ΘL4(2)=3 and ΘL4(3)=1, say. Then μλ(s)=μ(λ2(s))=μΘL4(2)(λ2(s))=μ3λ2(s). Now consider a group isomorphism Θ2, say, where Θ2:S2SΘL4(2). Then Θ2=ϕ1,3Θ3ϕ13,2. Thus Θ2 is determined by Θ3. In fact, by Theorem 3.1, any group isomorphism of Sα (αΩ) can be determined by Θ0, where 0 is the least element in Ω. For instance, let us choose any group isomorphism Θ1, say, associated with an automorphism Θ of S and ΘLj for some j{1,2,,6}. Suppose ΘLj(1)=3 and ΘLj(0)=0. Then Θ1 can be determined by Θ0 as
    Θ1=ϕ1ΘLj(1),ΘLj(0)Θ0ϕ1,0=ϕ13,0Θ0ϕ1,0.
    Therefore, Θ0 determines any group isomorphism associated with the automorphism Θ of S.

    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

    Θ3=ϕΘLk(4),ΘLk(3)Θ4ϕ14,3=ϕ4,2Θ4ϕ14,3.
    Therefore, Θ4 determines any group isomorphism associated with the automorphism Θ of S.

    Again, by Theorem 3.4, any group isomorphism of Sα (αΩ) can be determined by Θβ, where α,βΩ. For instance, let us choose α=2 and β=3. Then 23=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

    Θ2=ϕ1ΘLp(2),ΘLp(0)ϕΘLp(3),ΘLp(0)Θ3ϕ13,0ϕ2,0=ϕ11,0ϕ2,0Θ3ϕ13,0ϕ2,0.
    Therefore, Θ3 determines any group isomorphism associated with the automorphism Θ of S.

    Fig. 2.

    Fig. 2. 5-element antichain semilattice.