Next Article in Journal
Generalized 5-Point Approximating Subdivision Scheme of Varying Arity
Next Article in Special Issue
First-Degree Prime Ideals of Biquadratic Fields Dividing Prescribed Principal Ideals
Previous Article in Journal
The Derived Subgroups of Sylow 2-Subgroups of the Alternating Group, Commutator Width of Wreath Product of Groups
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Magnifiers in Some Generalization of the Full Transformation Semigroups

by
Thananya Kaewnoi
1,
Montakarn Petapirak
2 and
Ronnason Chinram
2,3,*
1
Department of Mathematics and Statistics, Prince of Songkla University, Hat Yai, Songkhla 90110, Thailand
2
Algebra and Applications Research Unit, Department of Mathematics and Statistics, Prince of Songkla University, Hat Yai, Songkhla 90110, Thailand
3
Centre of Excellence in Mathematics, CHE, Si Ayuthaya Road, Bangkok 10400, Thailand
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(4), 473; https://doi.org/10.3390/math8040473
Submission received: 7 February 2020 / Revised: 17 March 2020 / Accepted: 27 March 2020 / Published: 30 March 2020
(This article belongs to the Special Issue Algebra and Number Theory)

Abstract

:
An element a of a semigroup S is called a left [right] magnifier if there exists a proper subset M of S such that a M = S ( M a = S ) . Let T ( X ) denote the semigroup of all transformations on a nonempty set X under the composition of functions, P = { X i i Λ } be a partition, and ρ be an equivalence relation on the set X. In this paper, we focus on the properties of magnifiers of the set T ρ ( X , P ) = { f T ( X ) ( x , y ) ρ , ( x f , y f ) ρ and X i f X i for all i Λ } , which is a subsemigroup of T ( X ) , and provide the necessary and sufficient conditions for elements in T ρ ( X , P ) to be left or right magnifiers.

1. Introduction

Let T ( X ) denote the semigroup of all transformations on a nonempty set X . We will study magnifiers or magnifying elements in the generalization of this semigroup. Firstly, we give some concepts of the magnifiers in a semigroup. This notion was originally proposed by Ljapin in [1]. An element a of a semigroup S is called a left (right) magnifier if a M = S ( M a = S ) for some proper subset M of S. In 1992, the existence of magnifiers in simple and bisimple semigroups were established by Catino and Migliorini [2]. After that, K.D. Magill, Jr. [3] introduced nonstrong and strong magnifiers, but he focused on a nonstrong magnifier which is simply called a magnifier. The conditions for elements in any subsemigroup of T ( X ) with the identity to be a magnifier were established in his paper; moreover, he applied the result in some specific transformation semigroups. In 1996, Gutan [4] studied strong and nonstrong magnifiers in a semigroup and constructed the semigroup containing both left strong and left nonstrong magnifiers which answers the question that was raised by K.D. Magill, Jr. in [3]. A year later, he proved in [5] that every semigroup containing magnifiers is factorizable. Recently, the study of magnifiers in semigroups have been carried out by many authors. For instance, Chinram, Petchkaew, and Buapradist investigated the magnifiers of T ( X ) determined by a partition of a set X in [6]. Left and right magnifiers in the partial transformation semigroups were characterized by Luangchaisri, Changphas, and Phanlert in [7].
Thus far, many authors have extensively studied the transformation semigroups that preserve an equivalence relation. In 2004, Araujo and Konieczny [8] investigated a subsemigroup T ( X , ρ , R ) of T ( X ) , where
T ( X , ρ , R ) = { a T ( X ) R a R   and   ( x , y ) ρ   implies   ( x a , y a ) ρ }
consisting of all transformations preserving both an equivalence relation ρ on X and a cross-section R of the partition X / ρ determined by ρ . Moreover, they characterized the equivalence relation ρ on X for this semigroup to be regular and described the equivalence relation ρ on X leading to D = J in the semigroup T ( X , ρ , R ) , where D and J are Green’s relations. Later, Pei [9] examined the subsemigroup T ρ ( X ) of T ( X ) , which is defined as
T ρ ( X ) = { f T ( X ) ( x , y ) ρ , ( f ( x ) , f ( y ) ) ρ }
where ρ is an equivalence relation. This author investigated the necessary and sufficient conditions of T ρ ( X ) to be a regular semigroup and provided the conditions for any two elements in T ρ ( X ) having finite ranges to be J -equivalent where J is a Green’s relation. Meanwhile, Pei and Zou characterized Green’s equivalences in some subsemigroups of T ρ ( X ) in [10]. In 2009, Pei and Deng [11] exposed the conditions for the equivalence relation ρ on an infinite set X, which leads to D = J in the semigroup T ρ ( X ) . In [12], Sun and Pei gave necessary and sufficient conditions of T ρ 1 ( X ) T ρ 2 ( X ) for equivalence relations ρ 1 and ρ 2 on X such that ρ 2 ρ 1 under the assumption that ρ 1 and ρ 2 are comparable to be regular. In addition, naturally ordered semigroups of full and partial transformations preserving an equivalence relation were studied in [13] and [14]. Previously, the authors published the conditions of elements being left and right magnifiers in the full and partial transformation semigroups which preserve an equivalence relation in [15] and [16], respectively. As we can see, Sun and Pei [12] studied Green’s relations on T ( X ) preserving two equivalence relations. However, no one has yet studied the magnifiers in this semigroup. Thus, adding the condition preserving the partition on a set X would be a useful first step for the future work that is involved.
From now on, let ρ be an equivalence relation on a nonempty set X and denote a partition on a nonempty set X by P = { X i i Λ } , a collection of nonempty subsets of X satisfying X = i Λ X i with X i X j = for all i , j Λ such that i j . For any f , g T ρ ( X ) and x X , the notations x f and x f g are used instead of f ( x ) and ( g f ) ( x ) , respectively. The image of f is denoted by ran f . Then, we define
T ρ ( X , P ) = { f T ( X ) ( x , y ) ρ , ( x f , y f ) ρ and X i f X i for all i Λ } ,
for any x X , we denote the equivalence class of ρ containing x by [ x ] ρ = { y X x ρ y } . Let X / ρ = { [ x ] ρ x X } and ( X i , x j ) = X i [ x j ] ρ for x j X and X i P . The main purpose of this paper is to go a further step by considering magnifiers in T ρ ( X , P ) which preserves both an equivalence relation ρ and a partition P on X . In particular, it is verified that a magnifier exists if and only if at least one element of P is finite. Futhermore, the necessary and sufficient conditions for elements in T ρ ( X , P ) to be magnifiers are established.

2. Left Magnifiers in T ρ ( X , P )

In this section, we begin with some properties of left magnifiers in T ρ ( X , P ) and the conditions for elements in this semigroup to be a left magnifier are provided.
Lemma 1.
If f is a left magnifier in T ρ ( X , P ) , then f is injective.
Proof. 
By assumption, let M T ρ ( X , P ) be such that f M = T ρ ( X , P ) . Clearly, the identity map i d X on X belongs to T ρ ( X , P ) . Thus, there exists a function h M such that f h = i d X . This implies that f is injective. ☐
However, the converse of Lemma 1 is not true since there is no proper subset M of T ρ ( X , P ) such that i d X M = T ρ ( X , P ) .
Lemma 2.
Let f be a left magnifier in T ρ ( X , P ) . For any x , y X , if ( x f , y f ) ρ , then ( x , y ) ρ .
Proof. 
Let f be a left magnifier in T ρ ( X , P ) and M T ρ ( X , P ) be such that f M = T ρ ( X , P ) . Then, f h = i d X for some h M . Let x , y X be such that ( x f , y f ) ρ . Hence, ( x , y ) = ( x f h , y f h ) = ( ( x f ) h , ( y f ) h ) . Therefore, ( x , y ) ρ since h T ρ ( X , P ) and ( x f , y f ) ρ .
Note that, if f T ρ ( X , P ) , then, for any x X and X i P , x f X i implies x X i .
Lemma 3.
If f T ρ ( X , P ) is bijective, then f is not a left magnifier in T ρ ( X , P ) .
Proof. 
Let f T ρ ( X , P ) be bijective. Then, f 1 is also bijective. Suppose that f is a left magnifier. Then, there is a proper subset M of T ρ ( X , P ) such that f M = T ρ ( X , P ) . Clearly, f M = f T ρ ( X , P ) . To show that f 1 T ρ ( X , P ) , let x , y X be such that ( x , y ) ρ . Since f is surjective and by Lemma 2, there exists ( a , b ) ρ such that a f = x and b f = y . Then, ( x f 1 , y f 1 ) = ( a , b ) ρ . Next, let x X i for some X i P . Since f is surjective, there exists a X i such that a f = x . Then, x f 1 = a X i . Therefore, f 1 T ρ ( X , P ) . Hence, M = f 1 f M = f 1 f T ρ ( X , P ) = T ρ ( X , P ) , which is a contradiction. ☐
By Lemmas 1 and 3, we obtain the following corollary.
Corollary 1.
If f is a left magnifier in T ρ ( X , P ) , then f is injective but not surjective.
Lemma 4.
Let P = { X i i Λ } be a partition on a set X . If X i P is finite for all i Λ , then there exists no left magnifier in T ρ ( X , P ) .
Proof. 
Suppose that there is a left magnifier f in T ρ ( X , P ) . By Lemma 1, f | X i is bijective for all i Λ . Since X f = ( i Λ X i ) f = i Λ X i f = i Λ X i = X , f is surjective which is a contradiction. ☐
It is noticeable in Lemma 4 that if a left magnifier exists in T ρ ( X , P ) , then X i is infinite for some i Λ . However, the converse of this statement is not true in general. It is illustrated by the following counterexample.
Example 1.
Let X = Z and P = { X i i N { 0 } } where X 0 = { 0 , 1 , 2 , } and X i = { 2 i 1 , 2 i } for all i N . Define a relation ρ on X by ρ = j = 1 ( A j × A j ) where A 1 = { 0 , ± 1 , ± 2 } and A j = { ± 2 j , ± ( 2 j 1 ) } for all j N and j 2 . Clearly, ( X i , x ) is finite for all i N { 0 } and x X . Note that ( X 0 , x i ) A i and X i A i ; moreover, A i = ( X 0 , x i ) X i where [ x i ] ρ = A i for all i N . Let f be an injection in T ρ ( X , P ) . Then, X i f = X i A i for all i N . This forces that ( X 0 , x i ) f = ( X 0 , x i ) A i where [ x i ] ρ = A i for all i N . Then, f is a surjection. This implies that there exists no left magnifier in T ρ ( X , P ) .
Corollary 2.
If X is a finite set, then T ρ ( X , P ) has no left magnifiers.
We are now going to work under the assumption that, for each x X , there is exactly one X i P such that [ x ] ρ X i . That is, the partition associated with the equivalence relation ρ is a refinement of P .
Lemma 5.
Let P = { X i i Λ } be a partition on a set X such that X i is infinite for some i Λ and X / ρ is a refinement of P . If f T ρ ( X , P ) is injective but not surjective and for any x , y X , ( x f , y f ) ρ implies ( x , y ) ρ , then f is a left magnifier of T ρ ( X , P ) .
Proof. 
Assume that f T ρ ( X , P ) is injective but not surjective. For each x ran f , there is y x X such that y x f = x .
Case 1. | [ x ] ρ | = 1 for all x X .
Let M = { h T ρ ( X , P ) x h = x for all x ran f } . Clearly, M is a proper subset of T ρ ( X , P ) . For any function g in T ρ ( X , P ) , define a function h T ρ ( X , P ) by
x h = y x g if x ran f , x if x ran f
for all x X . Clearly, h M . For any x X , x f h = y x f g . Since y x f f = x f and f is injective, y x f = x . Therefore, x f h = x g . This shows that f h = g , which implies that f M = T ρ ( X , P ) .
Case 2. | [ x ] ρ | > 1 for some x X .
Let X = { x j j Λ } . For any i Λ and j Λ with ( X i , x j ) ran f , choose x i j ( X i , x j ) ran f . Then, there exist y x i j X i such that y x i j f = x i j . If ( X i , x j ) ran f = , choose x i j ( X i , x j ) . Let M = { h T ρ ( X , P ) h is not injective } . Clearly, M is a proper subset of T ρ ( X , P ) . For any function g in T ρ ( X , P ) , define a function h T ρ ( X , P ) for all x X by
x h = y x g if x ran f , y x i j g if x ran f and x ( X i , x j ) such that ( X i , x j ) ran f , x i j if x ran f and x ( X i , x j ) such that ( X i , x j ) ran f = .
Let ( a , b ) ρ . Then, a , b [ x j ] ρ for some x j X . If a , b ran f , then there exist y a , y b X such that y a f = a and y b f = b . By assumption, ( y a , y b ) ρ . Hence, ( a h , b h ) = ( y a g , y b g ) ρ . Since X / ρ is a refinement of P , a and b must belong to X i for some i Λ . Thus, a , b ( X i , x j ) . If a , b ran f , then we have two cases to consider. It is clear that ( a h , b h ) = ( y x i j g , y x i j g ) ρ if ( X i , x j ) ran f and ( a h , b h ) = ( x i j , x i j ) ρ if ( X i , x j ) ran f = . Next, we may assume that a ran f and b ran f . Then, we choose x i j = a ( X i , x j ) ran f and hence ( a h , b h ) = ( y a g , y a g ) ρ . Hence, it is readily seen that h preserves the equivalence relation ρ . Moreover, it is easy to see that h preserves the partition P on X as well. Since [ x ] ρ > 1 for some x X and f is injective but not surjective, there exists x 0 ran f . Then, x 0 f ( X \ { x 0 } ) h and hence h is not injective. Therefore, h M . For any x X , x f h = y x f g . Again, we obtain y x f = x . Therefore, x f h = x g . This shows that f h = g , which implies that f M = T ρ ( X , P ) .
The following examples illuminate the ideas of the proof given in Lemma 5.
Example 2.
Let X = Q and P be a partition on X such that P = { Q + , Q { 0 } } . For each n N , denote A n = x n x N and gcd ( x , n ) = 1 and A = Q \ { 2 n + 1 n N } . Define a relation ρ on X by ρ = i = 1 ( A 2 i × A 2 i ) i = 1 A 2 i 1 { 2 i + 1 } × A 2 i 1 { 2 i + 1 } ( B × B ) where B = A { 0 } . Thus, ρ is an equivalence relation on X and Q + P is infinite. Clearly, B and A n are infinite for all n N . Then, there exist the bijective functions φ 1 : B B , φ 2 : A 2 A 1 , φ 2 n : A 2 n A 2 ( n 1 ) for all n 2 and φ 2 n 1 : A 2 n 1 A 2 ( n + 1 ) 1 for all n N . Define a function f T ρ ( X , P ) by
x f = x φ i if x A i , i N , x 2 if x { 2 n + 1 n N } , x otherwise .
Clearly, 1 ran f . Therefore, f is injective but not surjective and, for any x , y X , ( x f , y f ) ρ implies ( x , y ) ρ but f is not a left magnifier of T ρ ( X , P ) since there is no function h T ρ ( X , P ) such that f h = i d X .
Example 3.
Let X = Z and P be a partition on X such that P = { X 1 , X 2 } where X 1 = { 0 , 1 , 2 , 3 , } and X 2 = { 1 , 2 , 3 , } . Define a relation ρ on X by ρ = i = 0 ( A i × A i ) where A 0 = X 1 , A 1 = { 1 } , A 2 = { 2 , 3 } , A 3 = { 4 , 5 , 6 } , A 4 = { 7 , 8 , 9 , 10 } , It is obvious that ρ is an equivalence relation on X . Clearly, X / ρ = { { 0 , 1 , 2 , 3 , } , { 1 } , { 2 , 3 } , { 4 , 5 , 6 } , { 7 , 8 , 9 , 10 } , } and X 1 P is infinite. Define a function f on X by
x f = x if   x A 0 , x + i if   x A i , i > 0 .
For convenience, we write f as
f = 3 2 1 0 1 2 3 4 5 6 7 8 9 10 3 2 1 0 2 4 5 7 8 9 11 12 13 14 .
It is noticeable that f is injective but not surjective and for any x , y X , ( x f , y f ) ρ implies ( x , y ) ρ . Let M = { h T ρ ( X , P ) h is not injective } and consider the element g of T ρ ( X , P ) , which is defined by
x g = x if   x A i , i 2 , x + i if   x A i , i > 2 .
Thus, we write g as
g = 3 2 1 0 1 2 3 4 5 6 7 8 9 10 3 2 1 0 1 2 3 7 8 9 11 12 13 14 .
By Lemma 5, f is a left magnifier and there exists an element h M such that f h = g . Note that, for all j 1 , A j ran f A j and hence there is an element x j A j and x j ran f . To get the desired result, for any x j ran f such that ( X i , x j ) ran f , choose y x j = min ( X i , x j ) ran f = min A j for all j 4 and define a function h in T ρ ( X , P ) by x h = x for all x A 0 A 1 , 2 h = 3 h = 1 , 4 h = 6 h = 2 , 5 h = 3 and
x h = x if x max A j , y x j if x = max A j
for all x A j such that j 4 . For convenience, we write h as
h = 3 2 1 0 1 2 3 4 5 6 7 8 9 10 3 2 1 0 1 1 1 2 3 2 7 8 9 7 .
Clearly, h M . Therefore, we have
f h = 3 2 1 0 1 2 3 4 5 6 7 8 9 10 3 2 1 0 2 4 5 7 8 9 11 12 13 14
3 2 1 0 1 2 3 4 5 6 7 8 9 10 3 2 1 0 1 1 1 2 3 2 7 8 9 7
= 3 2 1 0 1 2 3 4 5 6 7 8 9 10 3 2 1 0 1 2 3 7 8 9 11 12 13 14 = g .
Note that max A i ran f for all A i such that i 1 . The main ideas behind the concept are as follows: We illustrate the idea by considering 1 , 3 , 6 , and 10 ran f . Since 1 ( X 2 , 1 ) and ( X 2 , 1 ) ran f = , 1 h = 1 . Consider that 3 ( X 2 , 3 ) and ( X 2 , 3 ) ran f = { 2 } . We can see that 1 f = 2 . Hence, y 2 = 1 and y 2 g = 1 . Therefore, 3 h = 1 . Consider that 6 ( X 2 , 6 ) and ( X 2 , 6 ) ran f = { 4 , 5 } . Then, we choose 4 ( X 3 , 6 ) ran f . We can see that 2 f = 4 . Hence, y 4 = 2 and y 4 g = 2 . Therefore, 6 h = 2 . Consider that 10 ( X 2 , 10 ) and ( X 2 , 10 ) ran f = { 7 , 8 , 9 } . Then, we choose 7 ( X 2 , 10 ) ran f . We can see that 4 f = 7 . Hence, y 7 = 4 and y 7 g = 7 . Therefore, 10 h = 7 .
Theorem 1.
Let P = { X i i Λ } be a partition on a set X such that X i is infinite for some i Λ and X / ρ is a refinement of P . A function f is a left magnifier of T ρ ( X , P ) if and only if f T ρ ( X , P ) is injective but not surjective and for any x , y X , ( x f , y f ) ρ implies ( x , y ) ρ .
Proof. 
By Corollary 1, Lemmas 2 and 5. ☐
Alternatively, Theorem 1 can be assured by applying the result presented in [15] to the restriction of f T ρ ( X ) to the single set of P .
Theorem 2.
Let P = { X i i Λ } be a partition and ρ be an equivalence relation on a set X and X / ρ is a refinement of P . There exists a left magnifier in T ρ ( X , P ) if and only if X i is infinite for some i Λ .
Proof. 
The necessity is obtained by Lemma 4. On the other hand, suppose that there exists X i P such that | X i | is infinite.
Case 3. There exists t X such that ( X i , t ) is infinite. Then, there is a proper subset A of ( X i , t ) such that | A | = | ( X i , t ) | = | ( X i , t ) \ A | . Thus, there is a bijection g from ( X i , t ) to A . Define a function f by
x f = x g if x ( X i , t ) , x otherwise .
Clearly, f T ρ ( X , P ) and f is injective. Hence, ran f X \ ( ( X i , t ) \ A ) X . Then, f is injective but not surjective. By Theorem 1, f is a left magnifier.
Case 4. ( X i , t ) is finite for all t X .
Case 4(i): There is a natural number n such that K = { ( X i , t ) t X i and | ( X i , t ) | = n } is infinite. Then, there exists a proper subset K of K such that | K | = | K | = | K \ K | . There is a bijection λ from K to K . Thus, | A | = | A λ | = n for all A K . Hence, for all A K , there exists a bijective function γ A from A to A λ . Let γ = A K γ A . Then, γ is a bijection from A K A to A K A . Define a function f by
x f = x γ if x A K A , x otherwise .
Clearly, f belongs to T ρ ( X , P ) and f is injective. Since ran f = X \ ( A K A \ A K A ) X , f is not surjective. By Theorem 1, f is a left magnifier.
Case 4(ii): For all n N , the set K = { ( X i , t ) t X i and | ( X i , t ) | = n } is finite. Then, for each t X , there exists t X such that | ( X i , t ) | < | ( X i , t ) | . Let E = { ( X i , t ) [ t ] ρ X i } . In this case, E is an infinite set. Let n 1 = min ( X i , t ) E | ( X i , t ) | and K 1 = { ( X i , t ) | ( X i , t ) | = n 1 } . Choose ( X i , t 1 ) K 1 . Let n 2 = min ( X i , t ) E 1 | ( X i , t ) | where E 1 = E \ K 1 and K 2 = { ( X i , t ) | ( X i , t ) | = n 2 } . Choose ( X i , t 2 ) K 2 . Proceeding in this way, we obtain the sets ( X i , t 1 ) , ( X i , t 2 ) , , ( X i , t k ) , and positive integers n 1 , n 2 , , n k , such that n k = min ( X i , t ) E k | ( X i , t ) | where E k = E \ l = 1 k 1 K l and ( X i , t k ) K k , where K k = { ( X i , t ) | ( X i , t ) | = n k } for all k 2 . Clearly, n 1 < n 2 < . . . < n k < . . . . Next, we let A = { ( X i , t j ) j 1 } . Then, | ( X i , t j ) | < | ( X i , t j + 1 ) | for all j 1 . Hence, there exists an injection γ j : ( X i , t j ) ( X i , t j + 1 ) . Let γ = j 1 γ j . Then, γ is an injection from B A B to itself. Next, define a function f by
x f = x γ if x B A B , x otherwise .
Clearly, f T ρ ( X , P ) and f is injective. Since ran f X \ ( X i , t 1 ) X , f is not surjective. By Theorem 1, f is a left magnifier. ☐

3. Right Magnifier in T ρ ( X , P )

In this section, we pay our attention to right magnifiers in T ρ ( X , P ) . We provide the properties of right magnifiers in T ρ ( X , P ) and conditions for elements in this semigroup to be a right magnifier.
Lemma 6.
If f is a right magnifier in T ρ ( X , P ) , then f is surjective.
Proof. 
By assumption, let M T ρ ( X , P ) be such that M f = T ρ ( X , P ) . Clearly, the identity map i d X on X belongs to T ρ ( X , P ) . Thus, there exists h M such that h f = i d X . This implies that f is surjective. ☐
Lemma 7.
Let f be a right magnifier in T ρ ( X , P ) . For any x , y X , if ( x , y ) ρ , then there exists ( a , b ) ρ such that x = a f and y = b f .
Proof. 
By assumption, let M T ρ ( X , P ) be such that M f = T ρ ( X , P ) . Then, h f = i d X for some h M . Let x , y X be such that ( x , y ) ρ . Then, x h f = x i d X = x and y h f = y i d X = y . Since h T ρ ( X , P ) , ( x h , y h ) ρ . Choose a = x h , b = y h . Therefore, ( a , b ) ρ such that x = a f and y = b f .
Note that, for all surjection f T ρ ( X , P ) , each x X i with X i P , there exists a X i such that a f = x . Consequently, any right magnifier has this property, by Lemma 6.
Lemma 8.
Let f be an element in T ρ ( X , P ) . If f is bijective, then f is not a right magnifier of T ρ ( X , P ) .
Proof. 
Let f be a bijective function in T ρ ( X , P ) . Suppose that f is a right magnifier. Then, there is a proper subset M of T ρ ( X , P ) such that M f = T ρ ( X , P ) . Clearly, M f T ρ ( X , P ) f and T ρ ( X , P ) f T ρ ( X , P ) = M f . Therefore, M f = T ρ ( X , P ) f . Since f is injective, M = T ρ ( X , P ) , which is a contradiction. ☐
By Lemmas 6 and 8, we obtain Corollary 3.
Corollary 3.
If f is a right magnifier in T ρ ( X , P ) , then f is surjective but not injective.
Lemma 9.
Let P = { X i i Λ } be a partition on a set X . If X i is finite for all i Λ , then there exists no right magnifier in T ρ ( X , P ) .
Proof. 
Suppose that there is a right magnifier f T ρ ( X , P ) . By assumption and Lemma 7, f | X i is an injection for all i Λ . Since X f = i Λ X i f = i Λ X i f , f is injective, which is a contradiction. ☐
It is noticeable in Lemma 9 that, if a right magnifier exists in T ρ ( X , P ) , then X i is infinite for some i Λ . However, the converse of this statement is not true in general. It is illustrated by the following counterexample.
Example 4.
Let X = Z and P = { X i i N { 0 } } where X 0 = { 0 , 1 , 2 , } and X i = { 2 i 1 , 2 i } for all i N . Define a relation ρ on X by ρ = j = 1 ( A j × A j ) where A 1 = { 0 , ± 1 , ± 2 } and A j = { ± 2 j , ± ( 2 j 1 ) } for all j N and j 2 . Clearly, ( X i , x ) is finite for all i N { 0 } and x X . Moreover, A i = ( X 0 , x i ) X i where [ x i ] ρ = A i for all i N . Note that ( X 0 , x i ) A i where [ x i ] = A i and X i A i for all i N . Let f be a surjection in T ρ ( X , P ) . Then, X i f = X i A i for all i N . This forces that ( X 0 , x i ) f = ( X 0 , x i ) A i where [ x i ] ρ = A i for all j N . Then, f is an injection. This implies that there exists no right magnifier in T ρ ( X , P ) .
Corollary 4.
If X is a finite set, then T ρ ( X , P ) has no right magnifiers.
Lemma 10.
Let P = { X i i Λ } be a partition on a set X . If f T ρ ( X , P ) is surjective but not injective and for any ( x , y ) ρ , there exists ( a , b ) ρ such that x = a f and y = b f , then f is a right magnifier.
Proof. 
Assume that f T ρ ( X , P ) is surjective but not injective. Let g T ρ ( X , P ) and M = { h T ρ ( X , P ) h is not a surjection } . Let x ( X i , x j ) . Thus, x g X i . Since f is surjective, we can choose y x X i such that y x f = x g . Then, for all x , z ( X i , x j ) , there are y x , y z X i such that y x f = x g , y z f = z g and ( y x , y z ) ρ because ( x , z ) ρ . Define a function h by x h = y x for all x X . Obviously, h is a function on X . To show that h T ρ ( X , P ) , let a , b X be such that ( a , b ) ρ . Clearly, ( a h , b h ) = ( y a , y b ) ρ . For each X i P , if a X i , then a h = y a . Since y a f = a and a h X i , h T ρ ( X , P ) . Since f is not injective, there are distinct two elements x , y X i for some i Λ such that x f = y f = z for some z X i . Hence, y z = x or y z = y . Therefore, either x ran h or y ran h . Thus, h M . For all x X , x h f = y x f = x g . Then, h f = g . Therefore, M f = T ρ ( X , P ) which means that f is a right magnifier. ☐
The ideas of Lemma 10 are illustrated by the next example.
Example 5.
Let X = Z and P be a partition on X such that P = { Z , Z + { 0 } } . Define a relation ρ on X by ρ = j = 1 ( A j × A j ) where A 1 = { 1 , 3 , 5 , 7 , , } , A 2 = { ± 2 , ± 4 , ± 6 , ± 8 , } , A 3 = { 0 } , A 4 = { 1 , 3 } , A 5 = { 5 , 7 } , Then, ρ is an equivalence relation on X and X / ρ = { { 1 , 3 , 5 , 7 , , } , { ± 2 , ± 4 , ± 6 , ± 8 , } , { 0 } , { 1 , 3 } , { 5 , 7 } , } . Let f be a function defined by x f = 4 for all x A 4 and
x f = x 4 if   x Z + \ 2 Z + , x + 4 if   x 4 Z + , x otherwise .
It is easy to see that f belongs to T ρ ( X , P ) , and it is injective but not surjective. However, we can not construct the function h T ρ ( X , P ) such that f h = i d X since ( 4 , 8 ) ρ but there exist no a , b X such that ( a , b ) ρ satisfies a f = 4 and b f = 8 .
Example 6.
Let X = N and P be a partition on X such that P = { { 1 } , { 2 } , { 3 , 4 , 5 } , { 6 , 7 , 8 , 9 , } } . Define a relation ρ on X by
x ρ y   if   and   only   if   x y mod 2 .
It is obvious that ρ is an equivalence relation on X . We obtain that X / ρ = { { 1 , 3 , 5 , 7 , } , { 2 , 4 , 6 , 8 , } } and { 6 , 7 , 8 , 9 , } P is infinite. Let f be a function defined by 1 f = 1 , 2 f = 2 , 3 f = 5 , 4 f = 4 , 5 f = 3 , 6 f = 6 , 7 f = 7 and x f = x 2 for all x 8 . Thus, we write f as
f = 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2 5 4 3 6 7 6 7 8 9 10 11 12 13 .
It is easy to see that f belongs to T ρ ( X , P ) and it is surjective but not injective. Let M = { h T ρ ( X , P ) h is not a surjection } and consider the element g of T ρ ( X , P ) , which is defined by 1 g = 1 , 2 g = 2 , 3 g = 5 , 4 g = 4 , 5 g = 3 , and x f = x + 2 for all x 6 .
Thus, we write g as
g = 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2 5 4 3 8 9 10 11 12 13 14 15 16 13 .
By Lemma 10, f is a right magnifier and then there exists a function h M such that h f = g . To get the desired result, define a function h in T ρ ( X , P ) by
x h = x if x 5 , x + 4 if x > 5 .
Thus, we write h as
h = 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2 3 4 5 10 11 12 13 14 15 16 17 18 19 .
Clearly, h M . Therefore,
h f = 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2 3 4 5 10 11 12 13 14 15 16 17 18 19
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2 5 4 3 6 7 6 7 8 9 10 11 12 13
= 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 1 2 5 4 3 8 9 10 11 12 13 14 15 16 13 = g .
Theorem 3.
Let P = { X i i Λ } be a partition on a set X. A function f is a right magnifier of T ρ ( X , P ) if and only if f is surjective but not injective and for any ( x , y ) ρ , there exists ( a , b ) ρ such that x = a f and y = b f .
Proof. 
By Corollary 3, Lemmas 7 and 10. ☐
Theorem 4.
Let P be a partition and ρ be an equivalence relation on a set X such that X / ρ is a refinement of P . There exists a right magnifier in T ρ ( X , P ) if and only if X i is infinite for some i Λ .
Proof. 
The necessity is obtained by Lemma 9. On the other hand, suppose that there exists X i P such that | X i | is infinite.
Case 5. There exists t X such that ( X i , t ) is infinite. Then, there is a proper subset A of ( X i , t ) such that | A | = | ( X i , t ) | = | ( X i , t ) \ A | . Thus, there is a bijective function g from A to ( X i , t ) . Define a function f by
x f = x g if x A , x otherwise .
Clearly, f T ρ ( X , P ) and f is surjective. Since ( X \ ( X i \ A ) ) f = X , f is not injective. By Theorem 3, f is a right magnifier.
Case 6. ( X i , t ) is finite for all t X .
Case 6(i). There is a natural number n such that K = { ( X i , t ) t X i and | ( X i , t ) | = n } is infinite. Then, there exists a proper subset K of K such that | K | = | K | = | K \ K | . There is a bijective function λ from K to K. Thus, | A | = | A λ | = n for all A K . Hence, for all A K , there exists a bijective function γ A from A to A λ . Let γ = A K γ A . Then, γ is a bijection from A K A to A K A . Define a function f by
x f = x γ if x A K A , x otherwise .
Clearly, f belongs to T ρ ( X , P ) and f is surjective. Since ( X \ ( A K A \ A K A ) ) f = X , f is not injective. By Theorem 3, f is a right magnifier.
Case 6(ii). For all n N , the set K = { ( X i , t ) t X i and | ( X i , t ) | = n } is finite. Then, for each t X , there exists t X such that | ( X i , t ) | < | ( X i , t ) | . Let E = { ( X i , t ) [ t ] ρ X i } . In this case, E is an infinite set. Let n 1 = min ( X i , t ) E | ( X i , t ) | and K 1 = { ( X i , t ) | ( X i , t ) | = n 1 } . Choose ( X i , t 1 ) K 1 . Let n 2 = min ( X i , t ) E 1 | ( X i , t ) | where E 1 = E \ K 1 and K 2 = { ( X i , t ) | ( X i , t ) | = n 2 } . Choose ( X i , t 2 ) K 2 . Proceeding in this way, we obtain the sets ( X i , t 1 ) , ( X i , t 2 ) , , ( X i , t k ) , and positive integers n 1 , n 2 , , n k , such that n k = min ( X i , t ) E k | ( X i , t ) | where E k = E \ l = 1 k 1 K l and ( X i , t k ) K k , where K k = { ( X i , t ) | ( X i , t ) | = n k } for all k 2 . Clearly, n 1 < n 2 < . . . < n k < . . . . Next, we let A = { ( X i , t j ) j 1 } . Then, | ( X i , t j ) | < | ( X i , t j + 1 ) | for all j 1 . Hence, there exists a surjection γ j : ( X i , t j ) ( X i , t j 1 ) for all j 2 . Let γ = j 2 γ j . Then, γ is a surjection from B A B \ ( X i , t 1 ) to B A B . Next, define a function f by
x f = x γ if x B A B \ ( X i , t 1 ) , x otherwise .
Clearly, f T ρ ( X , P ) and f is a surjection. Since ( X i , t 1 ) f = ( X i , t 1 ) = ( X i , t 2 ) f , f is not injective. By Theorem 3, f is a right magnifier. ☐

4. Conclusions

Let P = { X i i Λ } be a partition on a nonempty set X . If X i is finite for all i Λ , then neither a left magnifier nor a right magnifier exists in T ρ ( X , P ) . Assume that X i is infinite for some i Λ . Each of the following statements holds true:
  • If X / ρ is a refinement of P , then f is a left magnifier if and only if f T ρ ( X , P ) is injective but not surjective and for any x , y X , ( x f , y f ) ρ implies ( x , y ) ρ .
  • A function f T ρ ( X , P ) is a right magnifier if and only if f is surjective but not injective and for any x , y X , ( x , y ) ρ implies x = a f and y = b f for some ( a , b ) ρ .
  • Magnifiers exist in T ρ ( X , P ) if and only if X i is infinite for some i Λ , provided that X / ρ is a refinement of P .

Author Contributions

Conceptualization, T.K., M.P., and R.C.; Investigation, T.K., M.P., and R.C.; Writing—Original Draft Preparation, T.K., M. P. and R.C.; Writing—Review and Editing, T.K., M.P., and R.C.; Supervision, R.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the Algebra and Applications Research Unit, Department of Mathematics and Statistics, Faculty of Science, Prince of Songkla University.

Acknowledgments

The authors would like to express our appreciation to the anonymous referees for the comprehensive reading of this paper and their valuable comments and suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ljapin, E.S. Semigroups (Translations of Mathematical Monographs Vol 3); American Mathematical Society: Providence, RI, USA, 1963; Available online: https://biblio.co.uk/book/semigroups-translations-mathematical-monographs-vol-3/d/1176723340 (accessed on 24 March 2020).
  2. Catino, F.; Migliorini, F. Magnifying elements in semigroups. Semigroup Forum 1992, 44, 314–319. [Google Scholar] [CrossRef]
  3. Magill, K.D., Jr. Magnifying elements of transformation semigroups. Semigroup Forum 1994, 48, 119–126. [Google Scholar] [CrossRef]
  4. Gutan, M. Semigroups with strong and nonstrong magnifying elements. Semigroup Forum 1996, 53, 384–386. [Google Scholar] [CrossRef]
  5. Gutan, M. Semigroups which contain magnifying elements are factorizable. Commun. Algebra 1997, 25, 3953–3963. [Google Scholar] [CrossRef]
  6. Chinram, R.; Petchkaew, P.; Baupradist, S. Left and right magnifying elements in generalized semigroups of transformations by using partitions of a set. Eur. J. Pure Appl. Math. 2018, 11, 580–588. [Google Scholar] [CrossRef]
  7. Luangchaisri, P.; Changphas, T.; Phanlert, C. Left (right) magnifying elements of a partial transformation semigroup. Asian-Eur. J. Math. 2020, 13. [Google Scholar] [CrossRef]
  8. Araujo, J.; Konieczny, J. Semigroups of transformations preserving an equivalence relation and a cross section. Commun. Algebra 2004, 32, 1917–1935. [Google Scholar] [CrossRef] [Green Version]
  9. Pei, H. Regularity and Green’s relations for semigroups of transformation that preserving an equivalence. Commun. Algebra 2005, 33, 109–118. [Google Scholar]
  10. Pei, H.; Zou, D. Green’s equivalences on semigroups of transformations preserving order and an equivalence relation. Semigroup Forum 2005, 71, 241–251. [Google Scholar]
  11. Pei, H.; Deng, W. A note on Green’s relations in the semigroups T(X,ρ). Semigroup Forum 2009, 79, 210–213. [Google Scholar] [CrossRef]
  12. Sun, L.; Pei, H. Green’s relations on semigroups of transformations preserving two equivalence relations. J. Math. Res. Expo. 2009, 29, 415–422. [Google Scholar]
  13. Pei, H.; Deng, W. Naturally ordered semigroups of partial transformations preserving an equivalence relation. Commun. Algebra 2013, 41, 3308–3324. [Google Scholar]
  14. Sun, L.; Deng, W.; Pei, H. Naturally ordered transformation semigroups preserving an equivalence relation and a cross-section. Algebra Colloq. 2011, 18, 523–532. [Google Scholar] [CrossRef]
  15. Kaewnoi, T.; Petapirak, M.; Chinram, R. Magnifying elements in a semigroup of transformations preserving equivalence relation. Korean J. Math. 2019, 27, 269–277. [Google Scholar]
  16. Kaewnoi, T.; Petapirak, M.; Chinram, R. On magnifying elements in E-preserving partial transformation semigroups. Mathematics 2018, 6, 160. [Google Scholar] [CrossRef] [Green Version]

Share and Cite

MDPI and ACS Style

Kaewnoi, T.; Petapirak, M.; Chinram, R. Magnifiers in Some Generalization of the Full Transformation Semigroups. Mathematics 2020, 8, 473. https://doi.org/10.3390/math8040473

AMA Style

Kaewnoi T, Petapirak M, Chinram R. Magnifiers in Some Generalization of the Full Transformation Semigroups. Mathematics. 2020; 8(4):473. https://doi.org/10.3390/math8040473

Chicago/Turabian Style

Kaewnoi, Thananya, Montakarn Petapirak, and Ronnason Chinram. 2020. "Magnifiers in Some Generalization of the Full Transformation Semigroups" Mathematics 8, no. 4: 473. https://doi.org/10.3390/math8040473

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop