Regularity and Green’s relations for the semigroup of partial
contractions of a finite chain
**B. Ali, A. Umar and M. M. Zubairu 111Corresponding Author. Email: aumar@pi.ac.ae
***Department of Mathematics, Nigerian Defence Academy, Kaduna
[email protected]
Department of Mathematics, The Petroleum Institute, Sas Nakhl,
Khalifa University of Science and Technology, P. O. Box 2533 Abu Dhabi, UAE
[email protected]
Department of Mathematics, Bayero University Kano, P. M. Box 3011 Kano Nigeria
[email protected]
Abstract
Let [n]={1,2,…,n} be a finite chain and let Pn be the semigroup of partial transformations on [n]. Let CPn={α∈Pn:(for all x,y∈Dom α) ∣xα−yα∣≤∣x−y∣}, then CPn is a subsemigroup of Pn. In this paper, we give a necessary and sufficient condition for an element in
Pn to be regular and characterize all the Green’s equivalences on the semigroup CPn.
2010 Mathematics Subject Classification. 20M20.
1 Introduction and Preliminaries
Let [n]={1,2,…,n} be a finite chain, a map α which has domain and range both subsets of [n] is said to be a (partial) transformation. The collection of all partial transformations of [n] is known as the semigroup of partial transformations, usually denoted by Pn. A map α∈Pn is said to be order preserving (resp., order reversing) if (for all x,y∈Dom α) x≤y implies xα≤yα (resp. xα≥yα); is order decreasing if (for all x∈Dom α) xα≤x; is an isometry (i. e., * distance preserving*) if (for all x,y∈Dom α) ∣xα−yα∣=∣x−y∣; a contraction if (for all x,y∈Dom α) ∣xα−yα∣≤∣x−y∣. Let
[TABLE]
and
[TABLE]
be the subsemigroups of partial contractions and of order preserving partial contractions of [n], respectively. A general study of these semigroups was first proposed in 2013 by Umar and AlKharousi [16] (a research proposal supported by a grant from The Research Council of Oman - TRC). Umar and AlKharousi [16] proposed among other things, notations for these semigroups and their subsemigroups as such we maintain the same notations in this paper.
For standard and basic concepts in semigroup theory, we refer the reader to Howie [7] and Higgins [6].
Regularity and Green’s relations on the semigroup Pn and its various subsemigroups have been studied by many authors, see for example, [3, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18]. It is now the case that whenever one encounters a new class of semigroups, the first question usually raised is about its Green’s equivalences. Recently, Zhao and Yang [18] characterized regular elements and all the Green’s equivalences on CPOn, where they refer to our“contractions” as“compressions”. However, so far, nothing has been done on regularity and Green’s relations for the new semigroup CPn. In this paper, in Section 2, we give necessary and sufficient conditions for an element in CPn to be regular and in Section 3, we describe all the Green’s equivalences. Most of the results concerning regularity and Green’s relations of subsemigroups of CPn can be deduced from the results obtained in this paper. We have demonstrated this assertion in Section 4 by deducing the results of Zhao and Yang [18]. For the remainder of this section we prove some preliminary results that will be needed later.
Let α be in CPn and let Domα, Im α and h (α) denote the domain of α, image of α and ∣Im α∣, respectively. For α,β∈CPn, the composition of α and β is defined as x(α∘β)=((x)α)β for any x in Dom α. Without ambiguity, we shall be using the notation αβ to denote α∘β.
Next, let A, B be any nonempty subsets of [n]. A is said to precede B written as A≺B if a<b for arbitrary a∈A, b∈B or minA<minB. Thus, if a<b for arbitrary a∈A, b∈B then A≺B coincides with the natural partial ordering and we can write A<B instead of (A≺B) otherwise we maintain the notation (A≺B).
Further, given any transformation α in Pn, domain of α is partitioned into p−blocks by the relation ker α={(x,y)∈[n]×[n]:xα=yα}, i. e., if
[TABLE]
then Ai (1≤i≤p) are equivalence classes under the relation ker α. Thus, aiα=xi for all ai∈Ai (1≤i≤p). The collection of all the equivalence classes of the relation ker α, is the partition of the domain of α, and is denoted by Ker α, i. e., Ker α={A1,A2,…Ap} and Dom α=A1∪A2∪…Ap where (p≤n). We now have the following lemma.
Lemma 1.1**.**
Let A and B be any disjoint subsets of [n] then there exist a′∈A and b′∈B such that ∣a′−b′∣≤∣a−b∣ for all a∈A, b∈B.
Proof.
Define a set as (A−B)′={∣a−b∣:a∈A,b∈B}, clearly (A−B)′ is a subset of N. The result now follows by the well ordering property of N.
∎
Now, let α be as defined in (3) and Ker α=(Ai)i∈[p]={A1≺A2≺…≺Ap} be the partition of Dom α ordered with the relation ≺. A subset Tα of [n] is said to be a transversal of the partition Ker α if ∣Tα∣=p, and ∣Ai∩Tα∣=1 (1≤i≤p). A transversal Tα is said to be relatively convex if for all x,y∈Tα with x≤y and if x≤z≤y (z∈Dom α), then z∈Tα. Notice that every convex transversal is necessarily relatively convex but not vice-versa.
A transversal Tα is said to be admissible if for any ti,tj∈Tα={ti: ti∈Ai, 1≤i≤p}, ∣ti−tj∣≤∣ai−aj∣ for all ai∈Ai, aj∈Aj (i,j∈{1,2,…,p}).
In other words, a transversal Tα is admissible if and only if the map Ai↦ti (ti∈Tα,i∈{1,2,…,p}) is a contraction. Notice that every convex transversal
is admissible but not vice-versa.
For the purpose of illustration, consider the following transformations:
\alpha_{1}=\left(\begin{array}[]{cccc}\{1,2,10,23\}&\{4,12\}&\{6,14\}&\{7,16,17\}\\
8&6&4&3\end{array}\right),
\alpha_{2}=\left(\begin{array}[]{ccc}\{1,5,30\}&\{2,12,10\}&\{4,16\}\\
8&7&9\end{array}\right), \alpha_{3}=\left(\begin{array}[]{ccc}\{1,7,21\}&\{2,8,20\}&\{3,9,19\}\\
3&4&5\end{array}\right).
The partition Ker α1 has an admissible transversal {2,4,6,7}. Next, for the transformation α2, none of the transversals of Ker α2 is admissible.
Now consider α3. The transversals {1,2,3}, {7,8,9} and {19,20,21} are all admissible and convex.
Remark 1.2**.**
We observe the following:**
(i)
Every convex transversal is an admissible transversal, but the converse is not true*;*
(ii)
Every partition Ker α, of Dom α in CPn of height 2 has an admissible transversal. This follows from Lemma(1.1);**
(iii)
Every admissible transversal is relatively convex*.*
Next, we have the following lemma:
Lemma 1.3**.**
For n≥4, let α∈CPn be such that there exists k∈{2,…,p−1} (3≤p≤n) and ∣Ak∣≥2. If Ai<Aj (i<j) for all i,j∈{1,2,…,p} then the partition Ker α={A1,A2,…,Ap} of Dom α has no relatively convex transversal.
Proof.
Let Ker α={A1,A2,…,Ak−1,Ak,Ak+1,…,Ap} be partition of Dom α such that ∣Ak∣≥2 where 2≤k≤p−1. Suppose Ai<Aj (i<j) for all i,j∈{1,2,…,p}.
Suppose by way of contradiction that Ker α has a relatively convex transversal
Tα={t1,t2,…,tk−1,tk,tk+1,…,tp} (ti∈Ai for all 1≤i≤p). Now since ∣Ak∣≥2, it means that there exists ak∈Ak with ak=tk and ak∈Tα. Suppose ak<tk. Notice that every element in Ak−1 is less than every element in Ak, in particular tk−1<ak<tk. This contradicts the fact that Tα is relatively convex. On the other hand, suppose tk<ak. Notice also that Ak<Ak+1, thus tk<ak<tk+1. This also contradicts the fact that Tα is relatively convex and hence the result follows.
∎
Corollary 1.4**.**
For n≥4, let α∈ORCPn be such that (for p≥3) there exists k∈{2,…,p−1} and ∣Ak∣≥2. Then the partition Ker α={A1,A2,…,Ap} of Dom α has no relatively convex transversal.
Lemma 1.5**.**
Let α∈CPn be such that Ai<Aj for all i<j in {1,2,…,p} (for
p≥3). If ∣Ai∣=1 for all 2≤i≤p−1 then the partition Ker α of Dom α has an admissible transversal Tα.
Proof.
Take Tα={ai:2≤i≤p−1}∪{maxA1, minAp}. Clearly, \theta=\left(\begin{array}[]{ccccc}A_{1}&a_{2}&\ldots&a_{p-1}&A_{p}\\
\max A_{1}&a_{2}&\ldots&a_{p-1}&\min A_{p}\end{array}\right) is a contraction. Hence Tα is admissible.
∎
A map α∈Pn is said to be an isometry if and only if ∣xα−yα∣=∣x−y∣ for all x,y∈Dom α. If we consider α as defined in (3), then α is an isometry if and only if ∣xi−xj∣=∣ai−aj∣ for all ai∈Ai and aj∈Aj (i,j∈{1,2,…,p}). Notice that this forces the blocks Ai (i=1,…,p) to be singletons, because α is one−one. In other words α is an isometry if and only if Dom α={ai:1≤i≤p}={xi+e:1≤i≤p}=(Dom α)α+e (called a translation) or Dom α={ai:1≤i≤p}={xp−i+1+e:1≤i≤p}=(Dom α)α+e (called a reflection) for some integer e.
Now let α∈Pn be as defined in (3) (1≤p≤n). Then we have by the definition of contraction the following lemma:
Lemma 1.6**.**
An element α in Pn is a contraction if and only if ∣xi−xj∣≤∣a−b∣ for all a∈Ai and b∈Aj (i,j∈{1,2,…,p}).
The next lemma gives a characterization of contractions with an admissible transversal.
Lemma 1.7**.**
Let α∈Pn be such that Ker α has an admissible transversal, Tα. Then α is a contraction if and only if ∣xi−xj∣≤∣ti−tj∣ for all ti,tj∈Tα for all i,j∈{1,2,…,p}.
Proof.
Suppose α∈Pn is such that Ker α has an admissible transversal, Tα. Further, suppose that α is a contraction. Then by Lemma(1.6), ∣xi−xj∣≤∣ai−aj∣ for all ai∈Ai and aj∈Aj (for all i,j∈{1,2,…,p}). Thus in particular, ∣xi−xj∣≤∣ti−tj∣.
Conversely, suppose ∣xi−xj∣≤∣ti−tj∣ for all ti,tj∈Tα for some Tα. Notice that ∣ti−tj∣≤∣ai−aj∣ for all ai∈Ai and aj∈Aj ( for all i,j∈{1,2,…,p}). Thus ∣xi−xj∣≤∣ti−tj∣≤∣ai−aj∣. The result follows from Lemma(1.6).
∎
Lemma 1.8**.**
Let α∈CPn and let A be a convex subset of Dom α. Then Aα is convex.
Proof.
Let α∈CPn such that A⊆Dom α is convex. Suppose by way of contradiction that Aα is not convex. That is to say, there exist x, z∈Aα with x<z<y for some z∈[n]∖Aα. Let (z−1] and [z+1) be the lower and upper saturations of z−1 and z+1, respectively. Note that, x∈(z−1] and y∈[z+1). Also note that, (z−1]α−1=Dom α=[z+1)α−1, but (z−1]α−1∪[z+1)α−1=Dom α. If (z−1]α−1 is convex then, since (z−1]α−1=Dom α, there exist either (i) an element a in (z−1]α−1 and a+1 in (z+1]α−1; or (ii) a in (z−1]α−1 and a−1 in (z−1]α−1.
Case i: Clearly aα≤z−1 and (a+1)α≥z+1 so that,
[TABLE]
which is a contradiction.
Case ii: it is clear that aα≤z−1 and (a−1)α≥y+1 so that
[TABLE]
which is another contradiction.
Now if (z−1]α−1 is not convex then there exists a∈(z−1]α−1 and either a+1∈(z+1]α−1 or a−1∈(z+1]α−1. In the former, we see that aα≤z−1 and (a+1)α≥z+1. Therefore,
[TABLE]
which is a contradiction. In the letter, we see that aα≤z−1 and (a−1)α≥z+1. Thus,
[TABLE]
which is another contradiction. Hence the result follows.
∎
Corollary 1.9** ([2], lemma1.2).**
Let α∈CTn be such that ∣Im α∣=p. Then Im α is convex.
Proof.
Let α∈CTn. Notice that Dom α=[n] is convex. Thus, by Lemma(1.8) [n]α=Im α is convex.
∎
Next, we have
Lemma 1.10**.**
Let α∈Pn be as defined in (3) (3≤p≤n), such that Ker α has a convex transversal. Then α is a contraction if and only if Tα=(Tα)α+e, for some e∈Z.
Proof.
Suppose α is a contraction whose Ker α has a convex transversal, Tα. Then by Lemma(1.8) we see that (Tα)α=Imα is convex and so
Tα=(Tα)α+e, for some e∈Z.
Conversely, suppose Ker α has a convex transversal Tα such that Tα=(Tα)α+e for some e∈Z. Take i<j with ai∈Ai and aj∈Aj (i,j∈{1,2,…,p}) then
[TABLE]
or
[TABLE]
Thus, the result follows from Lemma(1.6).
∎
2 Regularity of elements in CPn
An element a in a semigroup S is said to be regular if and only if there exists a′∈S such that a=aa′a, if every element of S is regular then the semigroup S is said to be a regular semigroup. Many transformation semigroups were shown to be regular or their regular elements have been characterized [9, 10, 12, 13, 15, 17, 18]. In this section we investigate the regular elements of CPn where we give a sufficient and necessary condition for an element in the semigroup CPn and some of its subsemigroups to be regular. Recall that Zhao and Yang [18] characterized regular elements in the semigroup of order preserving partial contractions of a finite chain OCPn, but their characterization depends heavily on order preservedness.
Therefore, their characterization of regular elements would not hold in the more general semigroup CPn. To see this consider \alpha_{1}=\left(\begin{array}[]{cc}\{2\}&\{1,3,5\}\\
1&2\end{array}\right)\in\mathcal{CP}_{5}. Denote A1={2} and A2={1,3,5}, but A1<A2 or A2<A1 does not hold, as such we cannot apply the condition of Theorem 2.2 in [18]. Similarly for \alpha_{2}=\left(\begin{array}[]{ccc}\{2\}&\{1,3,5\}&\{4\}\\
1&2&3\end{array}\right)\in\mathcal{CP}_{10} the conditions of Theorem 2.2 are not satisfied. Thus, we cannot conclude by Theorem 2.2 (2) and (3) in [18] that α1 and α2 are (or are not) regular, respectively. This is due to the fact that Ai<Aj for all i,j∈{1,2,…,p} (i<j) does not hold generally for the elements of CPn. But we shall see in this section that these elements are regular.
Now we have the main result of this section:
Theorem 2.1**.**
Let α and CPn be as defined in (3) and (1), respectively, where α∈CPn. Then α is regular if and only if there exists an admissible transversal Tα of Ker α such that ∣tj−ti∣=∣tjα−tiα∣ for all tj,ti∈Tα (i,j∈{1,2,…,p}). Equivalently, α in CPn is regular if and only if there exists an admissible transversal Tα, such that the map ti↦xi (i∈{1,2,…,p}) is an isometry.
Proof.
Let α∈CPn be a regular element. Then there exists γ∈CPn such that α=αγα. Thus given any t∈{1,2,…,p}, xt=Atα=(Atα)γα=(xtγ)α, i. e., xtγ∈At for all 1≤t≤p.
Now suppose by way of contradiction that for all admissible transversals Tα of Ker α, there exist ti,tj∈Tα for some i,j∈{1,2,…,p} such that
[TABLE]
Let {C1,C2,…,Cm} (m≤n) be the kernel classes of ker γ arrange in such a way that Akα∈Ck (i. e., xk∈Ck) for k=1,2,…,p≤m. Since γ∈CPn, then ∣xiγ−xjγ∣≤∣xi−xj∣ where xi∈Ci, xj∈Cj. Also given any xk∈Ck, xkγ=ak for any ak∈Ak (1≤k≤p), in particular xkγ=tk, where tk∈Tα. Thus, xiγ=ti and xjγ=tj where ti,tj∈Tα. Observe that using (4), ∣xiγ−xjγ∣=∣ti−tj∣>∣tiα−tjα∣=∣xi−xj∣. This contradict the fact that γ is a contraction, and hence the result follows.
Conversely, suppose there exists an admissible transversal Tα such that ∣tj−ti∣=∣tjα−tiα∣ for all tj,ti∈Tα. Define a map say γ, from Im α to Tα by xkγ=tk (1≤k≤p), the claim here is that, γ is an isometry. To see this, let xi,xj∈Dom γ (i,j∈{1,2,…,p}). Then, ∣xiγ−xjγ∣=∣ti−tj∣=∣tiα−tjα∣=∣xi−xj∣, as such γ is an isometry and for any a∈Ak (1≤k≤p), aαγα=xkγα=tkα=aα. Thus α is regular.
∎
As a consequence of the above theorem, we give the following definition. An admissible transversal Tα is said to be good if there is an isometry from Tα to Im α. Thus, an element α in CPn is regular if and only if α has a good transversal. Moreover, it is not difficult to see that every convex transversal is good. We conclude the section with the following (now) obvious result:
Corollary 2.2**.**
The semigroup CPn (n≥3) is not regular.
3 Green’s Relations for the semigroup CPn
Let S be a semigroup and a,b∈S. If S1a=S1b (i. e., a and b generate the same principal left ideal) then we say that a and b are related by L and we write (a,b)∈L or aLb, if aS1=bS1 (i. e., a and b generate the same principal right ideal) then we say a and b are related by R and we write (a,b)∈R or aRb and if S1aS1=S1bS1 (i. e., a and b generate the same principal two sided ideal) then we say a and b are related by J and we write (a,b)∈J or aJb. Each of the relations L, R and J is an equivalence on S. The relations H=L∩R and D=L∘R are also equivalences on S. These five equivalences are known as Green’s relations, first introduced by J. A. Green in 1951 [4].
To begin our investigation we introduce the following concept. A subset A of [n] is said to be translated by an integer e written as A+e if A+e={a+e:a∈A}.
For two subsets A and B of [n], A and B are said to be e−translates if and only if B=A+e for some e∈Z.
Now, as in (3) let α and β in CPn be expressed as:
[TABLE]
Then Dom α and Dom β are said to be e−translates if and only if Ai=Bi+e (i∈{1,2,…,p}) for some e∈Z. Similarly, Im α and Im β are said to be e−translates if and only if Im β=Im α+e (or Biβ=Aiα+e) for all 1≤i≤p, for some e∈Z.
Next, let α and β∈CPn (1≤p≤n) be as defined in (5), then we introduce further the following concept which helps towards characterizing the Green’s L-relation in CPn.
A partition Ker γ (for γ∈Pn) is said to be a refinement of the partition Ker α if ker γ⊆ker α. Thus, if Ker γ={A1′,A2′,…,As′} and Ker α={A1,A2,…,Ap} then p≤s.
A refined partition Ker γ of Ker α is said to be* maximum*, if ker γ⊆ker α and every refined relation of ker α say ker θ is contained in ker γ. Moreover, if there are at least two maximal relations say ker τi (i≥2) contained in ker α, then ker γ is maximum if ker γ=i≥2∩ker τi. A maximum refined partition Ker γ of Ker α is said to be admissible if it has an admissible transversal.
We immediately have the following lemma:
Lemma 3.1**.**
For every α∈CPn, Ker α has a maximum finer partition say Ker γ (for some γ∈CPn) with an admissible transversal.
Proof.
Let α∈CPn with Ker α={A1,A2,…,Ap} either ordered with the usual ordering or not, so there are two cases to consider:
Case i. Suppose Ker α is ordered with the usual order. Thus, Ker α={A1<A2<…<Ap}. If Ai={ai} for all i∈{2,…,p−1} then take Ker γ=Ker α={A1<{a2}<…<{ap−1}<Ap} for some γ∈CPn and observe that if we take Tγ={maxA1<a2<…<ap−1<minAp}, then the map \theta=\left(\begin{array}[]{ccccc}A_{1}&a_{2}&\ldots&a_{p-1}&A_{p}\\
\max A_{1}&a_{2}&\ldots&a_{p-1}&\min A_{p}\end{array}\right) is a contraction and hence Ker γ is admissible. Notice that any admissible finer relation of ker α is contain in the relation ker γ. Thus, Ker γ is maximum admissible finer partition.
If ∣Ai∣>1 for some i∈{2…,p−1}, then let C=i=1∪p−1Ai={a2<…<as} ( for some s>p) and take Ker γ={A1<{a2}<…<{as}<Ap} for some γ∈CPn and observe that if we take Tγ={maxA1<a2<…<as<minAp}, then the map \theta=\left(\begin{array}[]{ccccc}A_{1}&a_{2}&\ldots&a_{s}&A_{p}\\
\max A_{1}&a_{2}&\ldots&a_{s}&\min A_{p}\end{array}\right) is a contraction and hence Ker γ is admissible. Notice that any admissible finer relation of ker α is contain in the relation ker γ. Thus, Ker γ is maximum admissible partition.
Case ii. Suppose Ker α is not ordered, where Ker α={A1,A2,…,Ap}.
If Ker α have a convex transversal, we are done, we take Ker γ=Ker α and it is maximum and admissible.
If Ker α have a relatively convex transversal which is admissible, we are also done, take Ker γ=Ker α and it is maximum.
Now suppose Ker α have no convex or admissible relatively convex transversal. If there exists a convex block Ak of order j (j<n) for some k=1,…,p in the Ker α, we partition Ak into singleton blocks {aki} and let Ker γ={A1,…,Ak−1,{ak1},{ak2},…,{akj},Ak+1,…,Ap}, then we can check wether Ker γ have an admissible transversal, if it does then we are done and if it does not, we then partition Ak−1 (or Ak+1) into singleton blocks, and we continue in this fashion until we get one and if all fails then at least we can partition Ker α into singletons, and the resultant relation is the intersection of all maximal relations contain in ker α which is maximum and admissible. This complete the proof.
∎
Remark 3.2**.**
If α is a regular element in CPn, then in view of Theorem(4), Ker α is a maximum admissible refinement of Ker α, since it has an admissible transversal.
We now give a characterization of the Green’s L-relation on CPn as follows:
Theorem 3.3**.**
Let α,β∈CPn be as expressed in (5). Then (α,β)∈L if and only if Ker α and Ker β have admissible finer partitions, Ker γ1 and Ker γ2 (for some γ1 and γ2 in CPn), respectively, such that there exists either a translation τi↦σi and τiα=σiβ or a reflection τi↦σs−i+1 and τiα=σs−i+1β for all i=1,…,s (s≥p), where Aα={τ1,…,τs} and Bα={σ1,…,σs}, are the admissible transversals of Ker γ1 and Ker γ2, respectively.
Proof.
Let α,β∈CPn be as expressed in (5) such that (α,β)∈L. That is to say there exist γ1, γ2∈(CPn)1 such that
[TABLE]
Let Ker γ1={A1′,A2′,…,As′} and Ker γ2={B1′,B2′,…,Bs′} (s≥p). Whereas Ker α={A1,A2,…,Ap} and Ker β={B1,B2,…,Bp}. Clearly Ker γ1 and Ker γ2 are finer partitions of Ker α and Ker β, respectively.
Now let ai∈Ai′ and aj∈Aj′ (1≤i,j,≤s) where Ai′⊆Au and Aj′⊆Av for some 1≤u,v,≤s. Then since α=γ1β, there exists bu′∈Bu, bv′∈Bv (for some 1≤u,v≤p) such that aiγ1=bu′ and ajγ1=bv′, and that aiγ1β=bu′β=aiα and ajγ1β=bv′β=aiα.
Since, γ1 is a contraction we have;
[TABLE]
Now, recall that by Lemma(3) there exists τi∈Ai′ and τj∈Aj′ such that
[TABLE]
Thus, equation (7) and (8) implies that
[TABLE]
Similarly, let bi∈Bi′ and bj∈Bj′ (1≤i,j,≤s) where Bi′⊆Bu and Bj′⊆Bv for some 1≤u,v,≤s. Then since β=γ2α, there exist au′∈Au, av′∈Av (for some 1≤u,v≤p) such that biγ2=au′ and bjγ2=av′, and that biγ2α=au′α=biβ and bjγ2α=av′α=biβ.
Since, γ2 is a contraction we have;
[TABLE]
Now, recall that by Lemma(3) there exists σi∈Bi′ and σj∈Bj′ such that
[TABLE]
Thus, equation (10) and (11) implies that
[TABLE]
Notice that, since σi∈Bi′⊂Bu and σj∈Bj′⊂Bv then from (9) we have
[TABLE]
and also since τi∈Ai′⊂Au and τj∈Aj′⊂Bv then from equation(12) we have;
[TABLE]
Now equation (13) and (14) ensure that
[TABLE]
This shows that there is an isometry from {τi∈Ai′:1≤i≤s}=Aα and {σi∈Bi′:1≤i≤s}=Bβ. Now observe that by equation (8) and (11) the maps Ai′↦τi and Bi′↦σi for all i=1,…,s are contractions. Thus, Aα and Bβ are admissible and hence Ker γ1 and Ker γ2 are admissible finer partitions of Ker α and Ker β, respectively. And equation(15) shows there is translation τi↦σi or a reflection τi↦σs−i+1 (1≤i≤s). Now we claim that if τi↦σi then τiα=σiβ, and if τi↦σs−i+1 then τiα=σiβ.
Now to show that τiα=σiβ (1≤i≤s), we suppose by way of contradiction that τiα=xi (1≤i≤s) and that, σs−u−1β=xs−u, σs−uβ=xs−u−1 and σjβ=xj ( 1≤u+1≤j≤s−u−2 and 0≤u≤s−1) where τi∈Aα, σi∈Aβ (1≤i≤s). Let Aα={τ1<τ2<…<τs}.
It is clear from (11) that Aα⊆Dom γ1 and Bβ⊆Dom γ2. Thus, τs−u−2, τs−u−1, τs−u∈Dom γ1. Notice that α=γ1β, then τs−u−2γ1=bs−u−2′, τs−u−1γ1=bs−u′ and τs−uγ1=bs−u−1′ for any bs−u−2′∈Bs−u−2′, bs−u−1′∈Bs−u−1′, bs−u′∈Bs−u′. Thus, in particular,τs−u−2γ1=σs−u−2, τs−u−1γ1=σs−u and τs−uγ1=σs−u−1. Therefore
[TABLE]
This contradicts the fact that γ1 is a contraction, as such τiα=σiβ for all 1≤i≤s. Using the same argument, we can equally show that if τi↦σs−i+1 then τiα=σp−i+1β for all 1≤i≤s.
Conversely, suppose Ker α and Ker β have a maximum admissible finer partitions, Ker γ1 and Ker γ2 (for some γ1 and γ2 in CPn) respectively. Further, let Aα={τ1,…,τs} and Bα={σ1,…,σs} be the admissible transversals of Ker γ1 and Ker γ2, respectively, such that there exists either a translation τi↦σi and τiα=σiβ or a reflection τi↦σs−i+1 and τiα=σs−i+1β for all i=1,…,s (s≥p)
If in the former, τi↦σi is a translation and τiα=σiβ (i=1,…,s), then define \gamma_{1}=\left(\begin{array}[]{cccc}A_{1}^{{}^{\prime}}&A_{2}^{{}^{\prime}}&\ldots&A_{s}^{{}^{\prime}}\\
\sigma_{1}&\sigma_{2}&\ldots&\sigma_{s}\end{array}\right) and \gamma_{2}=\left(\begin{array}[]{cccc}B_{1}^{{}^{\prime}}&B_{2}^{{}^{\prime}}&\ldots&B_{s}^{{}^{\prime}}\\
\tau_{1}&\tau_{2}&\ldots&\tau_{s}\end{array}\right). Then γ1 and γ2 are contractions since for all ai′∈Ai′, aj′∈Aj′ (i,j∈{1,…,s})
[TABLE]
and
for all bi′∈Bi′, bj′∈Bj′ (i,j∈{1,…,s})
[TABLE]
In the later, Suppose that there exists a reflection τi↦σs−i+1 and τiα=σs−i+1β for all i=1,…,s.
Define \gamma_{1}=\left(\begin{array}[]{cccc}A_{1}^{{}^{\prime}}&A_{2}^{{}^{\prime}}&\ldots&A_{s}^{{}^{\prime}}\\
\sigma_{s}&\sigma_{s-1}&\ldots&\sigma_{1}\end{array}\right) and \gamma_{2}=\left(\begin{array}[]{cccc}B_{1}^{{}^{\prime}}&B_{2}^{{}^{\prime}}&\ldots&B_{s}^{{}^{\prime}}\\
\tau_{s}&\tau_{s-1}&\ldots&\tau_{1}\end{array}\right). Then γ1 and γ2 are contractions since for all ai′∈Ai′, aj′∈Aj′ (i,j∈{1,…,s})
[TABLE]
and
for all bi′∈Bi′, bj′∈Bj′ (i,j∈{1,…,s})
[TABLE]
Now by direct computations, it follows easily that α=γ1β and β=γ2α. Thus (α,β)∈L. This complete the proof.
∎
Lemma 3.4**.**
Let S=Pn and let α,β,γ∈S such that ∣Im α∣=∣Im β∣. If α=βγ there exists γ′∈S such that ∣Im γ′∣=∣Im α∣ and α=βγ′
Proof.
Take γ′=γidIm α, then ∣Im γ′∣=∣Im α∣ and it is easy to see that α=βγ′.
∎
Next let α,β∈CPn be as expressed in (5). Then we have the following:
Theorem 3.5**.**
Let α,β∈CPn. Then (α,β)∈R if and only if ker α=ker β and there exists either a translation xi↦yi or a reflection xi↦yp−i+1 (1≤i≤p).
Proof.
Suppose (α,β)∈R, then there exist γ1, γ2∈(CPn)1 such that
[TABLE]
Thus, ker α=ker β follows easily. Since α and β have the same height, then by Lemma(3.4) we can take γ1 and γ2 of the same height as the height of α and β, and by (17) Im β must be a transversal of Kerγ1 and Im α must be a transversal of Kerγ2. Let \gamma_{1}=\left(\begin{array}[]{cccc}C_{1}&C_{2}&\ldots&C_{p}\\
x_{1}&x_{2}&\ldots&x_{p}\end{array}\right) and \gamma_{2}=\left(\begin{array}[]{cccc}D_{1}&D_{2}&\ldots&D_{p}\\
y_{1}&y_{2}&\ldots&y_{p}\end{array}\right) (1≤p≤n). Thus yt∈Ct and xt∈Dt for all 1≤t≤p. Since γ1 and γ2 are contractions, for all i,j∈{1,2,…,p} with i<j,
[TABLE]
and
[TABLE]
Thus from (18) and (19) we have ∣xi−xj∣=∣yi−yj∣. This implies that there exists a translation xi↦yi or a reflection xi↦yp−i+1 for all i∈{1,2,…,p}.
Conversely, suppose that ker α=ker β and there exists an isometry from Im α to Im β. This implies that there exists either a translation xi↦yi or a reflection xi↦yp−i+1 for all i∈{1,2,…,p}.
If the map is a translation, define γ from Im α to Im β by xiγ=yi; and if it’s a reflection, define γ by xiγ=yp−i+1 (1≤i≤p). In each case, it is easy to see that γ is an isometry.
Now suppose that xiγ=yi. Let a∈Ai (1≤i≤p), then aα=xi implies aαγ=xiγ=yi=aβ, as such α=βγ.
Similarly, suppose that xiγ=yp−i+1. Let a∈Ai (1≤i≤p), then aα=xi implies aαγ=xiγ=yp−i+1=aβ, as such α=βγ. Moreover, since γ is an isometry its inverse exists, and therefore β=αγ1−1. Hence αRβ, as required.
∎
Theorem 3.6**.**
Let α,β∈CPn be as expressed in (5). Then (α,β)∈D if and only if there exist isometries ϑ1 from Ker γ1 to Ker γ2 and ϑ2 from Im α to Im β, where Ker γ1 and Ker γ2 (for some γ1 and γ2 in CPn) are maximum admissible finer partitions of Ker α and Ker β, respectively.
Proof.
Let α,β∈CPn (1≤p≤n) be as expressed in (5).
Suppose (α,β)∈D. That is to say there exists η∈(CPn)1 such that αLη and ηRβ. Thus, by Theorem(3.3), αLη implies that there exists an isometry from the refined partition Ker γ1 of Ker α to the refined partition Ker γ2 (for some γ1,γ2∈CPn) of Ker η and τiα=δiη or τiα=δs−i+1η with τi∈Aα and δi∈Cη (where Aα,Cη denote the admissible transversals of the maximum finer partitions Ker γ1 and Ker γ2, respectively). This implies that Im α=Im η.
Furthermore, by Theorem(3.5) ηRβ implies ker η=ker β, i. e., Ker η=Ker β and there exists an isometry from Im η to Im β. Now since Ker η=Ker β it means that Ker γ2 is the maximum admissible refined partition of Ker β. Hence there exists an isometry from Ker γ1 to Ker γ2.
Note also that, Im α=Im η and recall that there exists an isometry from Im η to Im β, this implies that there exists an isometry from Im α to Im β.
Conversely, suppose there exists an isometry ϑ1 from Ker γ1 to Ker γ2 and also there exists an isometry ϑ2 from Im α to Im β. If ϑ2 is a reflection, i. e., xiϑ2=yp−i+1 for all 1≤i≤p, then define a map say γ as:
[TABLE]
Then γ is a contraction and it easily follows from Theorem(3.3) and (3.5) that αLγ and γRβ. Hence (α,β)∈D.
If ϑ2 is a translation, i. e., xiϑ2=yi for all 1≤i≤p, then define a map say γ as \gamma=\left(\begin{array}[]{cccc}B_{1}&B_{2}&\ldots&B_{p}\\
x_{1}&x_{2}&\ldots&x_{p}\end{array}\right). Then it is easy to see that γ is a contraction and it follows from Theorem(3.3) and (3.5) that αLγ and γRβ. Hence (α,β)∈D.
∎
Let α and β be regular elements in CPn and be as expressed in (5). Then as a consequence of Theorem(3.3), (3.5), (3.6) and Remark(3.2) we have:
Corollary 3.7**.**
Let α,β∈CPn be regular elements.
(α,β)∈L* if and only Im α=Im β.*
(α,β)∈R* if and only Ker α=Ker β.*
(α,β)∈D* if and only xi=yi+e or xi=yp−i+1+e (i=1,2,…,p) for some e∈Z.*
4 Semigroup of order reversing partial contractions
We recall that a map α∈Pn is said to be order preserving if (for all x,y∈Dom α) x≤y implies xα≤yα. The collection of all order preserving contractions of a finite chain [n] is denoted by OCPn={α∈CPn:(for all x,y∈Dom α) x≤y implies xα≤yα} and is a subsemigroup of CPn. In 2013, Zhao and Yang [18] studied this semigroup, where they referred to our “contractions” as “compressions” and they characterized the Green’s equivalences and gave a necessary and sufficient condition for an element to be regular. In this section, we deduce the regularity and Green’s relations characterizations of this semigroup from the results already obtained for the larger semigroup CPn. However, before we do that, we establish the following crucial lemma.
Lemma 4.1**.**
Let \alpha=\left(\begin{array}[]{cccc}A_{1}&A_{2}&\ldots&A_{p}\\
x_{1}&x_{2}&\ldots&x_{p}\end{array}\right)\in\mathcal{ORCP}_{n}~{}(1\leq p\leq n). Then the following statements are equivalent:
maxA1−x1=minAp−xp=d* and Ai={xi+d} (i=2,…,p−1), or maxA1−xp=minAp−x1=d and Ai={xp−i+1−d} (i=2,…,p−1);*
Ker α* has a good transversal.*
Proof.
Suppose (i) holds. In the former, it means that Ker α={A1<{x2+d}<…<{xp−1+d}<Ap}. Take Tα={maxA1<x2+d<…<xp−1+d<minAp}. Then clearly Tα is a relatively convex transversal of Ker α and the map \theta=\left(\begin{array}[]{ccccc}A_{1}&x_{2}+d&\ldots&x_{p-1}+d&A_{p}\\
\max A_{1}&x_{2}+d&\ldots&x_{p-1}+d&\min A_{p}\end{array}\right) is clearly a contraction. Thus, Tα is admissible. Next, define a map say γ as;
[TABLE]
Clearly, γ is an isometry since γ=α∣Tα and d=maxA1−x1=(xi+d)−xi=minAp−xp (i=2,…,p−1). Hence Tα is good.
In the latter, Ker α={Ap<{xp−1−d}<{xp−2−d}<…<{x2−d}<A1}. Take Tα={maxA1<xp−1−d<xp−2−d<…<x2−d<minAp}. Then clearly Tα is a relatively convex transversal of Ker α and the map \theta^{\prime}=\left(\begin{array}[]{ccccc}A_{p}&x_{p-1}-d&\ldots&x_{2}-d&A_{1}\\
\max A_{1}&x_{p-1}-d&\ldots&x_{2}-d&\min A_{p}\end{array}\right) is a contraction. Thus, Tα is admissible. Next, define a map say γ′ as
[TABLE]
Clearly, γ′ is a reflection of γ which is also an isometry. Thus, Tα is good, as required.
Conversely, suppose Tα is good. This means that Tα={t1,t2,…,tp} is an admissible relatively convex transversal of Kerα with 1≤maxA1=t1<t2<…<tp=minAp≤n and the map ti↦xi (1≤i≤p) is an isometry. If 1≤x1<x2<…<xp≤n then minAp−maxA1=∣minAp−maxA1∣=∣tp−t1∣=∣xp−x1∣=xp−x1 i. e., minAp−maxA1=xp−x1 or minAp−xp=maxA1−x1=d.
Notice that; ∣ti−tj∣=∣xi−xj∣ (i,j∈{2,…,p−1}). This means that if (without loss of generality) i<j then tj−ti=xj−xi which implies tj−xj=ti−xi=d if and only if ti=xi+d. Thus, Ai={xi+d} (2≤i≤p−1).
The same result is obtained if n≥x1>x2>…>xp≥1.
∎
Next, in view of the above lemma, we deduce the corresponding results for regularity of elements in the semigroups of order preserving partial contractions and order reversing partial contractions, OCPn and ORCPn, respectively, from Theorem(2.1).
Corollary 4.2**.**
Let S=ORCPn and α∈S. If ∣Im α∣≥3, then α is regular if and only if either minAp−xp=maxA1−x1=d and Ai={xi+d} or minAp−x1=maxA1−xp=d and Ai={xp−i+1+d}, for i=2,…,p−1.
As a consequence of the above corollary we have:
Corollary 4.3** ([18], Theorem 2.2 (3)).**
Let S=OCPn and α∈S. If ∣Im α∣≥3, then α is regular if and only if minAp−xp=maxA1−x1=d and Ai={xi+d}, for i=2,…,p−1.
We conclude the characterizations of the regular elements in S=ORCPn with the following (now) obvious result:
Corollary 4.4**.**
The semigroup ORCPn (n≥3) is not regular.
Next, we deduce the characterizations of Green’s equivalences obtained in [18] from our results in the previous section. First, let us prove the following lemma.
Lemma 4.5**.**
Let α, β in ORCPn be as expressed in (5). Then the following statements are equivalent:
Let maxA1−maxB1=d. If minAp−minBp=d and Ai=Bi+d for all i=2,…,p−1 then α and β are of the same kernel type (denoted as αKerβ in **[18]**);
There exists a contraction from Ker γ1={A1<a2<…<as<Ap} to Ker γ2={B1<b2<…<bs<Bp}, where Ker γ1 and Ker γ2 are the maximum admissible refined partitions of Ker α and Ker β, respectively. Moreover, i=2∪p−1Ai={a2,…,as} and i=2∪p−1Bi={b2,…,bs} for some s≥p−2 where
Aα={{maxA1}<a2<…<as<min{Ap}} and Bβ={{maxB1}<b2<…<bs<{minBp}} are admissible transversals of Ker γ1 and Ker γ2, respectively.
Proof.
Suppose (i) holds. Define a map γ from Ker γ1 to Ker γ2 by
[TABLE]
Clearly γ is well defined and we claim that γ is a contraction. To see this, let x,y∈Dom γ=A1∪{a2}∪…∪{as−2}∪Ap. Then there are five cases to consider:
Case i: If x=y then ∣xγ−yγ∣=∣xγ−xγ∣=0=∣x−x∣≤∣x−y∣.
Case ii: If x∈A1 and y=ai (2≤i≤s−2) then ∣xγ−yγ∣=∣maxB1−(y−d)∣=∣y−(maxB1+d)∣=∣y−maxA1∣≤∣y−x∣=∣x−y∣.
Case iii: If x∈A1 and y∈Ap then ∣xγ−yγ∣=∣maxB1−minBp∣=∣(maxA1−d)−(minAp−d)∣=∣maxA1−minAp∣≤∣x−y∣.
Case iv: If x=ai (2≤i≤s−2) and y∈Ap then ∣xγ−yγ∣=∣(x−d)−minBp∣=∣(minBp+d)−x∣=∣minAp−x∣≤∣y−x∣.
Case v: If x=ai, y=aj (i,j∈{2,…,s−2}) then ∣xγ−yγ∣=∣(x−d)−(y−d)∣≤∣x−y∣.
Thus, γ is a contraction.
Conversely, suppose there exists a contraction from Ker γ1={A1<a2<…<as−2<Ap} to Ker γ2={B1<b2<…<bs<Bp}, where Ker γ1 and Ker γ2 are the maximum admissible refined partitions of Ker α and Ker β, respectively. Moreover, i=2∪s−2Ai={a2,…,as−2} and i=2∪s−2Bi={b2,…,bs−2} for some s≥p−2 where Aα={{maxA1}<a2<…<as−2<min{Ap}} and Bβ={{maxB1}<b2<…<bs−2<{minBp}} are admissible transversals of Ker γ1 and Ker γ2, respectively. Further, let maxA1−maxB1=d=minAp−minBp. Thus, the map defined as
[TABLE]
is a translation. Hence, ai=bi+d for all 2≤i≤s−2. Note that maxA1−maxB1=d=minAp−minBp. This shows that, γ1 and γ2 are of the same kernel type which implies that α and β are of same kernel type.
∎
In view of the above result, we deduce the following corollaries to Theorems (3.3), (3.5), (3.6) and (3.7), respectively.
Corollary 4.6**.**
Let α,β∈ORCPn. Then (α,β)∈L if and only if Im α=Im β and αKerβ.
Proof.
The result for elements in ORCPn of height 1 is obvious. Thus, without loss of generality
we may suppose that ∣Im α∣≥2 and let (α,β)∈L in ORCPn. Notice that Ker α={A1<…<Ap} and Ker β={B1<…<Bp}. It follows from Theorem(3.3)(i) that there exists a translation (if α and β are order preserving) Aα↦Bβ and tiα=ti′β (1≤i≤s) or a reflection (if α or β is order reversing) Aα↦Bβ and tiα=tp−i+1′β (1≤i≤s) where ti∈Aα, ti′∈Bβ, and Aα, Bβ are admissible transversals of the refined partitions of Ker α and Ker β, respectively. Thus, by Lemma(4.5) we have αKerβ and tiα=ti′β or tiα=tp−i+1′β (1≤i≤s) implies Im α=Im β.
Conversely, suppose that Im α=Im β and αKerβ. Note that if Im α={x1<x2<…<xp}={y1<y2<…<yp}=Im β then xi=yi for all i=1,…,p.
From Lemma(4.5), we see that αKerβ implies there exists a contraction from the maximum admissible refined partitions Ker γ1 to Ker γ2 (for some γ1, γ2∈CPn) of Ker α to Ker β, respectively and that Aiα=Biβ for all i=1,…,p.
Furthermore, if Im α={x1<x2<…<xp}={y1>y2>…>yp}=Im β then xi=yp−i+1 for all i=1,…,p.
From Lemma(4.5), we see that αKerβ implies there exists a contraction from the maximum admissible refined partitions Ker γ1 to Ker γ2 (for some γ1, γ2∈CPn) of Ker α to Ker β, respectively and that Aiα=Bp−i+1β for all i=1,…,p.
Thus in any case by Theorem(3.3)(i) (α,β)∈L.
∎
Next, let α,β∈ORCPn be as expressed in (5). Then we have the following:
Corollary 4.7**.**
Let α,β∈ORCPn. Then
(α,β)∈R if and only if ker α=ker β and there exists a translation xi↦yi or a reflection xi↦yp−i+1 for all 1≤i≤p.
Proof.
The result follows directly from Theorem(3.3)(ii).
∎
Corollary 4.8**.**
Let α and β∈ORCPn. Then
(α,β)∈D if and only if there exist translations (or reflections) ϑ1 and ϑ2 from Ker γ1 to Ker γ2 and from Im α to Im β, respectively.
Proof.
It follows directly from Theorem(3.6).
∎
In view of the above result, we deduce the following corollaries to Corollaries (4.6), (4.7) and (4.8), respectively.
Corollary 4.9** ([18], Theorem 3.1).**
Let α,β∈OCPn. Then
(α,β)∈L if and only if Im α=Im β and αKerβ.
Next, let α,β∈OCPn be as expressed in (5). Then we have the following:
Corollary 4.10** ([18], Theorem 3.2).**
Let α,β∈OCPn.
Then (α,β)∈R if and only if ker α=ker β and there exists a translation xi↦yi for all 1≤i≤p.
Corollary 4.11** ([18] Theorem 3.3).**
Let α and β∈OCPn. Then
(α,β)∈D if and only if there exist translations ϑ1 from Ker γ1 to Ker γ2 and ϑ2 from Im α to Im β.
Proof.
It follows directly from Corollary(4.8) together with the fact that we only need the existence of translations from Ker γ1 to Ker γ2 and from Im α to Im β.
∎
Corollary 4.12** ([18], Theorem 3.5).**
Let α and β∈OCPn be regular elements. Then (α,β)∈D if and only if xi=yi+e (i=1,2,…,p) for some e∈Z.
Acknowledgements. The second named author would like to thank Bayero University and TET Fund for financial support. He would also like to thank The Petroleum Institute, Khalifa University of Science and Technology for hospitality during his 3-month research visit to the institution.