Abstract
Let be the semigroup consisting of all total transformations from X into a fixed nonempty subset Y of X. For an equivalence relation on X, let be the restriction of on Y, R a cross-section of and define to be the set of all total transformations from X into Y such that preserves both (if , then ) and R (if , then ). is then a subsemigroup of . In this paper, we give descriptions of Green’s relations on , and these results extend the results on and when taking to be the identity relation and , respectively.
MSC:
20M20
1. Introduction
Let X be a nonempty set and denote the semigroup containing all full transformations from X into itself with the composition. It is well-known that is a regular semigroup, as shown in Reference [1]. Various subsemigroups of have been investigated in different years. One of the subsemigroups of is related to an equivalence relation on X and a cross-section R of the partition (i.e., each -class contains exactly one element of R), namely , which was first considered by Araújo and Konieczny in 2003 [2], and is defined by
where They studied automorphism groups of centralizers of idempotents. Moreover, they also determined Green’s relations and described the regular elements of in 2004 [3].
Let Y be a nonempty subset of the set X. Consider another subsemigroup of , which was first introduced by Symons [4] in 1975, called , defined by
when denotes the image of . He described all the automorphisms of and also determined when is isomorphic to . In 2009, Sanwong, Singha and Sullivan [5] described all the maximal and minimal congruences on . Later, in Reference [6], Sanwong and Sommanee studied other algebraic properties of . They gave necessary and sufficient conditions for to be regular and also determined Green’s relations on . Furthermore, they obtained a class of maximal inverse subsemigroups of and proved that the set
contains all regular elements in , and is the largest regular subsemigroup of .
From now on, we study the subsemigroup of defined by
where is an equivalence relation on X and R is a cross-section of the partition in which ∩ . If , then ; and if is the identity relation, then , so we may regard as a generalization of and .
Green’s relations play a role in semigroup theory, and the aim of this paper is to characterize Green’s relations on . As consequences, we obtain Green’s relations on and as corollaries.
2. Preliminaries and Notations
For any semigroup S, let be a semigroup obtained from S by adjoining an identity if S has no identity and letting if it already contains an identity. Green’s relations of S are equivalence relations on the set S which were first defined by Green. According to such definitions, we define the -relation as follows. For any ,
or equivalently, if and only if and for some .
Furthermore, we dually define the -relation as follows.
or equivalently, if and only if and for some .
Moreover, we define the -relation as follows.
or equivalently, if and only if and for some .
Finally, we define and , where ∘ is the composition of relations. Since the relations and commute, it follows that .
In this paper, we write functions on the right; in particular, this means that for a composition , is applied first. Furthermore, the cardinality of a set A is denoted by .
For each , we denote by the kernel of , the set of ordered pairs in having the same image under , that is,
Moreover, the symbol denotes the partition of X induced by the map , namely
We observe that is an equivalence relation on X in which the partition and coincide. Moreover, for all , we have if and only if .
In addition, if is an equivalence relation on the set X and , we sometimes write instead of , and define to be the equivalence class that contains a, that is, .
For the subsemigroup of where is an equivalence relation on X, Y is a nonempty subset of X and R is a cross-section of in which , we see that if and , then there exists a unique such that , and we denote this element by . Furthermore, we observe that contains all constant maps whose images belong to R. This implies that is a subsemigroup of , which will be denoted by F.
An element a in a semigroup S is said to be regular if there exists such that ; and S is a regular semigroup if every element of S is regular.
In general, is not a regular semigroup, so we cannot apply Hall’s Theorem to find the -relation and the -relation on .
Now, we give an example of a non-regular element in . Let , , , and . Define by
Suppose that is regular. Then for some . We see that , which implies that , a contradiction.
Throughout this paper, the set X we study can be a finite or an infinite set. For convenience, we will denote by T.
3. Green’s Relations on
Unlike , in general T has no identity, as shown in the following example.
Example 1.
Let and . Suppose that ε is an identity element in T. Consider defined by
We see that , which implies that . This leads to a contradiction, since both 5 and 6 are not in Y.
Therefore, we use the semigroup T with identity adjoined, given by , in studying its Green’s relations.
From now on, the notation () denote the set of all elements of T which are -related (-related, -related, -related) to , where .
Let and be families of sets. If for each set there is a set such that , we say that refines , denoted by .
In what follows, most of the notation used are taken from Reference [3]. For each , we denote by the family and the family . Furthermore, we define and . In fact, we see that and .
The following example describes the above notation.
Example 2.
Let , and . Define by
It follows that
and
3.1. -Relation and -Relation
We begin with characterizing the Green’s -relation on T by using the idea of the proof for the -relation on (see Reference [3] [Lemma 2.4]) with the idea of restricted range concerned.
The following example shows why the restricted range is involved.
Example 3.
Let and . Define as follows.
We see that for all , for if for some , then , and thus , a contradiction. However, . But since .
Theorem 1.
Let . Then for some if and only if or . Consequently, if and only if ; or and .
Proof.
Assume that for some . Suppose that . Thus . We prove that . Let . Then for some and for some . Therefore and thus, .
Conversely, assume that or . If , then , where . For the case , we define γ on each ρ-class as follows. Let . Then for some (since ). So, for each , we choose such that (if , we choose since ) and define . From for all we obtain . By the definition of γ, . Since is arbitrary, we conclude that . To see that , let . Then , and so . ☐
If we replace Y with X in Theorem 1, then , and for all . Therefore, we have the -relation on .
Corollary 1. [3] [Theorem 2.5]
Let . Then if and only if and .
Similarly to , there are two types of -classes on T. In order to describe these -classes, the following lemma is needed.
Lemma 1.
Let be such that and . Then and .
Proof.
For each , we have for some , since . Thus, . Similarly, , since . It follows that , and thus and . ☐
Corollary 2.
For , the following statements hold.
- (i)
- If , then and .
- (ii)
- If , then .
Proof.
Let α be any element in T and let . Then , which implies that ; or and by Theorem 1.
(i) Assume that . It is clear by Theorem 1 that and . To prove the other containment, we consider when . Since , we obtain and . By Lemma 1, we obtain . Thus, we have and .
(ii) Assume that . Then there is such that , so and . By Lemma 1, we get . ☐
As a direct consequence of Corollary 2, we obtain the -relation on as follows.
Corollary 3. [6] [Theorem 3.2]
For , the following statements hold.
- (i)
- If , then .
- (ii)
- If , then .
Proof.
If we replace ρ with the identity relation in Corollary 2, then , and . Therefore, (ii) holds. To see that (i) holds, it suffices to prove that for ,
By Lemma 1, we have the “only if” part of the above statement. Now, if and , then for each there exist and such that , since and . Hence, . Similarly, by using and , we obtain . ☐
As we know, on (or ) if and only if . However, for the semigroup T, this is true only on F (see Corollary 5). For outside F, there are more terminologies involved.
The following example shows that there are with but for all .
Example 4.
Considering and defined in Example 3, we see that but for all , for if for some , then , a contradiction. Moreover, we have but . In the same way, but for all , for if for some , then , which is a contradiction. Furthermore, but .
The proof below is completely different from those for and , especially when proving the existence of such .
Theorem 2.
Let . Then for some if and only if and . Consequently, if and only if , and
Proof.
Assume that for some . If , then and the theorem holds. Now, we prove for . Let be such that . Then . Thus, . For each , for some and so for some . Thus, , which implies that Now, let . Then and for some and . Hence, , that is,
Conversely, assume that and . Let be fixed, and define on each ρ-class as follows. Let .
If , then define for all . Therefore .
If , then . Let for some . We obtain . Since , it follows that for some . Now, let and consider two cases. If , then define . If , then and for some . Thus, which implies . Now, we define (this is well-defined since ). We observe that . To see that , we get by the definition of γ that if . For , we have for some and then , hence since . Thus, .
To prove that , let . Then , and so . By the definition of γ, we obtain . Therefore, . ☐
The -relation on is as follows.
Corollary 4. [6] [Theorem 3.3]
Let . Then if and only if .
Proof.
If ρ is the identity relation, then , and . Moreover, for all . In addition, always holds for all since . Since we have if and only if , it follows from Theorem 2 that if and only if . ☐
As one might expect, there are two types of the -classes on T, the one that lies inside F and the other outside F. To see this, we need the two lemmas below.
Lemma 2.
Let and . Then the following statements hold.
- (i)
- .
- (ii)
- .
Proof.
(i) Let . Then , where is a ρ-class such that for all . From , there exists such that . Therefore there is and . Thus, for some , which implies that . We prove that for all . Let .
If , then there exists and . It follows that , and so since . Thus, .
If , then since , there exists such that . From , we obtain that for some . Hence, , that is, for some , which implies . Since , we obtain that , where , and it follows that .
Therefore, for all , that is, and as required. Similarly, since , we obtain Thus, .
(ii) Let . Then and for some and . From , we get for some . Since , we obtain that , and thus . Similarly, . ☐
Lemma 3.
Let . If , then either both α and β are in F, or neither is in F.
Proof.
Assume that . Suppose that one of α and β is not in F. Without loss of generality, assume that . Then there exists such that for all . Thus, , which implies that for all . Hence, , which leads to . ☐
Using Theorem 2, Lemmas 2 and 3, we have the following corollary.
Corollary 5.
For , the following statements hold.
- (i)
- If , then .
- (ii)
- If , then , and .
If , then , and so . Thus, Corollary 5 gives us a description of the -relation on .
Corollary 6. [3] [Theorem 2.3]
Let . Then if and only if .
As direct consequences of Corollaries 2 and 5, we have the -relation on T as follows.
Corollary 7.
For , the following statements hold.
- (i)
- If , then .
- (ii)
- If , then .
3.2. -relation and -relation
Let be a function from a set B to a set C. For a family of subsets of B, denotes the family of subsets of C.
The main results used for characterizing the Green’s -relation on T below are Corollaries 5 and 2. Moreover, the technique for defining such a function in (i) is taken from Reference [3] [Theorem 2.6].
Theorem 3.
For , the following statements hold.
- (i)
- If , then ; or there exists a bijection such that and .
- (ii)
- If , then and .
Proof.
Let α be any element in T and let . Then and for some .
(i) Assume that . By Corollary 5, and . By Corollary 2, ; also, or . If , then . Now, assume that and . Define by . We have for some , since , so . Since , we obtain that φ is well-defined and injective. To see that φ is surjective, let . Then for some , since . It follows that for some , and so , hence φ is surjective. To show that , let . Since and , there exists such that , thus and . Moreover, by the definition of φ, and . Hence, and .
Conversely, assume that . If , then , and it follows that . If there exists a bijection such that and , then we define by for all . From , we obtain that for all . Thus, . To show that for some , considering and , we get for some . Thus, , that is, . To see that , let . Then for some , since . It follows that . Since φ is an injective map, we obtain that . By the definition of γ, and . Hence, and . By Corollaries 5 and 2, and . Therefore, .
(ii) Assume that . Corollaries 5 and 2 imply that . Thus, . Again by Corollary 5, we have , . Therefore, and . The other containment is clear since . ☐
The two corollaries below are the -relations on and , respectively.
Corollary 8. [3] [Theorem 2.6]
Let . Then if and only if there is a bijection such that and .
Proof.
If we replace Y with X in Theorem 3, then . Therefore we have that: For ; or there is a bijection such that and .
Now, we assert that implies that there is a bijection such that and . Assume that and define by for all . Then φ is a well-defined injective map, since . It is obvious that φ is surjective. By the definition of φ, . Thus, and . Finally, . Hence, we have our assertion, and, therefore, There is a bijection such that and , as required. ☐
Corollary 9. [6] [Theorem 3.7]
For , the following statements hold.
- (i)
- If , then .
- (ii)
- If , then .
Proof.
As in the proof of Corollary 4, if we replace ρ with the identity relation, then (ii) of Theorem 3 is as follows. If , then .
Now, we claim that the conditions ; or there is a bijection such that and in (i) of Theorem 3 is equivalent to for all . It is clear that the above conditions imply . Now, let and . Then there is a bijection and . To see that the remaining conditions hold, we observe that , since . From and ρ as the identity relation, we obtain , hence, . Similarly, from , we obtain . Therefore, we have our claim. ☐
To characterize the -relation on T, we need the terminology below. For each , we define
The following example shows that is necessary.
Example 5.
Let and . Let
Define as follows:
Then and . Moreover,
We show further that for some , but there is no function such that and . Define by
We see that . Suppose that there is such a function φ, which would imply for some , and , since . Thus, , which is a contradiction. However, since , we can define satisfying the conditions and as follows:
Note that if or is the identity relation, then for all .
The following result is the key lemma in characterizing the -relation on T. The outline of the proof is the same as Theorem 2.7 in [3], but there are differences in detail, for example, to prove the “only if” part, the function has to be defined from into in order to make in (2) well-defined. In addition, because of the restricted range of T, the function defined in (3) of the “if” part is greatly different from that defined in Theorem 2.7 [3]. Moreover, each step of the proof, the restricted range is involved.
Lemma 4.
Let . Then for some if and only if there exists such that and .
Proof.
Assume that for some . We define such that and as follows.
Fix . Let , and define φ in three steps.
- (1)
- If , we define .
- (2)
- If and , then define .
- (3)
- If and , then define .
We observe that in (2) belongs to , since and for some .
By the definition of φ and the fact that , we obtain that . To see that , let . Then there exists such that . We have . Thus, . To show that , let . By the definition of φ, either for some (if ) or (if ). Therefore, .
Conversely, assume that there exists such that and . Let . Then there is a unique such that (note that may not belong to but ). Since , there exists such that . From , there is such that . Let . Then . For every , we choose such that (since , we may assume that if ). Let Then . For every , we choose such that (since , we may assume that if ).
We aim to define such that . We first define λ. Let , and . Then , so there exists such that , thus we define . By the definition of λ, . If , then , and so . Hence , which implies that . Thus, .
To define μ, fix and let .
- (1)
- If , define .
- (2)
- If , define .
- (3)
- If for all , define .
To see that the definition of μ in (2) does not depend on the choice of A, we suppose that there are such that . Since and , we obtain , and thus . Next, we prove that . By the definition of μ, we see that . Now, if for all , then . For for some , we have if for some and if for all . Thus, .
To prove that , let , and . Let (note that was selected such that ). By the definitions of λ and μ, we have (recall that was chosen so that ) and . Thus, , as required. ☐
If we take in Lemma 4, then , which contains an identity element, the identity map. Thus, we obtain the -relation on .
Corollary 10. [3] [Theorem 2.8]
Let . Then if and only if there exist and such that , ; also , .
Now, we are ready to prove the -relation on T.
Theorem 4.
Let . Then if and only if one of the following conditions holds:
- (i)
- , ;
- (ii)
- there exist such that , and such that , .
Proof.
Assume that . Then and for some . If , then and , which implies that , and so , . If , then and , which implies that , and so ; or and . If , then (i) holds. If and , then we define φ and ϕ to be the identity maps on and , respectively. It follows that , and . That is, (ii) holds. For the other cases, we can conclude that and for some (for example, if and , then and imply ). Thus, Lemma 4 gives that (ii) holds in all the remaining cases.
Conversely, assume that the statement holds. If and , then , and so . If there exist such that , and such that , , then and for some by Lemma 4. Therefore, , as required. ☐
By setting to be the identity relation in Theorem 4, we obtain the -relation on as follows.
Corollary 11. [6] [Theorem 3.9]
Let . Then if and only if or .
Proof.
If ρ in Theorem 4 is the identity relation, then . By the same proof as given for Corollary 4, we have that (i) of Theorem 4 is equivalent to . Now, we claim that (ii) is equivalent to . If (ii) holds, then is onto, since implies that for each , for some . Similarly, from with , we obtain that ϕ is onto. Thus, and , and so . Therefore, . Conversely, if , then there exist bijections and . Since φ is onto, it follows that . Similarly, as ϕ is onto, we have . Moreover, , and in the same way, . Therefore, we have our claim. ☐
Recall that on any semigroup and on , but in T it is not always true, so we end this section with an example showing that on T.
Example 6.
Let X be the set of all positive integers and . Let
Then we define
Thus, and
It is clear that . Therefore, α and β are not -related by Theorem 3. However, we can define and as follows:
Both φ and ϕ satisfy the required properties of Theorem 4. Therefore, α and β are -related.
However, if X is a finite set, then T is a finite semigroup and it is periodic. Hence in this case.
Author Contributions
All authors contributed equally to this manuscript.
Funding
This research received no external funding.
Acknowledgments
This research was supported by Chiang Mai University.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Howie, J.M. Fundamentals of Semigroup Theory; Oxford University Press: New York, NY, USA, 1995. [Google Scholar]
- Araújo, J.; Konieczny, J. Automorphism groups of centralizers of idempotents. J. Algebra 2003, 269, 227–239. [Google Scholar] [CrossRef]
- Araújo, J.; Konieczny, J. Semigroups of transformations preserving an equivalence relation and a cross-section. Commun. Algebra 2004, 32, 1917–1935. [Google Scholar] [CrossRef]
- Symons, J.S.V. Some results concerning a transformation semigroup. J. Aust. Math. Soc. 1975, 19, 413–425. [Google Scholar] [CrossRef]
- Sanwong, J.; Singha, B.; Sullivan, R.P. Maximal and minimal congruences on some semigroups. Acta Math. Sin. Engl. Ser. 2009, 25, 455–466. [Google Scholar] [CrossRef]
- Sanwong, J.; Sommanee, W. Regularity and Green’s relations on a semigroup of transformations with restricted range. Int. J. Math. Math. Sci. 2008. [Google Scholar] [CrossRef]
© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).