Research article Special Issues

Characterizations of normal cancellative monoids

  • Normal cancellative monoids were introduced to explore the general structure of cancellative monoids, which are innovative and open up new possibilities. Specifically, we pointed out that the Green's relations in a cancellative monoid S are determined by its unitary subgroup U to a great extent. The specific composition of egg boxes in S, derived from the general semigroup theory, can be settled by the subgroups of U. We call a cancellative monoid normal when these subgroups are normal and characterize it as an NCM-system. This NCM-system was created in this article and can be obtained by combining a group and a condensed cancellative monoid. Furthermore, we introduced the concept of torsion extension and proved that a special kind of normal cancellative monoids can be constructed delicately by the outer automorphism groups of given groups and some simplified cancellative monoids.

    Citation: Hui Chen. Characterizations of normal cancellative monoids[J]. AIMS Mathematics, 2024, 9(1): 302-318. doi: 10.3934/math.2024018

    Related Papers:

    [1] Ahmet S. Cevik, Eylem G. Karpuz, Hamed H. Alsulami, Esra K. Cetinalp . A Gröbner-Shirshov basis over a special type of braid monoids. AIMS Mathematics, 2020, 5(5): 4357-4370. doi: 10.3934/math.2020278
    [2] Haijun Cao, Fang Xiao . The category of affine algebraic regular monoids. AIMS Mathematics, 2022, 7(2): 2666-2679. doi: 10.3934/math.2022150
    [3] Teerapong Suksumran . Two theorems on direct products of gyrogroups. AIMS Mathematics, 2023, 8(3): 6278-6287. doi: 10.3934/math.2023317
    [4] Alessandro Linzi . Polygroup objects in regular categories. AIMS Mathematics, 2024, 9(5): 11247-11277. doi: 10.3934/math.2024552
    [5] Shoufeng Wang . Projection-primitive $ P $-Ehresmann semigroups. AIMS Mathematics, 2021, 6(7): 7044-7055. doi: 10.3934/math.2021413
    [6] Zaffar Iqbal, Xiujun Zhang, Mobeen Munir, Ghina Mubashar . Hilbert series of mixed braid monoid $ MB_{2, 2} $. AIMS Mathematics, 2022, 7(9): 17080-17090. doi: 10.3934/math.2022939
    [7] Awatif Al-Jedani, Rashad A. Abdel-Baky . One-parameter Lorentzian spatial kinematics and Disteli's formulae. AIMS Mathematics, 2023, 8(9): 20187-20200. doi: 10.3934/math.20231029
    [8] Bao-Hua Xing, Nurten Urlu Ozalan, Jia-Bao Liu . The degree sequence on tensor and cartesian products of graphs and their omega index. AIMS Mathematics, 2023, 8(7): 16618-16632. doi: 10.3934/math.2023850
    [9] Ahmet Sinan Cevik, Ismail Naci Cangul, Yilun Shang . Matching some graph dimensions with special generating functions. AIMS Mathematics, 2025, 10(4): 8446-8467. doi: 10.3934/math.2025389
    [10] Guangrong Ren . Vanishing viscosity limit to the planar rarefaction wave for the two-dimensional radiative hydrodynamics. AIMS Mathematics, 2025, 10(3): 4860-4898. doi: 10.3934/math.2025223
  • Normal cancellative monoids were introduced to explore the general structure of cancellative monoids, which are innovative and open up new possibilities. Specifically, we pointed out that the Green's relations in a cancellative monoid S are determined by its unitary subgroup U to a great extent. The specific composition of egg boxes in S, derived from the general semigroup theory, can be settled by the subgroups of U. We call a cancellative monoid normal when these subgroups are normal and characterize it as an NCM-system. This NCM-system was created in this article and can be obtained by combining a group and a condensed cancellative monoid. Furthermore, we introduced the concept of torsion extension and proved that a special kind of normal cancellative monoids can be constructed delicately by the outer automorphism groups of given groups and some simplified cancellative monoids.



    A monoid S is called cancellative when the cancellative law holds. Precisely, for all x,y,aS, ax=ay or xa=ya implies that x=y. The study of the structure of commutative cancellative monoids has a long and rich history, rising from the theory of integral domains and free abelian monoids. Specifically, factorization theory on the subject has become more and more popular in recent years (see [1,2,3,4,5]). On the other hand, the general theory of non-commutative cancellative monoids has received limited attention, except for the word problem, which is an old and celebrated problem in combinatorial algebra and can often be reduced to the cancellative cases [6]. Baeth and Smertnig extended the classical theory of non-unique factorization to a non-commutative setting [7]. Lawson proved that a class of left cancellative monoids called left Rees monoids can be constructed by the Zappa-Szép product (a generalization of the semidirect product) of a free monoid and a group using self-similar group actions (see [8]). Wazzan defined a new consequence of the generalized general product and investigated some known algebraic properties, including left cancellative [9]. Attention has also been focused on the flatness properties of S systems to study the structure of [left, right] cancellative monoids in the past (see [10,11,12,13]).

    The motivation of this paper is to make an effort in the study of general cancellative monoids, which we have seen to be rare in the existing literature. The relations and affiliations between different elements in cancellative monoids are not so clear as in groups. However, the Green's relations will reveal some for us. The structure of the paper is as follows. Section 2 provides alternative characterizations of the Green's relations in a cancellative monoid. We then investigate the nature of divisibility in a special class of cancellative monoids called normal cancellative monoids and present a novel construction method for generating such a cancellative monoid. This construction method utilizes a generalized product structure that combines a group and a condensed cancellative monoid, resulting in an NCM-system as described in Section 3. In Section 4, we introduce the concept of torsion extensions, and point out that a special kind of normal cancellative monoids can be constructed by the outer automorphism groups of given groups and some simplified cancellative monoids.

    The reader is referred to [14,15] for notations and terminology not given in this paper.

    Green's relations characterize the elements of a monoid S in terms of the principal ideals they generate. For elements a and b of S, Green's relations L, R, H and D are defined by

    aLb if, and only if, Sa=Sb, i.e., there exists x,yS such that a=xb and b=ya.

    aRb if, and only if, aS=bS, i.e., there exists x,yS such that a=bx and b=ay.

    aHb if, and only if, aLb and aRb.

    D is the smallest equivalence relation containing both L and R; that is, aDb if, and only if, there exists c in S such that aLc and cRb.

    These relations above are equivalences on S, so each of them yields a partition of S into equivalence classes. The L-class of a is denoted by La (and similarly for the other relations).

    Let S be a cancellative monoid with identity element 1. Denote by U(S), or just U, the set of all units in S; i.e., G={uS:(vS)uv=1}. Note that uv=1 implies vu=1 in a cancellative monoid. It is easy to verify that U is a subgroup of S, and we call it the unitarysubgroup of S.

    Proposition 2.1. The following statements are true for a cancellative monoid S:

    (1) aLb if, and only if, a=gb for some gU(S);

    (2) aRb if, and only if, a=bh for some hU(S);

    (3) aDb if, and only if, a=gbh for some g,hU(S).

    Proof. (1) If aLb, then there exists x,yS such that a=xb and b=ya. It follows that a=xb=xya, and so xy=1 since S satisfies the cancellative law. This shows that x,yU(S). Conversely, if a=gb for some gU(S), then b=g1a and, hence, aLb. This proves (1).

    (2) It is dual to (1).

    (3) If aDb, then there exists cS such that aLcRb. By (1) and (2), a=gc=gbh for some g,hU. Conversely, if a=gbh for some g,hU, then by (1) and (2), aLbhRb, i.e., aDb. This completes the proof.

    For aS, put

    Ga={gU:ga=ah(hU)},Na={hU:ga=ah(gU)}. (2.1)

    It is easy to check that these are subgroups of U. The following lemma lists some of their properties.

    Lemma 2.2. Let S be a cancellative monoid with a,bS, then

    (1) The map fa: GaNa; gh, where ga=ha (g,hG) is an isomorphism;

    (2) aLbNa=Nb;

    (3) aRbGa=Gb;

    (4) aHbabNaaGab;

    (5) Da=UaU;

    (6) Ha=aNa=Gaa;

    (7) La=Ua=UGaa;

    (8) Ra=aU=aNaU;

    (9) Nag=g1Nag for all gU;

    (10) Gga=gGag1 for all gU.

    Proof. (1) According to formula (2.1) and the cancellativity of S, the map fa is well defined and a bijection. Now, let g1,g2Ga, then there exists h1,h2Na such that gia=ahi with i=1,2. Hence, g1g2a=g1ah2=ah1h2, i.e., fa(g1g2)=fa(g1)fa(g2). Thus, fa is a homomorphism and an isomorphism.

    (2) If aLb, there exists gU such that a=gb by Proposition 2.1. For any hNa, ah=ga for some gU. Thus, ah=gbh=gabh=g1ga, which yields that hNb and NaNb. Similarly, we can prove NbNa and, thus, Na=Nb.

    (3) It can be proved in the some way.

    (4) aHba=gb=bh for some g,hU, where gGb=Ga and hNb=Na by (2), which is equivalent to abNa or aGab.

    (5–8) They can be proved by Proposition 2.1 directly.

    (9, 10) hNag if, and only if, agh=gag for some gU, which gives that aghg1=gaghg1Nahg1Nag. We can prove (10) dually.

    For rS, Dr=UrU and Hr=rNr=Grr, by noting that

    Hrg=rgNrg=rgg1Nrg=rNrg=Grrg

    for gU, we obtain that the H-classes of S containing in Rr are of the form rNrg (gU). Since S is a cancellative monoid, rNrg and rNrh are distinct if, and only if, Nrg and Nrh are distinct right cosets of Nr in U. This shows that the set of H-classes of S contained in Rr is in bijection with the set of right cosets of Nr in U. Similarly, the set of H-classes of S contained in Lr is in bijection with the set of left cosets of Gr in U. The above results provide the specific composition of egg boxes in general semigroup theory when S is cancellative. We use S0 to denote the set of the non-regular (i.e., not in U(S)) elements of S. As the application of Lemma 2.2, we have:

    Proposition 2.3. The following conditions hold for a cancellative monoid S:

    (1) If U is finite, |S/L|=|S/R|.

    (2) If S/D is finite and S0, U must be infinite.

    Proof. (1) We need only to prove that for all rS, the cardinal number of the set Xr of H-classes of S in Rr is equal to the cardinal number of the set Yr of H-classes of S in Lr. By Lemma 2.2, we have

    |Xr|=|U/Nr|and|Yr|=|U/Gr|.

    On the other hand, Gr is isomorphic to Nr, and |U/Gr|=|U/Nr|. Thus, |Xr|=|Yr|, as required.

    (2) Assume contrarily that U is finite.

    Dr={grh:g,hU}

    for all rS shows that |Dr|<+. Furthermore, by the hypothesis that |S/D|<+, S is a finite cancellative monoid. This implies that S is a group, and S0=. This is a contradiction, inferring that U is infinite.

    In this section, we consider a special class of cancellative monoids.

    Definition 3.1. Let S be a cancellative monoid and rS. Gr is called a characteristic subgroup of S in Dr if Hr=rGr=Grr and Gr is a normal subgroup of U. In this case, Dr is called a normal D-class of S and Gr is the characteristic subgroup of Dr.

    Note that the characteristic subgroup of D-class Dr is independent of the representative of the D-class by Lemma 2.2.

    Proposition 3.2. If S is a cancellative monoid and rS, then Dr is a normal D-class of S if, and only if, Gr=Nr and Nr is a normal subgroup of U.

    Proof. We need only to prove the necessity part. Now, let Dr be normal. Hr=rGr=rNr implies that for all gGr, there exists hNr such that rg=rh. However, S is cancellative and g=h. Hence, GrNr. Similarly, we can prove NrGr. Thus, Gr=Nr which completes the proof.

    Definition 3.3. A cancellative monoid S is called a normal cancellative monoid with characteristic subgroup G if all non-regular D-classes of S are all normal and have the same characteristic subgroup G.

    Note that the identity of S is the only idempotent so that U=D1 is the only regular D-class, and S0=SU is the set of non-regular elements in S. Clearly, groups and commutative cancellative monoids are all normal cancellative monoids. The following example gives another kind of normal cancellative monoid.

    Example 3.4. Let G be a group and M be a cancellative semigroup without an identity element. Let M1 be a monoid with an identity adjoined and S=G×M1 be the direct product of G and M1. U(S)=(G,1) is the unitary subgroup. It is easy to check that the H-, L-, R-, D-classes of S are {(G,m):mM1}. Hence, S is a normal cancellative monoid with characteristic subgroup U(S).

    There are also cancellative monoids that cannot be normal.

    Example 3.5. Let

    S={MR2×2|M=(xz0y),xZ+,yZ+,zZ}.

    S forms a monoid under the matrix multiplication. For any MS, the determinant |M|>0, M is invertible, which keeps the law of cancellation in S. In fact, S can be embedded into the general linear group GL(2,R). A routine calculation following Proposition 2.1 and Lemma 2.2 can check these facts below:

    U={M|M=(1z01),zZ} is the unitary subgroup of S which is commutative;

    (x1z10y1)L(x2z20y2) if, and only if, x1=x2,y1=y2 and z1z2mody1;

    (x1z10y1)R(x2z20y2) if, and only if, x1=x2,y1=y2 and z1z2modx1;

    For any M=(xz0y)S,

    GM={GR2×2|G=(1klcm(x,y)/y01), kZ},
    NM={HR2×2|H=(1klcm(x,y)/x01), kZ},

    where lcm(x,y) means the least common multiple of x and y. DM is normal if, and only if, x=y, and in this case, the characteristic subgroup of DM is U.

    Definition 3.6. Let S be a cancellative monoid, then S is called fundamental if H(S0×S0)=ιS0 (the identity relation on S0).

    Proposition 3.7. Any fundamental cancellative monoid is normal and the characteristic subgroup is {1}.

    Proof. Let S be a fundamental cancellative monoid and rS0, then

    Grr=rNr=Hr={r}

    by Lemma 2.2(6), and

    Gr={1}=Nr

    since S is cancellative. Thus, S is a normal cancellative monoid with characteristic subgroup {1}.

    Proposition 3.8. If S is a normal cancellative monoid with characteristic subgroup G, then the relation

    aρba=gb=bh

    for some g,hG is a congruence on S, such that S/ρ is a fundamental cancellative monoid with unitary subgroup U/G and characteristic subgroup {1ρ}.

    Proof. We first show that ρ is a congruence. Let xi,yiS with i=1,2 such that x1ρy1 and x2ρy2. We have

    x1=g1y1=y1h1

    and

    x2=g2y2=y2h2

    for some gi,hiG. Thus,

    x1x2=g1y1g2y2=g1uy1y2(for some uG)=y1h1y2h2=y1y2vh2(for some vG)

    and, hence, x1x2ρy1y2. This proves that ρ is a congruence on S.

    Furthermore, if aρbρ=aρcρ, then ab=acg for some gG. Hence, b=cg and bρ=cρ. This shows that S/ρ satisfies the left cancellative law. Dually, S/ρ satisfies the right cancellative law. Thus, S/ρ is a cancellative monoid. We can also check the fact that

    U(S/ρ)=U/G.

    Finally, let a,bS0 such that aρHbρ, then by Proposition 2.1 there exists g,hU such that aρ=bρgρ=hρbρ. This means that a=bgp and a=qhb for some p,qG. Hence, aHb. On the other hand, since Hb=Gb=Ha, we have mG such that a=mb. Thus, mb=a=qhb and m=qh since S is cancellative. Hence, h=q1mG and, similarly, gG. Clearly, qhG and aρ=bρ. We have now proved that

    H((S/ρ)0×(S/ρ)0=ι(S/ρ)0.

    Thus, S/ρ is fundamental.

    It is easy to see that aρbaHb when a,bS0, by Lemma 2.2. In the remainder of this section, we shall establish the construction theorem of normal cancellative monoids.

    Consider

    G: a group with identity e.

    M: a fundamental cancellative monoid with identity 1.

    Aut(G): the group of automorphisms of G.

    φ: a mapping of M into Aut(G) defined by: mφm.

    P=(pij): a M×M-matrix with entries in G.

    The above quadruple (G,M;φ,P) is called an NCM-system if the following conditions hold:

    (NCM1) φ1 is the identical mapping on G.

    (NCM2) for all iM, p1i=pi1=e.

    (NCM3) for all i,j,kM and gG, pi,jk(gφjk)pjk=pij,k(pijφk)(gφjφk).

    Given an NCM-system (G,M;φ,P), form the set

    NCM=NCM(G,M;φ,P)=M×G

    and define a multiplication by

    (x,g)(y,h)=(xy,pxy(gφy)h).

    Clearly, is well defined.

    Lemma 3.9. (NCM,) is a normal cancellative monoid.

    Proof. Let (x,g),(y,h),(z,m)NCM, then by (NCM3),

    ((x,g)(y,h))(z,m)=(xy,pxy(gφy)h)(z,m)=(xyz,pxy,z(pxy((gφy)h)φz)m)=(xyz,pxy,z(pxyφz)(gφyφz)(hφz)m)=(xyz,px,yz(gφyz)pyz(hφz)m)=(x,g)(yz,pyz(hφz)m)=(x,g)((y,h)(z,m)),

    and satisfies the associative law. Hence, (S,) is a semigroup. By (NCM1) and (NCM2), a routine calculation can show that (1,e) is the identity of NCM. Thus, (NCM,) is a monoid.

    Next, we prove that NCM satisfies the cancellative law. For this, let

    (x,g),(y,h),(z,m)NCM.

    ● If

    (x,g)(y,h)=(x,g)(z,m),

    then xy=xz and

    pxy(gφy)h=pxz(gφz)m.

    The prior formula implies that y=z since M is a cancellative monoid. From this and the latter formula, we have h=m since G is a group.

    ● If

    (x,g)(y,h)=(z,m)(y,h),

    then xy=zy and

    pxy(gφy)h=pzy(mφy)h.

    By the prior formula, we have x=z. Moreover, by the latter formula, we have gφy=mφy, and so g=m since φy is an isomorphism.

    This shows that NCM satisfies the cancellative law. Therefore, NCM is a cancellative monoid with

    U(NCM)=U(M)×G,

    since for all

    (x,g),(y,h)NCM,  (x,g)(y,h)=(xy,pxy(gφy)h)=(1,e),

    if, and only if, y=x1 and

    h=(gφx)1p1xy.

    It remains to verify that {1}×G is the characteristic subgroup of Dr for all rNCM. Now, let (x,g)NCM, where x is not a unit. Since M is a fundamental cancellative monoid, by the proof of Proposition 3.7, we have Nx=Gx={1} in M. For any

    (m,h),(m,h)U(NCM),

    if

    (m,h)(x,g)=(x,g)(m,h),  (mx,pmx(hφx)g)=(xm,pxm(gφm)h)

    gives that mx=xm, which means

    m=m=1,  pmx=pxm=e,  gφm=g

    and

    G(x,g){1}×G

    in NCM. We can also take

    h=g1(hφx)g

    or

    h=(ghg1)ϕ1x

    for any h,hG to keep the product equality; thus,

    G(x,g)=N(x,g)={1}×G.

    On the other hand, it is easy to see that {1}×G is a normal subgroup of U(NCM). We have now proved that NCM is a normal cancellative monoid.

    We now arrive at the main result of this section.

    Theorem 3.10. If (G,M;φ,P) is an NCM-system, then NCM(G,M;φ,P) is a normal cancellative monoid with the characteristic subgroup isomorphic to G. Conversely, any normal cancellative monoid can be constructed in this way.

    Proof. We need only to verify the second part. Let S be a normal cancellative monoid with identity 1 and the characteristic subgroup G. By Proposition 3.8, S/ρ is a fundamental cancellative monoid. Denote by rx a fixed representative of the ρ-class of S containing x. Put

    N={rx:xS}

    with r1=1. Define a multiplication on N by

    rxry=rxy.

    It is easy to see that (N,) is a semigroup isomorphic to S/ρ.

    For all rx,ryN, we have a unique gG such that rxry=rxyg. Now, we define qrx,ry=g and form a N×N-matrix Q=(qrx,ry) with entries qrx,ryG.

    By the definition of characteristic subgroup, for all gG, there exists a unique hrxG such that grx=rxhrx. Now, define

    ψrx:GG;ghrx.

    By Lemma 2.2(1), ψrx is an isomorphism of G onto itself. Define a mapping

    ψ:NAut(G);rxψrx.

    Now, we can form the quadruple (N,G;ψ,Q). In fact, (N,G;ψ,Q) is an NCM-system. Clearly, ψr1 is the identical mapping; that is, condition (NCM1) holds. Since rx=r1rx=rxqr1,rx, cancellativity implies qr1,rx=1, the identity element of G. It's the same way to show that qrx,r1=1. Accordingly, condition (NCM2) holds. Now, let rx,ry,rzN and gG, then

    [(rxry)rz]q(rxry),rz(qrx,ryψrz)(gψryψrz)=(rxry)rz[(qrx,ry(gψry))ψrz]=(rxry)qrx,ry(gψry)rz=rxry(gψry)rz=rxgryrz=rxg(ryrz)qry,rz=rx(ryrz)(gψ(ryrz))qry,rz=[rx(ryrz)]qrx,(ryrz)(gψ(ryrz))qry,rz

    and, thus,

    q(rxry),rz(qrx,ryψrz)(gψryψrz)=qrx,(ryrz)(gψ(ryrz))qry,rz.

    This means that condition (NCM3) is satisfied and (N,G;ψ,Q) in fact is an NCM-system.

    It remains to verify that the mapping

    θ:SNCM(N,G;ψ,Q),s(rs,hs),

    where s=rshs for hsG, is a semigroup isomorphism. Undoubtedly, θ is well defined and injective. For all (x,h)N×G, by the definition of θ, we have rxh=x and, hence, hxh=h since S is a cancellative monoid. This means that (xh)θ=(x,h). Thus, θ is surjective. Now, let s,tS, then

    (sθ)(tθ)=(rs,hs)(rt,ht)=(rst,qrs,rt(hsψrt)ht)=(rstqrs,rt(hsψrt)ht)θ=(rsrt(hsψrt)ht)θ=(rshsrtht)θ=(st)θ

    and θ is a homomorphism. We have now proved that θ is a semigroup isomorphism, as required.

    Example 3.11. Let

    S={MR2×2|M=(xz0x),xZ+,zZ}.

    It has been pointed out in Example 3.5 that S forms a commutative cancellative monoid under the matrix multiplication.

    G={M|M=(1z01),zZ}

    is the unitary subgroup. S is a normal cancellative monoid and the characteristic subgroup is G. In fact, (x1z10x1)H(x2z20x2) if, and only if, x1=x2 and z1z2modx1. We can construct an NCM-system following the proof of Theorem 3.10. For any

    M=(xa0x)S,

    select

    rM=(xmod(a,x)0x)

    as the fixed representative of the ρ-class of S containing M. In the semigroup (N,),

    N={MR2×2|M=(xz0x),xZ+,0z<x,zZ}

    and for any T=(yb0y)S,

    rMrT=(xymod(ay+bx,xy)0xy).

    Moreover, ψrM is always the identical mapping on G since S is commutative. The entries qrM,rT of N×N-matrix Q=(qrM,rT) satisfy

    rMrT=(rMrT)qrM,rT.

    Conditions (NCM1)–(NCM3) for the NCM-system (N,G;ψ,Q) have also been checked in the proof of Theorem 3.10. For the isomorphism θ, (M)θ=(rM,g), where we can find gG such that M=rMg because mod(a,x)amodx.

    The previous section shows that the structure of a cancellative monoid S is largely determined by its subgroup consisting of all the units, which is called the unitary subgroup of S. Two kinds of isomorphic subgroups of the unitary subgroup are introduced to investigate the structure of the D-classes of S. It is a difficult problem for us to make it clear how these subgroups affect the overall structural properties of the cancellative monoid unless there are additional special conditions in place. Specifically, when all these subgroups are completely consistent with a normal subgroup of the unitary subgroup, we call S a normal cancellative monoid. We can already construct a normal cancellative monoid by combining a fundamental cancellative monoid with a group using an NCM-system and vice versa. However, NCM-systems are complex and not intuitive enough to some extent. A new and more simple way to characterize a normal cancellative monoid S directly is introduced in this section, when the characteristic subgroup of S has a trivial center.

    Suppose that G is a group. For each element gG, the mapping φg defined by xg1xg from G onto G is an inner automorphism of G. For any g,hG, φg=φh if, and only if, g=h when the center of G is trivial. All the inner automorphisms consist of a normal subgroup of the automorphism group Aut(G). We denote by Inn(G) the group of inner automorphisms of G. The quotient group Aut(G)/Inn(G) is called the outer automorphism group of G. We can recall from the last section the map fa: GaNa; gh, where ga=ah (g,hG) is an isomorphism.

    Lemma 4.1. Let a,bS and aHb. If a,b are in a normal D-class of S with characteristic subgroup G, then

    fa=fbφh=φgfb,

    where a=gb=bh,g,hG.

    Proof. It follows from Lemma 2.2 that there exists g,hG such that a=gb=bh. For any xG, we have

    a(xfa)=xa=xbh=b(xfb)h=bhh1(xfb)h=a(x(fbφh)).

    Consequently, fa=fbφh. Similarly, fa=φgfb.

    Proposition 4.2. Let S be a normal cancellative monoid with characteristic subgroup G0, then the mapping Ψ from S1=S/ρ into Aut(G0)/Inn(G0) defined by

    Ψ:S1Aut(G0)/Inn(G0);aρfaInn(G0)

    is a homomorphism. Moreover, if aG0, in this case fa=φa.

    Proof. By Lemma 4.1, it is easy to see that Ψ is well defined. Now, let a,bS, then for all gG0,

    ab(gfab)=gab=a(gfa)b=ab(g(fafb));

    that is,

    fab=fafb. (4.1)

    Consequently,

    ((aρ)(bρ))Ψ=fabInn(G0)=faInn(G0)fbInn(G0)=(aρ)Ψ(bρ)Ψ.

    The rest of the proof is trivial.

    Next, we introduce the concept of torsion extensions. Let T be a fundamental cancellative monoid with unitary subgroup G1. Let G0 be a group with trivial center. Denote by {fλInn(G0):λΛ} the outer automorphism group Aut(G0)/Inn(G0), where fλ are fixed elements in Aut(G0) and the cosets of Inn(G0) in Aut(G0) is indexed by Λ. We assume that the representative of the coset Inn(G0) itself is idG0, the identity automorphism of G0. Let Fd: TAut(G0)/Inn(G0) be a homomorphism. For tT write λt for the element of Λ such that tF=fλtInn(G0).

    Additionally, we know that the identity element of Aut(G0)/Inn(G0) is Inn(G0). Put

    TE=TE(T,G0;F)=T×G0

    and define a multiplication on TE by

    (t,g)(s,h)=(ts,n),

    where n is contained in G0 such that

    fλtφgfλsφhfλtfλsInn(G0)=fλtsInn(G0)

    and

    fλtφgfλsφh=fλtsφn.

    Proposition 4.3. S=(TE,) is a normal cancellative monoid with unitary subgroup (G1×G0,) and characteristic subgroup (1×G0,).

    Proof. First, we show that (S,) is a cancellative monoid. Now, we need to verify that is associative. Let (t,g),(s,h),(x,n)S. Suppose that

    ((t,g)(s,h))(x,n)=(ts,u)(x,n)=(tsx,v) (4.2)

    with u,vG0 and that

    (t,g)((s,h)(x,n))=(t,g)(sx,k)=(tsx,l) (4.3)

    with k,lG0. It is sufficient for us to show that v=l. By Eq (4.2),

    fλtφgfλsφh=fλtsφu (4.4)

    and

    fλtsφufλxφn=fλtsxφv. (4.5)

    Composing Eqs (4.4) and (4.5), we get

    fλtφgfλsφhfλxφn=fλtsxφv. (4.6)

    On the other hand, Eq (4.3) implies that

    fλsφhfλxφn=fλsxφk

    and

    fλtφgfλsxφk=fλtsxφl.

    Hence, we have

    fλtφgfλsφhfλxφn=fλtsxφl. (4.7)

    Compare Eqs (4.6) and (4.7), and we have

    fλtsxφv=fλtsxφl

    and φv=φl; thus v=l, as required.

    Now, we show that S is cancellative. If

    (t,g)(s,h)=(x,n)(s,h),

    then ts=xs; hence, t=x and

    fλtφgfλsφh=fλxφnfλsφh.

    Thus, φg=φn and g=n, so that (t,g)=(x,n). This means that S is right cancellative. Dually, we can show that (S,) is also left cancellative.

    We show next that (1,e) is the identity element of S, where e is the identity element of G0 and 1F=Inn(G0). Suppose that

    (t,g)(1,e)=(t,u)

    for some uG0, then

    fλtφgfλ1φe=fλtφu.

    Hence, u=g and

    (t,g)(1,e)=(t,g).

    In other words, (1,e) is a left identity of S. Dually, we can prove that (1,e) is a right identity of S. Thus, we have proved that (S,) is a cancellative monoid with identity (1,e).

    If

    (t,g)(s,h)=(1,e),

    then ts=1 and t,sG1. Conversely, for all (u,g)G1×G0, we have

    (u,g)(u1,h1v1)=(1,e),

    where h,vG0 such that

    φgfλu1=fλu1φh

    and

    fλufλu1=φvInn(G0).

    Hence, G1×G0 is the unitary subgroup of S.

    It remains to show that 1×G0 is the characteristic subgroup of S. For all

    (s,g)S0=S(G1×G0),

    if (u,h)N(s,g), then uNs={1}, showing that N(s,g)1×G0. Similarly, we can obtain G(s,g)1×G0. Conversely, for all (1,u)1×G0, it is easy to check that there exists (1,v)1×G0 such that

    (1,u)(s,g)=(s,g)(1,v),

    where v=g1t and

    φufλs=fλsφt.

    That is, 1×G0G(s,g). There also exists (1,h)1×G0 such that

    (s,g)(1,u)=(1,h)(s,g),

    where

    φhfλs=fλsφgug1.

    That is, 1×G0N(s,g). Consequently, 1×G0 is the characteristic subgroup of S.

    Definition 4.4. We shall call the above semigroup (TE,) the torsion extension of the fundamental cancellative monoid T by the group G0.

    We conclude this section by proving that any normal cancellative monoid whose characteristic subgroup has a trivial center can be constructed as the torsion extension of a fundamental cancellative monoid by a group. In the remainder of this section, we always assume that S is a normal cancellative monoid with unitary subgroup U and characteristic subgroup G having a trivial center. Let ρ be the same as in Proposition 3.8, in which it was shown that S/ρ is a fundamental cancellative monoid with unitary subgroup U/G.

    Recall the semigroup (N,) in the proof of Theorem 3.10, where rx is a fixed representative of the ρ-class of S containing x, N={rx:xS} with r1=1, rxry=rxy and (N,) is isomorphic to S/ρ. It follows from Proposition 4.2 that there exists a homomorphism Ψ from N into the outer automorphism group Aut(G)/Inn(G) such that rxfrxInn(G). We can form the the torsion extension TE(N,G;Ψ) of N by G.

    Define

    Φ:TES;(rx,g)rxg.

    It is routine to check that Φ is a bijection by Lemma 2.2. If

    (rx,g)(ry,h)=(rz,u),

    we claim that rz=rxryv with some vG. Otherwise, by the definition of , we have

    frxφgfryφh=frzφu.

    Furthermore, for all kG,

    krxgryh=rxgryh(k(frxφgfryφh))=krxryvv1(gfry)h=krxryvp,(here p=v1(gfry)h)=rxryvp(k(frxfryφvφp))=rxgryh(k(frzφp)=rxgryh(k(frzφu).

    Hence,

    frzφp=frzφuandu=v1(gfry)h.

    It follows that

    rzu=((rx,g)(ry,h))Φ=rzv1(gfry)h=rxry(gfry)h=rxgryh=(rx,g)Φ(ry,h)Φ.

    Thus, Φ is actually an isomorphism. Indeed, we have proved the following theorem.

    Theorem 4.5. Let T be a fundamental cancellative monoid and G a group with a trivial center. If F is a homomorphism of T into the outer automorphism group Aut(G)/Inn(G), the torsion extension (TE(T,G;F),) of T by the group G is a normal cancellative monoid. Conversely, any normal cancellative monoid whose characteristic subgroup has a trivial center is isomorphic to the torsion extension (TE,) of a fundamental cancellative monoid and a group.

    Example 4.6. The symmetric group S4 is the group of permutations of {1,2,3,4}. The alternating group A4 is the subgroup of Sn consisting of even permutations. Any 4×4 permutation matrix Eσ can be obtained from identity matrix E=(e1,,e4) by Eσ=(eσ(1),,eσ(4)) for some σS4, where {e1,,e4} are the columns of E. Eσ is called even (odd) when σ is even (odd). Let

    G={Eτ|τA4}andT={aEσ|a>1,aZ,σS4}.

    It is easy to verify that S=GT forms a cancellative monoid under the matrix multiplication and the unitary subgroup U(S)=G having a trivial center. For any

    A=aEσT,  EτG,  EτA=AE1σEτEσ=AEτ,

    where E1σEτEσ is even and coincides with Eτ for some τA4. This shows that S is normal and the characteristic subgroup is G. We can choose a fixed representative of the ρ-class of S containing A as rA=aEσA, where σA=(1) if Eσ is even and σA=(12) if Eσ is odd. S/ρ is isomorphic to the semigroup of {1,±2,±3,} under integer multiplication. For any

    rB=bEσB(N,),  rArB=rAB=rabEσAσB,

    the isomorphism frAAut(G) can be written as

    (Eτ)frA=E1σAEτEσA.

    Let Ψ be the homomorphism from N into the outer automorphism group Aut(G)/Inn(G) derived from Proposition 4.2, then

    Ψ(rA)={Inn(G),ifEσAiseven,f(12)Inn(G),ifEσAisodd,

    where

    (Eτ)f(12)=E1(12)EτE(12).

    The original semigroup S can be rebuilt by the torsion extension (TE(N,G;Ψ),) following Theorem 4.5.

    We have made some new progress in the study of the structure of a cancellative monoid S. For any aS, H-class of a can be obtained by multiplying a on the left or right side of certain subgroups of U(S), which is the unitary subgroup of S. When these subgroups are all the same normal subgroup of U(S), we can construct S under a uniform mode and we call S a normal cancellative monoid. Furthermore, if the normal subgroup has a trivial center, S can be characterized in a natural and intuitive way. It is worth paying attention to further related research on the use of these methods to characterize other types of monoids. How to find the correlation between characteristic subgroups of distinct normal D-classes when S is not normal remains an open question.

    The author declares he has not used Artificial Intelligence (AI) tools in the creation of this article.

    We would like to express our gratitude to the anonymous referees for their valuable comments and suggestions, which have inspired us to improve this paper. The author was supported by the Education Major Teaching Guiding Committee Fund of China (Grant No: JYJZWGGK-2023A-21), the University Humanities and Social Sciences Research Fund of Anhui (Grant No: SR2020A0828) and the Education Quality Projects Fund of Anhui (Grant No: 2020kfkc204).

    The author declares that he has no conflict of interest.



    [1] A. Geroldinger, F. Halter-Koch, Non-unique factorizations: algebraic, combinatorial and analytic theory, 1 Ed., Chapman and Hall/CRC, 2006. http://doi.org/10.1201/9781420003208
    [2] A. Geroldinger, Q. Zhong, Factorization theory in commutative monoids, Semigroup Forum, 100 (2020), 22–51. http://doi.org/10.1007/s00233-019-10079-0 doi: 10.1007/s00233-019-10079-0
    [3] P. Jȩdrzejewicz, M. Marciniak, Ł. Matysiak, J. Zieliński, On properties of square-free elements in commutative cancellative monoids, Semigroup Forum, 100 (2020), 850–870. http://doi.org/10.1007/s00233-019-10022-3 doi: 10.1007/s00233-019-10022-3
    [4] J. Gubeladze, Unimodular rows over monoid rings, Adv. Math., 337 (2018), 193–215. http://doi.org/10.1016/j.aim.2018.08.011 doi: 10.1016/j.aim.2018.08.011
    [5] B. Olberding, A. Reinhart, Radical factorization in commutative rings, monoids and multiplicative lattices, Algebra Univers., 80 (2019), 24. http://doi.org/10.1007/s00012-019-0597-1 doi: 10.1007/s00012-019-0597-1
    [6] C. F. Nyberg-Brodda, The word problem for one-relation monoids: a survey, Semigroup Forum, 103 (2021), 297–355. http://doi.org/10.1007/s00233-021-10216-8 doi: 10.1007/s00233-021-10216-8
    [7] N. R. Baeth, D. Smertnig, Factorization theory: from commutative to noncommutative settings, J. Algebra, 441 (2015), 475–551. http://doi.org/10.1016/j.jalgebra.2015.06.007 doi: 10.1016/j.jalgebra.2015.06.007
    [8] M. V. Lawson, A correspondence between a class of monoids and self-similar group actions Ⅰ, Semigroup Forum, 76 (2008), 489–517. http://doi.org/10.1007/s00233-008-9052-x doi: 10.1007/s00233-008-9052-x
    [9] S. A. Wazzan, Some algebraic properties over the generalized general product obtained by monoids and groups, J. Pure Appl. Math., 1 (2019), 96–106.
    [10] S. Bulman-Fleming, K. McDowell, A characterization of left cancellative monoids by flatness properties, Semigroup Forum, 40 (1990), 109–112. http://doi.org/10.1007/BF02573256 doi: 10.1007/BF02573256
    [11] S. Bulman-Fleming, Flat and strongly flat s-systems, Commun. Algebra, 20 (1992), 2553–2567. http://doi.org/10.1080/00927879208824478 doi: 10.1080/00927879208824478
    [12] U. Knauer, M. Petrich, Characterization of monoids by torsion-free, flat, projective, and free acts, Arch. Math., 36 (1981), 289–294. http://doi.org/10.1007/BF01223703 doi: 10.1007/BF01223703
    [13] H. S. Qiao, Some new characterizations of right cancellative monoids by condition (PWP), Semigroup Forum, 71 (2005), 134–139. http://doi.org/10.1007/s00233-005-0513-1 doi: 10.1007/s00233-005-0513-1
    [14] P. M. Higgins, Techniques of semigroup theory, Oxford University Press, 1992. http://doi.org/10.1093/oso/9780198535775.001.0001
    [15] J. M. Howie, An introduction to semigroup theory, Academic Press, 1976.
  • Reader Comments
  • © 2024 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(1584) PDF downloads(113) Cited by(0)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog