International Journal of Algebra, Vol. 2, 2008, no.

4, 187 - 195

On Green’s Relations for Γ-semigroups

and Reductive Γ-semigroups1
R. Chinram and P. Siammai

Prince of Songkla University, Department of Mathematics,

Faculty of Science, Hat Yai, Songklha 90112, Thailand
ronnason.c@psu.ac.th
Abstract
The notion of a Γ-semigroup has been introduced by M. K. Sen in the
year 1981. In this paper, we consider Green’s relations for Γ-semigroups
and reductive Γ-semigroups.

Mathematics Subject Classification: 20M10, 20M17

Keywords: Green’s relations, Γ-semigroups, regular Γ-semigroups, con-

gruences, reductive congruences, reductive Γ-semigroups, regular reductive Γ-
semigroups

1 Introduction
The notion of a Γ-semigroup has been introduced by M. K. Sen in [6]
the year 1981. Many classical notions of semigroup have been extended to Γ-
semigroup (see [6], [7], [1], [2]). Green’s relations for semigroups, first studied
by J. A. Green [4], have played a fundamental role in the development to
semigroup theory (see [5]). In [8], G. Thierrin has introduced a reductive
semigroup. A. Fattahi and H. R. E. Vishki have given a characterization
for regular reductive semigroups in [3]. In this paper, we consider Green’s
relations for Γ-semigroups and reductive Γ-semigroups. Moreover, we give a
characterization for regular reductive Γ-semigroups.

2 Preliminaries
Let S and Γ be nonempty sets. If there exists a mapping S × Γ × S → S,
written (a, γ, b) by aγb, S is called a Γ-semigroup if S satisfies the identities
1
This research was supported by the Commission on Higher Education and a grant of
Thailand Research Fund (TRF).
188 R. Chinram and P. Siammai

(aγb)μc = aγ(bμc) for all a, b, c ∈ S and γ, μ ∈ Γ.

Let S be an arbitrary semigroup and Γ be any nonempty set. Define a
mapping S × Γ × S → S by aγb = ab for all a, b ∈ S and γ ∈ Γ. It is easy
to see that S is a Γ-semigroup. Thus a semigroup can be considered to be a
Γ-semigroup.
Let S be a Γ-semigroup and α be a fixed element in Γ. We define a·b = aαb
for all a, b ∈ S. We can show that (S, ·) is a semigroup and we denote this
semigroup by Sα .
An element a of a Γ-semigroup S is said to be regular if there exist x ∈ S
and α, β ∈ Γ such that a = aαxβa. A regular Γ-semigroup is a Γ-semigroup
each element of which is regular. Let a be an element of a Γ-semigroup S and
α, β ∈ Γ. An element b of S is called an (α, β)-inverse of a if a = aαbβa and
b = bβaαb.
Let S be a Γ-semigroup and γ ∈ Γ. An element e in S is said to be a
γ-idempotent
 if eγe = e. The set of all γ-idempotents is denoted by Eγ . We
denote Eγ by E(S). The elements of E(S) are called idempotent elements
γ∈Γ
of S. A Γ-semigroup S is called an idempotent Γ-semigroup if S = E(S).

3 Main results
The Green’s equivalence relations L, R, H and D on a Γ-semigroup S are
defined by the following rules :
(i) aLb if and only if S 1 Γa = S 1 Γb where S 1 Γa = SΓa ∪ {a}.
(ii) aRb if and only if aΓS 1 = bΓS 1 where aΓS 1 = aΓS ∪ {a}.
(iii) H = L ∩ R.
(iv) D = L ◦ R.

Remark We have
(i) aLb if and only if a = b or there exist x, y ∈ S and α, β ∈ Γ such that
a = xαb and b = yβa.
(ii) aRb if and only if if a = b or there exist x, y ∈ S and α, β ∈ Γ such
that a = bαx and b = aβy.
(iii) aHb if and only if aLb and aRb.
(iv) aDb if and only if there exists c ∈ S such that aLc and cRb.

Theorem 3.1 L ◦ R = R ◦ L.

Proof. Let (a, b) ∈ L ◦ R. Then there exists c ∈ S such that aLc and cRb.
Case 1: a = c. Then aRb. Since aLa and aRb, (a, b) ∈ L ◦ R.
Case 2: b = c. Then aLb. Since aLb and bRb, (a, b) ∈ L ◦ R.
On Green’s relations for Γ-semigroups and reductive Γ-semigroups 189

Case 3: a = c and b = c. Since aLc and cRb, there exist x, y, u, v ∈ S and

γ, μ, η, θ ∈ Γ such that

xγa = c, yμc = a, cηu = b, bθv = c.

Let d = yμcηu. Then

aηu = yμcηu = d

and

dθv = yμcηuθv = yμbθv = yμc = a

from which it follows aRd. Also,

yμb = yμcηu = d

and

xγd = xγyμcηu = xγaηu = cηu = b,

so dLb. We deduce that (a, b) ∈ R ◦ L. Therefore L ◦ R ⊆ R ◦ L.

Similarly, we can prove that R ◦ L ⊆ L ◦ R. 

The L-class (resp. R-class, H-class, D-class) containing the element a will
be written La (resp. Ra , Ha , Da ).

Theorem 3.2 Let S be a Γ-semigroup, α ∈ Γ and e be an α-idempotent.

Then
(i) aαe = a for all a ∈ Le .
(ii) eαa = a for all a ∈ Re .
(iii) aαe = a = eαa for all a ∈ He .
(iv) For all a ∈ S, |Ha ∩ Eα | ≤ 1.

Proof. (i) Let a ∈ Le . Then aLe. It follows that S 1 Γa = S 1 Γe. Then

a = e or there exist x ∈ S and γ ∈ Γ such that a = xγe. If a = e, then
aαe = eαe = e = a. If a = xγe, then aαe = (xγe)αe = xγ(eαe) = xγe = a.
(ii) It is similar to (i).
(iii) It follows from (i) and (ii).
(iv) Let e, f ∈ Ha ∩ Eα . Then eHf . So eLf and eRf . Then f ∈ Le
and e ∈ Rf . By (i) and (ii), respectively , we have f αe = f and f αe = e.
Therefore e = f . It follows that |Ha ∩ Eα | ≤ 1. 

Theorem 3.3 If a is a regular element of a Γ-semigroup S, then every

element of Da is regular.
190 R. Chinram and P. Siammai

Proof. Since a is regular, there exist x ∈ S and α, β ∈ Γ such that a = aαxβa.

Let b ∈ Da . So aDb. Then aLc and cRb for some c ∈ S. Since aLc, a = c or
there exist u, v ∈ S and γ, μ ∈ Γ such that

uγa = c and vμc = a

Since cRb, b = c or there exist z, t ∈ S and η, θ ∈ Γ such that

cηz = b and bθt = c.

Case 1: a = c and c = b. Then a = b, so b is regular.

Case 2: a = c and cηz = b and bθt = c.Then

bθ(tαx)βb = cαxβcηz = aαxβaηz = aηz = cηz = b

Case 3: uγa = c and vμc = a, and b = c.Then

bα(xβv)μb = cαxβvμb = uγaαxβa = uγa = c = b

Case 4: uγa = c and vμc = a, and cηz = b and bθt = c.Then

bθ(tαxβv)μb = cαxβvμcηz = uγaαxβaηz = uγaηz = cηz = b.

Therefore b is a regular element. 

Let D is a D-class. Then either every element of D is regular or no element

of D is regular. We call the D-class regular if all its elements are regular.

Theorem 3.4 In a regular D-class, each L-class and each R-class contains
at least one idempotent.

Proof. Let a be an element of a regular D-class D in a Γ-semigroup S.

Then there exist x ∈ S and α, β ∈ Γ such that a = aαxβa. Then xβa =
xβ(aαxβa) = (xβa)α(xβa). Thus xβa is an α-idempotent. Since a = aα(xβa),
aLxβa. Similarly, aαx is a β-idempotent and aRaαx. 

Theorem 3.5 Let a be an element of a regular D-class D in a Γ-semigroup

S. Then
(i) If a is an (α, β)-inverse of a, then a ∈ D and the two H-classes
Ra ∩ La and La ∩ Ra , contain a β-idempotent aαa and an α-idempotent a βa,
respectively.
(ii) If b ∈ D is such that Ra ∩ Lb and La ∩ Rb contain a β-idempotent e
and an α-idempotent f , respectively, then Hb contains an (α, β)-inverse a∗ of
a such that aαa∗ = e and a∗ βa = f .
(iii) No H-class contains more than one (α, β)-inverse of a for all ordered
pair (α, β) ∈ Γ × Γ.
On Green’s relations for Γ-semigroups and reductive Γ-semigroups 191

Proof. (i) Let a be an (α, β)-inverse of a. Then a = aαa βa and a = a βaαa .

Thus

a L a βa, aαa R a, a L aαa , a βa R a .

Thus a Da, aαa ∈ Ra ∩ La and a βa ∈ La ∩ Ra . Therefore a ∈ D. Since

a = aαa βa, a βa = a βaαa βa and aαa = aαa βaαa . Therefore a βa is an
α-idempotent and aαa is a β-idempotent.
(ii) Since aRe, by Theorem 3.2(ii), eβa = a. Similarly, from aLf we deduce
that aαf = a by Theorem 3.2(i). Again from aRe it follows that a = e or
there exist x ∈ S and γ ∈ Γ such that aγx = e.
Case 1 : a = e. Let a∗ = f βe. Then

aαa∗ βa = aα(f βe)βa = (aαf )β(eβa) = aβa = eβa = a

and

a∗ βaαa∗ = (f βe)βaα(f βe) = f β(eβa)αf βe = f β(aαf )βe = f β(aβe) = f βe = a∗ .

Then a∗ is an (α, β)-inverse of a. Moreover

aαa∗ = aαf βe = aβe = eβe = e.

Further, since aLf , a = f or f = yθa for some y ∈ S and θ ∈ Γ. If a = f ,

then a∗ βa = f βeβa = eβeβe = e = f . If f = yθa, then a∗ βa = f βeβa =
yθaβeβe = yθa = f . It now follows easily that a∗ ∈ Le ∩ Rf = Lb ∩ Rb = Hb .
Case 2 : aγx = e. Let a∗ = f γxβe. Then

aαa∗ βa = aα(f γxβe)βa = (aαf )γxβ(eβa) = aγxβa = eβa = a

and
a∗ βaαa∗ = (f γxβe)βaα(f γxβe) = f γxβ(eβa)αf γxβe = f γxβ(aαf )γxβe =
f γxβ(aγx)βe = f γxβeβe = f γxβe = a∗ .
Then a∗ is an (α, β)-inverse of a. Moreover

aαa∗ = aαf γxβe = aγxβe = eβe = e.

Since aLf , a = f or there exist y ∈ S and θ ∈ Γ such that f = yθa . If a = f ,

then a∗ βa = f γxβeβa = aγxβeβa = eβeβa = eβa = a = f . If f = yθa, then
a∗ βa = f γxβeβa = yθ(aγx)βeβa = yθ(eβe)βa = yθ(eβa) = yθa = f . It now
follows easily that a∗ ∈ Le ∩ Rf = Lb ∩ Rb = Hb .
(iii) Suppose that a and a∗ are both (α, β)-inverses of a inside the single
H-class Hb . Since aαa and aαa∗ are β-idempotents in the H-class Ra ∩ Lb ,
aαa = aαa∗ by Theorem 3.2(iv). Similarly, a βa = a∗ βa because both are
α-idempotents in the H-class La ∩ Rb . Then a = a βaαa = a∗ βaαa∗ = a∗ 
192 R. Chinram and P. Siammai

Let S be a Γ-semigroup. An equivalence relation ρ on S is called a right

[resp. left] congruence on S if for each a, b ∈ S, (a, b) ∈ ρ implies (aγt, bγt) ∈ ρ
[resp. (tγa, tγb) ∈ ρ] for all t ∈ S and γ ∈ Γ. An equivalence relation ρ on
S is called a congruence if ρ is both a right and left congruence. It is easy to
prove that L is a right congruence on S and R is a left congruence on S.
Let S be a Γ-semigroup and ρ be a congruence on S. For aρ, bρ ∈ S/ρ and
γ ∈ Γ, let (aρ)γ(bρ) = (aγb)ρ. This is well-defined, since for all a, a , b, b ∈ S
and γ ∈ Γ,

aρ = a ρ and bρ = b ρ ⇒ (a, a ), (b, b ) ∈ ρ

⇒ (aγb, a γb), (a γb, a γb ) ∈ ρ
⇒ (aγb, a γb ) ∈ ρ
⇒ (aγb)ρ = (a γb )ρ.

Let a, b, c ∈ S and γ, μ ∈ Γ. We have

(aργbρ)μcρ = ((aγb)ρ)μcρ = ((aγb)μc)ρ = (aγ(bμc))ρ = aργ(bμc)ρ = aργ(bρμcρ).

Then the quotient set S/ρ is a Γ-semigroup.

Theorem 3.6 Let S be a Γ-semigroup and ρ be a congruence on S. Then

(i) If ρ ⊆ L then for all a, b ∈ S, aLb if and only if aρ L bρ in S/ρ.
(ii) If ρ ⊆ R then for all a, b ∈ S, aRb if and only if aρ R bρ in S/ρ.
(iii) If ρ ⊆ H then for all a, b ∈ S, aHb if and only if aρ H bρ in S/ρ.

Proof. (i) Let a, b ∈ S such that aLb. Then a = b or there exist x, y ∈ S and
α, β ∈ Γ such that a = xαb and b = yβa.
Case 1 : a = b. Then aρ = bρ.
Case 2 : a = xαb and b = yβa. Then aρ = (xαb)ρ = (xρ)α(bρ) and
bρ = (yβa)ρ = (yρ)β(aρ). Therefore aρLbρ.
Conversely, let a, b ∈ S. Assume aρLbρ. Then aρ = bρ or there exist
x, y ∈ S and α, β ∈ Γ such that aρ = (xρ)α(bρ) and bρ = (yρ)β(aρ).
Case 1 : aρ = bρ. Then (a, b) ∈ ρ. Since ρ ⊆ L, (a, b) ∈ L. So aLb.
Case 2 : aρ = (xρ)α(bρ) and bρ = (yρ)β(aρ). Then aρ = (xαb)ρ and
bρ = (yβa)ρ. Then (a, xαb) ∈ ρ and (b, yβa) ∈ ρ. Since ρ ⊆ L, (a, xαb) ∈ L
and (b, yβa) ∈ L. Then a ∈ S 1 Γ(xαb) and b ∈ S 1 Γ(yβa). Thus S 1 Γa = S 1 Γb.
Hence aLb.
(ii) It is similar to (i).
(iii) It follows from (i) and (ii). 

A congruence ρ on S is called right [resp. left] reductive if for each a, b ∈ S,

(aγt, bγt) ∈ ρ [resp. (tγa, tγb) ∈ ρ] for all t ∈ S and γ ∈ Γ implies (a, b) ∈ ρ.
A Γ-semigroup S is called right [resp. left] reductive if equality on S is a right
On Green’s relations for Γ-semigroups and reductive Γ-semigroups 193

[resp. left] reductive congruence. In other words, S is called right [resp. left]
reductive if for each a, b ∈ S, aγt = bγt [resp. tγa = tγb] for all t ∈ S and
γ ∈ Γ implies a = b. A Γ-semigroup is called reductive if it is both right and
left reductive.

Theorem 3.7 Let S be a Γ-semigroup and ρ be a congruence on S. The

following statements are true.
(i) ρ is a right reductive congruence if and only if S/ρ is a right reductive
Γ-semigroup.
(ii) ρ is a left reductive congruence if and only if S/ρ is a left reductive
Γ-semigroup.
(iii) ρ is a reductive congruence if and only if S/ρ is a reductive Γ-semigroup.

Proof. (i) Let ρ be a right reductive congruence. Let aρ, bρ ∈ S/ρ such that
(aρ)γ(tρ) = (bρ)γ(tρ) for all t ∈ S and γ ∈ Γ. Then (aγt, bγt) ∈ ρ for all t ∈ S
and γ ∈ Γ. Since ρ is right reductive, (a, b) ∈ ρ. Hence aρ = bρ.
Conversely, suppose S/ρ is a right reductive Γ-semigroup. Let a, b ∈ S
such that (aγt, bγt) ∈ ρ for all t ∈ S and γ ∈ Γ. Then (aγt)ρ = (bγt)ρ for all
t ∈ S and γ ∈ Γ. Thus (aρ)γ(tρ) = (bρ)γ(tρ) for all t ∈ S and γ ∈ Γ. Since
S/ρ is a right reductive Γ-semigroup, aρ = bρ. Therefore (a, b) ∈ ρ.
(ii) It is similar to (i).
(iii) It follows by (i) and (ii). 

Define two congruence ρr and ρl on a Γ-semigroup S as follows:

ρr = {(a, b) ∈ S × S | aγt = bγt for all t ∈ S and for all γ ∈ Γ}

ρl = {(a, b) ∈ S × S | tγa = tγb for all t ∈ S and for all γ ∈ Γ}.

The three following theorems hold.

Theorem 3.8 Let S be a Γ-semigroup. Then

(i) S is a right reductive Γ-semigroup if and only if ρr = 1S .
(ii) S is a left reductive Γ-semigroup if and only if ρl = 1S .

Proof. (i) Assume S is a right reductive Γ-semigroup. Let a, b ∈ S such that

aρr b. Then aγt = bγt for all t ∈ S and γ ∈ Γ. Since S is right reductive, a = b.
Conversely, suppose ρr = 1S . Let a, b ∈ S such that aγt = bγt for all t ∈ S
and γ ∈ Γ. Then (a, b) ∈ ρr . Since ρr = 1S , a = b. Hence S is a right reductive
Γ-semigroup.
(ii) It is similar to (i). 

Theorem 3.9 Let S be a regular Γ-semigroup. Then

(i) ρr ⊆ R.
(ii) ρl ⊆ L.
194 R. Chinram and P. Siammai

Proof. (i) Let (a, b) ∈ ρr . Then aγt = bγt for all t ∈ S and for all γ ∈ Γ. So
aΓS = bΓS. Since a ∈ aΓS and b ∈ bΓS because S is regular, aΓS 1 = bΓS 1 .
Therefore (a, b) ∈ R. Thus ρr ⊆ R.
(ii) It is similar to (i). 

Theorem 3.10 Let S be a regular Γ-semigroup. Then

(i) ρr is the minimum right reductive congruence on S.
(ii) ρl is the minimum left reductive congruence on S.

Proof. (i) Let a, b ∈ S. Assume that (aγt, bγt) ∈ ρr for all t ∈ S and γ ∈ Γ.
Then aγtβt = bγtβt for all t, t ∈ S and γ, β ∈ Γ. Thus aαt = bαt for all
t ∈ S and α ∈ Γ because S is regular. So (a, b) ∈ ρr . Therefore ρr is a right
reductive congruence on S.
Next, let ρ be any right reductive congruence on S. Let (a, b) ∈ ρr . Then
aγt = bγt for all t ∈ S and γ ∈ Γ. Since ρ is reflexive, (aγt, bγt) ∈ ρ. Therefore
(a, b) ∈ ρ because ρ is right reductive.
(ii) It is similar to (i). 

ACKNOWLEDGEMENTS. The authors are grateful to the Commis-

sion on Higher Education and the Thailand Research Fund (TRF) for grant
support.

References
[1] S. Chattopadhyay, Right inverse Γ-semigroup, Bull. Cal. Math. Soc.
93(2001), 435-442.

[2] S. Chattopadhyay, Right orthodox Γ-semigroup, SEA Bull. Math.

29(2005), 23-30.

[3] A. Fattahi and H.R.E. Vishki, A note on reductive semigroups, SEA Bull.
Math. 28(2004), 261-264.

[4] J. A. Green, On the structure of semigroups, Ann. of Math. 54(1951),

163-172.

[5] J. M. Howie, An introduction to semigroup theory, Academic Press, 1976.

[6] M. K. Sen, On Γ-semigroups, Proceeding of International Conference on

Algebra and it’s Applications, Decker Publication, New York, (1981), 301.

[7] M. K. Sen and N. K. Saha, On Γ-semigroup I, Bull. Cal. Math. Soc.

78(1986), 181-186.
On Green’s relations for Γ-semigroups and reductive Γ-semigroups 195

[8] G. Thierrin, Contribution a la theorie des equivalences dans les demi-

group, Bull. Soc. Math. France 83(1955), 103-159.

Received: November 1, 2007