Research article

Regularity and abundance on semigroups of transformations preserving an equivalence relation on an invariant set

  • Received: 28 March 2023 Revised: 15 May 2023 Accepted: 23 May 2023 Published: 29 May 2023
  • MSC : 20M20

  • Let T(X) be the full transformation semigroup on a nonempty set X. For an equivalence relation E on X and a nonempty subset Y of X, let

    ¯SE(X,Y)={αT(X):x,yY,(x,y)E(xα,yα)E,xα,yαY}.

    Then ¯SE(X,Y) is a subsemigroup of T(X) consisting of all full transformations that leave Y and the equivalence relation E on Y invariant. In this paper, we show that ¯SE(X,Y) is not regular in general and determine all its regular elements. Then we characterize relations L, L, R and R on ¯SE(X,Y) and apply these characterizations to obtain the abundance on such semigroup.

    Citation: Kitsanachai Sripon, Ekkachai Laysirikul, Yanisa Chaiya. Regularity and abundance on semigroups of transformations preserving an equivalence relation on an invariant set[J]. AIMS Mathematics, 2023, 8(8): 18223-18233. doi: 10.3934/math.2023926

    Related Papers:

    [1] Nuttawoot Nupo, Sayan Panma . Certain structural properties for Cayley regularity graphs of semigroups and their theoretical applications. AIMS Mathematics, 2023, 8(7): 16228-16239. doi: 10.3934/math.2023830
    [2] Fengxia Gao, Jialei Chen . Conjugacy classes of left ideals of Sweedler's four-dimensional algebra H4. AIMS Mathematics, 2022, 7(5): 7720-7727. doi: 10.3934/math.2022433
    [3] Rukchart Prasertpong . Roughness of soft sets and fuzzy sets in semigroups based on set-valued picture hesitant fuzzy relations. AIMS Mathematics, 2022, 7(2): 2891-2928. doi: 10.3934/math.2022160
    [4] Shahida Bashir, Ahmad N. Al-Kenani, Maria Arif, Rabia Mazhar . A new method to evaluate regular ternary semigroups in multi-polar fuzzy environment. AIMS Mathematics, 2022, 7(7): 12241-12263. doi: 10.3934/math.2022680
    [5] Ubaid Ur Rehman, Tahir Mahmood, Muhammad Naeem . Bipolar complex fuzzy semigroups. AIMS Mathematics, 2023, 8(2): 3997-4021. doi: 10.3934/math.2023200
    [6] S. Meenakshi, G. Muhiuddin, B. Elavarasan, D. Al-Kadi . Hybrid ideals in near-subtraction semigroups. AIMS Mathematics, 2022, 7(7): 13493-13507. doi: 10.3934/math.2022746
    [7] Faiz Muhammad Khan, Tian-Chuan Sun, Asghar Khan, Muhammad Junaid, Anwarud Din . Intersectional soft gamma ideals of ordered gamma semigroups. AIMS Mathematics, 2021, 6(7): 7367-7385. doi: 10.3934/math.2021432
    [8] Ze Gu, Xiang-Yun Xie, Jian Tang . On C-ideals and the basis of an ordered semigroup. AIMS Mathematics, 2020, 5(4): 3783-3790. doi: 10.3934/math.2020245
    [9] Guoqing Wang . A generalization of Kruyswijk-Olson theorem on Davenport constant in commutative semigroups. AIMS Mathematics, 2020, 5(4): 2992-3001. doi: 10.3934/math.2020193
    [10] Shoufeng Wang . Projection-primitive P-Ehresmann semigroups. AIMS Mathematics, 2021, 6(7): 7044-7055. doi: 10.3934/math.2021413
  • Let T(X) be the full transformation semigroup on a nonempty set X. For an equivalence relation E on X and a nonempty subset Y of X, let

    ¯SE(X,Y)={αT(X):x,yY,(x,y)E(xα,yα)E,xα,yαY}.

    Then ¯SE(X,Y) is a subsemigroup of T(X) consisting of all full transformations that leave Y and the equivalence relation E on Y invariant. In this paper, we show that ¯SE(X,Y) is not regular in general and determine all its regular elements. Then we characterize relations L, L, R and R on ¯SE(X,Y) and apply these characterizations to obtain the abundance on such semigroup.



    Let X be an arbitrary nonempty set. The full transformation semigroup on X, denoted by T(X), is the semigroup consisting of all mappings from X to X under the operation of composition of functions. It is well-known that T(X) is a regular semigroup (see [3], for details). Moreover, every semigroup can be embedded in T(X) for some appropriate set X.

    For a fixed nonempty subset Y of X, let

    S(X,Y)={αT(X):YαY}.

    Then S(X,Y) is a semigroup of total transformations of X which leave a subset Y of X invariant. In 1975, Symons [17] described the automorphism group of this semigroup. In 2005, Nenthein, Youngkhong and Kemprasit [7] showed that the semigroup S(X,Y) is regular if and only if X=Y or Y contains exactly one element, and R={αS(X,Y):XαY=Yα} is the set of all regular elements of S(X,Y). In addition, they determined the number of regular elements in S(X,Y) when X is a finite set. In 2011, Honyam and Sanwong [4] characterized when S(X,Y) is isomorphic to T(Z) for some set Z and proved that every semigroup A can be embedded in S(A1,A). They also described Green's relations of the semigroup S(X,Y), its group H-classes, and its ideals. In 2013, Choomanee, Honyam and Sanwong [2] described left regular, right regular and intra-regular elements of S(X,Y) and considered the relationships between these elements. Furthermore, they found the number of left regular elements of S(X,Y) when X is a finite set. In [14], Sun and Wang studied the natural partial order in S(X,Y). They determined when two elements of S(X,Y) are related, found the elements which are compatible and described the maximal elements, the minimal elements and the greatest lower bound of two elements. Also, they showed that the semigroup S(X,Y) is abundant. In [13], Sun L. and Sun J. investigated all the elements in the semigroup S(X,Y) which are left compatible with respect to the natural partial order. In [1], Chinram and Baupradist characterized left magnifying elements and right magnifying elements of semigroups of transformations with invariant set.

    Let E be an equivalence relation on a set X. Consider the following subset of T(X):

    TE(X)={αT(X):x,yX, (x,y)E implies (xα,yα)E}.

    It is obvious that if E is a non-trivial equivalence relation, then TE(X) is a proper subsemigroup of T(X) and if E is the identity or universal relation, then TE(X) and T(X) are identical. In 1994 and 1996, Pei discussed α-congruences and some regular subsemigroup inducing a certain lattice on TE(X) [9,10]. In 2005, Pei [8] investigated regularity of elements and Green's relations on the semigroup TE(X). In [11], Pei determined the rank of the homeomorphism group and considered the rank of TE(X) when X is a finite set and each class of the equivalence E has the same cardinality. Furthermore, he also studied the rank of Γ(X), the semigroup of all closed function α on a topological space X for which E classes form a basis. In 2008, Sun, Pei and Cheng [15] characterized the natural partial order on the semigroup TE(X). The compatibility of multiplication and all compatible elements were investigated. Moreover, they found maximal, minimal and covering elements with respect to the order. In 2011, Pei and Zhou [12] considered the relations L and R on the semigroup TE(X) and the equivalence relations E under which TE(X) becomes abundant. In 2019, Sun [16] investigated the left and right compatibility with respect to the natural partial order on TE(X). Kaewnoi, Petapirak and Chinram studied left and right magnifying elements of the semigroup TE(X) in [5].

    In our work, we introduce a new transformation subsemigroup of T(X) by letting Y be a fixed nonempty subset of X and define

    ¯SE(X,Y)={αT(X):x,yY,(x,y)E(xα,yα)E,xα,yαY}.

    Then ¯SE(X,Y) is a generalization of all aforementioned semigroups. In Section 3, we describe all regular elements on ¯SE(X,Y) and give necessary and sufficient conditions for ¯SE(X,Y) to be regular. In Section 4, we characterize relations L, L, R and R on ¯SE(X,Y). Consequently we prove that ¯SE(X,Y) is always left abundant but not right abundant, in general. Also, we determine the conditions for ¯SE(X,Y) to be abundant.

    This section provides some basic properties of ¯SE(X,Y) and notation which will be used throughout the paper. In addition, [3] is suggested for more basic concepts in semigroup theory.

    Let X be a nonempty set and E an equivalence relation on X. Hereafter, we denote by X/E the quotient set of X by E, i.e., the set of all E-classes. By AX/E, we mean that A is an equivalence class of E that can be viewed both as an element of X/E and as a subset of X. Let A and B be two collections of nonempty subsets of X. Then A is said to refine B, if for each AA, there exists BB such that AB. For α,βT(X), the composition of α and β, denoted by αβ, is a mapping obtained by performing first α and then β. The notation xα means the image of x under α and Xα={xα:xX} is the range of α. Moreover, π(α) is a partition of X induced by α, i.e.,

    π(α)={xα1:xXα},

    where xα1 is the inverse image of x under α. Note that by a slight abuse of notation, we write Pα=x, where P=xα1π(α). Particularly,

    ε(α)={Aα1:AX/E and AXα},

    where Aα1={xα1:xAXα}. Obviously, π(α) refines ε(α). For a nonempty subset Y of X, we define restrictions to Y of π(α) and ε(α) by

    πY(α)={Pπ(α):PY}

    and

    εY(α)={(AY)α1:AX/E and AXαY}.

    Let Y be a nonempty subset of a set X. Consider

    ¯SE(X,Y)={αT(X):x,yY,(x,y)E(xα,yα)E,xα,yαY}.

    We can see that ¯SE(X,Y) is a subsemigroup of T(X) and S(X,Y) and idX, the identity map on X, belongs to ¯SE(X,Y). We first present relationships between ¯SE(X,Y) and some famous transformation semigroups as follows:

    Proposition 2.1. ¯SE(X,Y)TE(X) if and only if either one of the following hold:

    (1) E=X×X;

    (2) for each zXY, aX, (z,a)E implies z=a.

    Consequently, ¯SE(X,Y)=TE(X) if and only if Y=X.

    Proof. Assume that EX×X and there exists (z,a)E, such that zXY, aX in which za. Since EX×X, |X/E|2, and so there exists AX/E such that zA.

    Case 1. AY. Let bAY and α:XX be defined by

    xα={z, if x=z,b,otherwise.

    Let x,yY and (x,y)E. Then (xα,yα)=(b,b)E, which implies α¯SE(X,Y). However, αTE(X) since (zα,aα)=(z,b)E.

    Case 2. AY=. Choose bA and cY. Define α:XX by

    xα={b, if x=z,c,otherwise.

    Let x,yY and (x,y)E. Then (xα,yα)=(c,c)E, which implies α¯SE(X,Y). However, αTE(X) since (zα,aα)=(b,c)E.

    The converse is obvious in the case of E=X×X. Assume EX×X and (2) holds. Let α¯SE(X,Y) and let x,yX be such that (x,y)E. If xY, then yY. Thus (xα,yα)E. If xY, then x=y by (2) and so (xα,yα)E. Hence αTE(X).

    Consequently, if YX, there exists zXY and XzTE(X), where Xz is a constant map on X with Xα={z}. Clearly, α¯SE(X,Y) and so TE(X)¯SE(X,Y).

    Proposition 2.2. ¯SE(X,Y)=S(X,Y) if and only if Y×YE or (Y×Y)E=idY, where idY is the identity relation on Y.

    Proof. Assume that Y×YE and (Y×Y)EidY. Then there exist distinct a,bY such that (a,b)E and there exist distinct c,dY such that (c,d)E. Define α:XX by

    xα={a, if x=c,b, if x=d,x,otherwise.

    Then αS(X,Y), but α¯SE(X,Y) since (cα,dα)=(a,b)E.

    Assume that Y×YE or (Y×Y)E=idY. Clearly, ¯SE(X,Y)S(X,Y). Let αS(X,Y) and x,yY be such that (x,y)E. Then xα,yαY. If Y×YE, then (xα,yα)E. If (Y×Y)E=idY, then x=y, and so (xα,yα)E. Hence, α¯SE(X,Y).

    Recall that, for an element a in a semigroup S, a is said to be regular if there exists xS such that a=axa. In particular, if all elements of S are regular, then S is called a regular semigroup. We begin this section by characterizing all regular elements in ¯SE(X,Y). To do this, the following lemma is a crucial tool.

    Lemma 3.1. Let α¯SE(X,Y). Then, for each AX/E, there exists BX/E such that (AY)αBY.

    Proof. Let AX/E. It is clear in the case of AY=. Let xAY. Then there exists BX/E such that xαB and so BY. To show (AY)αBY, we let yAY. Since x and y belong to the same partition, (x,y)E. Since x,yY and α¯SE(X,Y), (xα,yα)E and yαY. Hence, yαBY, as required.

    Theorem 3.1. Let α¯SE(X,Y). Then α is regular if and only if, for each AX/E, there exists BX/E such that BY and AXαY(BY)α.

    Proof. Assume α is regular and let AX/E. Then α=αβα for some β¯SE(X,Y). From Lemma 3.1, there exists BX/E such that (AY)βBY. For each xAXαY, we have x=aα for some aX, and so x=aα=aαβα=xβα(BY)α. Hence, AXαY(BY)α.

    Conversely, assume that the condition hold. For each AX/E in which AY, by the assumption, we can fix BAX/E such that BAY and AXαY(BAY)α. Let yABAY be fixed. Consider xAY. If xAYXα, then we choose xBAY such that xα=x. If x(AY)Xα, then we set x=yA. For each xXαY, we choose xX such that xα=x. Now, define β:XX by

    xβ={x, if xXαY,x,otherwise.

    To show β¯SE(X,Y), let x,yY in which (x,y)E. It is clear that xβ,yβY and x and y belong to the same equivalence class, say A. Then xβ=x and yβ=y are both in BA, that is, (xβ,yβ)E. To show α=αβα, let xX. Then xαβα=(xα)βα=(xα)α=xα. This completes the proof.

    Theorem 3.2. Let YX. Then ¯SE(X,Y) is a regular semigroup if and only if one of the following conditions hold:

    (1) |Y|=1.

    (2) Y=X and E=X×X.

    (3) Y=X and E=idX.

    Proof. Assume that all conditions are false.

    Case 1. |Y|1 and YX. Then there exist distinct a,bY and XY. Define α:XX by

    xα={b,if xY,a,otherwise.

    It is clear that α¯SE(X,Y). Let AX/E such that aA. For each BX/E, we have (BY)αYα={b}. Since aAYXα, we obtain AXαY(BY)α for all BX/E. By Theorem 3.1, α is not regular.

    Case 2. |Y|1, Y=X, EX×X and EidX. Then there exists AX/E such that AX and |A|2. Let a and b be two distinct elements in A. Define α:XX by

    xα={a,if xA,b,otherwise.

    It is clear that α¯SE(X,Y) and (BX)α=Bα is a singleton set, for all BX/E. Since a,bAXαX, we get AXαX(BX)α. By Theorem 3.1, α is not regular.

    Conversely, assume one of three aforementioned conditions holds. Let α¯SE(X,Y). If |Y|=1, then we let Y={y}. Hence, there exists BX/E such that yB. In this case, AXαY{y}=(BY)α for all AX/E, and so α is regular. For the case of Y=X and E=X×X, we have X is exactly one equivalence class in X/E and XYXα=Xα=(XY)α. This implies α is regular. Finally, if Y=X and X=idX, then each equivalence class in X/E is a singleton set of elements in X=Y. Consider {x}X/E. If xXα, then {x}YXα=({x}Y)α. If xXα, then x=xα for some xX. Hence, {x}XXα={x}=({x}X)α, and so α is regular. Therefore, ¯SE(X,Y) is regular, as required.

    If X=Y, then ¯SE(X,Y)=TE(X), and we have the following corollaries, which first appeared in [8].

    Corollary 3.1. [8] αTE(X) is regular if and only if for each AX/E, there exists BX/E such that AXαBα.

    Corollary 3.2. [8] TE(X) is regular if and only if E=idX or X×X.

    For any semigroup S, denote by S1 the semigroup obtained from S by adjoining an identity if S has no identity and S1=S if S is a monoid. For any a,bS, define

    aLbif and only ifS1a=S1b,

    or equivalently, aLb if and only if a=xb,b=ya for some x,yS1. Dually, define

    aRbif and only if aS1=bS1,

    or equivalently, aRb if and only if a=bx,b=ay for some x,yS1. Moreover,

    aLb if and only if aLb in some oversemigroup of S.

    Analogously,

    aRb if and only if aRb in some oversemigroup of S.

    It is well-known that all four aforementioned relations are equivalence relations on S in which LL and RR. Particularly, if S is a regular semigroup, then L=L and R=R. In addition, S is said to be left abundant if each L-class contains an idempotent. Right abundant semigroup is defined dually. If S is both left and right abundant, then S is called an abundant semigroup. Since all L-classes and R-classes of any regular semigroups always contain at least one idempotent, all regular semigroups are abundant.

    In fact, ¯SE(X,Y) is not regular in general. Here, we study the relations L, R, L and R on ¯SE(X,Y) and apply the results to describe the condition for ¯SE(X,Y) to be abundant.

    Theorem 4.1. Let α,β¯SE(X,Y). Then α=γβ for some γ¯SE(X,Y) if and only if XαXβ and, for each AX/E, there exists BX/E such that (AY)α(BY)β. Consequently, αLβ if and only if Xα=Xβ and, for each AX/E, there exist B,CX/E such that (AY)α(BY)β and (AY)β(CY)α.

    Proof. Assume α=γβ for some γ¯SE(X,Y). Clearly, Xα=(Xγ)βXβ. Let AX/E. By Lemma 3.1, there exists BX/E such that (AY)γBY. Hence, (AY)α=(AY)γβ(BY)β.

    Conversely, assume the conditions hold. For each AX/E, we fix AX/E such that (AY)α(AY)β. Let xX. Then there exists AxX/E such that xAx. If xY, we choose xAxY such that xα=xβ. If xY, then there exists xX such that xα=xβ. Define γ:XX by xγ=x for all xX. To show γ¯SE(X,Y), let x,yY in which (x,y)E. Then x,y belong to the same equivalence class in X/E, say A. Hence x,yAY. Therefore, (xγ,yγ)=(x,y)E and xγ,yγY. For each xX, we have xγβ=xβ=xα. Hence α=γβ. This completes the proof.

    Theorem 4.2. Let α,β¯SE(X,Y). Then α=βγ for some γ¯SE(X,Y) if and only if π(β) refines π(α) and εY(β) refines εY(α). Consequently, αRβ if and only if π(β)=π(α) and εY(β)=εY(α).

    Proof. Assume that α=βγ for some γ¯SE(X,Y). It is clear that π(β) refines π(α). To show that εY(β) refines εY(α), let UεY(β). Then U=(AY)β1 and AXβY for some AX/E. Thus UβAY. Since γ¯SE(X,Y), we get (AY)γBY for some BX/E. This implies Uα=Uβγ(AY)γBY. Hence, U(BY)α1εY(α), as required.

    On the other hand, assume the conditions hold. For each xXβ, choose xX such that x=xβ. For each AX/E in which AXβY, choose xAAXβY. Define γ:XX by

    xγ={xα, if xXβ,xAα, if xAYXβ and AXβY and AX/E,x,otherwise.

    To show γ¯SE(X,Y), let x,yY and (x,y)E. Then there exists AX/E such that x,yA. Clearly, xγ,yγY. If AXβY=, then (xγ,yγ)=(x,y)E. If AXβY, then (x,xA),(y,xA)E. Assume xXβ and yXβ (the other cases can be proved similar). Then x,xAAXβY, and so xβ1,xAβ1(AY)β1εY(β). Since εY(β)=εY(α), (AY)β1=(BY)α1 for some BX/E such that BYXα. Since xxβ1 and xAxAβ1, we get x,xA(AY)β1=(BY)α1. Hence, xα,xAαB which yields (xγ,yγ)=(xα,xAα)E. Let xX be such that xβ=y. Since yβ=y, x,yyβ1π(β)=π(α), we obtain xα=yα. This implies that xβγ=yγ=yα=xα and so α=βγ.

    Next, we provide necessary and sufficient conditions for any two elements of ¯SE(X,Y) to be L-related and R-related. To prove the results, we need the following three lemmas.

    Lemma 4.1. [6] Let S be a semigroup and a,bS. Then the following statements are equivalent:

    (1) aLb.

    (2) For all x,yS1, ax=ay if and only if bx=by.

    Lemma 4.2. [6] Let S be a semigroup and a,bS. Then the following statements are equivalent:

    (1) aRb.

    (2) For all x,yS1, xa=ya if and only if xb=yb.

    Lemma 4.3. [3] Let α,βT(X).

    (1) αLβ if and only if Xα=Xβ.

    (2) αRβ if and only if π(α)=π(β).

    Theorem 4.3. Let α,β¯SE(X,Y). Then αLβ if and only if Xα=Xβ.

    Proof. Assume that Xα=Xβ. By Lemma 4.3(1), αLβ in T(X). As T(X) is an oversemigroup of ¯SE(X,Y) then (by definition of L) αLβ.

    Conversely, assume αLβ. Let AX/E. If AXαY, then we choose xAAXαY. If AXαY=, then we choose xAXαY. Define γ:XX by

    xγ={x, if xXα,xA, if xAXα for some AX/E.

    Let x,yY be such that (x,y)E. Then x,yA for some AX/E. If AXαY, then x,y,xAAY, which implies (xγ,yγ)E and xγ,yγY. If AXαY=, then x,yXα. Hence, (xγ,yγ)=(xA,xA)E and xγ,yγY. Thus γ¯SE(X,Y) in which αγ=α=αidX. By Lemma 4.1, βγ=βidX=β. This implies that Xβ=XβγXγ=Xα. By the same argument, we can show that XαXβ. Therefore, Xα=Xβ, as required.

    Notice that the element γ, as define in the proof of Theorem 4.3, is an idempotent and Xγ=Xα. Therefore, an arbitrary L-class of ¯SE(X,Y) contains an idempotent and we obtain the following:

    Theorem 4.4. The semigroup ¯SE(X,Y) is left abundant.

    Theorem 4.5. Let α,β¯SE(X,Y). Then αRβ if and only if π(α)=π(β).

    Proof. Assume that π(α)=π(β). By Lemma 4.3(2), αRβ in T(X) and so αRβ.

    Conversely, assume αRβ. Let a,bX. To show aα=bα if and only if aβ=bβ, we first assume, for the if part, that aα=bα.

    Case 1. aY or bY. Without loss of generality, we assume that bY. Since X/E is a partition of X, there exists AX/E such that aA. If AY=Y or aY, then we let Z=Y{a}. If AYY and aY, then we set Z=YA. Define γ,δ:XX by

    xγ={b, if xZ,a, otherwise, 

    and xδ=b for all xX. Clearly, γ,δ¯SE(X,Y) and γα=δα. By Lemma 4.2, we obtain γβ=δβ and so aβ=aγβ=aδβ=bβ.

    Case 2. a,bY. Choose cY. Define γ,δ:XX by

    xγ={c, if xY,a, otherwise, 

    and

    xδ={c, if xY,a, if x=a,b, otherwise.

    Clearly, γ,δ¯SE(X,Y) and γα=δα. By Lemma 4.2, we obtain γβ=δβ and so aβ=bγβ=bδβ=bβ.

    The only part can be proved similar. Therefore, π(α)=π(β), as required.

    However, ¯SE(X,Y) is probably not right abundant. Consider X={1,2,3,4,5,6}, E is an equivalence relation on X such that X/E={{1,2,3},{4,5},{6}} and

    α=(123456112233)¯SE(X,X).

    We can see that there is no idempotent γ¯SE(X,X) such that π(γ)=π(α). Hence, the R-class containing α has no idempotent.

    In the last part of this paper, we will present the the conditions for being abundant of ¯SE(X,Y).

    Theorem 4.6. ¯SE(X,Y) is abundant if and only if |{AX/E:|AY|2}|1 or |AY|<3 for all AX/E.

    Proof. Assume that there exist A,BX/E such that |AY|3, |BY|2 and AB. Choose a1,a2,a3AY and b1,b2BY that are all distinct elements. Define α:XX by

    xα={a1, if x=a3,a2, if x=b1,a3, if x=b2,x, otherwise.

    Then α¯SE(X,Y) and {{a1,a3},{a2,b1},{b2}}π(α). Let γ¯SE(X,Y) be such that γ2=γ. We will show that (α,γ)R. Suppose that (α,γ)R. Then π(α)=π(γ). Since γ2=γ, we have b2γ=b2B. From (b1,b2)E, we get b1γ,b2γB. Hence a2γ=b1γB. From (a1,a2)E, we obtain (a1γ,a2γ)E. Thus a1γB. Since a1γ{a1,a3}, we have {a1,a3}B which is a contradition. Therefore (α,γ)R. Hence ¯SE(X,Y) is not abundant.

    Conversely, assume |{AX/E:|AY|2}|1 or |AY|<3 for all AX/E.

    Case 1. |AY|<3 for all AX/E. Let α¯SE(X,Y). For each AX/E such that AXαY, let RA={xα1:xAXαY}. By assumption, we have |RA|2. Now, let AX/E be such that AXαY and RAπBY(α) for all BX/E. For each PRA, if PY, then fix xPPY. If PY=, then fix xPP. Next, let AX/E be such that AXαY and there exists BX/E such that RAπBY(α). Choose AX/E such that RAπAY(α). Hence PAY for all PRA. We fix xPPAY for all PRA. Finally, for Pπ(α) such that P=xα1 and xXαY, fix xPP. Define γ:XX by xγ=xP where Pπ(α) and xP. Let xX. Then there exists a unique Pπ(α) such that xP. Let P=yα1 for some yXαY. Thus PRA for some AX/E. If PRB for some BX/E, then yBY. Hence, B=A and so γ is well-defined. We claim γ¯SE(X,Y). Let x,yY and (x,y)E. Then (xα,yα)E and xα,yαY. There exists a unique AX/E such that xα,yαA. Thus P=(xα)α1, Q=(yα)α1 and so P,QRA. We may assume PQ. Note that xP, yQ and (x,y)E. Since |RA|=2, we get RAπAY(α). This implies that xP,xQAY. Hence (xγ,yγ)E and xγ,yγY. Therefore γ¯SE(X,Y). For each Pπ(α) and xP, we have xγ=xP. Clearly, π(γ)=π(α). We have (γ,α)R. Consider xγ2=xpγ=xp=xγ. Thus γ is an idempotent. Hence ¯SE(X,Y) is right abundant. This means that ¯SE(X,Y) is abundant.

    Case 2. |{AX/E:|AY|2}|1. Let AX/E be such that |AY|2. Then, for all BX/E, BA implies |BY|1. For each Pπ(α), if PAY, then we choose xPPAY. If PY, then choose xPPY. If PY=, then choose xPP. Define γ:XX by xγ=xP where Pπ(α) and xP. Let x,yY and (x,y)E. If x,yA for some AX/E, then xPAY and yQAY. Thus xP,xQAY. Therefore (xγ,yγ)E and xγ,yγY. Hence γ¯SE(X,Y). If x,yA, then x,yBY for some BX/E. Thus x=y and so xγ=yγ. Therefore γ¯SE(X,Y). For each Pπ(α) and xP, we have xγ=xP. Clearly, π(γ)=π(α). We obtain that (γ,α)R. From xPP, we have xPγ=xP. This implies that xγ2=xPγ=xP=xγ. Hence γ is an idempotent. This means that ¯SE(X,Y) is right abundant. Therefore, ¯SE(X,Y) is abundant.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors declare no conflict of interest.



    [1] R. Chinram, S. Baupradist, Magnifying elements in semigroups of transformations with invariant set, Asian-Eur. J. Math., 12 (2019), 1950056. http://dx.doi.org/10.1142/S1793557119500566 doi: 10.1142/S1793557119500566
    [2] W. Choomanee, P. Honyam, J. Sanwong, Regularity in semigroups of transformations with invariant sets, International Journal of Pure and Applied Mathematics, 87 (2013), 151–164. http://dx.doi.org/10.12732/ijpam.v87i1.9 doi: 10.12732/ijpam.v87i1.9
    [3] J. Howie, Fundamentals of semigroup theory, Oxford: Clarendon Press, 1995.
    [4] P. Honyam, J. Sanwong, Semigroups of transformations with invariant set, J. Korean Math. Soc., 48 (2011), 289–300. http://dx.doi.org/10.4134/JKMS.2011.48.2.289 doi: 10.4134/JKMS.2011.48.2.289
    [5] T. Kaewnoi, M. Petapirak, R. Chinram, Magnifying elements in a semigroup of transformations preserving equivalence relation, Korean J. Math., 27 (2019), 269–277. http://dx.doi.org/10.11568/kjm.2019.27.2.269 doi: 10.11568/kjm.2019.27.2.269
    [6] E. Lyapin, Semigroups, Providence: American Mathematical Society, 1963.
    [7] S. Nenthein, P. Youngkhong, Y. Kemprasit, Regular elements of some transformation semigroups, Pure Mathematics and Applications, 16 (2005), 307–314.
    [8] H. Pei, Regularity and Green's relations for semigroups of transformations that preserve an equivalence, Commun. Algebra, 33 (2005), 109–118. http://dx.doi.org/10.1081/AGB-200040921 doi: 10.1081/AGB-200040921
    [9] H. Pei, Equivalences, α-semigroups and α-congruences, Semigroup Forum, 49 (1994), 49–58. http://dx.doi.org/10.1007/BF02573470 doi: 10.1007/BF02573470
    [10] H. Pei, A regular α-semigroup inducing a certain lattice, Semigroup Forum, 53 (1996), 98–113. http://dx.doi.org/10.1007/BF02574125 doi: 10.1007/BF02574125
    [11] H. Pei, On the rank of the semigroup TE(X), Semigroup Forum, 70 (2005), 107–117. http://dx.doi.org/10.1007/s00233-004-0135-z doi: 10.1007/s00233-004-0135-z
    [12] H. Pei, H. Zhou, Abundant semigroups of transformations preserving an equivalence relation, Algebr. Colloq., 18 (2011), 77–82. http://dx.doi.org/10.1142/S1005386711000034 doi: 10.1142/S1005386711000034
    [13] L. Sun, J. Sun, A note on naturally ordered semigroups of transformations with invariant set, Bull. Aust. Math. Soc., 91 (2015), 264–267. http://dx.doi.org/10.1017/S0004972714000860 doi: 10.1017/S0004972714000860
    [14] L. Sun, L. Wang, Natural partial order in semigroups of transformations with invariant set, Bull. Aust. Math. Soc., 87 (2013), 94–107. http://dx.doi.org/10.1017/S0004972712000287 doi: 10.1017/S0004972712000287
    [15] L. Sun, H. Pei, Z. Cheng, Naturally ordered transformation semigroups preserving an equivalence, Bull. Austral. Math. Soc., 78 (2008), 117–128. http://dx.doi.org/10.1017/S0004972708000543 doi: 10.1017/S0004972708000543
    [16] L. Sun, Compatibility on naturally ordered transformation semigroups preserving an equivalence, Semigroup Forum, 98 (2019), 75–82. http://dx.doi.org/10.1007/s00233-018-9965-y doi: 10.1007/s00233-018-9965-y
    [17] J. Symons, Some result concerning a transformation semigroup, J. Aust. Math. Soc., 19 (1975), 413–425. http://dx.doi.org/10.1017/S1446788700034455 doi: 10.1017/S1446788700034455
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1300) PDF downloads(55) Cited by(0)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog