On inverse ordered semigroups
A. Jamadar and K. Hansda
Department of Mathematics, Visva-Bharati, University
Santiniketan, Bolpur-731235, West Bengal, India
[email protected], [email protected]
Abstract
The purpose of this paper is to study the generalization of
inverse semigroups (without order). An ordered semigroup S is
called an inverse ordered semigroup if for every a∈S, any two
inverses of a are H-related. We prove that an ordered
semigroup is complete semilattice of t-simple ordered semigroups
if and only if it is completely regular and inverse. Furthermore
characterizations of inverse ordered semigroups have been
characterized by their ordered idempotents.
Key Words and phrases: ordered regular, ordered inverse
element, ordered idempotent, completely regular, inverse.
2000 Mathematics subject Classification: 16Y60;20M10.
1 Introduction
An ordered semigroup is a partiality ordered set
(S,≤), and at the same time a semigroup (S,⋅) such that
for all a,b,x∈S,a≤b implies
xa≤xbandax≤bx.
It is denoted by (S,⋅,≤). For every subset H of S,
the downword closure subset of H is denoted by (H] and defined
by (H]={t∈S:t≤h,for someh∈H}.
Throughout this paper unless otherwise stated S stands for an
ordered semigroup. T. Saito [8] studied inverse
semigroups by introducing partial order in it. There was much
interest in the past decade in studying the inverses of an element
in an ordered semigroup. Bhuniya and Hansda [2] prove that
for every a in a regular ordered semigroup S and for two
inverses x,y of a, xHy if and only if for all e,f∈E≤(S), ef∈(fSe]. Thus it is interesting to further
study ordered semigroup in which any two inverses of an element
are H-related. Class of these ordered semigroups are natural
generalization of class of inverse semigroups (without order). We
call these ordered semigroups as inverse ordered semigroups. This
paper is inspired by Clifford and Preston [1].
2 Preliminaries
An equivalence relation ρ is called left (right) congruence
if for a,b,c∈Saρb impliescaρcb(acρbc). By a congruence we mean both left and right
congruence. A congruence ρ is called semilattice congruence
on S if for all a,b∈S,aρa2andabρba. By a complete semilattice congruence on S we
mean a semilattice congruence σ on S such that for a,b∈S,a≤b implies that aσab. An ordered
semigroup S is called complete semilattice of subsemigroups of
type τ if there exists a complete semilattice congruence
ρ such that (x)ρ is a type τ subsemigroup of
S. Let I be a nonempty subset of S. Then I is called a
left(right) ideal of S, if SI⊆I(IS⊆I) and
(I]⊆I. An ideal I is both a left and a right ideal
of S. We call S a (left, right) simple ordered semigroup if it
does not contain any proper (left, right) ideal. Following
Kehayopulu [5] principal left ideal of S generated by
a is defined by the set L(a)={xa:x∈S1}, and principal
ideal generated by a is defined by the set I(a)={xay:x,y∈S1}.
S is said to be regular (resp. Completely regular, right
regular) ordered semigroup if for every a∈S,a∈(aSa](a∈(a2Sa2],a∈(a2S]). Due to Kehayopulu
[5] Green’s relations on a regular ordered semigroup
given as follows:
aLbifL(a)=L(b), aRbifR(a)=R(b), aJbifI(a)=I(b), H=L∩R.
This four relation L,R,J,andH are
equivalence relation.
A regular ordered semigroup S is said to be group-like (resp.
left group-like) [2] ordered semigroup if for every a,b∈S,a∈(Sb]andb∈(aS](resp.a∈(Sb]). Right group-like ordered semigroup can be defined dually.
An element b∈S is said to be an inverse of a∈S if a≤aba and b≤bab. The set of all inverses of an element a is
denoted by V≤(a). By an ordered idempotent of S, we mean
an element e∈S such that e≤e2. The set of all ordered
idempotents of S are denoted by E≤(S). Any two elements
a,b∈S are said to be H-commutative if ab≤bxa for
some x∈S.
For the sake of convenience of general reader we state some
results of [2].
Lemma 2.1**.**
[2]**
Let S be a completely regular ordered semigroup. Then following
statements hold in S:
-
For every a there is x∈S such that
a≤axa2 and a≤a2xa.
2. 2.
J* is the
least complete semilattice congruence on S.*
3. 3.
S* is a complete semilattice of completely simple ordered
semigroups.*
3 Inverse ordered semigroup
Let S be an ordered semigroup and ρ be an equivalence
relation on S. We call an ideal I of S is generated by an
ρ-unique element b∈S if for any generator of x∈I,
bρx.
Definition 3.1**.**
A regular ordered semigroup S is called inverse if for every
a∈S, any two inverses of a are H-related.
Example 3.2**.**
The ordered semigroup S={a,e,f} defined by multiplication
and order below is an inverse ordered semigroup.
[TABLE]
[TABLE]
We present a role of ordered idempotents in an inverse ordered
semigroup in the next theorem.
Theorem 3.3**.**
An ordered semigroup S is
inverse if and only if every principal left ideal and every
principal right ideal of S are generated by an H-unique
ordered idempotent.
Proof.
Suppose that S is inverse. Let I be a principal left ideal of
S. Then there exists e∈E≤(S) such that I=(Se]. If
possible let I=(Sf] for some f∈E≤(S). Then eLf
and thus e≤xf and f≤ye for some x,y∈S. Now
e≤ee≤eee≤exfe. Therefore exf≤exfexf so that
exf∈E≤(S). Also exf≤exfexf≤exf(fe)exf and
fe≤feee≤fexfe≤fe(exf)fe. Therefore fe∈V≤(exf). Also exf∈V≤(exf). Since S is inverse, we have
feHexf. Then e≤ee≤exf.fe≤fezexf for some z∈S, and so e≤fz1, where z1=ezexf. Similarly f≤ez2 for some z2∈S. So eRf. Hence eHf. Likewise every principal right ideal of S
generated by H-unique ordered idempotent.
Conversely assume that given conditions hold in S. Let a∈S
and a′,a′′∈V≤(a). Clearly (Sa]=(Sa′a]=(Sa′′a].
Since a′a,a′′a∈E≤(S) we have that a′aHa′′a, by
given condition. Then there are s,t∈S such that a′≤a′′asa′ and a′′≤a′ata′′. Thus a′Ra′′. Likewise a′La′′, that is a′Ha′′. Hence S is an inverse ordered
semigroup.
∎
In the following we show that an ordered semigroup S is inverse
if and only if any two ordered idempotents of S are
H-commutative.
Theorem 3.4**.**
The following conditions are equivalent on an ordered semigroup
S.
-
S* is an inverse semigroup;*
2. 2.
S* is regular and its idempotents are
H-commutative;*
3. 3.
For every e,f∈E≤(S), eLf(eRf) implies eHf.
Proof.
(1)⇒(2): Obviously S is regular. Let us assume that
a∈S and a′,a′′∈V≤(a). Consider e,f∈E≤(S).
Since S is regular, so there is x∈S such that x∈V≤(ef). Now x≤xefx implies that fxe≤fxe(ef)fxe
and ef≤efxef implies ef≤ef(fxe)ef. Thus ef∈V≤(fxe). Also fxe≤fxefxe that is fxe∈E≤(S).
So fxe∈V≤(fxe). Since S is inverse, so fxeHef.
Then there are s1,s2∈S such that ef≤fxes1 and
ef≤s2fxe. Now ef≤efxef implies that ef≤f(xes1xs2fx)e. Therefore ef≤fye, where y=xes1xs2fx.
Similarly there is z∈S such that fe≤ezf. Hence any two
idempotents are H-commutative.
(2)⇒(3): Let e,f∈E≤(S) be such that eLf. Then e≤xf and f≤ye for some x,y∈S. Now e≤xf implies e≤exf, and so e≤ee≤exfe which implies
that exf≤exfexf. So exf∈E≤(S). Similarly fye∈E≤(S). Now e≤exf≤exff≤exffye. Since exf,fye∈E≤(S), by condition (2) we have exffye≤(fye)z(exf) for some z∈S . Hence e≤ft, where
t=yezexf. Similarly f≤ew for some w∈S, so that eRf. Hence eHf. If eRf then eHf can be done dually.
(3)⇒(1): Let a∈S and a′,a′′∈V≤(a).
Now aa′≤aa′′aa′ and aa′′≤aa′aa′′. So aa′Raa′′
which implies that aa′Haa′′, by the condition (3). Also
a′aHa′′a. Then a′≤a′aa′ gives that a′≤a′′axa for
some x∈S. Therefore a′≤a′′t where t=axa. In similar
way it is possible to obtained u,v,w∈S such that a′≤ua′′, a′′≤a′v and a′′≤wa′. So a′Ha′′. Hence S
is an inverse ordered semigroup.
∎
Lemma 3.5**.**
Let S be an inverse ordered semigroup. Then following statements
hold in S.
-
aLb* if and only if a′aHb′b for
some a,b∈S and a′∈V≤(a) b′∈V≤(b);*
2. 2.
aRb* if and only if aa′Hbb′ for some a,b∈S and a′∈V≤(a) b′∈V≤(b);*
3. 3.
for any a∈S and e∈E≤(S) there are x,y∈S such that aexa′,a′eya∈E≤(S); where a′∈V≤(a).
4. 4.
for any a,b∈S there are x,y∈S
such that ab≤abb′xa′ab and b′a′≤b′a′aybb′a′, where
a′∈V≤(a) and b′∈V≤(b).
Proof.
(1): Let a,b∈S be such that aLb. Let a′∈V≤(a), b′∈V≤(b). Since a≤aa′a and a′a≤a′aa′a, we have aLa′a which implies that bLa′a. Also
bLb′b. Hence a′aLb′b. Since a′a,b′b∈E≤(S)
and S is inverse we have a′aHb′b, by Theorem 3.4(3).
Conversely suppose that given condition holds in S. Let a,b∈S with a′∈V≤(a) and b′∈V≤(b). Then by
given condition aa′Hbb′. Also we have aLa′a and bLb′b so that aLb.
(2): This is similar to (1).
(3): Let a∈S and e∈E≤(S). Also a′a∈E≤(S). Since S is an inverse, there is an x∈S such
that a′ae≤exa′a by Theorem 3.4(2). Now aexa′≤aa′aeexa′≤aexa′aexa′. So aexa′∈E≤(S). Likewise
a′eya∈E≤(S); for some y∈S.
(4): Let a,b∈S with a′∈V≤(a), b′∈V≤(b). So a′a,b′b∈E≤(S). Now ab≤aa′abb′b≤ and a′abb′≤b′bxa′a, by Theorem 3.4(2).
Thus ab≤abb′xa′ab. Likewise b′a′≤b′a′aybb′a′; for some
y∈S.
∎
In the following theorem an inverse ordered semigroup has been
characterized by the inverse of an element of the set (eSf].
Theorem 3.6**.**
Let S be an ordered semigroup and e,f∈E≤(S). Then
S is inverse if and only if for every x∈(eSf] implies
x′∈(fSe], where x′∈V≤(x).
Proof.
First suppose that S is an inverse ordered semigroup and x∈(eSf]. Then x≤es1f for some s1∈S. Let x′∈V≤(x). Now x′≤x′xx′≤x′es1fx′, and so es1fx′≤es1fx′es1fx′. Hence es1fx′∈E≤(S). Similarly
x′es1f∈E≤(S). Now there is s2∈S such that
x′es1fx′≤x′es1ffx′≤fs2x′es1fx′, by Theorem
3.4(2) . Also fs2x′es1fx′≤fs2x′ees1fx′≤fs2x′es1fx′s3e, for some s3∈S. Then x′≤x′xx′
implies that x′≤fs2x′es1fx′≤fs2x′es1fx′s3e. Hence
x′∈(fSe].
Conversely assume that the given conditions hold in S. First
consider a left ideal L of S such that L=(Se]=(Sf] for e,f∈E≤(S). Then eLf, so that e≤ee≤ezf for
some z∈S. Therefore e∈(eSf]. Since e∈V≤(e) we
have e∈(fSe], by given condition. Likewise f∈(eSf]. This
implies that eRf and so eHf. Similarly it can be shown
that every principal right ideal of S generated by H-unique
ordered idempotent. Thus by Theorem 3.3, S is an inverse
ordered semigroup.
∎
Corollary 3.7**.**
The following conditions are equivalent on a regular ordered
semigroup S.
-
S* is an inverse ordered semigroup;*
2. 2.
for any a∈S and for any a′∈V≤(a), aa′,a′a are
H-commutative;
3. 3.
for any e∈E≤(S), any two inverses of e are
H-related;
4. 4.
for any e∈E≤(S) and all its inverses are
H-commutative;
5. 5.
for any e∈E≤(S) and e′∈V≤(e), ee′ and e′e
are H-commutative.
Proof.
(1)⇒(2), (2)⇒(3), (3)⇒(4),
and (4)⇒(5): These are obvious.
(5)⇒(1): Let e,f∈E≤(S) and x∈V≤(ef). So ef≤efxef≤effxeef and x≤xefx implies that
fxe≤fxeeffxe. So ef∈V≤(fxe). Also fxe∈E≤(S). Now ef≤efxef≤effxeef≤effxefxeef≤fxez1efz2fxe,
for some z1,z2∈S, by the given condition. So ef≤fz3e where
z3=xemefnfx. Similarly fe≤ez4f, for some
z4∈S. So e,f are H-commutative. Hence by Theorem 3.4 S is inverse
ordered semigroup.
∎
We study inverse ordered semigroup together with complete
regularity in the following theorem.
Theorem 3.8**.**
The following conditions are equivalent on a regular ordered
semigroup S.
-
S* is inverse and completely regular;*
2. 2.
S* is a complete semilattice of group like
ordered semigroups;*
3. 3.
abHba* whenever ab,ba∈E≤(S);*
4. 4.
any ordered idempotent of S is
H-commutative to any element of S;
5. 5.
for any e,f∈E≤(S) eJf implies eHf;
6. 6.
H=L=R=J.
Proof.
(1)⇒(2): Let S be a completely regular and inverse
ordered semigroup. Then by Theorem 2.1, J is the
complete semilattice congruence on S and every H-class is a
group-like ordered semigroup. We now prove H=J. Let a,b∈S be such that aJb. So there are x,y,u,v∈S such
that a≤xby and b≤uav. Since S is completely regular,
so there are h,g,f∈S such that x≤x2hx, b≤b2gb, b≤bgb2, y≤yfy2. Now a≤x2hxb2gbyfy2≤x2hxb2gbgb2yfy2. Let p∈V≤(x2hxb2g). So
x2hxb2g≤x2hxb2gpx2hxb2g≤x2hxb2g(b2gpx2h)x2hxb2g and b2gpx2h≤b2gpx2hxb2gpx2h≤b2gpx2h(x2hxb2g)b2gpx2h. This shows
that b2gpx2h∈V≤(x2hxb2g). Also x2hxb2g≤x2hxb2gpx2hxb2g≤x2hxb2g(x2hxb2gp2)x2hxb2g and
x2hxb2gp2≤x2hxb2gpx2hxb2gp2≤x2hxb2gp2(x2hxb2g)x2hxb2gp2, which implies that
x2hxb2gp2∈V≤(x2hxb2g). Similarly p2x2hxb2g∈V≤(x2hxb2g). Since b2gpx2h,x2hxb2gp2∈V≤(x2hxb2g) and S is inverse, so there is t∈S such that
x2hxb2gp2≤b2gpx2ht. Thus x2hxb2g≤x2hxb2gpx2hxb2g≤x2hxb2gp2(x2hxb2g)2 implies that
x2hxb2g≤b2gpx2hxt(x2hxb2g)2=bs where s=bgpx2ht(x2hxb2g)2. Similarly there is s1∈S such that
b2gyfy2∈s1b. Hence a≤x2hxb2gbyfy2≤bsbyfy2=bs2, where s2=sbyfy2. Similarly a≤s3b for some
s3∈S. Likewise b≤s4a and b≤as5, for some
s4,s5∈S. So aHb. Thus J⊆H. Also
H⊆J, and Hence J=H. Therefore S is
complete semilattice of group-like ordered semigroups.
(2)⇒(3): Suppose that S
is a complete semilattice Y of group like ordered semigroups {Sα}α∈Y. Let a,b∈S such that ab,ba∈E≤(S). Let ρ be the corresponding semilattice
congruence on S. Then there is α∈Y such that ab,ba∈Sα . Since Sα is
group like ordered semigroups so abHba.
(3)⇒(4): Let a∈S and e∈E≤(S). Since
S is regular there is an x∈S such that a≤axa. Clearly
ax,xa∈E≤(S). Thus by condition (3) axHxa. So
xa≤axu and ax≤vxa, for some u,v∈S. Then
we have a≤axa≤axaxa≤axaxaxa≤aaxuxvxaa=a2ta2, where
t=xuxvx. Now a≤a2ta2≤a(a2ta2ta2ta2)a≤a2(a2ta2ta2ta2ta2)a, that is a≤a2ya, where y=a2ta2ta2ta2ta2. Similarly a≤aya2. Clearly a2y,ya2∈E≤(S).
Let e,f∈E≤(S) and x∈V≤(ef). Then we have
x≤xefx. So fxe≤fxefxe≤fxeeffxe and ef≤efxef≤effxeef. So ef∈V≤(fxe). Also ef≤effxeef implies that effxe≤effxeeffxe, and fxeef≤fxeeffxeef. So effxe,fxeef∈E≤(S) and thus effxeHfxeef, by the condition(3). Then there are u,v∈S such that
effxe≤fxeefu and fxeef≤veffxe. Now ef≤effxefxeef≤fxeefuveffxe=fce; where c=xe2fuvef2x.
Likewise fe≤edf, for some d∈S.
Now ae≤a2yae. Let z∈V≤(a2yae). So a2yae≤a2yaeza2yae≤a2yae(eza2y)a2yae. Clearly a2yaeeza2y,eza2ya2yae∈E≤(S) and thus a2yaeeza2yHeza2ya2yae, by condition (3). Now ae≤a2yae≤a2yaeeza2ya2yae≤eza2ys1a2yaea2yae, for some s1∈S. So ae≤es2ae, where s2=za2ys1a2yaea2y. Again
ae≤es2aya2e≤es2aes3ya2, for some s3∈S,
since ya2,e∈E≤(S). That is ae≤es4a, for some
s4∈S. Similarly ea≤as5e, for some s5∈S. So a,e are H-commutative.
(4)⇒(5): Let e,f∈E≤(S) such that eJf.
Then there are x,y,z,u∈S such that e≤xfy and f≤zeu. Now e≤xfy implies that e≤fhxy and e≤xykf
by the given condition for some h,k∈S. Similarly f≤zeu
gives f≤es1zu and f≤zus2e for some s1,s2∈S.
Hence eHf.
(5)⇒(6): Let a,b∈S such that aJb. Then
there are s,t,u,v∈S such that a≤sbt and b≤uav.
Since S is regular so a≤axa and b≤byb for some x,y∈S so that ax≤axax and by≤byby. Now axax≤axsbtx≤axsbybtx that is ax≤axsbybtx. Likewise by≤byuaxavy. Thus axJby, so from given condition axHby.
Similarly xaHyb. So there is c∈S such that ax≤byc, that is a≤byca=bd, for some d=yca∈S. Likewise
a≤pb, b≤qa for some p,q∈S. Thus aHb. So
H=J. Now J=H=L∩R gives J⊆L and
J⊆R. Therefore L=J=R.
(6)⇒(1): Let a∈S Since S is regular so there
exists a′∈V≤(a). Clearly aLa′a and aRaa′. So
by the given condition aRa′a and aLaa′. Now a≤aa′a≤aa′aa′a≤aa′aa′aa′a≤aas1a′s2aa for some s1,s2∈S. So a≤a2pa2 where p=s1a′s2. So S is
completely regular.
Also let a′,a′′∈V≤(a). Now aLa′aLa′′a implies
that aRa′aRa′′a. Also by the given condition we can show
that aLaa′La′′a. So it is to check that a′Ra′′ and
a′La′′. So a′Ha′′. Hence S is inverse ordered
semigroup.
∎