The transitivity of primary conjugacy in regular ω-semigroups

Xin Liu; Shoufeng Wang

doi:10.1515/math-2022-0523

Article Open Access

The transitivity of primary conjugacy in regular ω-semigroups

Xin Liu and Shoufeng Wang

Published/Copyright: November 24, 2022

Published by

Become an author with De Gruyter Brill

Submit Manuscript Author Information Explore this Subject

$Open Mathematics$

From the journal Open Mathematics Volume 20 Issue 1

Abstract

The conjugacy relation plays an important role in group theory and the conjugacy relation of groups has been generalized to semigroups in various methods by several authors. If a and b are elements of a semigroup S , then a is called primarily conjugate to b if a = u v and b = v u for some u , v ∈ S 1 . In general, primary conjugacy is reflexive and symmetric, but not transitive. Finding the classes of semigroups in which the primary conjugacy is transitive is an open problem raised by Araújo et al. in the literature. In this article, among other things we prove that the primary conjugacy is transitive in regular ω -semigroups.

Keywords: regular ω-semigroup; primary conjugacy; transitive

MSC 2010: 20M10; 20M18

1 Introduction and preliminaries

The conjugacy relation of groups has many applications in the theory of groups, such as defining normal subgroups and studying the normalizers of elements in groups. It is an interesting topic to extend the concept of conjugation in groups to semigroups. Many authors have generalized the conjugacy relation of groups to some kinds of semigroups by various methods and obtained a series of results (see [1–15]). To state some necessary results on conjugacy relations of semigroups, we need to recall the notions of various kinds of conjugacy relations of semigroups.

Let G be a group. Then the conjugacy relation ∼ on G is defined as follows: For all a , b ∈ G , a ∼ b if and only if there exists g ∈ G such that b = g − 1 a g . It is easy to see that

a ∼ b ⇔ ( ∃ g ∈ G ) a g = g b ⇔ ( ∃ u , v ∈ G ) a = u v , b = v u .

Inspired by this fact and the text [16], Lallement [17] has considered the conjugacy relations ∼ l and ∼ p on semigroups. Let S be a semigroup and a , b ∈ S . Recall that

a ∼ l b ⇔ ( ∃ g ∈ S 1 ) a g = g b

and

a ∼ p b ⇔ ( ∃ u , v ∈ S 1 ) a = u v , b = v u .

From [1], the relation ∼ p is called the primary conjugacy on S . According to Lallement [17], if S is a free semigroup, then ∼ p = ∼ l , and in this case, ∼ p is an equivalence. In a general semigroup, ∼ p is reflexive and symmetric, but not transitive. For this reason, the texts [1] and [2] investigated the transitive closure ∼ p ∗ of ∼ p and obtained some useful results. On the other hand, the relation ∼ l is reflexive and transitive, but not symmetric. In 1984, Otto [3] defined the relation ∼ o on a semigroup S as follows:

For all a , b ∈ S ,

a ∼ o b ⇔ ( ∃ g , h ∈ S 1 ) a g = g b , b h = h a .

It is easy to see that ∼ o is an equivalence on S and ∼ p ⊆ ∼ o as ( u v ) u = u ( v u ) and ( v u ) v = v ( u v ) for all u , v ∈ S 1 . Moreover, if e and f are two idempotents in S , we have e ( e f ) = e f = ( e f ) f and f ( f e ) = f e = ( f e ) e , and so e ∼ o f . Thus,

(1.1) e ∼ o f for all idempotents e and f in S .

However, if S has a zero, the ∼ o becomes the universal relation on S . To overcome this defect, Araújo et al. [4] defined the relation ∼ c on a semigroup S as follows: For all a , b ∈ S ,

a ∼ c b ⇔ ( ∃ g ∈ P ( a ) ) ( ∃ h ∈ P ( b ) ) a g = g b , b h = h a ,

where P ( 0 ) = { 0 } and

P ( x ) = { g ∈ S 1 ∣ ∀ m ∈ S 1 ( m x ≠ 0 ⇒ ( m x ) g ≠ 0 ) }

for all x ∈ S with x ≠ 0 . In view of the text [4], if S contains no zero, then ∼ c = ∼ o , and in general, ∼ c is contained in ∼ o properly. More recently, some new conjugacy relations on semigroups have been introduced and investigated, such as trace conjugacy ∼ t r for epigroups [5], i-conjugacy ∼ i for inverse semigroups [6], n -conjugacy ∼ n for general semigroups [8] and so on. Observe that ∼ i = ∼ n in inverse semigroups by [8, Theorem 2.6].

As mentioned above, the primary conjugacy ∼ p is not transitive in general semigroups. In fact, the primary conjugacy is not transitive in many well-known classes of semigroups, such as E -unitary inverse semigroups [5], polycyclic monoids [9], free inverse monoids [10], left or right patience sorting monoids [11], symmetric inverse semigroups [12,18], etc. In view of this fact, the study of ∼ p is divided into two aspects: One is to consider the descriptions of ∼ p and the transitive closure ∼ p ∗ of ∼ p for some interesting classes of semigroups (in particular, for various classes of (partial) transformation semigroups), the other is to find natural classes of semigroups in which ∼ p is transitive. For instance, Ganyushkin and Kormysheva [12] obtained the characterizations of ∼ p ∗ for finite symmetric inverse semigroups, Kudryavtseva [7] studied ∼ p ∗ for the class of regular epigroups and its some special classes, and Kudryavtseva and Mazorchuk [2] gave the descriptions of ∼ p ∗ for the full transformation semigroup and partial transformation semigroup on a finite set, symmetric inverse semigroup on a countable set and Brauer-type semigroups.

On the other hand, many authors have found some natural classes of semigroups in which ∼ p is transitive. For example, Otto [3] has proved that the primary conjugacy ∼ p is always transitive in monoids defined by special presentations (see also in Zhang [13]), and Kudryavtseva [7] has shown that ∼ p is transitive in completely regular semigroups. As a consequence, we have the following result which will be used several times in the next sections. Recall that Clifford semigroups are just semigroups that are both completely regular and inverse. It is well known that each ℋ -class is a subgroup in a Clifford semigroup and a Clifford semigroup is a strong semilattice of its ℋ -classes (see Howie [19]).

Lemma 1.1

The primary conjugacy ∼ p is transitive in Clifford semigroups.

Recently, Araújo et al. [5] have introduced the class W of semigroups which consists of semigroups S such that the subsemigroup S 2 = { a b ∣ a , b ∈ S } is completely regular, and proved that ∼ p is transitive in every epigroup in W . As a consequence, it is shown that ∼ p is transitive in the variants of completely regular semigroups. However, Example 4.19 in [5] indicates that there is an epigroup that has a variant in which ∼ p is not transitive. Based on this fact, the paper [5] has raised the following question (see Problem 6.18 in [5]): Is it true that ∼ p is transitive in the variants of the members in W ? In 2020, Borralho and Kinyon[14] provided an affirmative answer to this question (see Corollary 11 in [14]). In the same year, Borralho [15] has also shown that for semigroups satisfying x y ∈ { y x , ( x y ) n } for some fixed integer n > 1 , the primary conjugacy ∼ p is transitive.

From the aforementioned statements, we can see that it is an interesting research topic to find new classes of semigroups in which primary conjugacy is transitive. In fact, the four kinds of conjugacy relations of abstract semigroups including ∼ p , ∼ o , ∼ c , ∼ t r have already been studied systematically by Araújo et al. in [5] where the task to find new classes of semigroups in which primary conjugacy is transitive is also proposed (see Problem 6.3 in [5]). Specifically, they have raised the following question.

Problem 1.2

Find other classes of semigroups in which primary conjugacy is transitive. Describe the ( E -unitary) inverse semigroups in which primary conjugacy is transitive. Ultimately, classify the class of semigroups in which primary conjugacy is transitive.

The aim of this article is to continue the study of primary conjugacy relations of semigroups around the above problem. It is well known that the class of regular ω -semigroups is an important class of inverse monoids. Recall that a regular ω -semigroup is a regular monoid in which the idempotents form a chain that is isomorphic to the chain N 0 (the set of non-negative integers) with respect to the partial order

0 > 1 > 2 > 3 > 4 > ⋯ .

By using the classification and construction of regular ω -semigroups given in Kočin [20], Munn [21] and Reilly [22] (see also in Howie [19], Petrich [23] and McAlister and Medeiros [24]), among other things we shall prove that the primary conjugacy ∼ p is transitive in any regular ω -semigroup.

In the remainder of this section, we shall recall the classification and construction of regular ω -semigroups which are given in Kočin [20], Munn [21] and Reilly [22]. We first recall the notion of the Bruck-Reilly extension of a monoid determined by a morphism θ . Let T be a monoid with identity 1 and let θ be a morphism from T into H 1 the “group of units” of T (i.e. the ℋ -class containing 1). Then we can make N 0 × T × N 0 into a monoid with identity ( 0 , 1 , 0 ) by defining

( m , a , n ) ( p , b , q ) = ( m − n + t , ( a θ t − n ) ( b θ t − p ) , q − p + t )

where t = max { n , p } and θ 0 is interpreted as the identity map of T . From Howie [19], this semigroup is denoted by BR ( T , θ ) and called the Bruck-Reilly extension of T determined by θ . Obviously, BR ( T , θ ) contains no zero whence ∼ c = ∼ o in BR ( T , θ ) . Now we can state the constructions of regular ω -semigroups.

Lemma 1.3

[20,21] Let S be a regular ω -semigroup. If S has no kernel, then S is a Clifford semigroup. If S has kernel K and S = K (or equivalently, S is simple), then S is a Bruck-Reilly extension BR ( T , θ ) of T determined by θ where T is a Clifford monoid whose idempotents form a chain.

Lemma 1.4

[20,21] Let G 0 , … , G l − 1 be a set of pairwise disjoint groups for some non-negative integer l and let K be a simple regular ω -semigroup, disjoint from each G i , with group of units G . Write G l = G . For each i such that 0 ≤ i ≤ l − 1 , let γ i be a morphism of G i into G i + 1 . For all integers i , j with 0 ≤ i < j ≤ l , define α i , j to be γ i γ i + 1 ⋯ γ j − 1 and let α i , i be the identity automorphism of G i for all integers i with 0 ≤ i ≤ l − 1 . Let

S = G 0 ⋃ G 1 ⋃ ⋯ ⋃ G l − 1 ⋃ K .

Define a multiplication “ ∘ ” on S, extending that of K and of each G i , as follows:

a i ∘ b j = ( a i α i , t ) ( b j α j , t ) , a i ∘ x = ( a i α i , l ) x , x ∘ a i = x ( a i α i , l ) , x ∘ y = x y ,

where a i ∈ G i , b j ∈ G j , t = max { i , j } , and x , y ∈ K , i , j = 0 , 1 , … , l − 1 . Then S is a regular ω -semigroup with kernel K ≠ S , and the identity of G 0 is the identity of the whole semigroup S. Conversely, every such semigroup can be constructed in this way.

2 Primary conjugacy in Bruck-Reilly extensions

In this section, we shall explore some technical results of the primary conjugacy in Bruck-Reilly extensions. We begin our discussions by giving the lemma below.

Lemma 2.1

Let T be a monoid and S = BR ( T , θ ) the Bruck-Reilly extension of T determined by θ . Then ( m , a , m ) ∼ p ( n , b , n ) in S if and only if a ∼ p b in T for all ( m , a , m ) , ( n , b , n ) ∈ S .

Proof

Suppose that ( m , a , m ) , ( n , b , n ) ∈ S and ( m , a , m ) ∼ p ( n , b , n ) . Then there are ( u , c , v ) , ( s , d , t ) ∈ S such that

( m , a , m ) = ( u , c , v ) ( s , d , t ) = ( u − v + p , ( c θ p − v ) ( d θ p − s ) , t − s + p ) , ( n , b , n ) = ( s , d , t ) ( u , c , v ) = ( s − t + q , ( d θ q − t ) ( c θ q − u ) , v − u + q ) ,

where p = max { v , s } and q = max { t , u } . This implies that

u − v = t − s , a = ( c θ p − v ) ( d θ p − s ) , b = ( d θ q − t ) ( c θ q − u ) ,

and so v − s = u − t . If v − s ≥ 0 , then p = v and q = u . Otherwise, we have p = s and q = t . In either case, we have p − v = q − u and p − s = q − t , and hence a ∼ p b in T .

Conversely, let a ∼ p b in T . Then a = u v and b = v u with u , v ∈ T . This implies that

( m , a , n ) = ( m , u , n ) ( n , v , m ) and ( n , b , n ) = ( n , v , m ) ( m , u , n ) ,

which gives that ( m , a , m ) ∼ p ( n , b , n ) in S .□

Lemma 2.2

Let T be a monoid, S = BR ( T , θ ) the Bruck-Reilly extension of T determined by θ and ( m 1 , a , n 1 ) , ( m 2 , b , n 2 ) ∈ S such that ( m 1 , a , n 1 ) ∼ p ( m 2 , b , n 2 ) . Then m 1 − n 1 = m 2 − n 2 , say p, and at least one of the following conditions is satisfied:

There exist q ∈ Z , c , d ∈ T such that p ≤ q ≤ 0 , a = c ( d θ q − p ) , and b = d ( c θ − q ) .
There exist q ∈ Z , c , d ∈ T such that
0 ≤ q ≤ min { m 1 , n 1 } , q ≥ m 1 − m 2 , a = c ( d θ n 1 − q ) , b = ( d θ m 1 − q ) c .
There exist q ∈ Z , c , d ∈ T such that
0 ≤ q ≤ min { m 1 , n 1 } , q ≥ m 1 − m 2 , a = ( c θ m 1 − q ) d , b = d ( c θ n 1 − q ) .
There exist q ∈ Z , c , d ∈ T such that 0 ≤ q ≤ p , a = ( c θ p − q ) d and b = ( d θ q ) c .

Proof

Suppose that ( m 1 , a , n 1 ) ∼ p ( m 2 , b , n 2 ) . Then there are ( m 3 , c , n 3 ) , ( m 4 , d , n 4 ) ∈ S such that

( m 1 , a , n 1 ) = ( m 3 , c , n 3 ) ( m 4 , d , n 4 ) = ( m 3 − n 3 + t , ( c θ t − n 3 ) ( d θ t − m 4 ) , n 4 − m 4 + t ) , ( m 2 , b , n 2 ) = ( m 4 , d , n 4 ) ( m 3 , c , n 3 ) = ( m 4 − n 4 + s , ( d θ s − n 4 ) ( c θ s − m 3 ) , n 3 − m 3 + s ) ,

where t = max { n 3 , m 4 } , s = max { n 4 , m 3 } . This implies that

(2.1) m 1 = m 3 − n 3 + t , n 1 = n 4 − m 4 + t , a = ( c θ t − n 3 ) ( d θ t − m 4 ) , m 2 = m 4 − n 4 + s , n 2 = n 3 − m 3 + s , b = ( d θ s − n 4 ) ( c θ s − m 3 ) ,

and so m 1 − n 1 = m 3 − n 3 + m 4 − n 4 = m 2 − n 2 . Denote

(2.2) m 1 − n 1 = m 3 − n 3 + m 4 − n 4 = m 2 − n 2 = p .

If m 4 ≤ n 3 and m 3 ≤ n 4 , then t = n 3 and s = n 4 , and so m 1 = m 3 , m 2 = m 4 and n 2 = n 3 − m 3 + n 4 by (2.1). Let q = n 3 − n 2 . Then

0 ≥ m 3 − n 4 = q = n 3 − n 2 ≥ m 4 − n 2 = m 2 − n 2 = p .

Observe that t − m 4 = n 3 − m 2 = n 3 − n 2 − p = q − p by (2.2) and s − m 3 = n 4 − m 3 = − q , it follows that a = c ( d θ q − p ) and b = d ( c θ − q ) by (2.1) again. In this case, (i) holds.

If m 4 ≤ n 3 and m 3 ≥ n 4 , then t = n 3 and s = m 3 , and so m 1 = m 3 , n 2 = n 3 and n 1 = n 4 − m 4 + n 3 by (2.1).

This implies that

(2.3) n 4 = n 1 − n 3 + m 4 = n 1 − n 2 + m 4 = m 1 − m 2 + m 4

by (2.2). Let q = n 4 . Then by the facts that 0 ≤ m 4 ≤ n 3 and m 3 ≥ n 4 ≥ 0 ,

0 ≤ q = n 4 ≤ m 3 = m 1 , q = n 1 + m 4 − n 3 ≤ n 1 , q = m 1 − m 2 + m 4 ≥ m 1 − m 2 .

Since t − m 4 = n 3 − m 4 = n 1 − n 4 = n 1 − q by (2.3) and s − n 4 = m 3 − n 4 = m 1 − q , we have a = c ( d θ n 1 − q ) and b = ( d θ m 1 − q ) c by (2.1) again. In this case, (ii) holds.

If m 4 ≥ n 3 and m 3 ≤ n 4 , then t = m 4 and s = n 4 , and so m 2 = m 4 , n 1 = n 4 and m 1 = m 3 − n 3 + m 4 by (2.1). This yields that

(2.4) m 3 = m 1 − m 4 + n 3 = m 1 − m 2 + n 3 .

Let q = m 3 . Then by the facts m 4 ≥ n 3 ≥ 0 and 0 ≤ m 3 ≤ n 4 ,

q = m 3 ≤ n 4 = n 1 , q = m 1 + n 3 − m 4 ≤ m 1 , q = m 1 − m 2 + n 3 ≥ m 1 − m 2 .

As t − n 3 = m 4 − n 3 = m 1 − m 3 = m 1 − q by (2.4) and s − m 3 = n 4 − m 3 = n 1 − q , we obtain a = ( c θ m 1 − q ) d and b = d ( c θ n 1 − q ) by (2.1) again. In this case, (iii) is true.

If m 4 ≥ n 3 and m 3 ≥ n 4 , then t = m 4 and s = m 3 , and so n 2 = n 3 , n 1 = n 4 and m 1 = m 3 − n 3 + m 4 by (2.1). This implies that

m 3 − n 1 = m 1 + n 3 − m 4 − n 1 = m 1 − n 1 + n 3 − m 4 = n 3 − m 4 + p

by (2.2). Let q = m 3 − n 1 . Then 0 ≤ m 3 − n 4 = q = m 3 − n 1 = n 3 − m 4 + p ≤ p by the facts m 4 ≥ n 3 and m 3 ≥ n 4 = n 1 . Observe that

t − n 3 = m 4 − n 3 = m 1 − m 3 = n 1 + p − m 3 = p − q

by the fact that m 1 = m 3 − n 3 + m 4 and (2.2), and s − n 4 = m 3 − n 4 = m 3 − n 1 = q , it follows that a = ( c θ p − q ) d and b = ( d θ q ) c by (2.1) again. In this case, (iv) is valid.□

Lemma 2.3

Let T be a Clifford monoid with the identity 1 in which the idempotents form a chain, and S = BR ( T , θ ) be the Bruck-Reilly extension of T determined by θ . Then ∼ p on S is transitive.

Proof

Let ( m 1 , a , n 1 ) , ( m 2 , b , n 2 ) , and ( m 3 , c , n 3 ) be in S such that ( m 1 , a , n 1 ) ∼ p ( m 2 , b , n 2 ) and ( m 2 , b , n 2 ) ∼ p ( m 3 , c , n 3 ) . Then by Lemma 2.2, we can denote

(2.5) m 1 − n 1 = m 2 − n 2 = m 3 − n 3 = p ,

and have 16 cases including

( i , i ) , ( i , ii ) , ( i , iii ) , ( i , iv ) , ( ii , i ) , ( ii , ii ) , ( ii , iii ) , ( ii , iv ) , ( iii , i ) , ( iii , ii ) , ( iii , iii ) , ( iii , iv ) , ( iv , i ) , ( iv , ii ) , ( iv , iii ) , ( iv , iv )

to consider. In the following statements, we shall check all the cases one by one. We first observe that

( x θ k ) − 1 ( x θ k ) = ( x − 1 θ k ) ( x θ k ) = ( x − 1 x ) θ k = 1 = ( x x − 1 ) θ k = ( x θ k ) ( x − 1 θ k ) = ( x θ k ) ( x θ k ) − 1

for any positive integer k and x ∈ T .

Case 1–(i, i). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

p ≤ q 1 ≤ 0 , a = u ( v θ q 1 − p ) , b = v ( u θ − q 1 ) , p ≤ q 2 ≤ 0 , b = s ( t θ q 2 − p ) , c = t ( s θ − q 2 ) .

In this case, by (2.5) we have

(2.6) n 3 + q 2 ≥ n 3 + p = m 3 , m 1 − q 2 ≥ m 1 , n 3 + q 1 ≥ n 3 + p = m 3 , m 1 − q 1 ≥ m 1 .

(1.1) q 1 ≠ p , q 1 ≠ 0 , q 2 ≠ p , q 2 ≠ 0 . In this case, we have 2 p < q 1 + q 2 < 0 , and so p < q 1 + q 2 − p < − p . If p < q 1 + q 2 − p < 0 , then

0 < p − q 1 − q 2 < − p , a = u ( s θ q 1 − p ) ( c θ q 1 + q 2 − p − p ) [ ( s − 1 θ q 1 − p ) u − 1 ] θ − p ,

and m 1 + p − q 1 − q 2 − m 1 = p − q 1 − q 2 > 0 and

( n 3 + q 1 + q 2 − p ) − m 3 = n 3 − m 3 + q 1 + q 2 − p = q 1 + q 2 − p − p > p − p = 0

by (2.5). This implies that

( m 1 , a , n 1 ) = ( m 1 , u ( s θ q 1 − p ) , n 3 + q 1 + q 2 − p ) ( m 3 , c [ ( s − 1 θ q 1 − p ) u − 1 ] θ p − q 1 − q 2 , m 1 + p − q 1 − q 2 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ ( s − 1 θ q 1 − p ) u − 1 ] θ p − q 1 − q 2 , m 1 + p − q 1 − q 2 ) ( m 1 , u ( s θ q 1 − p ) , n 3 + q 1 + q 2 − p ) ,

which gives that ( m 1 , a , n 1 ) ∼ p ( m 3 , c , n 3 ) .

If 0 < q 1 + q 2 − p < − p , then we have

c = t ( v θ − q 2 ) ( a θ − ( q 1 + q 2 ) ) [ ( v − 1 θ − q 2 ) t − 1 ] θ − p ,

and m 1 − q 1 − q 2 − m 1 = − q 1 − q 2 > 0 and

( n 3 + q 1 + q 2 ) − m 3 = q 1 + q 2 + n 3 − m 3 = q 1 + q 2 − p > 0 ,

by (2.5). This implies that

( m 1 , a , n 1 ) = ( m 1 , a [ ( v − 1 θ − q 2 ) t − 1 ] θ q 1 + q 2 − p , n 3 + q 1 + q 2 ) ( m 3 , t ( v θ − q 2 ) , m 1 − q 1 − q 2 ) , ( m 3 , c , n 3 ) = ( m 3 , t ( v θ − q 2 ) , m 1 − q 1 − q 2 ) ( m 1 , a [ ( v − 1 θ − q 2 ) t − 1 ] θ q 1 + q 2 − p , n 3 + q 1 + q 2 ) .

From now on, for each x ∈ T , we shall denote the idempotent in the ℋ -class containing x by 1 x . Thus for all x , y ∈ T , it follows that

1 x x = x = x 1 x , 1 x = x x − 1 = x − 1 x and 1 x y = y 1 x .

If q 1 + q 2 − p = 0 , then we have

a = u ( s θ q 1 − p ) ( c θ − p ) [ ( s − 1 θ q 1 − p ) u − 1 ] θ − p , c = t ( v θ − q 2 ) ( a θ − p ) [ ( v − 1 θ − q 2 ) t − 1 ] θ − p

and so 1 u a = a and 1 t c = c . This implies that

a ( v − 1 θ − q 2 ) 1 u = a ( v − 1 θ − q 2 ) , c ( s − 1 θ q 1 − p ) 1 t = c ( s − 1 θ q 1 − p ) .

Since the idempotents of T form a chain, we have 1 u 1 t = 1 t or 1 u 1 t = 1 u . If 1 u 1 t = 1 u , then

a ( v − 1 θ − q 2 ) t − 1 t ( v θ − q 2 ) = a ( v − 1 θ − q 2 ) 1 u 1 t ( v θ − q 2 ) = a ( v − 1 θ − q 2 ) 1 u ( v θ − q 2 ) = a ( v − 1 θ − q 2 ) ( v θ − q 2 ) = a .

This implies that

( m 1 , a , n 1 ) = ( m 1 , a ( v − 1 θ − q 2 ) t − 1 , m 3 ) ( m 3 , t ( v θ − q 2 ) , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , t ( v θ − q 2 ) , n 1 ) ( m 1 , a ( v − 1 θ − q 2 ) t − 1 , m 3 ) .

If 1 u 1 t = 1 t , then

c ( s − 1 θ q 1 − p ) u − 1 u ( s θ q 1 − p ) = c ( s − 1 θ q 1 − p ) 1 t 1 u ( s θ q 1 − p ) = c ( s − 1 θ q 1 − p ) 1 t ( s θ q 1 − p ) = c ( s − 1 θ q 1 − p ) ( s θ q 1 − p ) = c .

This implies that

( m 1 , a , n 1 ) = ( m 1 , u ( s θ q 1 − p ) , n 3 ) ( m 3 , c ( s − 1 θ q 1 − p ) u − 1 , m 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c ( s − 1 θ q 1 − p ) u − 1 , m 1 ) ( m 1 , u ( s θ q 1 − p ) , n 3 ) .

(1.2) q 1 = p , q 1 ≠ 0 , q 2 ≠ p , q 2 ≠ 0 . In this case, we have

a = u v , b = v ( u θ − p ) , b = s ( t θ q 2 − p ) , c = t ( s θ − q 2 ) ,

and so a = u s ( c θ q 2 − p ) ( s − 1 u − 1 ) θ − p . This implies by (2.6) that

( m 1 , a , n 1 ) = ( m 1 , u s , n 3 + q 2 ) ( m 3 , c ( s − 1 u − 1 ) θ − q 2 , m 1 − q 2 ) , ( m 3 , c , n 3 ) = ( m 3 , c ( s − 1 u − 1 ) θ − q 2 , m 1 − q 2 ) ( m 1 , u s , n 3 + q 2 ) .

(1.3) q 1 ≠ p , q 1 = 0 , q 2 ≠ p , q 2 ≠ 0 . In this case, we obtain

a = u ( v θ − p ) , b = v u , b = s ( t θ q 2 − p ) , c = t ( s θ − q 2 ) ,

whence c = t ( v θ − q 2 ) ( a θ − q 2 ) [ ( v − 1 θ − q 2 ) t − 1 ] θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , a [ ( v − 1 θ − q 2 ) t − 1 ] θ q 2 − p , n 3 + q 2 ) ( m 3 , t ( v θ − q 2 ) , m 1 − q 2 ) , ( m 3 , c , n 3 ) = ( m 3 , t ( v θ − q 2 ) , m 1 − q 2 ) ( m 1 , a [ ( v − 1 θ − q 2 ) t − 1 ] θ q 2 − p , n 3 + q 2 ) .

(1.4) q 1 ≠ p , q 1 ≠ 0 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

a = u ( v θ q 1 − p ) , b = v ( u θ − q 1 ) , b = s t , c = t ( s θ − p ) ,

whence a = u ( s θ q 1 − p ) ( c θ q 1 − p ) [ ( s − 1 θ q 1 − p ) u − 1 ] θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , u ( s θ q 1 − p ) , n 3 + q 1 ) ( m 3 , c [ ( s − 1 θ q 1 − p ) u − 1 ] θ − q 1 , m 1 − q 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ ( s − 1 θ q 1 − p ) u − 1 ] θ − q 1 , m 1 − q 1 ) ( m 1 , u ( s θ q 1 − p ) , n 3 + q 1 ) .

(1.5) q 1 ≠ p , q 1 ≠ 0 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

a = u ( v θ q 1 − p ) , b = v ( u θ − q 1 ) , b = s ( t θ − p ) , c = t s ,

whence c = ( t v ) ( a θ − q 1 ) ( v − 1 t − 1 ) θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , a ( v − 1 t − 1 ) θ q 1 − p , n 3 + q 1 ) ( m 3 , t v , m 1 − q 1 ) , ( m 3 , c , n 3 ) = ( m 3 , t v , m 1 − q 1 ) ( m 1 , a ( v − 1 t − 1 ) θ q 1 − p , n 3 + q 1 ) .

(1.6) q 1 = p , q 1 = 0 . In this case, we obtain

q 2 = p = 0 , m 1 − n 1 = m 2 − n 2 = m 3 − n 3 = p = 0 , a = u v , b = v u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) . It is easy to see that q 1 = p , q 1 = 0 if and only if q 2 = p , q 2 = 0 . Thus, all the cases that there exist at least three items are equal to zero in q 1 − p , q 1 , q 2 − p , q 2 reduce to this case.

(1.7) q 1 = p , q 1 ≠ 0 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

p = q 1 ≠ 0 , a = u v , b = v ( u θ − p ) , b = s t , c = t ( s θ − p ) ,

whence a = ( u s ) c ( s − 1 u − 1 ) θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , u s , m 3 ) ( m 3 , c ( s − 1 u − 1 ) θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c ( s − 1 u − 1 ) θ − p , n 1 ) ( m 1 , u s , m 3 ) .

(1.8) q 1 = p , q 1 ≠ 0 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

p = q 1 ≠ 0 , a = u v , b = v ( u θ − p ) , b = s ( t θ − p ) , c = t s ,

whence 1 t c = 1 t t s = t s = c , u − 1 a = u − 1 u v = 1 u v , t − 1 c = t − 1 t c = 1 t s and

1 u b = 1 u v ( u θ − p ) = u − 1 u v ( u θ − p ) = u − 1 a ( u θ − p ) , 1 t b = 1 t s ( t θ − p ) = t − 1 c ( t θ − p ) .

Since the idempotents of T form a chain, we have 1 u 1 t = 1 t or 1 u 1 t = 1 u . If 1 u 1 t = 1 t , then

1 t u − 1 a ( u θ − p ) = 1 t 1 u b = 1 u 1 t b = 1 u t − 1 c ( t θ − p ) , 1 t 1 t u − 1 a ( u θ − p ) = 1 t 1 u t − 1 c ( t θ − p ) = 1 t t − 1 c ( t θ − p ) .

Multiplying by t from the left on both sides of the second equation above, we have

( t u − 1 ) a ( u θ − p ) = t 1 t t − 1 c ( t θ − p ) = t t − 1 c ( t θ − p ) = 1 t c ( t θ − p ) = c ( t θ − p ) ,

and hence c = t u − 1 a ( u θ − p ) ( t − 1 θ − p ) = t u − 1 a ( u t − 1 ) θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , a ( u t − 1 ) θ − p , n 3 ) ( m 3 , t u − 1 , m 1 ) , ( m 3 , c , n 3 ) = ( m 3 , t u − 1 , m 1 ) ( m 1 , a ( u t − 1 ) θ − p , n 3 ) .

Similarly, we can prove the case that 1 u 1 t = 1 u .

(1.9) q 1 ≠ p , q 1 = 0 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

p ≠ 0 , a = u ( v θ − p ) , b = v u , b = s t , c = t ( s θ − p ) ,

whence 1 u a = a , t − 1 c = 1 t ( s θ − p ) , u − 1 a = 1 u ( v θ − p ) and

1 u ( b θ − p ) = 1 u ( v θ − p ) ( u θ − p ) = u − 1 a ( u θ − p ) , 1 t ( b θ − p ) = 1 t ( s θ − p ) ( t θ − p ) = t − 1 c ( t θ − p ) , 1 u t − 1 c ( t θ − p ) = 1 u 1 t ( b θ − p ) = 1 t 1 u ( b θ − p ) = 1 t u − 1 a ( u θ − p ) .

Since the idempotents of T form a chain, we have 1 u 1 t = 1 t or 1 u 1 t = 1 u . If 1 u 1 t = 1 u , then

1 u 1 u t − 1 c ( t θ − p ) = 1 u 1 t u − 1 a ( u θ − p ) = 1 u u − 1 a ( u θ − p ) = u − 1 a ( u θ − p ) ,

Multiplying by u from the left on both sides of the equation above, we have

( u t − 1 ) c ( t θ − p ) = u u − 1 a ( u θ − p ) = 1 u a ( u θ − p ) = a ( u θ − p ) ,

and hence a = ( u t − 1 ) c ( t θ − p ) ( u − 1 θ − p ) = ( u t − 1 ) c ( t u − 1 ) θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , u t − 1 , m 3 ) ( m 3 , c ( t u − 1 ) θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c ( t u − 1 ) θ − p , n 1 ) ( m 1 , u t − 1 , m 3 ) .

Similarly, we can prove the case that 1 u 1 t = 1 t .

(1.10) q 1 ≠ p , q 1 = 0 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

p ≠ 0 , a = u ( v θ − p ) , b = v u , b = s ( t θ − p ) , c = t s ,

whence c = t v a ( v − 1 t − 1 ) θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , a ( v − 1 t − 1 ) θ − p , n 3 ) ( m 3 , t v , m 1 ) , ( m 3 , c , n 3 ) = ( m 3 , t v , m 1 ) ( m 1 , a ( v − 1 t − 1 ) θ − p , n 3 ) .

Case 2–(i, ii). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

m 2 − n 2 = p ≤ q 1 ≤ 0 , a = u ( v θ q 1 − p ) , b = v ( u θ − q 1 ) ,

0 ≤ q 2 ≤ m 2 ≤ n 2 , q 2 ≥ m 2 − m 3 , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s .

In this case,

n 1 − m 1 = n 3 − m 3 = − p ≥ 0 , n 3 + q 1 ≥ n 3 + p = m 3 , m 1 − q 1 ≥ m 1 .

(2.1) q 1 ≠ p , q 1 ≠ 0 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

a = u ( t − 1 θ n 2 + q 1 − q 2 ) ( c θ q 1 − p ) [ ( t θ n 2 + q 1 − q 2 ) u − 1 ] θ − p .

This yields that

( m 1 , a , n 1 ) = ( m 1 , u ( t − 1 θ n 2 + q 1 − q 2 ) , n 3 + q 1 ) ( m 3 , c [ ( t θ n 2 + q 1 − q 2 ) u − 1 ] θ − q 1 , m 1 − q 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ ( t θ n 2 + q 1 − q 2 ) u − 1 ] θ − q 1 , m 1 − q 1 ) ( m 1 , u ( t − 1 θ n 2 + q 1 − q 2 ) , n 3 + q 1 ) .

(2.2) q 1 = p , q 1 ≠ 0 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

p = q 1 ≠ 0 , a = u v , b = v ( u θ − p ) , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s ,

whence a = u ( t − 1 θ m 2 − q 2 ) c [ ( t θ m 2 − q 2 ) u − 1 ] θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , u ( t − 1 θ m 2 − q 2 ) , m 3 ) ( m 3 , c [ ( t θ m 2 − q 2 ) u − 1 ] θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ ( t θ m 2 − q 2 ) u − 1 ] θ − p , n 1 ) ( m 1 , u ( t − 1 θ m 2 − q 2 ) , m 3 ) .

(2.3) q 1 ≠ p , q 1 = 0 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

p ≠ 0 , a = u ( v θ − p ) , b = v u , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s ,

whence c = ( t θ m 2 − q 2 ) v a [ v − 1 ( t − 1 θ m 2 − q 2 ) ] θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , a [ v − 1 ( t − 1 θ m 2 − q 2 ) ] θ − p , n 3 ) ( m 3 , ( t θ m 2 − q 2 ) v , m 1 ) , ( m 3 , c , n 3 ) = ( m 3 , ( t θ m 2 − q 2 ) v , m 1 ) ( m 1 , a [ v − 1 ( t − 1 θ m 2 − q 2 ) ] θ − p , n 3 ) .

(2.4) q 2 = n 2 . In this case,

q 2 = n 2 = m 2 , q 1 = p = 0 , m 1 − n 1 = m 2 − n 2 = m 3 − n 3 = p = 0 , a = u v , b = v u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(2.5) q 1 ≠ p , q 1 ≠ 0 , q 2 ≠ n 2 , q 2 = m 2 . In this case, we obtain

a = u ( v θ q 1 − p ) , b = v ( u θ − q 1 ) , b = s ( t θ − p ) , c = t s ,

whence c = t v ( a θ − q 1 ) ( v − 1 t − 1 ) θ − p . This yields that

(2.6) q 1 = p , q 1 = 0 . In this case, we obtain

m 1 − n 1 = m 2 − n 2 = m 3 − n 3 = p = 0 , a = u v , b = v u

and b = s ( t θ m 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s . By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(2.7) q 1 = p , q 1 ≠ 0 , q 2 ≠ n 2 , q 2 = m 2 . In this case, we obtain

a = u v , b = v ( u θ − p ) , b = s ( t θ − p ) , c = t s .

In view of (1.8), we obtain ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(2.8) q 1 ≠ p , q 1 = 0 , q 2 ≠ n 2 , q 2 = m 2 . In this case, we obtain

p ≠ 0 , a = u ( v θ − p ) , b = v u , b = s ( t θ − p ) , c = t s ,

whence c = t v a ( v − 1 t − 1 ) θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , a ( v − 1 t − 1 ) θ − p , n 3 ) ( m 3 , t v , m 1 ) , ( m 3 , c , n 3 ) = ( m 3 , t v , m 1 ) ( m 1 , a ( v − 1 t − 1 ) θ − p , n 3 ) .

Case 3–(i, iii). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

m 2 − n 2 = p ≤ q 1 ≤ 0 , a = u ( v θ q 1 − p ) , b = v ( u θ − q 1 ) , 0 ≤ q 2 ≤ m 2 ≤ n 2 , q 2 ≥ m 2 − m 3 , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) .

In this case,

n 1 − m 1 = n 3 − m 3 = − p ≥ 0 , n 3 + q 1 ≥ n 3 + p = m 3 , m 1 − q 1 ≥ m 1 .

(3.1) q 1 ≠ p , q 1 ≠ 0 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

a = u ( s θ n 2 + q 1 − q 2 ) ( c θ q 1 − p ) [ ( s − 1 θ n 2 + q 1 − q 2 ) u − 1 ] θ − p .

This yields that

( m 1 , a , n 1 ) = ( m 1 , u ( s θ n 2 + q 1 − q 2 ) , n 3 + q 1 ) ( m 3 , c [ ( s − 1 θ n 2 + q 1 − q 2 ) u − 1 ] θ − q 1 , m 1 − q 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ ( s − 1 θ n 2 + q 1 − q 2 ) u − 1 ] θ − q 1 , m 1 − q 1 ) ( m 1 , u ( s θ n 2 + q 1 − q 2 ) , n 3 + q 1 ) .

(3.2) q 1 = p , q 1 ≠ 0 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

p = q 1 ≠ 0 , a = u v , b = v ( u θ − p ) , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) ,

whence a = u ( s θ m 2 − q 2 ) c [ ( s − 1 θ m 2 − q 2 ) u − 1 ] θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , u ( s θ m 2 − q 2 ) , m 3 ) ( m 3 , c [ ( s − 1 θ m 2 − q 2 ) u − 1 ] θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ ( s − 1 θ m 2 − q 2 ) u − 1 ] θ − p , n 1 ) ( m 1 , u ( s θ m 2 − q 2 ) , m 3 ) .

(3.3) q 1 ≠ p , q 1 = 0 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

p ≠ 0 , a = u ( v θ − p ) , b = v u , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) ,

whence c = ( s − 1 θ m 2 − q 2 ) v a [ v − 1 ( s θ m 2 − q 2 ) ] θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , a [ v − 1 ( s θ m 2 − q 2 ) ] θ − p , n 3 ) ( m 3 , ( s − 1 θ m 2 − q 2 ) v , m 1 ) , ( m 3 , c , n 3 ) = ( m 3 , ( s − 1 θ m 2 − q 2 ) v , m 1 ) ( m 1 , a [ v − 1 ( s θ m 2 − q 2 ) ] θ − p , n 3 ) .

(3.4) q 2 = n 2 . In this case, we obtain

q 2 = n 2 = m 2 , m 1 − n 1 = m 2 − n 2 = m 3 − n 3 = p = 0 , a = u v , b = v u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(3.5) q 1 ≠ p , q 1 ≠ 0 , q 2 ≠ n 2 , q 2 = m 2 . In this case, we obtain

a = u ( v θ q 1 − p ) , b = v ( u θ − q 1 ) , b = s t , c = t ( s θ − p ) ,

whence a = u ( s θ q 1 − p ) ( c θ q 1 − p ) [ ( s − 1 θ q 1 − p ) u − 1 ] θ − p . This yields that

(3.6) q 1 = p , q 1 = 0 . In this case, we obtain

m 1 − n 1 = m 2 − n 2 = m 3 − n 3 = p = 0 , a = u v , b = v u , b = ( s θ m 2 − q 2 ) t , c = t ( s θ m 2 − q 2 ) .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(3.7) q 1 = p , q 1 ≠ 0 , q 2 ≠ n 2 , q 2 = m 2 . In this case, we obtain

p = q 1 ≠ 0 , a = u v , b = v ( u θ − p ) , b = s t , c = t ( s θ − p ) ,

whence a = u s c ( s − 1 u − 1 ) θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , u s , m 3 ) ( m 3 , c ( s − 1 u − 1 ) θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c ( s − 1 u − 1 ) θ − p , n 1 ) ( m 1 , u s , m 3 ) .

(3.8) q 1 ≠ p , q 1 = 0 , q 2 ≠ n 2 , q 2 = m 2 . In this case, we obtain

a = u ( v θ − p ) , b = v u , b = s t , c = t ( s θ − p ) .

It follows that ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) from (1.9).

Case 4–(i, iv). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

p ≤ q 1 ≤ 0 , a = u ( v θ q 1 − p ) , b = v ( u θ − q 1 ) , 0 ≤ q 2 ≤ p , b = ( s θ p − q 2 ) t , c = ( t θ q 2 ) s .

In this case,

m 1 − n 1 = m 2 − n 2 = m 3 − n 3 = p = 0 , q 1 = q 2 = 0 , a = u v , b = v u , b = s t , c = t s ,

and so ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by Lemmas 1.1 and 2.1.

Case 5–(ii, i). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ m 1 ≤ n 1 , q 1 ≥ m 1 − m 2 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u ,

and p ≤ q 2 ≤ 0 , b = s ( t θ q 2 − p ) , c = t ( s θ − q 2 ) . In this case,

n 2 − m 2 = n 1 − m 1 = n 3 − m 3 = − p ≥ 0 , n 3 + q 2 ≥ n 3 + p = m 3 , m 1 − q 2 ≥ m 1 .

(5.1) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 ≠ p , q 2 ≠ 0 . In this case, we obtain

c = t ( v θ m 1 − q 1 − q 2 ) ( a θ − q 2 ) [ ( v − 1 θ m 1 − q 1 − q 2 ) t − 1 ] θ − p .

This yields that

( m 1 , a , n 1 ) = ( m 1 , a [ ( v − 1 θ m 1 − q 1 − q 2 ) t − 1 ] θ q 2 − p , n 3 + q 2 ) ( m 3 , t ( v θ m 1 − q 1 − q 2 ) , m 1 − q 2 ) , ( m 3 , c , n 3 ) = ( m 3 , t ( v θ m 1 − q 1 − q 2 ) , m 1 − q 2 ) ( m 1 , a [ ( v − 1 θ m 1 − q 1 − q 2 ) t − 1 ] θ q 2 − p , n 3 + q 2 ) .

(5.2) q 1 = n 1 . In this case, we obtain

q 1 = m 1 , p = m 1 − n 1 = m 2 − n 2 = m 3 − n 3 = 0 , q 2 = 0 , a = u v , b = v u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(5.3) q 1 ≠ n 1 , q 1 = m 1 , q 2 ≠ p , q 2 ≠ 0 . In this case, we obtain

a = u ( v θ − p ) , b = v u , b = s ( t θ q 2 − p ) , c = t ( s θ − q 2 ) ,

whence c = t ( v θ − q 2 ) ( a θ − q 2 ) [ ( v − 1 θ − q 2 ) t − 1 ] θ − p . This yields that

(5.4) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

p = q 2 ≠ 0 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , b = s t , c = t ( s θ − p ) ,

whence a = ( v − 1 θ m 1 − q 1 ) s c [ s − 1 ( v θ m 1 − q 1 ) ] θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , ( v − 1 θ m 1 − q 1 ) s , m 3 ) ( m 3 , c [ s − 1 ( v θ m 1 − q 1 ) ] θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ s − 1 ( v θ m 1 − q 1 ) ] θ − p , n 1 ) ( m 1 , ( v − 1 θ m 1 − q 1 ) s , m 3 ) .

(5.5) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

p ≠ 0 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , b = s ( t θ − p ) , c = t s ,

whence c = t ( v θ m 1 − q 1 ) a [ ( v − 1 θ m 1 − q 1 ) t − 1 ] θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , a [ ( v − 1 θ m 1 − q 1 ) t − 1 ] θ − p , n 3 ) ( m 3 , t ( v θ m 1 − q 1 ) , m 1 ) , ( m 3 , c , n 3 ) = ( m 3 , t ( v θ m 1 − q 1 ) , m 1 ) ( m 1 , a [ ( v − 1 θ m 1 − q 1 ) t − 1 ] θ − p , n 3 ) .

(5.6) q 1 ≠ n 1 , q 1 = m 1 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

a = u ( v θ − p ) , b = v u , b = s t , c = t ( s θ − p ) ,

whence ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by (1.9).

(5.7) q 1 ≠ n 1 , q 1 = m 1 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

p ≠ 0 , a = u ( v θ − p ) , b = v u , b = s ( t θ − p ) , c = t s ,

whence c = t v a ( v − 1 t − 1 ) θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , a ( v − 1 t − 1 ) θ − p , n 3 ) ( m 3 , t v , m 1 ) , ( m 3 , c , n 3 ) = ( m 3 , t v , m 1 ) ( m 1 , a ( v − 1 t − 1 ) θ − p , n 3 ) .

(5.8) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 = p , q 2 = 0 . In this case, we obtain

a = u ( v θ n 1 − q 1 ) , b = ( v θ n 1 − q 1 ) u , b = s t , c = t s ,

and so ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by Lemmas 1.1 and 2.1.

We observe that it is impossible that q 1 ≠ n 1 , q 1 = m 1 , q 2 = p , q 2 = 0 .

Case 6–(ii,ii). If p ≤ 0 , then there exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ m 1 ≤ n 1 , q 1 ≥ m 1 − m 2 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , 0 ≤ q 2 ≤ m 2 ≤ n 2 , q 2 ≥ m 2 − m 3 , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s .

In this case, n 3 − m 3 = − p ≥ 0 .

(6.1) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

a = ( v − 1 θ m 1 − q 1 ) ( t − 1 θ m 2 − q 2 ) c [ ( t θ m 2 − q 2 ) ( v θ m 1 − q 1 ) ] θ − p .

This yields that

( m 1 , a , n 1 ) = ( m 1 , ( v − 1 θ m 1 − q 1 ) ( t − 1 θ m 2 − q 2 ) , m 3 ) ( m 3 , c [ ( t θ m 2 − q 2 ) ( v θ m 1 − q 1 ) ] θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ ( t θ m 2 − q 2 ) ( v θ m 1 − q 1 ) ] θ − p , n 1 ) ( m 1 , ( v − 1 θ m 1 − q 1 ) ( t − 1 θ m 2 − q 2 ) , m 3 ) .

(6.2) q 1 = n 1 . In this case, we obtain

q 1 = m 1 = n 1 , p = 0 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = s ( t θ m 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(6.3) q 1 ≠ n 1 , q 1 = m 1 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = u ( v θ − p ) , b = v u , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s ,

whence c = ( t θ m 2 − q 2 ) v a [ v − 1 ( t − 1 θ m 2 − q 2 ) ] θ − p . This yields that

(6.4) q 2 = n 2 . In this case, we obtain

q 2 = m 2 = n 2 , p = 0 , m 1 = n 1 , m 3 = n 3 , a = u ( v θ n 1 − q 1 ) , b = ( v θ n 1 − q 1 ) u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(6.5) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 ≠ n 2 , q 2 = m 2 . In this case, we obtain

p = m 2 − n 2 ≠ 0 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , b = s ( t θ − p ) , c = t s ,

whence c = t ( v θ m 1 − q 1 ) a [ ( v − 1 θ m 1 − q 1 ) t − 1 ] θ − p . This yields that

(6.6) q 1 ≠ n 1 , q 1 = m 1 , q 2 ≠ n 2 , q 2 = m 2 . In this case, we obtain

p = m 2 − n 2 ≠ 0 , a = u ( v θ − p ) , b = v u , b = s ( t θ − p ) , c = t s ,

whence c = t v a ( v − 1 t − 1 ) θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , a ( v − 1 t − 1 ) θ − p , n 3 ) ( m 3 , t v , m 1 ) , ( m 3 , c , n 3 ) = ( m 3 , t v , m 1 ) ( m 1 , a ( v − 1 t − 1 ) θ − p , n 3 ) ,

which gives that ( m 1 , a , n 1 ) ∼ p ( m 3 , c , n 3 ) .

If p ≥ 0 , then there exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ n 1 ≤ m 1 , q 1 ≥ m 1 − m 2 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , 0 ≤ q 2 ≤ n 2 ≤ m 2 , q 2 ≥ m 2 − m 3 , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s .

In this case, m 1 − n 1 = m 2 − n 2 = m 3 − n 3 = p ≥ 0 .

(6.7) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

a = [ ( v − 1 θ n 1 − q 1 ) ( t − 1 θ n 2 − q 2 ) ] θ p c ( t θ n 2 − q 2 ) ( v θ n 1 − q 1 ) .

This yields that

( m 1 , a , n 1 ) = ( m 1 , [ ( v − 1 θ n 1 − q 1 ) ( t − 1 θ n 2 − q 2 ) ] θ p c , n 3 ) ( n 3 , ( t θ n 2 − q 2 ) ( v θ n 1 − q 1 ) , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , ( t θ n 2 − q 2 ) ( v θ n 1 − q 1 ) , n 1 ) ( m 1 , [ ( v − 1 θ n 1 − q 1 ) ( t − 1 θ n 2 − q 2 ) ] θ p c , n 3 ) .

(6.8) q 1 = n 1 , q 1 ≠ m 1 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = u v , b = ( v θ p ) u , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s ,

whence a = [ v − 1 ( t − 1 θ n 2 − q 2 ) ] θ p c ( t θ n 2 − q 2 ) v . This yields that

( m 1 , a , n 1 ) = ( m 1 , [ v − 1 ( t − 1 θ n 2 − q 2 ) ] θ p c , n 3 ) ( n 3 , ( t θ n 2 − q 2 ) v , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , ( t θ n 2 − q 2 ) v , n 1 ) ( m 1 , [ v − 1 ( t − 1 θ n 2 − q 2 ) ] θ p c , n 3 ) .

(6.9) q 1 = m 1 . In this case, we obtain

q 1 = n 1 = m 1 , p = 0 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = s ( t θ m 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(6.10) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 = n 2 , q 2 ≠ m 2 . In this case, we obtain

p = m 2 − n 2 ≠ 0 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , b = s t , c = ( t θ p ) s ,

whence a = [ ( v − 1 θ n 1 − q 1 ) t − 1 ] θ p c t ( v θ n 1 − q 1 ) . This yields that

( m 1 , a , n 1 ) = ( m 1 , [ ( v − 1 θ n 1 − q 1 ) t − 1 ] θ p c , n 3 ) ( n 3 , t ( v θ n 1 − q 1 ) , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , t ( v θ n 1 − q 1 ) , n 1 ) ( m 1 , [ ( v − 1 θ n 1 − q 1 ) t − 1 ] θ p c , n 3 ) ,

(6.11) q 2 = m 2 . In this case, we obtain

q 2 = n 2 , p = 0 , m 1 = n 1 , m 3 = n 3 , a = u ( v θ m 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(6.12) q 1 = n 1 , q 1 ≠ m 1 , q 2 = n 2 , q 2 ≠ m 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = u v , b = ( v θ p ) u , b = s t , c = ( t θ p ) s ,

whence a = ( v − 1 t − 1 ) θ p c t v . This yields that

( m 1 , a , n 1 ) = ( m 1 , ( v − 1 t − 1 ) θ p c , n 3 ) ( n 3 , t v , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , t v , n 1 ) ( m 1 , ( v − 1 t − 1 ) θ p c , n 3 ) .

Case 7–(ii,iii). If p ≤ 0 , then there exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ m 1 ≤ n 1 , q 1 ≥ m 1 − m 2 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , 0 ≤ q 2 ≤ m 2 ≤ n 2 , q 2 ≥ m 2 − m 3 , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) .

In this case, n 3 − m 3 = n 1 − m 1 = − p ≥ 0 .

(7.1) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 ≠ m 2 , q 2 ≠ n 2 . In this case, we obtain

a = ( v − 1 θ m 1 − q 1 ) ( s θ m 2 − q 2 ) c [ ( s − 1 θ m 2 − q 2 ) ( v θ m 1 − q 1 ) ] θ − p .

This yields that

( m 1 , a , n 1 ) = ( m 1 , ( v − 1 θ m 1 − q 1 ) ( s θ m 2 − q 2 ) , m 3 ) ( m 3 , c [ ( s − 1 θ m 2 − q 2 ) ( v θ m 1 − q 1 ) ] θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ ( s − 1 θ m 2 − q 2 ) ( v θ m 1 − q 1 ) ] θ − p , n 1 ) ( m 1 , ( v − 1 θ m 1 − q 1 ) ( s θ m 2 − q 2 ) , m 3 ) .

(7.2) q 1 = n 1 . In this case, we obtain

q 1 = m 1 = n 1 , p = 0 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = ( s θ m 2 − q 2 ) t , c = t ( s θ m 2 − q 2 ) .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(7.3) q 1 ≠ n 1 , q 1 = m 1 , q 2 ≠ m 2 , q 2 ≠ n 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = u ( v θ − p ) , b = v u , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) ,

whence c = ( s − 1 θ m 2 − q 2 ) v a [ v − 1 ( s θ m 2 − q 2 ) ] θ − p . This yields that

(7.4) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 = m 2 , q 2 ≠ n 2 . In this case, we obtain

p = m 2 − n 2 ≠ 0 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , b = s t , c = t ( s θ − p ) ,

whence a = ( v − 1 θ m 1 − q 1 ) s c [ s − 1 ( v θ m 1 − q 1 ) ] θ − p . This yields that

(7.5) q 2 = n 2 . In this case, we obtain

q 2 = m 2 = n 2 , p = 0 , m 1 = n 1 , m 3 = n 3 , a = u ( v θ n 1 − q 1 ) , b = ( v θ n 1 − q 1 ) u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(7.6) q 1 ≠ n 1 , q 1 = m 1 , q 2 = m 2 , q 2 ≠ n 2 . In this case, we obtain

a = u ( v θ − p ) , b = v u , b = s t , c = t ( s θ − p ) ,

whence ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by (1.9).

If p ≥ 0 , then there exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ n 1 ≤ m 1 , q 1 ≥ m 1 − m 2 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , 0 ≤ q 2 ≤ n 2 ≤ m 2 , q 2 ≥ m 2 − m 3 , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) .

In this case, m 1 − n 1 = m 2 − n 2 = m 3 − n 3 = p ≥ 0 .

(7.7) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 ≠ m 2 , q 2 ≠ n 2 . In this case, we obtain

a = [ ( v − 1 θ n 1 − q 1 ) ( s θ n 2 − q 2 ) ] θ p c ( s − 1 θ n 2 − q 2 ) ( v θ n 1 − q 1 ) .

This yields that

( m 1 , a , n 1 ) = ( m 1 , [ ( v − 1 θ n 1 − q 1 ) ( s θ n 2 − q 2 ) ] θ p c , n 3 ) ( n 3 , ( s − 1 θ n 2 − q 2 ) ( v θ n 1 − q 1 ) , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , ( s − 1 θ n 2 − q 2 ) ( v θ n 1 − q 1 ) , n 1 ) ( m 1 , [ ( v − 1 θ n 1 − q 1 ) ( s θ n 2 − q 2 ) ] θ p c , n 3 ) .

(7.8) q 1 = n 1 , q 1 ≠ m 1 , q 2 ≠ m 2 , q 2 ≠ n 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = u v , b = ( v θ p ) u , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) ,

whence a = [ v − 1 ( s θ n 2 − q 2 ) ] θ p c ( s − 1 θ n 2 − q 2 ) v . This yields that

( m 1 , a , n 1 ) = ( m 1 , [ v − 1 ( s θ n 2 − q 2 ) ] θ p c , n 3 ) ( n 3 , ( s − 1 θ n 2 − q 2 ) v , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , ( s − 1 θ n 2 − q 2 ) v , n 1 ) ( m 1 , [ v − 1 ( s θ n 2 − q 2 ) ] θ p c , n 3 ) .

(7.9) q 1 = m 1 . In this case, we obtain

q 1 = n 1 = m 1 , p = 0 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = ( s θ m 2 − q 2 ) t , c = t ( s θ m 2 − q 2 ) .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(7.10) q 2 = m 2 . In this case, we obtain

q 2 = n 2 = m 2 , p = 0 , m 1 = n 1 , m 3 = n 3 , a = u ( v θ m 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(7.11) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 ≠ m 2 , q 2 = n 2 . In this case, we obtain

p = m 2 − n 2 ≠ 0 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , b = ( s θ p ) t , c = t s ,

whence c = [ s − 1 ( v θ n 1 − q 1 ) ] θ p a ( v − 1 θ n 1 − q 1 ) s . This yields that

( m 1 , a , n 1 ) = ( n 1 , ( v − 1 θ n 1 − q 1 ) s , n 3 ) ( m 3 , [ s − 1 ( v θ n 1 − q 1 ) ] θ p a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , [ s − 1 ( v θ n 1 − q 1 ) ] θ p a , n 1 ) ( n 1 , ( v − 1 θ n 1 − q 1 ) s , n 3 ) .

(7.12) q 1 = n 1 , q 1 ≠ m 1 , q 2 ≠ m 2 , q 2 = n 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = u v , b = ( v θ p ) u , b = ( s θ p ) t , c = t s ,

whence

c 1 s = c , a v − 1 = u 1 v , c s − 1 = t 1 s , b 1 v = ( v θ p ) u 1 v = ( v θ p ) a v − 1 , b 1 s = ( s θ p ) t 1 s = ( s θ p ) c s − 1 .

Since the idempotents of T form a chain, we have 1 v 1 s = 1 s or 1 v 1 s = 1 v . If 1 v 1 s = 1 s , then

( v θ p ) a v − 1 1 s = b 1 v 1 s = b 1 s 1 v = ( s θ p ) c s − 1 1 v , ( v θ p ) a v − 1 1 s = ( v θ p ) a v − 1 1 s 1 s = ( s θ p ) c s − 1 1 v 1 s = ( s θ p ) c s − 1 1 s = ( s θ p ) c s − 1 .

Multiplying by s on the right on both sides of the second equation above, we obtain

( v θ p ) a v − 1 s = ( v θ p ) a v − 1 1 s s = ( s θ p ) c s − 1 s = ( s θ p ) c 1 s = ( s θ p ) c ,

and hence c = ( s − 1 v ) θ p a ( v − 1 s ) . This yields that

( m 1 , a , n 1 ) = ( n 1 , v − 1 s , n 3 ) ( m 3 , ( s − 1 v ) θ p a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , ( s − 1 v ) θ p a , n 1 ) ( n 1 , v − 1 s , n 3 ) .

Similarly, we can prove the case that 1 v 1 s = 1 v .

Case 8–(ii,iv). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ n 1 ≤ m 1 , q 1 ≥ m 1 − m 2 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u ,

and 0 ≤ q 2 ≤ p , b = ( s θ p − q 2 ) t , c = ( t θ q 2 ) s . In this case,

m 1 − n 1 = m 3 − n 3 = p ≥ 0 , m 3 − q 2 ≥ m 3 − p = n 3 , n 1 + q 2 ≥ n 1 .

(8.1) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 ≠ p , q 2 ≠ 0 . In this case, we obtain

a = [ ( v − 1 θ n 1 − q 1 ) t − 1 ] θ p ( c θ p − q 2 ) t ( v θ n 1 − q 1 ) .

This yields that

( m 1 , a , n 1 ) = ( n 1 + q 2 , [ ( v − 1 θ n 1 − q 1 ) t − 1 ] θ q 2 c , n 3 ) ( m 3 − q 2 , t ( v θ n 1 − q 1 ) , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 − q 2 , t ( v θ n 1 − q 1 ) , n 1 ) ( n 1 + q 2 , [ ( v − 1 θ n 1 − q 1 ) t − 1 ] θ q 2 c , n 3 ) ,

(8.2) q 1 = n 1 , q 1 ≠ m 1 , q 2 ≠ p , q 2 ≠ 0 . In this case, we obtain

a = u v , b = ( v θ p ) u , b = ( s θ p − q 2 ) t , c = ( t θ q 2 ) s ,

whence a = ( v − 1 t − 1 ) θ p ( c θ p − q 2 ) t v . This yields that

( m 1 , a , n 1 ) = ( n 1 + q 2 , ( v − 1 t − 1 ) θ q 2 c , n 3 ) ( m 3 − q 2 , t v , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 − q 2 , t v , n 1 ) ( n 1 + q 2 , ( v − 1 t − 1 ) θ q 2 c , n 3 ) .

(8.3) q 1 = m 1 . In this case, we obtain

q 1 = n 1 = m 1 , p = 0 = q 2 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(8.4) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

p = q 2 ≠ 0 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , b = s t , c = ( t θ p ) s ,

whence a = [ ( v − 1 θ n 1 − q 1 ) t − 1 ] θ p c t ( v θ n 1 − q 1 ) . This yields that

( m 1 , a , n 1 ) = ( m 1 , [ ( v − 1 θ n 1 − q 1 ) t − 1 ] θ p c , n 3 ) ( n 3 , t ( v θ n 1 − q 1 ) , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , t ( v θ n 1 − q 1 ) , n 1 ) ( m 1 , [ ( v − 1 θ n 1 − q 1 ) t − 1 ] θ p c , n 3 ) .

(8.5) q 1 ≠ n 1 , q 1 ≠ m 1 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

p ≠ 0 , a = u ( v θ n 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , b = ( s θ p ) t , c = t s ,

whence c = [ s − 1 ( v θ n 1 − q 1 ) ] θ p a ( v − 1 θ n 1 − q 1 ) s . This yields that

(8.6) q 1 = n 1 , q 1 ≠ m 1 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

p = q 2 ≠ 0 , a = u v , b = ( v θ p ) u , b = s t , c = ( t θ p ) s ,

whence a = ( v − 1 t − 1 ) θ p c t v . This yields that

( m 1 , a , n 1 ) = ( m 1 , ( v − 1 t − 1 ) θ p c , n 3 ) ( n 3 , t v , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , t v , n 1 ) ( m 1 , ( v − 1 t − 1 ) θ p c , n 3 ) .

(8.7) q 1 = n 1 , q 1 ≠ m 1 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

a = u v , b = ( v θ p ) u , b = ( s θ p ) t , c = t s ,

whence ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by (7.12).

(8.8) q 2 = p , q 2 = 0 . In this case, we obtain

p = 0 , m 1 = n 1 , m 2 = n 2 , m 3 = n 3 , a = u ( v θ m 1 − q 1 ) , b = ( v θ m 1 − q 1 ) u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

Case 9–(iii,i). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ m 1 ≤ n 1 , q 1 ≥ m 1 − m 2 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) ,

and p ≤ q 2 ≤ 0 , b = s ( t θ q 2 − p ) , c = t ( s θ − q 2 ) . In this case,

m 1 − n 1 = m 3 − n 3 = p ≤ 0 , n 3 + q 2 ≥ n 3 + p = m 3 , m 1 − q 2 ≥ m 1 .

(9.1) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 ≠ p , q 2 ≠ 0 . In this case, we obtain

a = ( u θ m 1 − q 1 ) s ( c θ q 2 − p ) [ s − 1 ( u − 1 θ m 1 − q 1 ) ] θ − p .

This yields that

( m 1 , a , n 1 ) = ( m 1 , ( u θ m 1 − q 1 ) s , n 3 + q 2 ) ( m 3 , c [ s − 1 ( u − 1 θ m 1 − q 1 ) ] θ − q 2 , m 1 − q 2 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ s − 1 ( u − 1 θ m 1 − q 1 ) ] θ − q 2 , m 1 − q 2 ) ( m 1 , ( u θ m 1 − q 1 ) s , n 3 + q 2 ) .

(9.2) q 1 = m 1 , q 1 ≠ n 1 , q 2 ≠ p , q 2 ≠ 0 . In this case, we obtain

a = u v , b = v ( u θ − p ) , b = s ( t θ q 2 − p ) , c = t ( s θ − q 2 ) ,

whence a = u s ( c θ q 2 − p ) ( s − 1 u − 1 ) θ − p . This yields that

(9.3) q 1 = n 1 . In this case, we obtain

q 1 = m 1 = n 1 , p = 0 , m 2 = n 2 , m 3 = n 3 , q 2 = 0 , a = u v , b = v u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(9.4) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

p = q 2 ≠ 0 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , b = s t , c = t ( s θ − p ) ,

whence a = ( u θ m 1 − q 1 ) s c [ s − 1 ( u − 1 θ m 1 − q 1 ) ] θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , ( u θ m 1 − q 1 ) s , m 3 ) ( m 3 , c [ s − 1 ( u − 1 θ m 1 − q 1 ) ] θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ s − 1 ( u − 1 θ m 1 − q 1 ) ] θ − p , n 1 ) ( m 1 , ( u θ m 1 − q 1 ) s , m 3 ) .

(9.5) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

p ≠ 0 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , b = s ( t θ − p ) , c = t s ,

whence c = t ( u − 1 θ m 1 − q 1 ) a [ ( u θ m 1 − q 1 ) t − 1 ] θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , a [ ( u θ m 1 − q 1 ) t − 1 ] θ − p , n 3 ) ( m 3 , t ( u − 1 θ m 1 − q 1 ) , m 1 ) , ( m 3 , c , n 3 ) = ( m 3 , t ( u − 1 θ m 1 − q 1 ) , m 1 ) ( m 1 , a [ ( u θ m 1 − q 1 ) t − 1 ] θ − p , n 3 ) .

(9.6) q 1 = m 1 , q 1 ≠ n 1 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

p = q 2 ≠ 0 , a = u v , b = v ( u θ − p ) , b = s t , c = t ( s θ − p ) ,

whence a = ( u s ) c ( s − 1 u − 1 ) θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , u s , m 3 ) ( m 3 , c [ ( s − 1 u − 1 ) θ − p ] , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ ( s − 1 u − 1 ) θ − p ] , n 1 ) ( m 1 , u s , m 3 ) .

(9.7) q 1 = m 1 , q 1 ≠ n 1 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

a = u v , b = v ( u θ − p ) , b = s ( t θ − p ) , c = t s ,

whence ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by (1.8).

(9.8) q 2 = p , q 2 = 0 . In this case, we obtain

m 1 = n 1 , m 2 = n 2 , m 3 = n 3 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ m 1 − q 1 ) , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

Case 10–(iii,ii). If p ≤ 0 , then there exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ m 1 ≤ n 1 , q 1 ≥ m 1 − m 2 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , 0 ≤ q 2 ≤ m 2 ≤ n 2 , q 2 ≥ m 2 − m 3 , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s .

In this case, n 3 − m 3 = n 1 − m 1 = − p ≥ 0 .

(10.1) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

a = ( u θ m 1 − q 1 ) ( t − 1 θ m 2 − q 2 ) c [ ( t θ m 2 − q 2 ) ( u − 1 θ m 1 − q 1 ) ] θ − p .

This yields that

( m 1 , a , n 1 ) = ( m 1 , ( u θ m 1 − q 1 ) ( t − 1 θ m 2 − q 2 ) , m 3 ) ( m 3 , c [ ( t θ m 2 − q 2 ) ( u − 1 θ m 1 − q 1 ) ] θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ ( t θ m 2 − q 2 ) ( u − 1 θ m 1 − q 1 ) ] θ − p , n 1 ) ( m 1 , ( u θ m 1 − q 1 ) ( t − 1 θ m 2 − q 2 ) , m 3 ) .

(10.2) q 1 = m 1 , q 1 ≠ n 1 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = u v , b = v ( u θ − p ) , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s ,

whence a = u ( t − 1 θ m 2 − q 2 ) c [ ( t θ m 2 − q 2 ) u − 1 ] θ − p . This yields that

(10.3) q 1 = n 1 . In this case, we obtain

q 1 = m 1 = n 1 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = s ( t θ m 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(10.4) q 2 = n 2 . In this case, we obtain

q 2 = m 2 = n 2 , m 1 = n 1 , m 3 = n 3 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ m 1 − q 1 ) , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(10.5) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 ≠ n 2 , q 2 = m 2 . In this case, we obtain

p = m 2 − n 2 ≠ 0 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , b = s ( t θ − p ) , c = t s ,

whence c = t ( u − 1 θ m 1 − q 1 ) a [ ( u θ m 1 − q 1 ) t − 1 ] θ − p . This yields that

(10.6) q 1 = m 1 , q 1 ≠ n 1 , q 2 ≠ n 2 , q 2 = m 2 . In this case, we obtain

a = u v , b = v ( u θ − p ) , b = s ( t θ − p ) , c = t s ,

whence ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by (1.8).

If p ≥ 0 , then there exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ n 1 ≤ m 1 , q 1 ≥ m 1 − m 2 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , 0 ≤ q 2 ≤ n 2 ≤ m 2 , q 2 ≥ m 2 − m 3 , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s .

In this case, m 1 − n 1 = m 3 − n 3 = p ≥ 0 .

(10.7) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

a = [ ( u θ n 1 − q 1 ) ( t − 1 θ n 2 − q 2 ) ] θ p c ( t θ n 2 − q 2 ) ( u − 1 θ n 1 − q 1 ) .

This yields that

( m 1 , a , n 1 ) = ( m 1 , [ ( u θ n 1 − q 1 ) ( t − 1 θ n 2 − q 2 ) ] θ p c , n 3 ) ( n 3 , ( t θ n 2 − q 2 ) ( u − 1 θ n 1 − q 1 ) , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , ( t θ n 2 − q 2 ) ( u − 1 θ n 1 − q 1 ) , n 1 ) ( m 1 , [ ( u θ n 1 − q 1 ) ( t − 1 θ n 2 − q 2 ) ] θ p c , n 3 ) .

(10.8) q 1 = m 1 . In this case, we obtain

q 1 = n 1 = m 1 , p = 0 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = s ( t θ m 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(10.9) q 1 ≠ m 1 , q 1 = n 1 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = ( u θ p ) v , b = v u , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s ,

whence c = [ ( t θ n 2 − q 2 ) u − 1 ] θ p a u ( t − 1 θ n 2 − q 2 ) . This yields that

( m 1 , a , n 1 ) = ( n 1 , u ( t − 1 θ n 2 − q 2 ) , n 3 ) ( m 3 , [ ( t θ n 2 − q 2 ) u − 1 ] θ p a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , [ ( t θ n 2 − q 2 ) u − 1 ] θ p a , n 1 ) ( n 1 , u ( t − 1 θ n 2 − q 2 ) , n 3 ) .

(10.10) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 = n 2 , q 2 ≠ m 2 . In this case, we obtain

p = m 2 − n 2 ≠ 0 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , b = s t , c = ( t θ p ) s ,

whence a = [ ( u θ n 1 − q 1 ) t − 1 ] θ p c t ( u − 1 θ n 1 − q 1 ) . This yields that

( m 1 , a , n 1 ) = ( m 1 , [ ( u θ n 1 − q 1 ) t − 1 ] θ p c , n 3 ) ( n 3 , t ( u − 1 θ n 1 − q 1 ) , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , t ( u − 1 θ n 1 − q 1 ) , n 1 ) ( m 1 , [ ( u θ n 1 − q 1 ) t − 1 ] θ p c , n 3 ) .

(10.11) q 2 = m 2 . In this case, we obtain

q 2 = n 2 = m 2 , p = 0 , m 1 = n 1 , m 3 = n 3 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ m 1 − q 1 ) , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(10.12) q 1 ≠ m 1 , q 1 = n 1 , q 2 = n 2 , q 2 ≠ m 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = ( u θ p ) v , b = v u , b = s t , c = ( t θ p ) s ,

whence

c 1 s = c , c s − 1 = ( t θ p ) 1 s , a v − 1 = ( u θ p ) 1 v , ( b θ p ) 1 v = ( v u ) θ p 1 v = ( v θ p ) ( u θ p ) 1 v = ( v θ p ) a v − 1 , ( b θ p ) 1 s = ( s t ) θ p 1 s = ( s θ p ) ( t θ p ) 1 s = ( s θ p ) c s − 1 .

Since the idempotents of T form a chain, we have 1 v 1 s = 1 s or 1 v 1 s = 1 v . If 1 s 1 v = 1 s , then

( v θ p ) a v − 1 1 s = ( b θ p ) 1 v 1 s = ( b θ p ) 1 s 1 v = ( s θ p ) c s − 1 1 v , ( v θ p ) a v − 1 1 s = ( v θ p ) a v − 1 1 s 1 s = ( s θ p ) c s − 1 1 v 1 s = ( s θ p ) c s − 1 1 s = ( s θ p ) c s − 1 ,

Multiplying by s from the right on both sides of the second equation above, then

( v θ p ) a v − 1 s = ( s θ p ) c s − 1 s = ( s θ p ) c 1 s = ( s θ p ) c ,

hence c = ( s − 1 v ) θ p a ( v − 1 s ) . This yields that

( m 1 , a , n 1 ) = ( n 1 , v − 1 s , n 3 ) ( m 3 , ( s − 1 v ) θ p a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , ( s − 1 v ) θ p a , n 1 ) ( n 1 , v − 1 s , n 3 ) .

Similarly, we can prove the case that 1 s 1 v = 1 v .

Case 11–(iii,iii). If p ≤ 0 , then there exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ m 1 ≤ n 1 , q 1 ≥ m 1 − m 2 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , 0 ≤ q 2 ≤ m 2 ≤ n 2 , q 2 ≥ m 2 − m 3 , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) .

In this case, n 3 − m 3 = n 1 − m 1 = − p ≥ 0 .

(11.1) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

a = ( u θ m 1 − q 1 ) ( s θ m 2 − q 2 ) c [ ( s − 1 θ m 2 − q 2 ) ( u − 1 θ m 1 − q 1 ) ] θ − p .

This yields that

( m 1 , a , n 1 ) = ( m 1 , ( u θ m 1 − q 1 ) ( s θ m 2 − q 2 ) , m 3 ) ( m 3 , c [ ( s − 1 θ m 2 − q 2 ) ( u − 1 θ m 1 − q 1 ) ] θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c [ ( s − 1 θ m 2 − q 2 ) ( u − 1 θ m 1 − q 1 ) ] θ − p , n 1 ) ( m 1 , ( u θ m 1 − q 1 ) ( s θ m 2 − q 2 ) , m 3 ) .

(11.2) q 1 = m 1 , q 1 ≠ n 1 , q 2 ≠ m 2 , q 2 ≠ n 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = u v , b = v ( u θ − p ) , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) ,

whence a = u ( s θ m 2 − q 2 ) c [ ( s − 1 θ m 2 − q 2 ) u − 1 ] θ − p . This yields that

(11.3) q 1 = n 1 . In this case, we obtain

q 1 = m 1 = n 1 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = ( s θ n 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(11.4) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 = m 2 , q 2 ≠ n 2 . In this case, we obtain

p = m 2 − n 2 ≠ 0 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , b = s t , c = t ( s θ − p ) ,

whence a = ( u θ m 1 − q 1 ) s c [ s − 1 ( u − 1 θ m 1 − q 1 ) ] θ − p . This yields that

(11.5) q 2 = n 2 . In this case, we obtain

q 2 = m 2 = n 2 , m 1 = n 1 , m 3 = n 3 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ m 1 − q 1 ) , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(11.6) q 1 = m 1 , q 1 ≠ n 1 , q 2 = m 2 , q 2 ≠ n 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = u v , b = v ( u θ − p ) , b = s t , c = t ( s θ − p ) ,

whence a = u s c ( s − 1 u − 1 ) θ − p . This yields that

( m 1 , a , n 1 ) = ( m 1 , u s , m 3 ) ( m 3 , c ( s − 1 u − 1 ) θ − p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , c ( s − 1 u − 1 ) θ − p , n 1 ) ( m 1 , u s , m 3 ) .

If p ≥ 0 , then there exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ n 1 ≤ m 1 , q 1 ≥ m 1 − m 2 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , 0 ≤ q 2 ≤ n 2 ≤ m 2 , q 2 ≥ m 2 − m 3 , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) .

In this case, m 1 − n 1 = m 3 − n 3 = p ≥ 0 .

(11.7) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

a = [ ( u θ n 1 − q 1 ) ( s θ n 2 − q 2 ) ] θ p c ( s − 1 θ n 2 − q 2 ) ( u − 1 θ n 1 − q 1 ) .

This yields that

( m 1 , a , n 1 ) = ( m 1 , [ ( u θ n 1 − q 1 ) ( s θ n 2 − q 2 ) ] θ p c , n 3 ) ( n 3 , ( s − 1 θ n 2 − q 2 ) ( u − 1 θ n 1 − q 1 ) , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , ( s − 1 θ n 2 − q 2 ) ( u − 1 θ n 1 − q 1 ) , n 1 ) ( m 1 , [ ( u θ n 1 − q 1 ) ( s θ n 2 − q 2 ) ] θ p c , n 3 ) .

(11.8) q 1 = m 1 . In this case, we obtain

q 1 = n 1 = m 1 , p = 0 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = ( s θ m 2 − q 2 ) t , c = t ( s θ m 2 − q 2 ) .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(11.9) q 1 ≠ m 1 , q 1 = n 1 , q 2 ≠ m 2 , q 2 ≠ n 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = ( u θ p ) v , b = v u , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) ,

whence c = [ ( s − 1 θ n 2 − q 2 ) u − 1 ] θ p a u ( s θ n 2 − q 2 ) . This yields that

( m 1 , a , n 1 ) = ( n 1 , u ( s θ n 2 − q 2 ) , n 3 ) ( m 3 , [ ( s − 1 θ n 2 − q 2 ) u − 1 ] θ p a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , [ ( s − 1 θ n 2 − q 2 ) u − 1 ] θ p a , n 1 ) ( n 1 , u ( s θ n 2 − q 2 ) , n 3 ) .

(11.10) q 2 = m 2 . In this case, we obtain

q 2 = n 2 = m 2 , p = 0 , m 1 = n 1 , m 3 = n 3 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ m 1 − q 1 ) , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(11.11) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 ≠ m 2 , q 2 = n 2 . In this case, we obtain

p = m 2 − n 2 ≠ 0 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , b = ( s θ p ) t , c = t s ,

whence c = [ s − 1 ( u − 1 θ n 1 − q 1 ) ] θ p a ( u θ n 1 − q 1 ) s . This yields that

( m 1 , a , n 1 ) = ( n 1 , ( u θ n 1 − q 1 ) s , n 3 ) ( m 3 , [ s − 1 ( u − 1 θ n 1 − q 1 ) ] θ p a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , [ s − 1 ( u − 1 θ n 1 − q 1 ) ] θ p a , n 1 ) ( n 1 , ( u θ n 1 − q 1 ) s , n 3 ) .

(11.12) q 1 ≠ m 1 , q 1 = n 1 , q 2 ≠ m 2 , q 2 = n 2 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = ( u θ p ) v , b = v u , b = ( s θ p ) t , c = t s ,

whence c = ( s − 1 u − 1 ) θ p a u s . This yields that

( m 1 , a , n 1 ) = ( n 1 , u s , n 3 ) ( m 3 , ( s − 1 u − 1 ) θ p a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , ( s − 1 u − 1 ) θ p a , n 1 ) ( n 1 , u s , n 3 ) .

Case 12–(iii,iv). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ n 1 ≤ m 1 , q 1 ≥ m 1 − m 2 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 )

and 0 ≤ q 2 ≤ p , b = ( s θ p − q 2 ) t , c = ( t θ q 2 ) s . In this case,

m 1 − n 1 = m 3 − n 3 = p ≥ 0 , m 3 − q 2 ≥ m 3 − p = n 3 , n 1 + q 2 ≥ n 1 .

(12.1) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 ≠ p , q 2 ≠ 0 . In this case, we obtain

a = [ ( u θ n 1 − q 1 ) t − 1 ] θ p ( c θ p − q 2 ) t ( u − 1 θ n 1 − q 1 ) .

This yields that

( m 1 , a , n 1 ) = ( n 1 + q 2 , [ ( u θ n 1 − q 1 ) t − 1 ] θ q 2 c , n 3 ) ( m 3 − q 2 , t ( u − 1 θ n 1 − q 1 ) , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 − q 2 , t ( u − 1 θ n 1 − q 1 ) , n 1 ) ( n 1 + q 2 , [ ( u θ n 1 − q 1 ) t − 1 ] θ q 2 c , n 3 ) .

(12.2) q 1 = m 1 . In this case, we obtain

q 1 = n 1 = m 1 , p = 0 , m 2 = n 2 , m 3 = n 3 , q 2 = 0 , a = u v , b = v u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(12.3) q 1 ≠ m 1 , q 1 = n 1 , q 2 ≠ p , q 2 ≠ 0 . In this case, we obtain

a = ( u θ p ) v , b = v u , b = ( s θ p − q 2 ) t , c = ( t θ q 2 ) s ,

whence c = [ s − 1 ( u − 1 θ q 2 ) ] θ p ( a θ q 2 ) ( u θ q 2 ) s . This yields that

( m 1 , a , n 1 ) = ( n 1 + q 2 , ( u θ q 2 ) s , n 3 ) ( m 3 − q 2 , [ s − 1 ( u − 1 θ q 2 ) ] θ p − q 2 a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 − q 2 , [ s − 1 ( u − 1 θ q 2 ) ] θ p − q 2 a , n 1 ) ( n 1 + q 2 , ( u θ q 2 ) s , n 3 ) .

(12.4) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

p = q 2 ≠ 0 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , b = s t , c = ( t θ p ) s ,

whence a = [ ( u θ n 1 − q 1 ) t − 1 ] θ p c t ( u − 1 θ n 1 − q 1 ) . This yields that

(12.5) q 1 ≠ m 1 , q 1 ≠ n 1 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

p ≠ 0 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ n 1 − q 1 ) , b = ( s θ p ) t , c = t s ,

whence c = [ s − 1 ( u − 1 θ n 1 − q 1 ) ] θ p a ( u θ n 1 − q 1 ) s . This yields that

(12.6) q 1 ≠ m 1 , q 1 = n 1 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

a = ( u θ p ) v , b = v u , b = s t , c = ( t θ p ) s ,

whence ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by (10.12).

(12.7) q 1 ≠ m 1 , q 1 = n 1 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

p = m 1 − n 1 ≠ 0 , a = ( u θ p ) v , b = v u , b = ( s θ p ) t , c = t s ,

whence c = ( s − 1 u − 1 ) θ p a u s . This yields that

( m 1 , a , n 1 ) = ( n 1 , u s , n 3 ) ( m 3 , ( s − 1 u − 1 ) θ p a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , ( s − 1 u − 1 ) θ p a , n 1 ) ( n 1 , u s , n 3 ) .

(12.8) q 2 = p , q 2 = 0 . In this case, we obtain

m 1 = n 1 , m 2 = n 2 , m 3 = n 3 , q 2 = 0 , a = ( u θ m 1 − q 1 ) v , b = v ( u θ m 1 − q 1 ) , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

Case 13–(iv,i). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ p , a = ( u θ p − q 1 ) v , b = ( v θ q 1 ) u , p ≤ q 2 ≤ 0 , b = s ( t θ q 2 − p ) , c = t ( s θ − q 2 ) .

In this case,

p = 0 , q 1 = q 2 = 0 , a = u v , b = v u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

Case 14–(iv,ii). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ p , a = ( u θ p − q 1 ) v , b = ( v θ q 1 ) u , 0 ≤ q 2 ≤ n 2 ≤ m 2 , q 2 ≥ m 2 − m 3 , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s .

In this case,

m 1 − n 1 = m 3 − n 3 = p ≥ 0 , m 3 − q 1 ≥ m 3 − p = n 3 , n 1 + q 1 ≥ n 1 .

(14.1) q 1 ≠ p , q 1 ≠ 0 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

c = [ ( t θ n 2 − q 2 ) u − 1 ] θ p ( a θ q 1 ) u ( t − 1 θ n 2 − q 2 ) .

This yields that

( m 1 , a , n 1 ) = ( n 1 + q 1 , u ( t − 1 θ n 2 − q 2 ) , n 3 ) ( m 3 − q 1 , [ ( t θ n 2 − q 2 ) u − 1 ] θ p − q 1 a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 − q 1 , [ ( t θ n 2 − q 2 ) u − 1 ] θ p − q 1 a , n 1 ) ( n 1 + q 1 , u ( t − 1 θ n 2 − q 2 ) , n 3 ) .

(14.2) q 1 = p , q 1 ≠ 0 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

p = q 1 ≠ 0 , a = u v , b = ( v θ p ) u , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s ,

whence a = [ v − 1 ( t − 1 θ n 2 − q 2 ) ] θ p c [ ( t θ n 2 − q 2 ) v ] . This yields that

(14.3) q 1 ≠ p , q 1 = 0 , q 2 ≠ n 2 , q 2 ≠ m 2 . In this case, we obtain

p ≠ 0 , a = ( u θ p ) v , b = v u , b = s ( t θ n 2 − q 2 ) , c = ( t θ m 2 − q 2 ) s ,

whence c = [ ( t θ n 2 − q 2 ) u − 1 ] θ p a [ u ( t − 1 θ n 2 − q 2 ) ] . This yields that

(14.4) q 1 ≠ p , q 1 ≠ 0 , q 2 = n 2 , q 2 ≠ m 2 . In this case, we obtain

a = ( u θ p − q 1 ) v , b = ( v θ q 1 ) u , b = s t , c = ( t θ p ) s ,

whence a = [ v − 1 ( t − 1 θ p − q 1 ) ] θ p ( c θ p − q 1 ) [ ( t θ p − q 1 ) v ] . This yields that

( m 1 , a , n 1 ) = ( n 1 + q 1 , [ v − 1 ( t − 1 θ p − q 1 ) ] θ q 1 c , n 3 ) ( m 3 − q 1 , ( t θ p − q 1 ) v , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 − q 1 , ( t θ p − q 1 ) v , n 1 ) ( n 1 + q 1 , [ v − 1 ( t − 1 θ p − q 1 ) ] θ q 1 c , n 3 ) .

(14.5) q 2 = m 2 . In this case, we obtain

q 2 = n 2 = m 2 , p = 0 , m 1 = n 1 , m 3 = n 3 , q 1 = 0 , a = u v , b = v u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(14.6) q 1 = p , q 1 = 0 . In this case, we obtain

m 1 = n 1 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = s ( t θ n 2 − q 2 ) , c = ( t θ n 2 − q 2 ) s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(14.7) q 1 = p , q 1 ≠ 0 , q 2 = n 2 , q 2 ≠ m 2 . In this case, we obtain

p = q 1 ≠ 0 , a = u v , b = ( v θ p ) u , b = s t , c = ( t θ p ) s ,

whence a = ( v − 1 t − 1 ) θ p c ( t v ) . This yields that

( m 1 , a , n 1 ) = ( m 1 , ( v − 1 t − 1 ) θ p c , n 3 ) ( n 3 , t v , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , t v , n 1 ) ( m 1 , ( v − 1 t − 1 ) θ p c , n 3 ) .

(14.8) q 1 ≠ p , q 1 = 0 , q 2 = n 2 , q 2 ≠ m 2 . In this case, we obtain

a = ( u θ p ) v , b = v u , b = s t , c = ( t θ p ) s ,

whence ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by (10.12).

Case 15–(iv,iii). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ p , a = ( u θ p − q 1 ) v , b = ( v θ q 1 ) u , 0 ≤ q 2 ≤ n 2 ≤ m 2 , q 2 ≥ m 2 − m 3 , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) .

In this case,

m 1 − n 1 = m 3 − n 3 = p ≥ 0 , m 3 − q 1 ≥ m 3 − p = n 3 , n 1 + q 1 ≥ n 1 .

(15.1) q 1 ≠ p , q 1 ≠ 0 , q 2 ≠ m 2 , q 2 ≠ n 2 . In this case, we obtain

c = [ ( s − 1 θ n 2 − q 2 ) u − 1 ] θ p ( a θ q 1 ) u ( s θ n 2 − q 2 ) .

This yields that

( m 1 , a , n 1 ) = ( n 1 + q 1 , u ( s θ n 2 − q 2 ) , n 3 ) ( m 3 − q 1 , [ ( s − 1 θ n 2 − q 2 ) u − 1 ] θ p − q 1 a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 − q 1 , [ ( s − 1 θ n 2 − q 2 ) u − 1 ] θ p − q 1 a , n 1 ) ( n 1 + q 1 , u ( s θ n 2 − q 2 ) , n 3 ) .

(15.2) q 1 = p , q 1 ≠ 0 , q 2 ≠ m 2 , q 2 ≠ n 2 . In this case, we obtain

p = q 1 ≠ 0 , a = u v , b = ( v θ p ) u , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) ,

whence a = [ v − 1 ( s θ n 2 − q 2 ) ] θ p c [ ( s − 1 θ n 2 − q 2 ) v ] . This yields that

(15.3) q 1 ≠ p , q 1 = 0 , q 2 ≠ m 2 , q 2 ≠ n 2 . In this case, we obtain

p ≠ 0 , a = ( u θ p ) v , b = v u , b = ( s θ m 2 − q 2 ) t , c = t ( s θ n 2 − q 2 ) ,

whence c = [ ( s − 1 θ n 2 − q 2 ) u − 1 ] θ p a u ( s θ n 2 − q 2 ) . This yields that

(15.4) q 2 = m 2 . In this case, we obtain

q 2 = n 2 = m 2 , p = 0 , m 1 = n 1 , m 3 = n 3 , q 1 = 0 , a = u v , b = v u , b = s t , c = t s .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(15.5) q 1 ≠ p , q 1 ≠ 0 , q 2 ≠ m 2 , q 2 = n 2 . In this case, we obtain

a = ( u θ p − q 1 ) v , b = ( v θ q 1 ) u , b = ( s θ p ) t , c = t s ,

whence c = ( s − 1 u − 1 ) θ p ( a θ q 1 ) u s . This yields that

( m 1 , a , n 1 ) = ( n 1 + q 1 , u s , n 3 ) ( m 3 − q 1 , ( s − 1 u − 1 ) θ p − q 1 a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 − q 1 , ( s − 1 u − 1 ) θ p − q 1 a , n 1 ) ( n 1 + q 1 , u s , n 3 ) .

(15.6) q 1 = p , q 1 = 0 . In this case, we obtain

m 1 = n 1 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = ( s θ m 2 − q 2 ) t , c = t ( s θ m 2 − q 2 ) .

By Lemmas 1.1 and 2.1, ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) .

(15.7) q 1 = p , q 1 ≠ 0 , q 2 ≠ m 2 , q 2 = n 2 . In this case, we obtain

a = u v , b = ( v θ p ) u , b = ( s θ p ) t , c = t s ,

whence ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by (7.12).

(15.8) q 1 ≠ p , q 1 = 0 , q 2 ≠ m 2 , q 2 = n 2 . In this case, we obtain

p ≠ 0 , a = ( u θ p ) v , b = v u , b = ( s θ p ) t , c = t s ,

whence c = ( s − 1 u − 1 ) θ p a u s . This yields that

( m 1 , a , n 1 ) = ( n 1 , u s , n 3 ) ( m 3 , ( s − 1 u − 1 ) θ p a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , ( s − 1 u − 1 ) θ p a , n 1 ) ( n 1 , u s , n 3 ) .

Case 16–(iv,iv). There exist q 1 , q 2 ∈ Z and u , v , s , t ∈ T such that

0 ≤ q 1 ≤ p , a = ( u θ p − q 1 ) v , b = ( v θ q 1 ) u , 0 ≤ q 2 ≤ p , b = ( s θ p − q 2 ) t , c = ( t θ q 2 ) s .

In this case,

m 3 − q 1 ≥ m 3 − p = n 3 , n 1 + q 1 ≥ n 1 , m 3 − q 2 ≥ m 3 − p = n 3 , n 1 + q 2 ≥ n 1 .

(16.1) q 1 ≠ p , q 1 ≠ 0 , q 2 ≠ p , q 2 ≠ 0 . In this case, we have 0 < q 1 + q 2 < 2 p .

If − p < q 1 + q 2 − p < 0 , then we have c = [ s − 1 ( u − 1 θ q 2 ) ] θ p ( a θ q 1 + q 2 ) ( u θ q 2 ) s . This implies that

( m 1 , a , n 1 ) = ( n 1 + q 1 + q 2 , ( u θ q 2 ) s , n 3 ) ( m 3 − q 1 − q 2 , [ s − 1 ( u − 1 θ q 2 ) ] θ p − q 1 − q 2 a , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 − q 1 − q 2 , [ s − 1 ( u − 1 θ q 2 ) ] θ p − q 1 − q 2 a , n 1 ) ( n 1 + q 1 + q 2 , ( u θ q 2 ) s , n 3 ) .

If 0 < q 1 + q 2 − p < p , then we have a = [ v − 1 ( t − 1 θ p − q 1 ) ] θ p ( c θ p − ( q 1 + q 2 − p ) ) ( t θ p − q 1 ) v . This implies that

( m 1 , a , n 1 ) = ( n 1 + q 1 + q 2 − p , [ v − 1 ( t − 1 θ p − q 1 ) ] θ q 1 + q 2 − p c , n 3 ) ( m 3 + p − q 1 − q 2 , ( t θ p − q 1 ) v , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 + p − q 1 − q 2 , ( t θ p − q 1 ) v , n 1 ) ( n 1 + q 1 + q 2 − p , [ v − 1 ( t − 1 θ p − q 1 ) ] θ q 1 + q 2 − p c , n 3 ) .

If q 1 + q 2 − p = 0 , then we have

c = [ s − 1 ( u − 1 θ q 2 ) ] θ p ( a θ p ) ( u θ q 2 ) s , a = [ v − 1 ( t − 1 θ p − q 1 ) ] θ p ( c θ p ) ( t θ p − q 1 ) v ,

and hence 1 s ( t − 1 θ p − q 1 ) c = ( t − 1 θ p − q 1 ) c , 1 v ( u − 1 θ q 2 ) a = ( u − 1 θ q 2 ) a . Since the idempotents of T form a chain, we have 1 s 1 v = 1 s or 1 s 1 v = 1 v . If 1 s 1 v = 1 v , then

( u θ q 2 ) s s − 1 ( u − 1 θ q 2 ) a = ( u θ q 2 ) 1 s 1 v ( u − 1 θ q 2 ) a = ( u θ q 2 ) 1 v ( u − 1 θ q 2 ) a = ( u θ q 2 ) ( u − 1 θ q 2 ) a = a .

This implies that

( m 1 , a , n 1 ) = ( m 1 , ( u θ q 2 ) s , n 3 ) ( n 3 , s − 1 ( u − 1 θ q 2 ) a , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , s − 1 ( u − 1 θ q 2 ) a , n 1 ) ( m 1 , ( u θ q 2 ) s , n 3 ) .

If 1 s 1 v = 1 s , then

( t θ p − q 1 ) v v − 1 ( t − 1 θ p − q 1 ) c = ( t θ p − q 1 ) 1 v 1 s ( t − 1 θ p − q 1 ) c = ( t θ p − q 1 ) 1 s ( t − 1 θ p − q 1 ) c = ( t θ p − q 1 ) ( t − 1 θ p − q 1 ) c = c .

This implies that

( m 1 , a , n 1 ) = ( n 1 , v − 1 ( t − 1 θ p − q 1 ) c , n 3 ) ( m 3 , ( t θ p − q 1 ) v , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , ( t θ p − q 1 ) v , n 1 ) ( n 1 , v − 1 ( t − 1 θ p − q 1 ) c , n 3 ) .

(16.2) q 1 = p , q 1 ≠ 0 , q 2 ≠ p , q 2 ≠ 0 . In this case, we obtain

a = u v , b = ( v θ p ) u , b = ( s θ p − q 2 ) t , c = ( t θ q 2 ) s ,

whence a = ( v − 1 t − 1 ) θ p ( c θ p − q 2 ) t v . This yields that

(16.3) q 1 ≠ p , q 1 = 0 , q 2 ≠ p , q 2 ≠ 0 . In this case, we obtain

a = ( u θ p ) v , b = v u , b = ( s θ p − q 2 ) t , c = ( t θ q 2 ) s ,

whence c = [ s − 1 ( u − 1 θ q 2 ) ] θ p ( a θ q 2 ) ( u θ q 2 ) s . This yields that

(16.4) q 1 ≠ p , q 1 ≠ 0 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

a = ( u θ p − q 1 ) v , b = ( v θ q 1 ) u , b = s t , c = ( t θ p ) s ,

whence a = [ v − 1 ( t − 1 θ p − q 1 ) ] θ p ( c θ p − q 1 ) ( t θ p − q 1 ) v . This yields that

(16.5) q 1 ≠ p , q 1 ≠ 0 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

a = ( u θ p − q 1 ) v , b = ( v θ q 1 ) u , b = ( s θ p ) t , c = t s ,

whence c = ( s − 1 u − 1 ) θ p ( a θ q 1 ) ( u s ) . This yields that

(16.6) q 1 = p , q 1 = 0 . In this case, we obtain

q 2 = p = 0 , m 1 = n 1 , m 2 = n 2 , m 3 = n 3 , a = u v , b = v u , b = s t , c = t s .

(16.7) q 1 = p , q 1 ≠ 0 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

a = u v , b = ( v θ p ) u , b = s t , c = ( t θ p ) s ,

whence p = q 1 ≠ 0 , a = ( v − 1 t − 1 ) θ p c t v . This yields that

( m 1 , a , n 1 ) = ( m 1 , ( v − 1 t − 1 ) θ p c , n 3 ) ( n 3 , t v , n 1 ) , ( m 3 , c , n 3 ) = ( n 3 , t v , n 1 ) ( m 1 , ( v − 1 t − 1 ) θ p c , n 3 ) .

(16.8) q 1 = p , q 1 ≠ 0 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

a = u v , b = ( v θ p ) u , b = ( s θ p ) t , c = t s ,

whence ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by (7.12).

(16.9) q 1 ≠ p , q 1 = 0 , q 2 = p , q 2 ≠ 0 . In this case, we obtain

a = ( u θ p ) v , b = v u , b = s t , c = ( t θ p ) s ,

whence ( m 1 , a , m 1 ) ∼ p ( m 3 , c , m 3 ) by (10.12).

(16.10) q 1 ≠ p , q 1 = 0 , q 2 ≠ p , q 2 = 0 . In this case, we obtain

p ≠ 0 , a = ( u θ p ) v , b = v u , b = ( s θ p ) t , c = t s ,

whence c = ( s − 1 u − 1 ) θ p a u s . This yields that

( m 1 , a , n 1 ) = ( n 1 , u s , n 3 ) ( m 3 , ( s − 1 u − 1 ) θ p , n 1 ) , ( m 3 , c , n 3 ) = ( m 3 , ( s − 1 u − 1 ) θ p , n 1 ) ( n 1 , u s , n 3 ) .

We have completed the proof.□

The following example shows that ∼ p is not transitive in a Bruck-Reilly extension of a general Clifford semigroup.

Example 2.4

Let Y = { 0 , 1 , α , β , γ , δ } be a semilattice with the greatest element 1 and the least element 0 such that the four elements α , β , γ , δ are pairwise incomparable. Consider the Bruck-Reilly extension S = BR ( Y , θ ) of Y determined by θ where θ : Y → { 1 } , x ↦ 1 . Take three elements ( 0 , α , 1 ) , ( 0 , 0 , 1 ) and ( 0 , β , 1 ) in S . Since

( 0 , 0 , 1 ) = ( 0 , β , 0 ) ( 0 , α , 1 ) , ( 0 , α , 1 ) = ( 0 , α , 1 ) ( 0 , β , 0 ) , ( 0 , 0 , 1 ) = ( 0 , γ , 0 ) ( 0 , δ , 1 ) , ( 0 , δ , 1 ) = ( 0 , δ , 1 ) ( 0 , γ , 0 ) ,

we have ( 0 , α , 1 ) ∼ p ( 0 , 0 , 1 ) and ( 0 , 0 , 1 ) ∼ p ( 0 , δ , 1 ) . Suppose that ( 0 , α , 1 ) ∼ p ( 0 , δ , 1 ) . In view of Lemma 2.2 and the fact that p = 0 − 1 = − 1 < 0 , we obtain that at least one of items (1), (2) and (3) in Lemma 2.2 holds. We shall show that this is impossible. In fact, if (1) holds, then there exist q ∈ Z , c , d ∈ Y such that − 1 = p ≤ q ≤ 0 , α = c ( d θ q − p ) and δ = d ( c θ − q ) whence q = 0 or q = − 1 . If q = 0 , then α = c ( d θ ) = c 1 = c and δ = d c . This implies that δ = d α , and so δ ≤ α . If q = − 1 , then α = c d and δ = d ( c θ ) = d 1 = d . This gives that α = c δ , and so α ≤ δ . If (2) holds, then there exist q ∈ Z , c , d ∈ Y such that

0 ≤ q ≤ min { 0 , 1 } , q ≥ 0 − 0 , α = c ( d θ 1 − q ) , δ = ( d θ 0 − q ) c ,

which shows that q = 0 , and so α = c ( d θ ) = c 1 = c and δ = d c = d α . Thus, δ ≤ α . If (3) holds, then there exist q ∈ Z , c , d ∈ Y such that

0 ≤ q ≤ min { 0 , 1 } , q ≥ 0 − 0 , α = ( c θ 0 − q ) d , δ = d ( c θ 1 − q ) .

This implies that α = c δ , and so α ≤ δ . We have shown that α and δ are comparable in any case. However, α and δ are incomparable by hypothesis, which is a contradiction. Thus, ∼ p is not transitive.

Remark 2.5

From the Introduction part, ∼ p is contained in ∼ o = ∼ c in Bruck-Reilly extensions of general Clifford semigroups. We observe that the inclusion ∼ p ⊆ ∼ o is proper by the following example. Let T be a Clifford monoid which has at least two ℋ -classes and S = BR ( T , θ ) the Bruck-Reilly extension of T determined by θ . Assume that e and f are distinct idempotents in T . Then ( 0 , e , 0 ) and ( 0 , f , 0 ) are two idempotents in S . By the fact (1.1), we have ( 0 , e , 0 ) ∼ o ( 0 , f , 0 ) . If ( 0 , e , 0 ) ∼ p ( 0 , f , 0 ) , then by Lemma 2.1 we obtain that e ∼ p f in T . Thus, there exist c , d ∈ T such that e = c d and f = d c , and so e , f lie in the same ℋ -class of T whence e = f , which is a contradiction.

3 The primary conjugacy is transitive in regular ω -semigroups

In this section, we shall show that the primary conjugacy ∼ p is transitive in any regular ω -semigroup by using the technical results obtained in Section 2.

Theorem 3.1

The relation ∼ p in a regular ω -semigroup is transitive.

Proof

Let S be a regular ω -semigroup. If S has no kernel, then S is a Clifford semigroup by Lemma 1.3, and so ∼ p is transitive by Lemma 1.1. If S has kernel K and S = K , then by Lemma 1.3, S is a Bruck-Reilly extension BR ( T , θ ) of T determined by θ in which T is a Clifford monoid whose idempotents form a chain, and so ∼ p is transitive by Lemma 2.3.

Now, we consider the case that S has kernel K which is not equal to S . By Lemma 1.4, we can assume that S is the semigroup constructed in Lemma 1.4. Suppose that a , b , c ∈ S and a ∼ p b , b ∼ p c . Then there exist u , v , s , t ∈ S such that

a = u ∘ v , b = v ∘ u , b = s ∘ t , c = t ∘ s .

We shall consider the following cases in the sequel.

(1) If u , v , s , t ∈ K , then a , b , c ∈ K and a ∼ p b and b ∼ p c in K . Since K is a simple regular ω -semigroup, it follows that K has kernel K , and so a ∼ p c in K by the above arguments. This certainly gives that a ∼ p c in S .

(2) If v , s , t ∈ K and u ∈ S \ K , then u ∈ G i for some i with 0 ≤ i ≤ l − 1 . By Lemma 1.4 we have

a = u ∘ v = ( u α i , l ) v , b = v ∘ u = v ( u α i , l ) , b = s ∘ t = s t , c = t ∘ s = t s .

Observe that u α i , l , v , s , t are all in K , it follows that a , b , c ∈ K and a ∼ p b , b ∼ p c in K , and so a ∼ p c in K by Lemma 2.3. Hence, a ∼ p c in S . Similarly, we can prove a ∼ p c in S for all the cases with ∣ { u , v , s , t } ∩ K ∣ = 3 .

(3) If u , v ∈ K and s , t ∈ S \ K , then s ∈ G i and t ∈ G j for some i , j with 0 ≤ i , j ≤ l − 1 . By Lemma 1.4 we have

b = v ∘ u = v u ∈ K , b = s ∘ t = ( s α i , x ) ( t α j , x ) ∈ S \ K ,

where x = max { i , j } . This leads to a contradiction. Similarly, we can prove the case that u , v ∉ K and s , t ∈ K is also impossible.

(4) If v , t ∈ K and u , s ∈ S \ K , then u ∈ G i and s ∈ G j for some i , j with 0 ≤ i , j ≤ l − 1 . By Lemma 1.4 we have

a = u ∘ v = ( u α i , l ) v , b = v ∘ u = v ( u α i , l ) , b = s ∘ t = ( s α j , l ) t , c = t ∘ s = t ( s α j , l ) .

By similar arguments in Case (2), we have a ∼ p c in S . Similarly, we can prove a ∼ p c in S for the following cases: (i) u , s ∈ K , v , t ∈ S \ K , (ii) u , t ∈ K , v , s ∈ S \ K and (iii) v , s ∈ K , u , t ∈ S \ K .

(5) If s ∈ K and u , v , t ∈ S \ K , then u ∈ G i , v ∈ G j and t ∈ G r for some i , j , r with 0 ≤ i , j , r ≤ l − 1 . By Lemma 1.4, we have

b = v ∘ u = ( v α j , x ) ( u α i , x ) ∈ S \ K , b = s ∘ t = s ( t α r , l ) ∈ K ,

where x = max { i , j } . This also leads to a contradiction. Therefore, this case does not occur. Similarly, we can show that it is impossible for all the cases with ∣ { u , v , s , t } ∩ K ∣ = 1 .

(6) If u , v , s , t ∈ S \ K , then u ∈ G i , v ∈ G j , s ∈ G n and t ∈ G m for some i , j , m , n with 0 ≤ i , j , n , m ≤ l − 1 . By Lemma 1.4, we have

a = u ∘ v = ( u α i , x ) ( v α j , x ) , b = v ∘ u = ( v α j , x ) ( u α i , x ) , b = s ∘ t = ( s α n , y ) ( t α m , y ) , c = t ∘ s = ( t α m , y ) ( s α n , y ) ,

where x = max { i , j } and y = max { m , n } . This implies that b ∈ G x and b ∈ G y whence x = y . Thus, a , b , c ∈ G x and a ∼ p b , b ∼ p c in the group G x , and hence a ∼ p c in G x by Lemma 1.1. Certainly, it follows that a ∼ p c in S .□

Remark 3.2

By Theorem 3.1, primary conjugacy in a regular ω -semigroup is transitive. However, the proof is too complicated. Thus, it will be a necessary work to find a simple proof of this result in future. We observe that it is impossible to give a proof by showing that ∼ o = ∼ p according to Remark 2.5. Moreover, the characterizations of various kinds of conjugacy relations and the relationships among them on regular ω -semigroups are also worthy of further study.

Acknowledgement

The authors are deeply grateful to all the referees for their valuable comments and suggestions which lead to a great improvement of this article.

Funding information: This research was supported by Nature Science Foundations of China (12271442, 11661082) and a Nature Science Foundation of Shandong Province of China (ZR2020MA002).
Conflict of interest: The authors state no conflict of interest.

References

[1] G. Kudryavtseva and V. Mazorchuk, On three approaches to conjugacy in semigroups, Semigroup Forum 78 (2009), no. 1, 14–20, https://doi.org/10.1007/s00233-008-9047-7. Search in Google Scholar

[2] G. Kudryavtseva and V. Mazorchuk, On conjugation in some transformation and Brauer-type semigroups, Publ. Math. Debrecen 70 (2007), no. 1–2, 19–43. 10.5486/PMD.2006.3354Search in Google Scholar

[3] F. Otto, Conjugacy in monoids with a special Church-Rosser presentation is decidable, Semigroup Forum 29 (1984), no. 1, 223–240, https://doi.org/10.1007/BF02573327. Search in Google Scholar

[4] J. Araújo, J. Konieczny, and A. Malheiro, Conjugation in semigroups, J. Algebra 403 (2014), 93–134, https://doi.org/10.1016/j.jalgebra.2013.12.025. Search in Google Scholar

[5] J. Araújo, M. Kinyon, J. Konieczny, and A. Malheiro, Four notions of conjugacy for abstract semigroups, Proc. Roy. Soc. Edinburgh Sect. A 147 (2017), no. 6, 1169–1214, https://doi.org/10.1017/S0308210517000099. Search in Google Scholar

[6] J. Araújo, M. Kinyon, and J. Konieczny, Conjugacy in inverse semigroups, J. Algebra 533 (2019), 142–173, https://doi.org/10.1016/j.jalgebra.2019.05.022. Search in Google Scholar

[7] G. Kudryavtseva, On Conjugacy in Regular Epigroups, 2006, https://doi.org/10.48550/arXiv.math/0605698. Search in Google Scholar

[8] J. Konieczny, A new definition of conjugacy for semigroups, J. Algebra Appl. 17 (2018), no. 2, 1850032, https://doi.org/10.1142/S0219498818500329. Search in Google Scholar

[9] J. Araújo, M. Kinyon, J. Konieczny, and A. Malheiro, Decidability and independence of conjugacy problems in finitely presented monoids, Theoret. Comput. Sci. 731 (2018), 88–98, https://doi.org/10.1016/j.tcs.2018.04.002. Search in Google Scholar

[10] C. Choffrut, Conjugacy in free inverse monoids, Int. J. Algebra Comput. 3 (1993), no. 2, 169–188, https://doi.org/10.1142/S0218196793000135. Search in Google Scholar

[11] A. J. Cain, A. Malheiro, and F. M. Silva, Conjugacy in Patience Sorting Monoids, 2018, https://doi.org/10.48550/arXiv.1803.00361. Search in Google Scholar

[12] O. Ganyushkin and T. Kormysheva, The chain decomposition of partial permutations and classes of conjugate elements of the semigroup ISn, Vianyk Kyiv Univ. 2 (1993), 10–18. Search in Google Scholar

[13] L. Zhang, Conjugacy in special monoids, J. Algebra 143 (1991), no. 2, 487–497, https://doi.org/10.1016/0021-8693(91)90275-D. Search in Google Scholar

[14] M. Borralho and M. Kinyon, Variants of epigroups and primary conjugacy, Commun. Algebra 48 (2020), no. 12, 5465–5473, https://doi.org/10.1080/00927872.2020.1791145. Search in Google Scholar

[15] M. Borralho, The transitivity of primary conjugacy in a class of semigroups, Quasigroups Related Systems 28 (2020), no. 1, 43–46. Search in Google Scholar

[16] R. C. Lyndon and M. P. Schützenberger, The equation am=bncp in a free group, Michigan Math. J. 9 (1962), no. 4, 289–298, https://doi.org/10.1307/mmj/1028998766. Search in Google Scholar

[17] G. Lallement, Semigroups and combinatorial applications, Pure and Applied Mathematics, A Wiley-Interscience Publication. John Wiley & Sons, New York-Chichester-Brisbane, 1979. Search in Google Scholar

[18] O. Ganyushkin and V. Mazorchuk, Classical finite transformation semigroups, Algebra and Applications, Vol. 9, Springer-Verlag, London, 2009, https://doi.org/10.1007/978-1-84800-281-4. Search in Google Scholar

[19] J. M. Howie, Fundamentals of semigroup theory, London Mathematical Society Monographs, Vol. 12, Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1995. Search in Google Scholar

[20] B. P. Kočin, The structure of inverse ideal-simple ω-semigroups, Vestnik Leningrad. Univ. Mat. Meh. Astronom. 23 (1968), no. 7, 41–50, (in Russian). Search in Google Scholar

[21] W. D. Munn, Regular ω-semigroups, Glasgow Math. J. 9 (1968), no. 1, 46–66, https://doi.org/10.1017/S0017089500000288. Search in Google Scholar

[22] N. R. Reilly, Bisimple ω-semigroups, Glasgow Math. J. 7 (1966), no. 3, 160–167, https://doi.org/10.1017/S2040618500035346. Search in Google Scholar

[23] M. Petrich, Inverse Semigroups, John Wiley and Sons, New York, 1984. Search in Google Scholar

[24] D. B. McAlister and P. J. Medeiros, Compatible total orders on ω-regular semigroups, Semigroup Forum 89 (2014), no. 1, 217–235, https://doi.org/10.1007/s00233-013-9514-7. Search in Google Scholar

Received: 2022-06-24

Accepted: 2022-10-20

Published Online: 2022-11-24

This work is licensed under the Creative Commons Attribution 4.0 International License.

Articles in the same Issue

https://doi.org/10.1515/math-2022-0523

Keywords for this article

regular ω-semigroup; primary conjugacy; transitive

Creative Commons

BY 4.0