In previous papers, it has been recently defined a new class of semigroups based on both Rees matrix and completely 0-simple semigroups. For this new structure, it has been introduced with certain basic properties and finiteness conditions. The main goal of the paper is to prove Green’s Theorem for by indicating the existence of Green’s lemma. We also study generalized Green’s relation over and present some new findings. In particular, we classify our semigroup associated with generalized Green’s relation by constructing good homomorphism.

1. Introduction and Preliminaries

It is good to keep in mind the definition of the semigroup given in [1], in order to grasp the importance of this paper. Since this paper is continuation of our work in [1], let us recall the basic facts regarding the semigroup .

The notation represents the Rees matrix semigroup and the notation represents completely 0-simple semigroup .

Let us consider the mapping for the elements and . By the operation given in (14), the set defines a semigroup . We denote this new semigroup shortly by . The details of the element of are as follows.

Indeed, every is an element of and is an element of . Moreover, the semigroup is composed of the semigroup and the group . Furthermore, we can see the diagram in Figure 1 for .

Then, we obtained which satisfies important homological properties and proved that the spined product of the (C)-inversive semigroup and the idempotent semigroup of is isomorphic to the strictly inverse semigroup in [1]. Furthermore, we gave some consequences of the results to make a detailed classification over in the same reference. Despite the progress, several important issues remain to be addressed, which will be focused on them.

We now discuss a very helpful tool for the study of monoids/semigroups called Green’s relations. Fundamental equivalence relations, -relations, were first introduced and studied by Green in 1951. Then, using these equivalences, Green’s lemma and theorem were proved. These relations have played a main role in the development of the semigroup theory. Green’s relation is a subject in its own right, with a substantial body of literature, see for instance [2]. Especially, Green’s relations may be used to depict the structure of regular semigroups (for example, see Theorem 2.1 in [3]). On the other hand, in [4, 5], the authors studied some Green’s relations for semigroup and monoid structures. The Green’s lemma and Green’s theorem are the natural next steps in these relations. In [6], the author studied an application for -semigroups techniques via the Green’s theorem. In the present paper, our aim is to prove Green’s lemma and Green’s theorem for .

On the other hand, in [7], the authors introduced generalized Green’s relation over a semigroup, namely, the generalized Green’s relation. Because of this reason, replacing Green’s relations upon a given semigroup is the most efficient method to study the generalized regular semigroups.

Generalized Green’s relation, which is another equivalence class, is crucial for the classification of the semigroup class such as the abundant and adequate semigroup. One can regard the abundant semigroup as another kind of generalized regular semigroups. Obviously, an abundant semigroup is not necessarily a regular semigroup. In abundant semigroups, a homomorphic image of an abundant semigroup must not be abundant, and the notions of good homomorphism for abundant semigroups are introduced in [8, 9]. Another of our aim is to focus on the generalizations of Green’s relations on a semigroup and think of their applications such as classification of semigroups and good homomorphism in this paper.

The paper is structured as follows. We reveal important results related to Green’s relations which are Green’s lemma and Green’s theorem for (Proposition 1 and Theorem 1) in Section 2. In Section 3, by considering generalizations of Green’s relations on a semigroup as mentioned by Green’s ∗relations (Lemma 5 and Theorem 2). Furthermore, we make new classifications for associated with the abundant semigroup (Corollaries 1 and 2). Finally, we present other results which build a structure of abundant and adequate semigroups in terms of good homomorphism (Corollary 3) in the same section.

2. Green’s Lemma and Green’s Theorem for

A natural question in the theory of semigroups can be stated as follows: what kind of new material can be obtained for a semigroup by considering the results on Green’s relation of the same semigroup ? It is well known that certain equivalence relations and for an arbitrary semigroup were first introduced by Green [10], in which those are defined in a very influential method to make a classification for a new semigroup. As a result of this fact, in [1], we studied and -Green’s relations for . On the other hand, we will prove Green’s lemma and Green’s theorem by developing the results which are obtained in [1].

Some basic facts about the behavior of these relations are summarized in the following lemma.

Lemma 1 (see [1]). For (i) and .(ii) and .

For , we denote by and the -classes of containing the elements and , respectively. Furthermore, for , let us assume that and .

Lemma 2. Let . Then, and .

Proof. Let us choose an element such that . This clearly implies that .
Nevertheless, we can present this short proof in the following alternative way:
For , we have and by Lemma 1 via by the definition of Green’s relation [2], and we certainly have and such that . Thus,Since and , we finally have .

Similarly as in Lemma 2, by choosing an element such that , we also obtain the following preresult.

Lemma 3. Let . Then, and .

Proposition 1. (Green lemma for ) Let and be -equivalent elements of the semigroup , and let such that . Then, the mappings and are mutually inverse and one-to-one mappings of upon and upon , respectively.

Proof. By Lemmas 2 and 3, since ve , one can obtain the following well-defined mappings:Now, let us show these two mappings are mutually inverse. To do that let us take the elements and . In fact implies or there exists such that , and similarly, implies or there exists such that . By considering the compositionsof mappings and ,(i)for the case , we have , and(ii)for the other case, we obtain .Therefore is the identity mapping on . In fact, a quite similar process can be applied on to get the identity mapping. Hence, and are mutually inverse mappings (in other words, -class preserving). Hence, is one-to-one mapping of onto and is mapping of onto .

Theorem 1. (Green theorem for ) Let and be equivalent elements of a semigroup . Then, there exists such that and , and hence, , , , for some . The mappingsare mutually inverse, one-to-one mappings of and upon each other.

Proof. For an element , clearly, we have and . Therefore,After that we can indicate the element assuch thatSince and in elements , it is satisfied that and , and we have , so .
We can also indicate the element assuch thatSince and in elements , it is satisfied that and , and we have , so . Hence, we obtain , and the whole process mentioned above implies that the mapping is well defined.
By considering an arbitrary element and applying a similar approach as above, one can also obtain the mapping which is well defined.
Now, suppose that is an element of which gives and .Then, we haveWith a similar approach as above, one can further get by considering an element .
The mapping is one-to-one mapping of onto and the mapping is a one-to-one mapping of onto so and are mutually inverse.
The proof is now complete.

3. Generalized Green’s Relation for

Let us consider the semigroup . is the set of all idempotents. The element is called a regular element if there exists an element such that and . is said to be the regular semigroup if each element of is regular. Green’s relation may be used to describe the structure of regular semigroups [3]. In fact, the result related to regularity over is given in [1]. However, in here, we will focus on the generalizations of Green’s relations on a semigroup and study their applications such as adequate and abundant semigroups. Obviously, these types of semigroups are natural generalizations of regular semigroups, and so, it would be appropriate to study being abundant and adequate semigroups. We note that the index sets (used to expose the semigroup ) are composed of one element in this section.

In [11, 12], Fountain observed that Green’s relation (i.e., generalized Green’s relation) may be studied to abundant semigroups, namely, superabundant semigroups. Many papers have been dedicated to generalizations and improvements of Green’s relation in various contexts (see, for instance, [7, 13]).

In the following context, we will remind some fundamentals which are related to the terminology generalized Green’s relations over a semigroup.

We consider the semigroup to be a semigroup, and . By [12], it is known that

is called the abundant semigroup if each -class and -class include an idempotent element. Moreover, if each -class of includes an idempotent element, then is called superabundant. If is a superabundant semigroup and (idempotent semigroup of ) forms a subsemigroup of , then is called a cyber-group.

On the other hand, in [14], Fountain introduced that the most important subclasses of abundant semigroups are perhaps the classes of adequate semigroups. An abundant semigroup whose idempotents are commutative is considered as adequate semigroup. Therefore, an adequate semigroup in the class of abundant semigroups can be regarded as a generalization of the inverse semigroup in the class of regular semigroups (cf. [15]).

If for any , implies and implies , then a semigroup homomorphism is called good [9].

Definition 1 (see [2]). Let be a semigroup. An element in is called left cancellative if implies for all and in and right cancellative if implies for all and in . If every element in is left cancellative, then is called a left cancellative semigroup. Similarly, is called a right cancellative semigroup if every element in is right cancellative.
Now, we will consider and equivalences for the semigroup and so with the operation defined in (14). Before, let us recall the following lemma, which was proved in ([1], Lemma 3).
Unless stated otherwise, in this whole section, will denote the semigroup placed in the Rees matrix semigroup which was constructed for as presented in the introduction of this paper.

Lemma 4 (see [1]). The element is an idempotent , which is a rectangular band, and .

Lemma 5. For the semigroup ,(i)if it is a right cancellative semigroup, then every element of is equivalence, and(ii)if it is a left cancellative semigroup, then every element of is equivalence.

Proof. The proof will be given for just since the equivalence case can be obtained quite similarly as equivalence.
Since index sets are composed of one element, the structure of two arbitrary elements in are the form of and (see [1], Lemma 3). So, we haveSince is in , by Lemma 4, we will haveIn addition, by the assumption, since is a right cancellative semigroup, we have which implies . So, by taking into account (15), we can writeAll of the preceding progress results in as equivalence, as required.
One of the main theorems of this paper is the following.

Theorem 2. Let be a cancellative semigroup. Then, the set is not only an abundant semigroup but also a superabundant semigroup.

Proof. Consider any two idempotent elements and in . By Lemma 4, we have and . In addition, since and are idempotents, , and -classes consist of idempotent elements. According to Lemma 5 and the definition of an abundant semigroup, is the abundant semigroup. Furthermore, according to the definition of the superabundant semigroup, is the superabundant semigroup since -classes consist of idempotent elements.
The following consequences are immediate.

Corollary 1. If is commutative, then is an abundant semigroup as well as an adequate semigroup.

Proof. Assume that is commutative. Thus, the elements of are commutative which gives the meaning of an adequate semigroup since an abundant semigroup whose idempotents are commutative is actually an adequate semigroup.

Corollary 2. For any , every is a superabundant semigroup as well as a cyber-group.

Proof. By Theorem 2, is a superabundant semigroup of . Furthermore, since is a subsemigroup of , we reach that it is also a cyber-group.
As we mentioned in Corollary 1, it is well known that every commutative abundant semigroup is an adequate semigroup for . By utilizing this result, we show that the homomorphism of abundant semigroups for is a good kind of homomorphism. Now, we let and denote the abundant semigroup and commutative abundant semigroup (adequate) for , respectively.
Our final result in this paper is as follows.

Corollary 3. If is a homomorphism, then is a good homomorphism.

Proof. Let be a homomorphism, then we have for . Since it is known that by using the definition of adequate semigroup, we have and. Furthermore, since , we have and , and so, is a kind of good homomorphism.

4. Summary and Conclusions

Green’s relations are one of the interested areas in the semigroup theory. There are different types of it also, which are used for Green’s theorem. In this paper, we prove Green’s theorem over by using Green’s relations of the semigroup . Furthermore, we present the classification of the semigroup considering generalized Green’s relation. Finally, we obtain a new result about good homomorphism.

As future work, we are going to study some other properties and classification of the special semigroup over semigroups.

Data Availability

No data were used to support this study.

Conflicts of Interest

The authors declare that they have no conflicts of interest.


This work was supported by the Ministry of Education and Deanship of Scientific Research (DSR), King Abdulaziz University (KAU) (grant number IFPFP-272-22).