Automorphism groups of superextensions
of finite monogenic semigroups
Taras Banakh and Volodymyr Gavrylkiv
Ivan Franko National University of Lviv (Ukraine) and Jan Kochanowski University in Kielce (Poland)
[email protected]
Vasyl Stefanyk Precarpathian National University,
Ivano-Frankivsk, Ukraine
[email protected]
Abstract.
A family L of
subsets of a set X is called linked if A∩B=∅ for any A,B∈L. A linked family
M of subsets of X is maximal linked if
M coincides with each linked family L on
X that contains M. The superextension
λ(X) of X consists of all maximal linked families on X. Any
associative binary operation ∗:X×X→X can be extended
to an associative binary operation ∗:λ(X)×λ(X)→λ(X). In the
paper we study automorphisms of the superextensions of finite
monogenic semigroups and characteristic ideals in such semigroups. In particular, we describe the automorphism groups of the superextensions of
finite monogenic semigroups of cardinality ≤5.
Key words and phrases:
monogenic semigroup, maximal linked upfamily, superextension, automorphism group
1991 Mathematics Subject Classification:
20D45, 20M15, 20B25
1. Introduction
In this paper we investigate the automorphism group of the
superextension λ(S) of a finite monogenic semigroup S. The
thorough study of various extensions of semigroups was started in
[14] and continued in [1]–[10] and [15]–[18].
The largest among these extensions is the semigroup υ(S) of all
upfamilies on S. A family A of non-empty subsets of
a set X is called an upfamily if for each set
A∈A any subset B⊃A of X belongs to
A. Each family B of non-empty subsets of
X generates the upfamily ⟨B⊂X:B∈B⟩={A⊂X:∃B∈B (B⊂A)}. An upfamily F that is closed
under taking finite intersections is called a filter. A
filter U is called an ultrafilter if
U=F for any filter F
containing U. The family β(X) of all
ultrafilters on a set X is called the Stone-Čech
extension of X, see [20]. An ultrafilter, generated by a singleton {x}, x∈X, is called
principal. Each point x∈X is identified with the
principal ultrafilter ⟨{x}⟩ generated by the
singleton {x}, and hence we can consider
X⊂β(X)⊂υ(X). It was shown in [14]
that any associative binary operation ∗:S×S→S can be
extended to an associative binary operation ∗:υ(S)×υ(S)→υ(S) by the formula
[TABLE]
for upfamilies A,B∈υ(S). In this
case the Stone-Čech compactification β(S) is a
subsemigroup of the semigroup υ(S).
The semigroup υ(S) contains as subsemigroups many other important
extensions of S. In particular, it contains the semigroup
λ(S) of maximal linked upfamilies, see [13], [14].
An upfamily L of
subsets of S is said to be linked if A∩B=∅ for all A,B∈L. A linked upfamily
M of subsets of S is maximal linked if
M coincides with each linked upfamily L on
S that contains M. It follows that β(S) is a subsemigroup of λ(S).
The space λ(S)
is well-known in General and Categorial Topology as the superextension of S, see [22]–[24].
For a finite set X, the cardinality of the set λ(X) grows very quickly as ∣X∣ tends to infinity.
The calculation of the cardinality of λ(X) seems to be a
difficult combinatorial problem, which can be reformulated as the problem of counting the number λ(n) of self-dual monotone Boolean functions of n variables, which is well-known in Discrete Mathematics.
According to Proposition 1.1 in [11],
[TABLE]
which means that the sequence (λ(n))n=1∞ has double exponential growth.
The sequence of numbers λ(n) (known in Discrete Mathematics as Hoşten-Morris numbers) is included in the On-line Encyclopedia of Integer Sequences as the sequence A001206. All known precise values of this sequence (taken from [11]) are presented the following table.
[TABLE]
Each map f:X→Y induces the map
[TABLE]
If φ:S→S′ is a homomorphism of semigroups, then λφ:λ(S)→λ(S′) is a homomorphism as well, see [15].
A non-empty subset I of a semigroup S is called an ideal
if IS∪SI⊂I. An ideal I of a semigroup S is called proper if I=S.
A proper ideal M of S is maximal if M coincides with each proper ideal I of S that contains M.
It is easy to see that for every n∈N the subset S⋅n={x1⋅…⋅xn:x1,…,xn∈S} is an ideal in S.
An element z of a semigroup S is called a zero (resp. a left zero, a right
zero) in S if az=za=z (resp. za=z, az=z) for any a∈S. An element e of a semigroup S is called an idempotent if ee=e. By E(S) we denote the
set of all idempotents of a semigroup S.
Recall that an isomorphism between S and S′ is a bijective function
ψ:S→S′ such that ψ(xy)=ψ(x)ψ(y) for
all x,y∈S. If there exists an isomorphism between S and
S′, then S and S′ are said to be isomorphic, denoted
S≅S′. An isomorphism ψ:S→S is called an automorphism of a semigroup S. By Aut(S) we denote
the automorphism group of a semigroup S.
For an automorphism ψ of a semigroup S, a subset A⊂S is called ψ-invariant if ψ(A)=A. A subset A⊂S is called characteristic if ψ(A)=A for any automorphism ψ of S. It is easy to see that the set E(S) is characteristic in S and so are the ideals S⋅n for all n∈N.
For a set X by SX we denote the group of all bijections of X. For two sets X⊂Y we shall identify SX with the subgroup {φ∈SY:φ∣Y∖X=id} of the permutation group SY. By Cn we denote a cyclic group of order n∈N.
In this paper we study automorphisms of superextensions of finite monogenic semigroups.
The thorough study of automorphism groups of superextensions of semigroups was started in
[19] and continued in [9].
In [19] it was shown that each automorphism of a semigroup S can be extended to an automorphism of its superextension λ(S)
and the automorphism group Aut(λ(S)) of the superextension of a semigroup S contains a subgroup,
isomorphic to the automorphism group Aut(S) of S. Also the automorphism groups of superextensions
of null semigroups, almost null semigroups, right zero semigroups, left zero semigroups and all three-element semigroups were described.
In [9] we studied the automorphism groups of superextensions of groups and described the automorphism groups Aut(λ(G))
of the superextensions of all groups G of cardinality ∣G∣≤5.
The obtained results are presented in Table 1.
In Section 3 we establish some general results on the structure of superextensions of finite monogenic groups, using the notion of a good shift introduced in Section 2. In particular, in Theorem 3.2 we prove that two monogenic groups are isomorphic if and only if their superextensions are isomorphic. In Section 4 we use the results of Section 3 to classify the authomorphism groups of the superextensions of monogenic semigroups of order ≤5. The obtained results are summed up in the table in Section 5.
2. Semigroups possessing a good shift
In this section we develop a tool for recognizing the automorphism group of a semigroup possessing a good shift.
Definition 2.1**.**
Let X be a semigroup. A function σ:X→X is called a good shift of X if
X⋅X⊂σ(X) and for any elements x,y∈X with σ(x)=σ(y) the equalities xz=yz and zx=zy hold for all z∈X.
A good shift σ:S→S is called an auto-shift if σ∘ψ=ψ∘σ for any automorphism ψ∈Aut(S).
Proposition 2.2**.**
If σ:X→X is a good shift of a semigroup X, then
the automorphism group Aut(X) of X contains the subgroup K consisting of all bijections ψ:X→X of X such that σ∘ψ=σ and ψ∣XX=id. This subgroup is isomorphic to ∏x∈σ(X)Sσ−1(x)∖XX.
Proof.
It is clear that the group K is isomorphic to the product
of permutation groups ∏x∈σ(X)Sσ−1(x)∖XX.
To see that K⊂Aut(X), it is necessary to check that each bijection ψ∈K is an automorphism of the semigroup X.
Given two elements x,y∈X, we shall show that ψ(xy)=ψ(x)⋅ψ(y). It follows that xy∈XX and hence ψ(xy)=xy. Since σ∘ψ=σ, we obtain that σ(ψ(x))=σ(x) and σ(ψ(y))=σ(y). Now Definition 2.1 ensures that
[TABLE]
so ψ∈Aut(X).
∎
A homomorphism ρ:S→S of a semigroup S is called a homomorphic retraction if ρ∘ρ=ρ. The functoriality of the superextension in the category of semigroups [15] ensures that for any homomorphic retraction ρ:S→S the map λρ:λ(S)→λ(S) is a homomorphic retraction, too.
For a semigroup X by ΞX denote the family of all characteristic subsets of X.
Theorem 2.3**.**
If σ:X→X is an auto-shift of a semigroup X, then σ(X) is a characteristic ideal of X, and for the restriction operator
[TABLE]
the kernel of R is equal to ∏x∈σ(X)Sσ−1(x)∖σ(X) and R(Aut(X))⊂H⊂G where
[TABLE]
and
[TABLE]
If the auto-shift σ is a homomorphic retraction, then R(Aut(X))=H=G.
Proof.
Definition 2.1 ensures that XX⊂σ(X), so σ(X) is an ideal in X. Since σ is an auto-shift, for any automorphism ψ∈Aut(X) we have ψ∘σ=σ∘ψ and hence
[TABLE]
which means that the ideal σ(X) is characteristic in X.
Now consider the group K of all bijections ψ:X→X such that σ∘ψ=σ and ψ∣σ(X) is the identity map of σ(X).
It is clear that the group K is isomorphic to the product of permutation groups ∏x∈σ(x)Sσ−1(x)∖σ(X).
By Proposition 2.2, K⊂Aut(X).
It is clear that K is contained in the kernel Ker(R) of the restriction operator R:Aut(X)→Aut(σ(X)). On the other hand, for any automorphism ψ∈Ker(R) we get σ∘ψ=ψ∘σ=σ, so ψ∈K.
Observe that for any automorphism ψ of X the equality ψ−1∘σ=σ∘ψ−1 implies that
σ−1(y)=σ−1(ψ(y)) for any y∈σ(X).
Moreover, for any characteristic set C∈ΞX we get ψ(C)=C and hence
[TABLE]
and hence ∣σ−1(x)∩C∣=∣σ−1(ψ(x))∩C∣. Since σ(X)∈ΞX, for the restriction φ:=ψ∣σ(X) of ψ we get φ(σ−1(x)∩σ(X))=σ−1(x)∩σ(X) for every x∈σ(X), which means that φ=R(ψ)∈H and hence R(Aut(X))⊂H.
The inclusion H⊂G follows from X∖σ(X)∈ΞX.
Assuming that σ is a homomorphic retraction, we shall prove that R(Aut(X))=H=G.
It suffices to check that each automorphism φ∈G extends to an automorphism of the semigroup X.
By the definition of G, we can extend the automorphism φ of σ(X) to a bijection φˉ
of X such that φˉ(σ−1(x)∖σ(X))=σ−1(φ(x))∖σ(X) for all x∈σ(X).
By φ∈G, we also get φ(σ−1(x))∩σ(X)=σ−1(φ(x))∩σ(X). So, φˉ(σ−1(x))=σ−1(φ(x)) for any x∈σ(X).
This equality implies the equality σ∘φˉ=φ∘σ. Indeed, for any z∈X and x=σ(z) we get φˉ(z)∈φˉ(σ−1(x))=σ−1(φ(x)). Applying to this equality the map σ, we obtain σ∘φˉ(z)∈{φ(x)} and hence σ∘φˉ(z)=φ(x)=φ∘σ(z).
Let us show that the bijection φˉ is an automorphism of X. Given any elements x,y∈X, it suffices to check that φˉ(xy)=φˉ(x)⋅φˉ(y).
Taking into account that xy∈XX⊂σ(X) and σ:X→σ(X) is a homomorphic retraction, we conclude that xy=σ(xy)=σ(x)⋅σ(y) and thus
[TABLE]
∎
3. Automorphisms and characteristic ideals of superextensions of finite monogenic semigroups
A semigroup S is called monogenic if it is generated by some element a∈S in the sense that S={an}n∈N. If a monogenic semigroup is
infinite, then it is isomorphic to the additive semigroup N of positive integer numbers. A
finite monogenic semigroup S=⟨a⟩ also has simple
structure, see [21]. There are positive integer numbers r
and m called the index and the period of S such
that
S={a,a2,…,ar+m−1} and r+m−1=∣S∣;
ar+m=ar;
Cm:={ar,ar+1,…,ar+m−1} is
a cyclic and maximal subgroup of S with the
neutral element e=an∈Cm and generator an+1, where n∈(m⋅N)∩{r,…,r+m−1}.
From now on, we denote by Mr,m a finite monogenic semigroup of
index r and period m. Consider the shift
[TABLE]
and observe that for
every k∈N the shift σk:Mr,m→akMr,m, σk:x↦akx, coincides with the kth iteration of σ.
Observe also that the subset akMr,m=σk(Mr,m) coincides with
the characteristic ideal Mr,m⋅(k+1) of Mr,m. For k≥r
the characteristic ideal Mr,m⋅k=ak−1Mr,m coincides with the minimal
ideal of Mr,m and with a maximal subgroup Cm of Mr,m.
For the idempotent e=an of the group
Cm the shift σn:Mr,m→anMr,m=Cm is a homomorphic retraction of Mr,m onto
its maximal subgroup Cm. This retraction will be denoted by ρ.
The following lemma distinguishes some characteristic ideals in the semigroup λ(Mr,m).
Lemma 3.1**.**
For every k≥2 the subsemigroup λ(Mr,m⋅k) of λ(Mr,m)
coincides with the characteristic ideal λ(Mr,m)⋅k of the semigroup λ(Mr,m).
Proof.
By the functoriality of the superextension, the surjective map
[TABLE]
induces the surjective map λσk−1:λ(Mr,m)→λ(Mr,m⋅k), λσk−1:A↦ak−1∗A.
Then for every maximal linked upfamily B∈λ(ak−1Mr,m) we can find a maximal linked upfamily A∈λ(Mk,m) with B=ak−1∗A and conclude that B=ak−1∗A∈λ(Mk,m)⋅k.
On the other hand, the definition of the semigroup operation on λ(Mr,m)
implies that λ(Mr,m)⋅k⊂λ(Mr,m⋅k)=λ(ak−1Mr,m).
So, λ(Mr,m⋅k)=λ(Mr,m)⋅k is a characteristic ideal in λ(Mr,m).
∎
Theorem 3.2**.**
Two finite monogenic semigroups are isomorphic if and only if their superextensions are isomorphic.
Proof.
If two semigroups are isomorphic, then their superextensions are isomorphic by the functoriality of the superextension in the category of semigroups [15]. Now assume that two monogenic semigroups Mi,m and Mj,n have isomorphic superextensions. Let ψ:λ(Mi,m)→λ(Mj,n) be an isomorphism.
Let Cm be the maximal subgroup of Mi,m. By Lemma 3.1, the superextension λ(Cm) is a characteristic subsemigroup of λ(Mi,m), equal to the intersection ⋂k∈Nλ(Mi,m)⋅k of the characteristic ideals λ(Mi,m)⋅k. Then
[TABLE]
and hence
∣λ(Cm)∣=∣λ(Cn)∣.
Observe that two finite sets X,Y have the same cardinality if ∣λ(X)∣=∣λ(Y)∣.
Indeed, assuming that ∣X∣<∣Y∣ we can choose an injective map f:X→Y with f(X)=Y and obtain an injective
map λf:λ(X)→λ(Y) with λf(λ(X))=λ(Y), which implies that ∣λ(X)∣<∣λ(Y)∣. Now we see that the equality ∣λ(Cm)∣=∣λ(Cn)∣ implies n=m.
On the other hand, the equality ∣λ(Mi,m)∣=∣λ(Mj,n)∣ implies i+m−1=∣Mi,m∣=∣Mj,n∣=j+n−1. Since m=n, we obtain that i=j and hence Mi,n=Mj,m.
∎
Proposition 3.3**.**
If r≥3, then any automorphism ψ of the semigroup λ(Mr,m) has ψ(x)=x for all x∈Mr,m.
Proof.
Let a be the (unique) generator of the monogenic semigroup Mr,m.
By Lemma 3.1, a∗λ(Mr,m)=λ(Mr,m)⋅2 is a characteristic
ideal in λ(Mr,m). Then for any automorphism ψ∈Aut(λ(Mr,m)) we get
[TABLE]
and
hence a2=ψ(a)∗A for some A∈λ(Mr,m). Taking into account that for r≥3, the equality a2=x∗y has a unique solution x=y=a in λ(Mr,m), we conclude that ψ(a)=a and hence ψ(x)=x for all x∈Mr,m.
∎
In the following proposition by e we denote the unique idempotent of the
group Cm⊂Mr,m and by ρ:Mr,m→Cm, ρ:x↦ex, the homomorphic
retraction of Mr,m onto Cm. The homomorphic retraction ρ induces a homomorphic
retraction ρˉ:λ(Mr,m)→λ(Cm), ρˉ:A↦e∗A.
Theorem 3.4**.**
For r=2 the homomorphic retraction ρˉ:λ(Mr,m)→λ(Cm)⊂λ(Mr,m) has the following properties:
- (1)
A∗B=ρˉ(A)∗B=A∗ρˉ(B)=ρˉ(A)∗ρˉ(B)* for any A,B∈λ(Mr,m);*
2. (2)
ψ(x)=x* for any x∈Cm and any ψ∈Aut(λ(Mr,m));*
3. (3)
the homomorphic retraction ρˉ is an auto-good shift of λ(Mr,m);
4. (4)
the operator R:Aut(λ(Mr,m))→Aut(λ(Cm)) has kernel isomorphic to ∏L∈λ(Cm)Sρˉ−1(L)∖{L} and the range R(Aut(Mr,m))={φ∈Aut(λ(Cm)):∀L∈λ(Cm)∣ρˉ−1(φ(L))∣=∣ρˉ−1(L)∣}.
Proof.
-
The first statement follows from the definition of the semigroup operation on λ(Mr,m) and the equality xy=ρ(x)⋅y=x⋅ρ(y)=ρ(x⋅y) holding for any elements x,y∈Mr,m=M2,m.
-
Fix any automorphism ψ of the semigroup λ(Mr,m).
By Lemma 3.1, λ(Cm) is a characteristic ideal of λ(Mr,m),
so the restriction ψ∣λ(Cm) is an automorphism of the semigroup λ(Cm). In [9] it was proved that ψ(Cm)=Cm.
Taking into account that e is a unique idempotent of Cm, we conclude that ψ(e)=e.
Since ψ is an automorphism of λ(Mr,m), for every A∈λ(Mr,m) we have
[TABLE]
which implies that ψ(ρˉ−1(B))=ρˉ−1(ψ(B)) and hence
∣ρˉ−1(B)∣=∣ρˉ−1(ψ(B))∣ for all B∈λ(Cm). In particular,
for the generator a of the semigroup Mr,m we get ∣ρˉ−1(ae)∣=∣ρˉ−1(ψ(ae))∣. Now observe that
ρˉ−1(ae)⊃ρ−1(ae)={ae,a} and ρˉ−1(x)=ρ−1(x)={x} for any x∈Cm∖{ae}. This implies that ψ(ae)=ae and hence ψ(x)=x for all x∈Cm (as ae is a generator of the group Cm).
-
The third statement follows from the preceding two statements.
-
The fourth statement follows from the preceding statement and Theorem 2.3.
∎
Lemma 3.5**.**
If r≥2, then the map
[TABLE]
is an auto-shift of the semigroup λ(Mr,m).
Proof.
It is clear that σˉ(λ(Mr,m))=a∗λ(Mr,m)=λ(Mr,m)⋅2. Next, we show that σˉ∘ψ=ψ∘σˉ for every automorphism ψ of λ(Mr,m).
If r≥3, then ψ(a)=a by Proposition 3.3 and hence
[TABLE]
for any A∈λ(Mr,m).
If r=2, then ax=aex for any x∈Mr,m. By Theorem 3.4, ψ(ae)=ae and then
[TABLE]
for any A∈λ(Mr,m).
It remains to prove that for any A,A′∈λ(Mr,m) with σˉ(A)=σˉ(A′) the equalities A∗B=A′∗B and B∗A=B∗A′ hold for all B∈λ(Mr,m).
It follows from a∗A=σˉ(A)=σˉ(A′)=a∗A′ that an∗A=an∗A′ for all n∈N and hence x∗A=x∗A′
for all x∈Mr,m. To see that B∗A=B∗A′, take any set C∈B∗A and find
a set B∈B and a family (Ab)b∈B∈AB such that ⋃b∈BbAb⊂C.
For every b∈B, we can use the equality bAb∈b∗A=b∗A′ to find a set Ab′∈A′ such that bAb′⊂bAb.
Then
[TABLE]
and hence C∈B∗A′.
By analogy we can prove that B∗A′⊂B∗A.
Next, we prove that A∗B=A′∗B. Given any element C∈A∗B, find a set A∈A and a family {Bx}x∈A⊂B such that ⋃x∈AxBx⊂C. Since aA∈a∗A=a∗A′, there exists a set A′∈A′ such that aA′⊂aA. For any y∈A′ find x∈A with ay=ax and put By:=Bx. We claim that ⋃y∈A′yBy⊂C. Indeed, for any z∈⋃y∈A′yBy we can find y∈A′ and b∈By such that z=yb∈yBy. For the element y there exists an element x∈A such that ax=ay and By=Bx. The equality ax=ay implies akx=aky for all k∈N. In particular, bx=by. Then z=yb=by=bx=xb∈xBx⊂C and hence A′∗B∋⋃y∈A′By⊂C, which implies C∈A′∗B and A∗B⊂A′∗B. By analogy we can prove that A′∗B⊂A∗B and thus A′∗B=A∗B.
∎
Corollary 3.6**.**
If r≥2, then for any k∈N the map
[TABLE]
is a good shift of the semigroup λ(Mr,m⋅k).
Lemma 3.5 and Theorem 2.3 have the following:
Corollary 3.7**.**
Assume that r≥2. The operator R:Aut(λ(Mr,m))→Aut(λ(Mr,m⋅2))
has kernel isomorphic to ∏L∈λ(Mr,m⋅2)Sσˉ−1(L)∖λ(Mr,m⋅2)
and range R(Aut(Mr,m))⊂H where
[TABLE]
4. Automorphism groups of superextensions of monogenic semigroups of cardinality ≤5
In this section we shall describe the structure of the automorphism groups of superextensions of all monogenic semigroups Mr,m of cardinality ∣Mr,m∣≤5.
4.1. The semigroups λ(M1,1), λ(M1,2) and λ(M2,1)
For any r,m∈N with r+m≤3, the monogenic semigroup Mr,m has cardinality ∣Mr,m∣≤2. Consequently, λ(Mr,m)=Mr,m and Aut(λ(Mr,m))=Aut(Mr,m)≅C1.
4.2. The semigroups λ(M1,3), λ(M2,2) and λ(M3,1)
For a monogenic semigroup Mr,m with m+r=4 and generator a, the superextension λ(Mr,m) consists of three principal ultrafilters a,a2,a3
and the maximal linked family
△=⟨{a,a2},{a,a3},{a2,a3}⟩.
Taking into account that M1,3 is isomorphic to C3 and Aut(λ(C3))≅C2 (see Table 1), we conclude that Aut(λ(M1,3))≅Aut(λ(C3))≅C2.
By Proposition 3.3, for any i∈{1,2,3} and ψ∈Aut(λ(M3,1))
we have ψ(ai)=ai. Then ψ(△)=△ and hence Aut(λ(M3,1))≅C1.
To recognize the automorphism group of λ(M2,2), consider the homomorphic
retraction
[TABLE]
and
observe that it has fibers: ρˉ−1(a2)={a2} and ρˉ−1(a3)={a,a3,△}.
Since the automorphism group Aut(λ(M2,2⋅2))≅Aut(λ(C2)) is trivial, we can apply Theorem 3.4
and conclude that the automorphism group Aut(λ(M2,2)) is isomorphic to Sρˉ−1(a3)∖{a3}=S{a,△}≅C2.
4.3. The semigroup λ(M1,4)
The semigroup M1,4 is isomorphic to the cyclic group C4. Therefore,
[TABLE]
according to [9] (see also Table 1).
4.4. The semigroup λ(M2,3)
Consider the semigroup M2,3={a,a2,a3,a4 ∣ a5=a2} generated by the element a. Its superextension λ(M2,3) contains 12 elements of the form:
[TABLE]
where i∈{1,2,3,4}.
Let e=a3 be the idempotent of the subgroup C3 and ρ:M2,3→C3, ρ:x↦ex,
be the homomorphic retraction of M2,3 onto C3. The map ρ induces a homomorphic
retraction ρˉ:λ(M2,3)→λ(C3)={a2,a3,a4,△1}, defined by ρˉ(A)=a3∗A for A∈λ(M2,3).
By routine calculations we can show that the map ρˉ has fibers:
ρˉ−1(a2)={a2};
ρˉ−1(a3)={a3};
ρˉ−1(a4)={a,a4,△2,△3,□1,□4};
ρˉ−1(△1)={△1,△4,□2,□3}.
Applying Theorem 3.4, we can show that the automorphism group Aut(λ(M2,3)) of λ(M2,3) is isomorphic to
[TABLE]
4.5. The semigroup λ(M3,2)
In this section we consider the monogenic semigroup M3,2={a,a2,a3,a4} generated by an element a such that a5=a3. The semigroup M3,2 contains the characteristic ideals M3,2⋅2={a2,a3,a4} and M3,2⋅3={a3,a4}=C2.
Using the notations from the preceding subsection, we can see that the superextensions of the semigroups M3,2⋅k contain the following elements:
λ(M3,2)={ai,△i,□i:1≤i≤4};
λ(M3,2⋅2)={a2,a3,a4,△1};
λ(M3,2⋅3)=λ(C2)=C2={a3,a4}.
By Lemma 3.5, the map σˉ:λ(M3,2)→λ(M3,2⋅2), σˉ:A↦a∗A, is an auto-shift of the semigroup λ(M3,2).
By routine calculations it can be shown that the map σˉ has the following fibers:
σˉ−1(a2)={a};
σˉ−1(a3)={a2,a4,△1,△3,□2,□4};
σˉ−1(a4)={a3};
σˉ−1(△1)={△2,△4,□1,□3}.
By Corollary 3.6, the restriction σˉ2=σˉ∣λ(M3,2⋅2) is a good shift of the
semigroup λ(M3,2⋅2). This shift has a unique fiber σˉ2−1(a3)={a4,a2,△1}
containing more than one point. By Proposition 2.2, the automorphism group Aut(λ(M3,2⋅2)) contains
the permutation group S{a2,△1}≅C2. Taking into account that C2 is a characteristic subgroup
of λ(M3,2⋅2) with trivial automorphism group, we conclude that Aut(λ(M3,2⋅2))=S{a2,△1}≅C2.
By Corollary 3.7, the restriction operator R:Aut(λ(M3,2))→Aut(λ(M3,2⋅2))≅C2 has kernel isomorphic to
[TABLE]
We claim that the subgroup R(Aut(λ(M3,2))) of Aut(λ(M3,2⋅2))=S{a2,△1} is trivial.
Indeed, each automorphism φ∈R(Aut(λ(M3,2))) is trivial on the subgroup
C2={a3,a4}, so φ(a2)∈{a2,△1}. By Corollary 3.7,
[TABLE]
which implies that φ(a2)=a2 and φ is the identity automorphism of Aut(λ(M3,2⋅2)).
Consequently, the range of the restriction operator R is trivial and the group Aut(λ(M3,2))
coincides with the kernel of R and hence is isomorphic to S3×S4.
4.6. The semigroup λ(M4,1)
In this subsection we consider the monogenic semigroup M4,1={a,a2,a3,a4} generated by an element a such that a5=a4.
The semigroup M4,1 contains the characteristic ideals M4,1⋅2={a2,a3,a4}, M4,1⋅3={a3,a4}, and M4,1⋅4={a4}.
Using the notations from the preceding subsection, we can see that the superextensions of the semigroups M4,1⋅k contain the following elements:
λ(M4,1)={ai,△i,□i:1≤i≤4};
λ(M4,1⋅2)={a2,a3,a4,△1};
λ(M4,1⋅3)=M4,1⋅3={a3,a4};
λ(M4,1⋅4)=M4,1⋅4={a4}.
It is clear that the semigroups λ(M4,1⋅4) and λ(M4,1⋅3) have trivial automorphism groups.
Taking into account that xy=a4 for any x,y∈λ(M4,1⋅2)={a2,a3,a4,△1}, we conclude that the automorphism group Aut(M4,1⋅2) of the semigroup M4,1⋅2 is isomorphic to the symmetric group S3.
By Lemma 3.5, the map
[TABLE]
is an auto-shift of the semigroup λ(M4,1).
By routine calculations it can be shown that the map σˉ has the following fibers:
σˉ−1(a2)={a};
σˉ−1(a3)={a2};
σˉ−1(a4)={a3,a4,△1,△2,□3,□4};
σˉ−1(△1)={△3,△4,□1,□2}.
By Corollary 3.7, the restriction operator R:Aut(λ(M4,1))→Aut(λ(M4,1⋅2)) has kernel isomorphic to
[TABLE]
By Proposition 3.3, for any automorphism ψ of λ(M4,1),
we get ψ(ak)=ak for any k∈N. Taking into account that λ(M4,1⋅2)={a2,a3,a4,△1} is
a characteristic ideal in λ(M4,1), we conclude that ψ(△1)=△1.
Consequently, the range of the restriction operator R is trivial and the group Aut(λ(M4,1))
coincides with the kernel of R and hence is isomorphic to S3×S4.
4.7. The semigroup λ(M1,5)
The monogenic semigroup M1,5 is isomorphic to the cyclic group C5.
It was proved in [9] that the automorphism group Aut(λ(M1,5))≅Aut(λ(C5)) is isomorphic to C4.
4.8. The semigroup λ(M2,4)
To describe the structure of the automorphism group Aut(λ(M2,4)), we shall apply Theorem 3.4.
Consider the homomorphic retraction
[TABLE]
where e=a4∈C4⊂M2,4 is the unique idempotent of the semigroup M2,4.
To describe the fibers of the retraction ρˉ we first introduce a convenient notation for all
81 elements of the superextension λ(M2,4). We recall that M2,4={a,a2,a3,a4,a5} and C4={a2,a3,a4,a5} where a6=a2.
The 81 elements of the semigroup λ(M2,4) will be denoted as follows:
ai for i∈{1,2,3,4,5};
◯:={A⊂M2,4:∣A∣≥3};
Θij:=⟨{ai,aj},A:A⊂M2,4,∣A∣=3,∣A∩{ai,aj}∣=1}⟩ for 1≤i<j≤5;
△ijk:=⟨{ai,aj},{ai,ak},{aj,ak}⟩ for numbers 1≤i<j<k≤5;
Λi:=⟨M2,4∖{ai},{ai,x}:x∈M2,4∖{ai}⟩ for i∈{1,2,3,4,5};
♢ijkn:=⟨{an,ai},{an,aj},{an,ak},{ai,aj,ak}⟩ for numbers 1≤i<j<k≤5 and n∈{1,2,3,4,5}∖{i,j,k};
\Lambda^{i}_{jk}:=\big{\langle}\{a^{i},a^{j}\},\{a^{i},a^{k}\},A:A\subset\mathrm{M\mkern 1.0mu}_{2,4},\;|A|=3,\;A\cap\{a^{i},a^{j},a^{k}\}\in\big{\{}\{a^{i}\},\{a^{j},a^{k}\}\big{\}}\big{\rangle} for 1≤j<k≤5 and i∈{1,2,3,4,5}∖{j,k}.
Observe that for the subgroup C4={a2,a3,a4,a5}⊂M2,4 we have
[TABLE]
By routine calculations it can be shown that the map ρˉ:λ(M2,4)→λ(C4) has the following fibers:
(ρˉ)−1(x)={x} for x∈{a2,a3,a4,△234};
(ρˉ)−1(a5)={a5,a,△125,△135,△145,♢2351,♢2451,♢3451,♢1235,♢1245,♢1345,Λ1,Λ5,Θ15,Λ251,Λ351,Λ451,Λ125,Λ135,Λ145};
(ρˉ)−1(△235)={△235,△123,♢1352,♢1253,Θ23,Λ132,Λ352,Λ123,Λ253};
(ρˉ)−1(△245)={△245,△124,♢1452,♢1254,Θ24,Λ142,Λ452,Λ124,Λ254};
(ρˉ)−1(△345)={△345,△134,♢1453,♢1354,Θ34,Λ143,Λ453,Λ134,Λ354};
(ρˉ)−1(♢3452)={♢3452,♢1342,Λ2,Λ342};
(ρˉ)−1(♢2453)={♢2453,♢1243,Λ3,Λ243};
(ρˉ)−1(♢2354)={♢2354,♢1234,Λ4,Λ234};
(ρˉ)−1(♢2345)={♢2345,♢2341,Λ231,Λ241,Λ341,Λ152,Λ153,Λ154,Λ235,Λ245,Λ345,Θ12,Θ13,Θ14,Θ25,Θ35,Θ45,◯}.
By Theorem 3.4, for any automorphism ψ of λ(M2,4) the restriction ψ∣λ(C4) is
an automorphism of λ(C4) such that ψ(x)=x for all x∈C4. The description of
the automorphism group of λ(C4) given in [9] ensures that ψ(♢ijkn)=♢ijkn
for any ♢ijkn∈λ(C4). Taking into account that
∣(ρˉ)−1(△234)∣=1<∣(ρˉ)−1(△ijk)∣ for
any △ijk∈λ(C4)∖{△234}, we conclude that ψ(△234)=ψ(△234)
and hence ψ(x△234)=x△234 for any x∈C4. Since {x△234:x∈C4}={△ijk:2≤i<j<k≤5},
we conclude that ψ∣λ(C4) is the identity automorphism of the semigroup λ(C4).
By Theorem 3.4, the automorphism group Aut(λ(M2,4)) is isomorphic
to
[TABLE]
4.9. The semigroup λ(M3,3)
In this section we recognize the automorphism group of the superextension of the semigroup M3,3={a,a2,a3,a4,a5}.
This semigroup is generated by an element a such that a6=a3. Observe that the ideal M3,3⋅2={a2,a3,a4,a5}
is isomorphic to the monogenic semigroup M2,3={b,b2,b3,b4} as for the element b=a2 we get {b,b2,b3,b4}={a2,a4,a3,a5}.
As shown in Subsection 4.4, the automorphism group Aut(λ(M2,3)) consists of all bijections
ψ of λ(M2,3) such that
ψ(x)=x for any x∈/{△4,□2,□3}∪{b,△2,△3,□1,□4};
the sets {△4,□2,□3} and {b,△2,△3,□1,□4} are ψ-invariant.
Taking into account the isomorphism {b,b2,b3,b4}→{a2,a4,a3,a5} between the semigroups M2,3 and M3,3⋅2, we obtain the following fact.
Claim 4.1**.**
The automorphism group of the semigroup λ(M3,3⋅2) consists of bijections ψ of λ(M3,3⋅2) such that
ψ(x)=x* for any x∈{△234,♢2354,♢2453}∪{a2,△235,△245,♢3452,♢2345};*
the sets {△234,♢2354,♢2453} and
{a2,△235,△245,♢3452,♢2345} are ψ-invariant.
By Lemma 3.5, the map σˉ:λ(M3,3)→λ(M3,3⋅2), σˉ:A↦a∗A,
is an auto-shift of the semigroup λ(M3,3).
By routine calculations, it can be shown that the map σˉ has the following fibers:
σˉ−1(a2)={a}, σˉ−1(a4)={a3}, σˉ−1(a5)={a4};
σˉ−1(a3)={a2,a5,△125,△235,△245,Λ152,Λ352,Λ452,Λ125,Λ235,Λ245,♢1352,♢1452,♢3452,♢1235,♢1245,♢2345,Θ25,Λ2,Λ5};
σˉ−1(△245)={△134};
σˉ−1(△234)={△123,△135,Λ231,Λ351,Λ123,Λ153,♢2351,♢1253,Θ13};
σˉ−1(△235)={△124,△145,Λ241,Λ451,Λ124,Λ154,♢2451,♢1254,Θ14};
σˉ−1(△345)={△234,△345,Λ243,Λ453,Λ234,Λ354,♢2453,♢2354,Θ34};
σˉ−1(♢3452)={Λ341,♢2341,♢3451,Λ1};
σˉ−1(♢2354)={Λ143,♢1243,♢1453,Λ3};
σˉ−1(♢2345)={Λ134,♢1234,♢1354,Λ4};
σˉ−1(♢2453)={Λ251,Λ132,Λ142,Λ342,Λ253,Λ254,Λ135,Λ145,Λ345,♢1345,♢1342,Θ12,Θ15,Θ23,Θ24,Θ35,Θ45,◯}.
Then
σˉ−1(x)∖λ(M3,3⋅2)=∅ for x∈{a2,a4,a5};
σˉ−1(a3)∖λ(M3,3⋅2)={△125,Λ152,Λ352,Λ452,Λ125,Λ235,Λ245,♢1352,♢1452,♢1235,♢1245,Θ25,Λ2,Λ5};
σˉ−1(△245)∖λ(M3,3⋅2)={△134};
σˉ−1(△234)∖λ(M3,3⋅2)={△123,△135,Λ231,Λ351,Λ123,Λ153,♢2351,♢1253,Θ13};
σˉ−1(△235)∖λ(M3,3⋅2)={△124,△145,Λ241,Λ451,Λ124,Λ154,♢2451,♢1254,Θ14};
σˉ−1(△345)∖λ(M3,3⋅2)={Λ243,Λ453,Λ234,Λ354,Θ34};
σˉ−1(♢3452)∖λ(M3,3⋅2)={Λ341,♢2341,♢3451,Λ1};
σˉ−1(♢2354)∖λ(M3,3⋅2)={Λ143,♢1243,♢1453,Λ3};
σˉ−1(♢2345)∖λ(M3,3⋅2)={Λ134,♢1234,♢1354,Λ4};
σˉ−1(♢2453)∖λ(M3,3⋅2)={Λ251,Λ132,Λ142,Λ342,Λ253,Λ254,Λ135,Λ145,Λ345,♢1345,♢1342,Θ12,Θ15,Θ23,Θ24,Θ35,Θ45,◯}.
By Corollary 3.7, for any automorphism ψ of λ(M3,3) we get ∣σˉ−1(ψ(x))∣=∣σˉ−1(x)∣ for all
x∈λ(M3,3⋅2). Taking into account Corollary 3.7, Claim 4.1 and comparing the cardinalities of
the fibers of σˉ, we conclude that ψ is the identity on the set λ(M3,3⋅2)∖{♢3452,♢2345}.
To see that ψ∣λ(M3,3⋅2) is trivial, it is sufficient to show that the assumption ψ(♢3452)=♢2345 leads to a contradiction. In this case ψ(Λ1)∈{Λ134,♢1234,♢1354,Λ4}.
Replacing ψ by the composition of ψ with a suitable permutation in the kernel of the restriction
operator R:Aut(λ(M3,3))→Aut(λ(M3,3⋅2)),
we can assume that ψ(Λ1)=Λ4 and ψ(△123)=△123.
Now observe that △123∗Λ1=△234=△345=△123∗Λ4.
On the other hand,
[TABLE]
which is a desired
contradiction showing that the restriction ψ∣λ(M3,3⋅2) is trivial.
Therefore, the restriction operator R has trivial range and the automorphism
group Aut(λ(M3,3)) coincides with the kernel of R, which is isomorphic to
[TABLE]
4.10. The semigroup λ(M4,2)
In this section we recognize the structure of the automorphism group of the superextension of the semigroup M4,2 and its
characteristic ideals M4,2⋅k for k∈{2,3,4}. The monogenic semigroup M4,2={a,a2,a3,a4,a5}
is generated by an element a such that a6=a4.
The characteristic ideal M4,2⋅4={a4,a5} is a group with neutral element a4.
Observe that λ(M4,2⋅4)=M4,2⋅4≅C2 and hence Aut(λ(M4,2⋅4))≅Aut(C2)≅C1.
To recognize the structure of the automorphism groups of the superextensions of the semigroups M4,2⋅3={a3,a4,a5}
and M4,2⋅2={a2,a3,a4,a5}, observe that the map ρ:M4,2⋅2→M4,2⋅4, ρ:x↦a4x=a2x,
is a homomorphic retraction of M4,2⋅2 onto the group M4,2⋅4 such that xy=ρ(x)⋅ρ(y) for
all x,y∈M4,2⋅2. This homomorphic retraction induces a homomorphic retraction
[TABLE]
such that A∗B=ρˉ(A)∗ρˉ(B) for any A,B∈λ(M4,2⋅2).
Using the notations for the elements of the superextension λ(M4,2) from Subsection 4.8, observe that
[TABLE]
By routine calculations it can be shown that the map ρˉ:λ(M4,2⋅2)→λ(M4,2⋅4)={a4,a5} has the following fibers:
ρˉ−1(a4)={a2,a4,△234,△245,♢3452,♢2354};
ρˉ−1(a5)={a3,a5,△235,△345,♢2453,♢2345}.
Now we see that Aut(λ(M4,2⋅3)) is isomorphic to
[TABLE]
and Aut(λ(M4,2⋅2)) is isomorphic to
[TABLE]
To detect the algebraic structure of the automorphism group of λ(M4,2), consider the map σ:M4,2→M4,2⋅2, σ:x↦ax, which induces the map
[TABLE]
By Lemma 3.5, σˉ is an auto-shift of λ(M4,2).
By routine calculations we can show that the map σˉ has the following fibers:
σˉ−1(a2)={a}, σˉ−1(a3)={a2}, σˉ−1(a5)={a4};
σˉ−1(a4)={a3,a5,△135,△235,△345,Λ153,Λ253,Λ453,Λ135,Λ235,Λ345,♢1253,♢1453,♢2453,♢1235,♢1345,♢2345,Λ3,Λ5,Θ35};
σˉ−1(△235)={△124};
σˉ−1(△234)={△123,△125,Λ231,Λ251,Λ132,Λ152,♢2351,♢1352,Θ12};
σˉ−1(△245)={△134,△145,Λ341,Λ451,Λ134,Λ154,♢3451,♢1354,Θ14};
σˉ−1(△345)={△234,△245,Λ342,Λ452,Λ234,Λ254,♢3452,♢2354,Θ24};
σˉ−1(♢3452)={♢2341,♢2451,Λ1,Λ241};
σˉ−1(♢2453)={♢1342,♢1452,Λ2,Λ142};
σˉ−1(♢2345)={♢1234,♢1254,Λ4,Λ124};
σˉ−1(♢2354)={Λ351,Λ352,Λ123,Λ143,Λ243,Λ354,Λ125,Λ145,Λ245,♢1243,♢1245,Θ13,Θ15,Θ23,Θ25,Θ34,Θ45,◯}.
Now consider the restriction operator
[TABLE]
We claim that this operator has trivial range.
Fix any automorphism ψ∈Aut(λ(M4,2)). Proposition 3.3 ensures that ψ(ai)=ai for all i∈{1,2,3,4,5}.
The description of the automorphism group Aut(λ(M4,2⋅2)) ensures that the sets {a2,a4,△234,△245,♢3452,♢2354} and {a3,a5,△235,△345,♢2453,♢2345} are ψ-invariant.
Then the sets F4={△234,△245,♢3452,♢2354}
and F4′={△235,△345,♢2453,♢2345} are ψ-invariant, too.
Taking into account that the ideal λ(M4,2⋅3)={a3,a4,a5,△345} is characteristic,
we conclude that ψ(△345)=△345. Consequently, the set
F3={△235,♢2453,♢2345} is ψ-invariant and ψ(A)=A for any
A∈λ(M4,2⋅2)∖(F3∪F4).
It follows from ψ∘σˉ=σˉ∘ψ that
[TABLE]
for any A∈λ(M4,2⋅2).
Observe that
∣σˉ−1(x)∖λ(M4,2⋅2)∣=0 for x∈{a2,a3,a5};
∣σˉ−1(a4)∖λ(M4,2⋅2)∣=∣{△135,Λ153,Λ253,Λ453,Λ135,Λ235,Λ345,♢1253,♢1453,♢1235,♢1345,Λ3,Λ5,Θ35}∣=14;
∣σˉ−1(△235)∖λ(M4,2⋅2)∣=∣{△124}∣=1;
∣σˉ−1(△234)∖λ(M4,2⋅2)∣=∣{△123,△125,Λ231,Λ251,Λ132,Λ152,♢2351,♢1352,Θ12}∣=9;
∣σˉ−1(△245)∖λ(M4,2⋅2)∣=∣{△134,△145,Λ341,Λ451,Λ134,Λ154,♢3451,♢1354,Θ14}∣=9;
∣σˉ−1(△345)∖λ(M4,2⋅2)∣=∣{Λ342,Λ452,Λ234,Λ254,Θ24}∣=5;
∣σˉ−1(♢3452)∖λ(M4,2⋅2)∣=∣{♢2341,♢2451,Λ1,Λ241}∣=4;
∣σˉ−1(♢2453)∖λ(M4,2⋅2)∣=∣{♢1342,♢1452,Λ2,Λ142}∣=4;
∣σˉ−1(♢2345)∖λ(M4,2⋅2)∣=∣{♢1234,♢1254,Λ4,Λ124}∣=4;
∣σˉ−1(♢2354)∖λ(M4,2⋅2)∣=
=∣{Λ351,Λ352,Λ123,Λ143,Λ243,Λ354,Λ125,Λ145,Λ245,♢1243,♢1245,Θ13,Θ15,Θ23,Θ25,Θ34,Θ45,◯}∣=18.
Comparing the cardinalities of the sets σˉ−1(A)∖λ(M4,2⋅2) for points in the sets F3 and F4,
we can conclude that the sets {△234,△245} and {♢2453,♢2345} are ψ-invariant and ψ(A)=A for any A∈λ(M4,2⋅2)∖{△234,△245,♢2453,♢2345}.
Now we show that ψ(△234)=△234. In the opposite case, ψ(△234)=△245 and hence ψ(△123)∈σˉ−1(△245)∖λ(M4,2⋅2).
Replacing ψ by the composition of ψ with a suitable permutation in the kernel of the restriction operator R:Aut(λ(M4,2))→Aut(λ(M4,2⋅2)), we can assume that ψ(△123)=△134.
Taking into account that △123∗△123=♢2354 and △134∗△134=△245, we conclude that
[TABLE]
which is a contradiction proving that ψ(A)=A for all A∈λ(M4,2⋅2)∖{♢2453,♢2345}.
Assuming that ψ∣λ(M4,2⋅2) is not identity, we conclude that ψ(♢2453)=♢2345. Replacing ψ by the composition of ψ with a suitable permutation in the kernel of the restriction operator R, we can assume that ψ(Λ2)=Λ4 and ψ(△123)=△123.
Taking into account that △123∗Λ2=△345 and △123∗Λ4=♢2345, we conclude that
[TABLE]
which is a contradiction completing the proof of the triviality of the range of the restriction operator R:Aut(λ(M4,2))→Aut(λ(M4,2⋅2)).
Then the automorphism group
Aut(λ(M4,2)) coincides with the kernel of R, which is isomorphic to the group
[TABLE]
4.11. The semigroup λ(M5,1)
In this section we recognize the structure of the automorphism group of the superextension of the semigroup M5,1 and its
characteristic ideals M5,1⋅k for k∈{2,3,4,5}. The monogenic semigroup M5,1={a,a2,a3,a4,a5} is
generated by an element a such that a6=a5.
Observe that for any x,y∈{a3,a4,a5}=M5,1⋅3 we get xy=a5. This implies that for any k∈{3,4,5} any
bijection ψ of λ(M5,1⋅k) with ψ(a5)=a5 is an automorphism of the semigroup λ(M5,1⋅k).
This observation implies that Aut(λ(M5,1⋅5))≅Aut(λ(M5,1⋅4))≅C1 and Aut(λ(M5,1⋅3))≅S3.
Next, consider the semigroup M5,1⋅2={a2,a3,a4,a5} and its superextension λ(M5,1⋅2). It follows from M5,1⋅2∗M5,1⋅2=M5,1⋅4={a4,a5} that λ(M5,1⋅2)∗λ(M5,1⋅2)=λ(M5,1⋅4)=M5,1⋅4.
This implies that the ideal M5,1⋅4 is characteristic in the semigroup λ(M5,1⋅2). Since the semigroup M5,1⋅4={a4,a5} has trivial automorphism group, ψ(a4)=a4 and ψ(a5)=a5 for any automorphism ψ of λ(M5,1⋅2).
It is easy to show that the equation x∗y=a4 has a unique solution x=y=a2 in the semigroup λ(M5,1⋅2).
Consequently, ψ(a2)=a2 for any automorphism ψ of λ(M5,1⋅2) and A∗B=a5 for any maximal
linked upfamilies A,B∈λ(M5,1⋅2) such that (A,B)=(a2,a2). It follows that any bijection
ψ of λ(M5,1⋅2) such that ψ(ai)=ai for i∈{2,4,5} is an automorphism of the semigroup
λ(M5,1⋅2). This implies that Aut(M5,1⋅2)≅S9.
To recognize the automorphism group of λ(M5,1), consider
the map
[TABLE]
By Lemma 3.5, σˉ is an auto-shift of λ(M5,1) and its restriction
σˉ2:=σˉ∣λ(M5,1⋅2) is a good shift of λ(M5,1⋅2).
By routine calculations, it can be shown that the map σˉ has the following fibers:
σˉ−1(ai)={ai−1} for i∈{2,3,4};
σˉ−1(a5)={a4,a5,Λ5,Λ4,♢2345,♢1345,♢1245,♢2354,♢1354,♢1254,Λ345,Λ245,Λ145,Λ354,Λ254,Λ154,△345,△245,△145,Θ45};
σˉ−1(△234)={△123};
σˉ−1(△235)={Θ12,♢1452,♢2451,Λ152,Λ142,Λ251,Λ241,△125,△124};
σˉ−1(△245)={Θ13,♢1453,♢3451,Λ153,Λ143,Λ351,Λ341,△135,△134};
σˉ−1(△345)={Θ23,♢2453,♢3452,Λ253,Λ243,Λ352,Λ342,△234,△235};
σˉ−1(♢3452)={Λ1,♢2351,♢2341,Λ231};
σˉ−1(♢2453)={Λ2,♢1352,♢1342,Λ132};
σˉ−1(♢2354)={Λ3,♢1253,♢1243,Λ123};
σˉ−1(♢2345)={◯,Θ35,Θ34,Θ25,Θ24,Θ15,Θ14,♢1235,♢1234,Λ235,Λ135,Λ125,Λ234,Λ134,Λ124,Λ453,Λ452,Λ451}.
To recognize the algebraic structure of the automorphism group Aut(λ(M5,1)), consider the restriction operator
R:Aut(λ(M5,1))→Aut(λ(M5,1⋅2)). By Corollary 3.7, the kernel of this operator is isomorphic to
[TABLE]
We claim that the operator R has trivial range. Given any automorphism ψ of λ(M5,1), we should prove that ψ(A)=A for any A∈λ(M5,1⋅2). By Proposition 3.3, ψ(ai)=ai for all i∈{1,2,3,4,5}. The equality ψ(a)=a implies that σˉ∘ψ=ψ∘σˉ. Consequently, for every L∈λ(M5,1⋅2) we have ψ(σˉ−1(L))=σˉ−1(ψ(L)). Since the ideals λ(M5,1⋅k) are characteristic in λ(M5,1), Corollary 3.7 ensures that
[TABLE]
for all
L∈λ(M5,1⋅2) and all k∈{1,2,3,4,5}.
Comparing the cardinalities of the sets σˉ−1(L)∩λ(M5,1⋅k) for various k∈{1,2,3,4,5} and L∈λ(M5,1⋅2), we see that ψ(F2)=F2, ψ(F3)=F3 and ψ(A)=A for all A∈M5,1⋅2∖(F2∪F3), where F2={△235,△245} and F3={♢3452,♢2453,♢2354}.
Let us check that ψ(△235)=△235. To derive a contradiction, assume that ψ(△235)=△235 and hence ψ(△235)=△245. Consider the element △124∈σˉ−1(△235)∖λ(M5,1⋅2) and observe that ψ(△124)∈ψ(σˉ−1(△235))=σˉ−1(ψ(△235))=σˉ−1(△245).
Let π:λ(M5,1)→λ(M5,1) be a permutation such that π(ψ(△124))=△135 and π(A)=A for all A∈λ(M5,1)∖{△135,△124}.
By Corollary 3.7, the permutation π belongs to the automorphism group Aut(λ(M5,1)). Replacing ψ by π∘ψ, we can assume that ψ(△124)=△135.
Observe that
[TABLE]
This contradiction shows that ψ(△235)=△235 and hence ψ(△245)=△245 (as ψ(F2)=F2)).
Next, we show that ψ(A)=A for any A∈F3={♢3452,♢2453,♢2354}.
To simplify notations, put ♢2:=♢3452,
♢3:=♢2453, ♢4:=♢2354.
To derive a contradiction, assume that ψ(♢i)=♢j for some 2≤i<j≤4.
Consider the maximal linked upfamily Λi−1∈σˉ−1(♢i) and
observe that ψ(Λi−1)∈ψ(σˉ−1(♢i))=σˉ−1(ψ(♢i))=σˉ−1(♢j).
Since Λj−1∈σˉ−1(♢j), we can replace ψ by the
composition with the permutation exchanging ψ(Λi−1) with Λj−1
and ψ(△134) with △134, and assume that ψ(Λi−1)=Λj−1 and ψ(△134)=△134.
Now observe that the elements Λ1,Λ2,Λ3 can be algebraically distinguished by the equalities:
[TABLE]
Two cases are possible. If i=2, then ψ(Λ1)=Λj−1 and we obtain a contradiction:
[TABLE]
If i=3, then we obtain a contradiction considering
[TABLE]
In both cases we obtain a contradiction with the assumption that ψ(A)=A for some A∈F3. This contradiction completes the proof of the triviality of the range of the operator R. Then the group Aut(λ(M5,1)) is equal to the kernel of the operator R and hence is isomorphic to the group
S43×S5×S92×S14×S18.
5. Summary Table and some Conjectures
The obtained results on the automorphism groups of superextensions of monogenic semigroups of cardinality ≤5 are summed up in the following table.
[TABLE]
Analyzing the entries of this table and the arguments in Section 4, we can make the following conjectures.
Conjecture 5.1**.**
For any integer numbers r,s≥3 and n,m≥1 with r+m=s+n the automorphism groups Aut(λ(Mr,m)) and Aut(λ(Ms,n)) are isomorphic.
Conjecture 5.2**.**
For any integer r≥2 and m≥1 the restriction operator R:Aut(λ(Mr,m))→Aut(λ(Mr,m⋅2)), R:ψ↦ψ∣λ(Mr,m⋅2),
has trivial range.