ALL Metrics
-
Views
-
Downloads
Get PDF
Get XML
Cite
Export
Track
Research Article

Structure of the (Total) Transformation Monoids Under Rank N Generators

[version 1; peer review: awaiting peer review]
PUBLISHED 02 Feb 2026
Author details Author details
OPEN PEER REVIEW
REVIEWER STATUS AWAITING PEER REVIEW

This article is included in the Fallujah Multidisciplinary Science and Innovation gateway.

Abstract

Throughout this paper our study focuses on transformation semigroups. These kinds of semigroups are the corner stone of semigroup theory. This is because every semigroup is isomorphic to transformation semigroup. The (total) transformation monoid T X n on a finite set X n = { 1 , 2 , … , n } where n ≥ 0 , n ∈ Z , is a semigroup of mapping that takes a set X n into itself, under the operation of composition of mapping with identity I X n . In this paper, we use an algebraic method for considering the monoid T ( Fl ) n ( G ) , where an independence algebra ( Fl ) n ( G ) is a disjointed union of sets of the form G x i for all 1 ≤ i ≤ n . Firstly, particular attention is paid to find the isomorphism between T ( Fl ) n ( G ) and the endomorphism monoid End ( F ℓ ) n ( G ) . Secondly, the embeddedness of T ( Fl ) n ( G ) in (full) wreath product of T n by G n has been found. Finally, the description of Green’s relation of T ( Fl ) n ( G ) has been provided.

Keywords

A finite group, Semigroup, Wreath product, A free (left) G-act, Total transformation semigroup, Endomorphism monoid, Semigroup morphism.

1. Introduction

In this paper G will be a finite monoid (group) and (F)n(G) be a free (left)- G -act of rank n . It is clear that (F)n(G) is an independence algebra,1 which is a class of universal algebras of rank n generators that includes free (left)- G -acts for a finite group G. For a positive integer n , we write the (total) transformation TXn to be Tn which is the monoid of n degree, under the operation of a compositions of functions, such that for all σ,τTn and xXn we have x(στ)=x(στ)=(xσ)τ. As well as, it is a set that maps every transformations into itself (i.e., XnXn , n0,nZ) . Clearly, if n=0, then Xn=, and T0 becomes a monoid that consists of only one map, which is the (empty) map.

All transformations of this paper are composed from left to right, so for any σTn and for any iXn, then will be written as the image of i , and for any σTn , we define Im{σ}={:iXn} and Ker{σ}={(i,j)Xn×Xn:=} and (σ)=rank{σ}=|Im{σ}|. A number of authors appeared in29 obtained and described various transformation semigroups, such as the description of the singular transformation Snn, 10 and they study the structure of the partial endomorphism monoids of the independence algebra like a free acts and other set such as vector spaces and modules. When G is a finite monoids the endomorphism monoids of free (left)- G -acts played a major part of semigroup theory, and it can be found in.11

It has long been known that set of the endomorphism monoid of the free (left)- G -acts of rank n is isomorphic to the (full) wreath product GnTn, 12,13 or, more generally SnTn for arbitrary semigroup S. Clearly, if G={e} , then GnTn Tn . Where S is a finite semigroup, the (total) transformation monoid T(F)n(S) of a free (left) S act of rank n has been described in,12 for further information we recommend the reader see.1421 Through this work, the discerption of T(F)n(M) , has established in particular when M is a finite group, and many properties of this concepts have been studied such as the isomorphic of T(F)n(M) to End(F)n(M) and the embeddedness of it in the (total) wreath product MnTn . Furthermore, in the last section of this work the discerption of Green’s relation of T(F)n(M) has been found.

2. Preliminaries

Definition 2.1:

12 A mapping σ from a monoid A to a monoid B is named (morphism) if

  • 1- ( aa¯ ) σ=(a)σ(a¯)σ, for all a , a¯A ;

  • 2- ( 1A)σ=1B.

Definition 2.2:

12 Let B be a non-empty set and A be a monoid, then B is refed to a (left)- A -act if there is a mapping α:A×BB, defined by α(a,b)=ab , such the following conditions are satisfied:

  • 1 - a(rb)=(ar)b .

  • 2 - 1Ab=b for all bB and a,rA .

Definition 2.3:

12 Suppose that Y and T are two (left)- A -acts, then a mapping α:YT is named an A - acts morphism if (ay)α=a() , aA, yY .

Definition 2.4:

12,13 The (total) transformation semigroup on a non-empty set X is denoted by TX={σ|σ:XX}. If n0 , such that nZ , where X=Xn={1,2,,n}, we write TX to be Tn . With respect to the semigroup operation of composition that x(δγ)=x ( δγ ) =()γ, for all xX and δ,γTx . Clearly, Tn is monoid with identity transformation IX=(12n12n) .

Remark 2.5:

12,13

  • 1 - If σTn , n0 , nZ, then σ can be written as σ=(1n1σ) .

  • 2 - For any σTn, the second row of σ is not a permutation for the first row. Since not all element σ Tn is injective.

  • 3 - The number of elements of Tn is equal to nn .

Recall that, if S is a semigroup and if tS , the (principal) left ideal generated by t is the smallest left ideal of S containing t , and it is denoted by S1t . Dually, for tS1 .22

Now, let’s have the following definition:

Definition 2.6:

22 Let S be any semigroup, the Green’s preorder binary relations are defined as follows:

  • 1. sLt if and only if sS1t .

  • 2. sRt if and only if stS1 .

  • 3. sJt if and only if sS1tS1.

From the above definition we can define the Green’s relations by:

Definition 2.7:

22 Let S be any semigroup, the Green’s relations are defined by:

  • 1. R=RR.

  • 2. L=LL.

  • 3. J=JJ.

  • 4. H=RL.

  • 5. D=RL .

Clearly, if S is finite, then D=J. So, the above definition can be translated as follows:

Definition 2.8:

22 Let S be a finite semigroup, the Green’s relations can be defined as:

  • 1. sLt if and only if S1s=S1t.

  • 2. sRt if and only if sS1=tS1.

  • 3. sJt if and only if S1sS1=S1tS1.

3. Free (left)- G -act structure (F)n(G)

This section is devoted to give an explicit description of the set of the free (left)- G -acts, when G is a finite group.

Definition 3.1:

12,22 Let G be a finite group and X be a non-empty set, then (F)X(G) is known as a free (left)- G -acts on X if:

  • 1 - For any mapping σ:X(F)X(G);

  • 2 - For all G -acts Y and every map δ:XY, there exists a unique morphism ϕ:(F)X(G)Y such that the following diagram is commute:

1a012c86-98c5-467f-90ca-d05b794c28cd_gra1.gif

If X=Xn={1,2,,n} where n0 and nZ, the free (left)- G -act can be written as (F)n(G) .

It is clear that (F)n(G) consists elements of the form gx, where gG and xX i.e., (F)n(G)=̇i=1i=nGxi, such that Gxi={gxi:gG,1in,xiX}. 1,12 It is well-known that the set of all the morphisms σ:BB is called the endomorphism monoid, and it is denoted by End(B). Therefore, the set of all morphisms from the free (left)- G -acts into itself is an endomorphism monoid and it is denoted by End(F)n(G) such that End(F)n(G)={σ|σ:(F)n(G)(F)n(G) ; and σ is a G morphism}. If σEnd(F)n(G) , we define σ to be xjσ=gjσxjσ´, where 1 jn , σ´Tn , and gjσGn . As σ is a G morphism and for gG and 1 jn we have (gxj)σ=g(xjσ)=g(gjσxjσ´) .

4. Properties of the (full) wreath product multiplication

The (full) wreath product multiplication in semigroup theory is a multiplication comes from a semidirect product between two semigroups. The next definition gives an abstract construction of the (full) wreath product multiplication.

Definition 4.1:

12,13 Let G be a finite group and Tn be the (total) transformation on Xn , where n0,nZ.

Then, the (full) wreath product of Gn by Tn is

(g1δ,,gnδ,δ)(g1σ,,gnσ,σ)=(g1δg1δσ,,gnδgσ,δσ),
where δ,σTn and gjδ,gjσGn. Under this multiplication, the set ( Gn×Tn) is a monoid which is denoted by GnTn , with identity (e,e,,en,In), when In is the identity of Tn .

5. The structure of semigroup T(F)n(G)

This section is devoted to describe the set T(F)n(G) , when (F)n(G) is an independence algebra.

5.1 The monoids TY and TY

Suppose B be an algebra and B be a universe of B ,1,12,13 The sets TB={σ|σ:BB,σTB} , and TB={τ|τ:BB, such that τ is a morphism ,τTB } are monoids. Furthermore, TB is submonoid of TB, this result has been proved by Al-Aadhami in,12 and this can be shown by the following lemma:

Lemma 5.1.1:

The semigroup TB is a submonoid of TB.

Proof:

See.12

5.2 The monoid T(F)n(G)

In this subsection we give an explicit description to the (total) transformation monoid T(F)n(G) .

Definition 5.2.1:

The set of all morphisms T(F)n(G)={σ|σ:(F)n(G)(F)n(G) , such that σ is morphism} is a monoid. If γ T(F)n(G), then γ can be expressed as:

γ=(xi1ximi1γxi1γ´imγximγ´).

Where γ´Tn,i1γ,,imγG such that 1 i1<<imn,m0 and xikγ=ikγxikγ´ . Notice, for every selection of σ´Tn with Dom(σ´)={1,.,r} for 11<<rn,r0 and 1σ,,rσG this gives σ=(x1xr1σx1σ´rσxrσ´)T(F)n(G) .

Clearly, where G={e}, i.e., ( G is a trivial set), then T(F)n(G) will be isomorphic to Tn .

The next lemma is analogous to Lemma 4.1.12 However, the following lemma a semigroup S is assumed to be a finite group G.

Theorem 5.2.2:

If n0 , nZ, then T(F)n(G) End(F)n(G).

Proof:

Suppose σ be a mapping such that σ:T(F)n(G)End(F)n(G) defined by λσ=λ¯ when (gxi)λ¯=(gxi)λ, for all gG. We must show that λ¯ is a G -acts morphism, i.e., we want to show that g(bλ¯)=(gb)λ¯, for all gG and b(F)n(G) . Let b=kxi . Clearly, an element xiDom(λ) if and only if kxiDom(λ) for all kG. Where kxiDom(λ) , that means for all gG , gkxiDom(λ) then (gkxi)λ¯=(gkxi)λ=g((kxi)λ)=g((kxi)λ¯), since λ is a G -acts morphism.

To show σ is injective. Assume that λσ=γσ , then for any gxi(F)n(G) obtaining ( gxi)λσ=(gxi)γσ, i. Notice that, ( gxi)λ=(gxi)λ¯=(gxi)λσ=(gxi)γσ=(gxi)γ¯=(gxi)γ , so λ=γ , as required.

To prove σ is onto. Let β¯End(F)n(G) and let βT(F)n(G) defined from (F)n(G) to (F)n(G) by

(gxi)β=(gxi)β¯ , for each gxi(F)n(G). As βT(F)n(G) that implies β is a G -acts morphism, therefore for some gxiDom(β)=(F)n(G) and kG , we have k((gxi)β)=k((gxi)β¯)=(kgxi)β¯=(kgxi)β .

Since, (gxi)β=(gxi)β¯=(gxi)βσ , for all gxi(F)n(G) , gG. Therefore, βσ=β¯ , that gives σ is onto.

To prove σ is a homomorphism. Let δ,γT(F)n(G) .We need (δγ)σ=δσγσ . From the definition of σ and from our assumption we have (gxi)(δγ)σ=(gxi)δγ¯=(gxi)δγ i . Conversely, (gxi)(δσγσ)=(gxi)δ¯γ¯ .

Obviously, δ,¯γ¯End(F)n(G) , so δ,¯ and γ¯ are a G -acts morphisms. Then, (gxi)δ¯γ¯=((gxi)δ¯)γ¯=((gxi)δ)γ¯=((gxi)δ)γ=(gxi)δγ=(gxi)δγ¯ . So, (δγ)σ=δγ¯=δ¯γ¯=δγ , and this complete the proof.

Theorem 5.2.3:

For all n0, nZ, T(F)n(G) GnTn.

Proof:

Assume that σT(F)n(G), then σ can be written as =(xi1ximgi1σxi1σ´gimσximσ´) , such that σ´Tn,gi1σ,,gimσG for 1 i1<<imn,m0 . Let α:T(F)n(G)GnTn defined by μα=(g1μ,,gnμ,μ´) . In order to prove α is embedding, we have to prove α is one to one and a homomorphism map. Let δ,γT(F)n(G) , we need show ( δγ ) α=δαγα . Now, δαγα=(g1δ,,gnδ,δ´)(g1γ,,gnγ,γ´)=(g1δg1δ´γ,,gnδgnδ´γ,δ´γ´). The other side gives ( δγ ) α=(g1δγ,,gnδγ,(δγ)) . As δ,γT(F)n(G) then δ,γ are G -acts morphisms such that they take T(F)n(G) to itself. Hence, (xi)δγ=(xiδ)γ=(giδxiδ´)γ=giδ(xiδ´γ)=giδgiδ´γxiδ´γ´ i, and ( xi)δγ=giδγxi(δγ) . From that, i we get giδγxi(δγ)=giδgiδ´γxiδ´γ´ , so we obtain giδγ=giδgiδ´γ and (δγ)=δ´γ´ . This implies, α is homomorphism.

To prove α is one-to-one. Let δ,γT(F)n(G) such that δα=γα that leads to (g1δ,,gnδ,δ´)=(g1γ,,gnγ,γ´) .

Then for any gxi(F)n(G) , we have (gxi)δ=g(xiδ)=g(giδxiδ´)=g(giγxiγ´)=g(xiγ)=(gxi)γ , and

then δ=γ and α is one-to-one.

6. Green’s relations properties of T(F)n(G)

Where B is an independence algebra V. Gould,1 gave the characterization of Green’s relations on End(B) , after that A. Al-Aadhami,12 described the Green’s relations on End(F)n(S) , where S is a finite semigroup. In this section the characterization of Green’s relations on T(F)n(G) have been illustrated.

Theorem 6.1:

For all σ,τT(F)n(G) , we get the following identities:

  • I. σLτ if and only if Im{σ}Im{τ}.

  • II. σRτ if and only if Ker{τ}Ker{σ}.

  • III. (στ)(σ),(τ).

Proof:

  • I. ) Let σLτ in T(F)n(G) that implies σ=δτ for some δ T(F)n(G) and so by,12 [Proposition 5.5] we have Im{σ}=Im{δτ}Im{τ} , and hence Im{σ}Im{τ}.

    ) Assume that Im{σ}Im{τ} , so for all j{1,2,,n} , we get xjσIm{σ}Im{τ}.

    If we select bj(F)n(G) such that xjσ=bjτ , then by defining υ T(F)n(G) such that xjυ=bj for j{1,2,,n}. It is clear that xjυτ=bjτ=xjσ and therefore we can obtain υτ=σ that means σLτ.

  • II. (Where σRτ in T(F)n(G) that implies σ=τλ for any λT(F)n(G) . Assume (x,y)Ker{τ} , hence xτ=yτ . Therefore, xσ=x(τλ)

    =(xτ)λ(asτ,λareGacts morphism)=(yτ)λ=y(τλ)(asτ,λareGacts morphism)=yσ.

That means, (x,y)Ker{σ}, and so Ker{τ}Ker{σ}.

) If Ker{τ}Ker{σ}, let ϖT(F)n(G) such that ϖ : (F)n(G)(F)n(G). Since Im{τ}=Gxj1̇̇Gxjn by,12 [Lemma 5.1], define xjıϖ = yıσ, such that yıτ = xjı , and xjϖ=xj , for all j{j1,j2, …, jm} .

Now, let yıτ = yi´τ=xjı then ( yı , yi´ ) Ker{τ}Ker{σ} means yıσ= yi´σ that implies yıϖ=yi´ϖ , therefore, ϖ is well –defined.

Since (F)n(G) is free on Xn={x1,.,xn }, and as ϖT(F)n(G) then ϖ must be a G -acts morphism. Let z (F)n(G) be such that z=gxk, also let xkτ = hxjı , that implies =(gxk)τ=g(xkτ)=g(hxjı)=gh(xjı)= gh(yıτ)=(ghyı)τ. Now, zτϖ = (ghxji)ϖ=(gh) ( xjıϖ ) = (gh)(yıσ)=(ghyı)σ.

Because =(ghyı)τ, and Ker{τ}Ker{σ} we must have z σ = (ghyı)σ=zτϖ . Hence, σ=τϖ.

  • III. If we suppose that for any σ,τT(F)n(G) then (στ)(σ), and (στ)(τ), by,12 [Remark 5.2]. Recall, (σ)=(Im{σ}) and let Im{σ}=̇zZGz , where ZXn , so that, (σ)= | Z |. Because Im{στ}=Im{σ}τ=(̇zZGz)τ=̇zZG() this implies that (στ)|Z|=(σ). Notice, (τσ)=(Im{τσ})=((Im{τ})σ). As Im{τσ}Im{σ} we obtain (Im{τσ})(Im{σ}) and then (τσ)(τ) . Therefore, (στ)(σ),(τ).

Theorem 6.2:

For all σ,τT(F)n(G) , we have the following:

  • 1) σLτ if and only if Im{σ}=Im{τ}.

  • 2) σRτ if and only if Ker{τ}=Ker{σ}.

  • 3) σHτ if and only if Im{σ}=Im{τ} and Ker{τ}=Ker{σ}.

  • 4) σDτ if and only if (σ)=(τ) .

  • 5) σJτ if and only if (σ)(τ).

  • 6) σJτ if and only if (σ)=(τ).

  • 7) D= J.

Proof:

The point (1) and (2) can be easily be verified using Theorem 6.1.

3) It is direct result from (1) and (2).

4)) Let σDτ that means σRδLτ for any δT(F)n(G) . From (1) and (2) we get Im{δ}=Im{τ} and Ker{σ}=Ker{δ} . Now, Im{σ}(F)n(G)/ Ker{σ} (by the Fundamental Theorem of Semigroup), therefore, m{σ}(F)n(G)/Ker{δ} Im{δ} , and so (σ)=(Im{σ})=(Im{δ})=(δ), and then we get (σ)=(δ) , furthermore, (δ)=(Im{δ})=(Im{τ})=(τ). Hence, (σ)=(τ).

) Let (σ)=(τ). As Im{σ}=̇yYGy,Im{τ}=̇zZGz for some Y,ZXn . With | Y |=| Z | = (σ)=(τ).

If we let φ :Y Ζ be a bijection and by defining ϕ:Im{σ}Im{τ} by (gy ) ϕ=g(yφ), for all gG and yY. Clearly, ϕ is one to one as where (gy ) ϕ=(hy)ϕ that implies g(yφ) = h(yφ) , for all g,hG and y,y´Y . Then we must have g=h and (yφ) = (y´φ), this is because they are in Im{τ} and as Im{τ} is free (left)- G -act and φ is one-one, then y=y´ . Furthermore, ϕ is onto since from definition of ϕ we get, (gy)ϕ=g(yφ) for all gG,yY and because φ is bijection hence for all gzIm{τ} , choose yY with yφ=z,thengyIm{σ}andgz=g(y)φ=(gy ) ϕ .

Suppose ξ=σϕ,whereξT(F)n(G) . We have Im{ξ} = Im{σϕ} = Im{σ}ϕ=Im{τ} , therefore, τLξ.

Let c,d(F)n(G). Clearly, cσ=dσ if and only if (cσ)ϕ=(dσ)ϕ. Since ϕ is one to one, then Ker{σ}=Ker{σϕ}=Ker{ξ} , therefore, σRξ . Hence, σDτ.

5) ) Let σIτ that means σ=ζτη , for any ζ,ηT(F)n(G) . From Theorem 6.1, (III), we have (σ)=(ζτη)(ζτ)(τ) .

)If(σ)(τ),Im{σ}=̇yYGy and Im{τ}=̇zZGz for some Y,ΖXn , with (σ)= | Y | and (τ)=|Z|. Because (σ)(τ) then by,12 [Remark 5.7] there is a one to one map ϕ:YΖ . Let P=Im{ϕ} , that means PZ and |Y|=|P| .

Fix p0P and define π:ZP by z π=z , for all z P , and =p0 for all z Z\P, then Im{π}=P . Define β:̇zZGżpPGp by =. Obviously, β extends to a G -acts morphism therefore, βπT(F)n(G) . Since Im{βπ} = (Im{β})π = (̇zZGz)π=̇zZGzπ = ̇zZGzβ = ̇pPGp , we obtain (βπ)=|P|=|Y|=(σ) so, by (4) we get βπDσ and then βπJσ because DJ . Therefore, σIτ.

6) ) If σJτ, then σ=δτλ,τ=ασυ,for someδ,λ,α,υT(F)n(G). By Theorem 6.1, (III), (σ) = (δτλ)(δτ)(τ) , as well as (τ)=(ασυ)(ασ)(σ) , that gives (σ)= (τ).

) Let (σ)= (τ) , then σDτ by using (4), so that σJτ as D J .

7) This is an immediate consequence of (4) and (6).

7. Conclusions

Throughout this paper, the independence algebra (F)n(G) has been studied, and we show that it is free (left)- G -acts under specific conditions. Moreover, the structure of T(F)n(G) have been considered, and the we show that T(F)n(G) isomorphic to the endomorphism monoid End(F)n(G) , with embeddedness in the (full) wreath product of Tn by Gn . For future work we may consider the structure of PT(F)n(S) , where S is a finite semigroup.

Comments on this article Comments (0)

Version 1
VERSION 1 PUBLISHED 02 Feb 2026
Comment
Author details Author details
Competing interests
Grant information
Copyright
Download
 
Export To
metrics
Views Downloads
F1000Research - -
PubMed Central
Data from PMC are received and updated monthly.
- -
Citations
CITE
how to cite this article
M. Sulaiman H and Al-Aadhami A. Structure of the (Total) Transformation Monoids Under Rank N Generators [version 1; peer review: awaiting peer review]. F1000Research 2026, 15:170 (https://doi.org/10.12688/f1000research.173831.1)
NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article.
track
receive updates on this article
Track an article to receive email alerts on any updates to this article.

Open Peer Review

Current Reviewer Status:
AWAITING PEER REVIEW
AWAITING PEER REVIEW
?
Key to Reviewer Statuses VIEW
ApprovedThe paper is scientifically sound in its current form and only minor, if any, improvements are suggested
Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit.
Not approvedFundamental flaws in the paper seriously undermine the findings and conclusions

Comments on this article Comments (0)

Version 1
VERSION 1 PUBLISHED 02 Feb 2026
Comment
Alongside their report, reviewers assign a status to the article:
Approved - the paper is scientifically sound in its current form and only minor, if any, improvements are suggested
Approved with reservations - A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit.
Not approved - fundamental flaws in the paper seriously undermine the findings and conclusions
Sign In
If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password.

The email address should be the one you originally registered with F1000.

Email address not valid, please try again

You registered with F1000 via Google, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Google account password, please click here.

You registered with F1000 via Facebook, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Facebook account password, please click here.

Code not correct, please try again
Email us for further assistance.
Server error, please try again.