Home Mathematics The lattice of (2, 1)-congruences on a left restriction semigroup
Article Open Access

The lattice of (2, 1)-congruences on a left restriction semigroup

  • Haijun Liu and Xiaojiang Guo EMAIL logo
Published/Copyright: October 12, 2022

Abstract

All the (2, 1)-congruences on a left restriction semigroup become a complete sublattice of its lattice of congruences. The aim of this article is to study certain fundamental properties of this complete sublattice. We introduce k -, K -, t -, and T -operators on this sublattice and obtain some properties. As applications, the remarkable (2, 1)-congruences are characterized. These results extend the corresponding results on inverse semigroups and ample semigroups.

MSC 2010: 20M10; 20M75

1 Introduction

Inverse semigroups play an important role in the theory of semigroups and appear in many branches of mathematics. So, many semigroup scholars have been trying to generalize inverse semigroups. One of the most successful generalizations is (left; right) ample semigroups, originated by Fountain (see, [1,2]). (Left; Right) restriction semigroups are generalizations of (left; right) ample semigroups (of course, extensions of inverse semigroups).

Left restriction semigroups (termed as weakly left E -ample semigroups in some context) arise from many sources (see [2,3]). They are a class of semigroups equipped with one additional unary operation + (i.e., unary semigroups), which satisfy certain identities. Such semigroups are isomorphic to unary subsemigroups of partial transformation semigroups PT X , where the unary operation + is of the form α I dom α . The reader can consult [4,5] for history and more details. In particular, each inverse semigroup S can be shaped into a left restriction semigroup where the unary operation + is defined by the rule a + = a a 1 for a S . Certainly, S also has another unary operation 1 , which will not have a crucial part to play at this stage. In this sense, left restriction semigroups are regarded as being natural extensions of inverse semigroups, obtained by weakening the condition of regularity, and they have many analogous properties. Consequently, such class of semigroups has been recently extensively researched by many semigroup experts from various perspectives (see [6,7,8]).

The theory of congruences plays a significant role in semigroup theory. Many researchers have been investigating such a theory (e.g., see [9,10, 11,12,13, 14,15,16, 17,18,19, 20,21] and references therein). The most useful tool in studying congruences is the kernel-trace approach, which is successfully used to research the congruences on inverse semigroups (e.g., see [9,10]). In 1986, Pastijn and Petrich [11] established the kernel-trace theory on general regular semigroups. Recently, El-Qallali in [12] developed the kernel-trace theory on ample semigroups, which is similar to that on inverse semigroups. He characterized the structural properties of the smallest and the greatest (admissible) congruences having the same kernel and the same trace as a given admissible congruence. From the universal algebraic point of view, a left restriction semigroup is an algebra of type (2, 1), so we will mainly concentrate on the (2, 1)-congruences. In the case of inverse semigroups, congruences must be admissible ones while the admissible congruences on ample semigroups are necessarily (2, 1)-congruences, even ( 2 , 1 , 1 ) -congruences (see [12, Lemma 2.2]). Meanwhile, the projections will take over the role of idempotents in the process of studying left restriction semigroups, correspondingly, the kernel and trace of congruences will be replaced by the projection kernel and trace, respectively. In this spirit, we shall analogously investigate the (2, 1)-congruences via the projection kernel-trace approach on left restriction semigroups, echoing the kernel-trace approach to (admissible) congruences on inverse semigroups and ample semigroups. Inspired by [9,12], the constructions of (2, 1)-congruences having the same projection kernel and the same projection trace will be explored on left restriction semigroups.

The kernel-trace approach can establish the two-dimensional “network” structure of the lattice of congruences, which may provide more structure information of the related semigroup. In [13], Petrich and Reilly set up a min network of congruences on inverse semigroups by means of the smallest group congruence, semilattice congruence, Clifford semigroup congruence, and E -unitary inverse semigroup congruence, which enlarges the lattice of congruences on such a semigroup, which is provided by Green [14]. More recently, El-Qallali [15] extended the approach of [13] to ample semigroups and depicted a network of admissible congruences on the basis of the smallest cancellative monoid, semilattice, Clifford ample semigroup, E -unitary ample semigroup admissible congruence, and so on. Along this way, we shall continue to research analogously remarkable (2, 1)-congruences and provide a similar min network of these congruences for left restriction semigroups.

The main aim of this article is to study the lattice of (2, 1)-congruences on a left restriction semigroup. The authors in [16] pointed out that all the (2, 1)-congruences on a left restriction semigroup become a complete sublattice. This result allows us to develop the kernel-trace theory on left restriction semigroups. The article will be organized as follows: after making some preparations, Section 3 is contributed to investigating the structure of (2, 1)-congruences whose projection traces coincide with that of a given (2, 1)-congruence on left restriction semigroups and determining the smallest as well as the greatest one of such (2, 1)-congruences. Moreover, it is proved that such (2, 1)-congruences constitute a complete sublattice of C 2 , 1 ( S ) . However, the key to the kernel-trace theory on left restriction semigroups is how to define the t ( T )operator and the k ( K )operator on C 2 , 1 ( S ) . So, in Section 3, we introduce t - and T -operators on C 2 , 1 ( S ) . Similarly, we also probe the (2, 1)-congruences having the same projection kernel and consider k - and K -operators on C 2 , 1 ( S ) in Section 4. All of these conclusions generalize the corresponding ones on inverse semigroups and ample semigroups [9,10,12]. As applications, Section 5 is devoted to characterizing certain specific (2, 1)-congruences on a left restriction semigroup; for example, reduced, semilattice, Clifford left restriction semigroup, and P -unitary left restriction semigroup (2, 1)-congruences (Propositions 5.1, 5.3, Theorem 5.5, and Lemma 5.8). In particular, ω t = σ , ω k = η , ( ω k ) t = ν , ( ω t ) k = π are, respectively, the least reduced, semilattice, Clifford left restriction semigroup, and P -unitary left restriction semigroup (2, 1)-congruence on left restriction semigroups, where ω is the universal congruence (Corollaries 5.2, 5.4, 5.6, and Proposition 5.9). Moreover, such least congruences are utilized to build up a min network of (2, 1)-congruences as building bricks on left restriction semigroups. These results enrich and extend the related results concerning inverse semigroups [10,13] and ample semigroups [15].

2 Preliminaries

Throughout this article, we shall use notions and notations from the textbook of Howie [22]. We start by recalling some concepts and known results on left restriction semigroups in the sequel. For those not given in this article, the reader is referred to [3,4,6].

Definition 2.1

A left restriction semigroup is defined to be an algebra of type (2, 1), more precisely, an algebra S = ( S , , + ) where ( S , ) is a semigroup and + is a unary operation such that the following identities are satisfied:

(2.1) x + x = x , ( x + y ) + = x + y + , ( x + y + ) + = x + y + = y + x + , x y + = ( x y ) + x .

Dually, we can define right restriction semigroups. By a restriction semigroup we mean an algebra ( S , , + , ) of type ( 2 , 1 , 1 ) such that

  1. ( S , , + ) is a left restriction semigroup;

  2. ( S , , ) is a right restriction semigroup; and

  3. for any x S , ( x ) + = x and ( x + ) = x + .

The lemma gathers some easy but useful consequences; for details, see [6].

Lemma 2.2

Let S be a left restriction semigroup and x , y S . Then

x + x + = x + , ( x + ) + = x + , ( x y ) + = ( x y + ) + , x + ( x y ) + = ( x y ) + = ( x y ) + x + .

For a left restriction semigroup S , as usual, we call P ( S ) = { x + : x S } the set of projections of S and its elements are called projections of S . By Lemma 2.2, every projection is necessarily an idempotent element of S , but, in general, not all of the idempotents are projections; for example, see [4]. So, by definition, it is easy to know that P ( S ) is a sub-semilattice of S . Indeed, any semilattice Y can be regarded as being a left restriction semigroup with identity unary operator by defining a + = a for every a Y . Therefore, such a left restriction semigroup is simply considered and called a semilattice.

In particular, we call a left restriction semigroup to be reduced if its set of projections is a singleton. It is easy to see that a reduced left restriction semigroup S must be a monoid with the unique projection as its identity 1. Indeed, any monoid M with identity 1 can be endowed with the structure of a left restriction semigroup by setting s + = 1 for all s M . Note that an inverse semigroup, regarded as a left restriction semigroup, is reduced if and only if it is a group while a left ample semigroup is reduced if and only if it is a right cancellative monoid. So, in what follows, we regard a monoid as a reduced left restriction semigroup with a unary operator + : s 1 .

A left restriction semigroup S is called Clifford if P ( S ) is central, that is, if e P ( S ) , then e a = a e holds for each a S . The known result [7, Proposition 2.3] tells us that S is a Clifford left restriction semigroup if and only if S is a semilattice of monoids M α with Y , satisfying that 1 α 1 β = 1 α β = 1 β 1 α for any α , β Y .

Let S be a left restriction semigroup. Following [22], a subset A S is said to be left unitary if for all a A and s S , whenever a s A , we have s A . Dually, we may define the notion of a right unitary subset. If A is both left and right unitary, then we call it a unitary subset of S . In particular, a left restriction semigroup S is P-unitary if P ( S ) is a unitary subset of S .

Proposition 2.3

Let S be a left restriction semigroup. Then the following statements are equivalent:

  1. S is P -unitary;

  2. S is left P -unitary;

  3. If x + y = x + for x , y S , then y = y + .

Proof

(1) (2) (3) are consequences of the definition.

(3) (1). Let a , b S . If a b + P ( S ) , then ( a b ) + a = a b + = ( a b ) + P ( S ) , so that a = a + P ( S ) , thereby P ( S ) is a right unitary subset of S . If a + b P ( S ) , then

a + b + b = a + b = ( a + b ) + = a + b + P ( S ) ,

hence b = b + P ( S ) , thereby P ( S ) is a left unitary subset of S . We complete the proof.□

Among left restriction semigroups, the notions of subalgebras, homomorphisms, congruences, and factor algebras are understood in type ( 2 , 1 ) . In order to emphasize this point, we use the expressions ( 2 , 1 ) -subsemigroup, ( 2 , 1 ) -morphism, ( 2 , 1 ) -congruence, and ( 2 , 1 ) -factor semigroup, respectively.

Let ρ be a (2, 1)-congruence on a left restriction semigroup. On the quotient S / ρ , define

+ : S / ρ S / ρ ; a ρ a + ρ .

Obviously, + is well defined. We use still S / ρ to denote the algebra ( S / ρ , , + ) of type (2, 1). The following proposition is immediate and we here omit the details.

Proposition 2.4

Let ρ be a (2, 1)-congruence on a left restriction semigroup S. Then so is S / ρ , and P ( S / ρ ) = { x + ρ : x S } .

Moreover, we have the following result.

Proposition 2.5

Let α , β be (2, 1)-congruences on a left restriction semigroup S . If α β , then

  1. β / α is a (2, 1)-congruence on S / α ;

  2. S / β is (2, 1)-isomorphic to ( S / α ) / ( β / α ) .

Proof

  1. It is immediate from [16, Proposition 2.3] and [22, Theorem 1.5.4, p. 25].

  2. Consider the mapping

    θ : ( S / α ) / ( β / α ) S / β ; ( x α ) ( β / α ) x β ,

    and note that by [22, Theorem 1.5.4, p. 25], θ is a semigroup isomorphism from ( S / α ) / ( β / α ) onto S / β and

    [ ( ( x α ) ( β / α ) ) + ] θ = [ ( x + α ) ( β / α ) ] θ = x + β = ( x β ) + = [ ( ( x α ) ( β / α ) ) θ ] + .

Thus, we obtain that θ is indeed a (2, 1)-isomorphism.□

Remark 2.6

In view of Proposition 2.5, we can assert that the map β β / α has actually established an isotone isomorphism from the lattice of those (2, 1)-congruences on S that contain α onto C 2 , 1 ( S / α ) , the lattice of all (2, 1)-congruences on S / α .

Let S be a semigroup with a subsemilattice E of E ( S ) the set of idempotents. The relations ˜ E and ˜ E are efficient tools in the study of generalized regular semigroups (see, [3,4]). In [3], Gould provided an equivalent definition of a left restriction semigroup in terms of ˜ E , that is, S is weakly left (right) E -ample with respect to E if and only if ( S , , + ) is a left (right) restriction semigroup with P ( S ) = E . Later on, when considering the relation ˜ P ( S ) on a left restriction semigroup S , it is usual to drop the subscript and write ˜ P ( S ) more simply as ˜ and make the same convention for ˜ P ( S ) . In the literature, the relation ˜ is used only for weakly left ample semigroups (a class of left restriction semigroups in which all the idempotents are projections see [23,24,25]), but here this will not cause any confusion. It is well known that for elements a , b of a left restriction semigroup, ( a , b ) ˜ if and only if a + = b + , from which it follows that ˜ is indeed a left congruence on any left restriction semigroup; in particular, a ˜ a + . This observation will be repeatedly used in the sequel.

Kernel-trace approach is a useful tool to study congruences on an inverse semigroup. As (left; right) restriction semigroups are generalizations of inverse semigroups, the following problem is natural: Whether do (left; right) restriction semigroups have a kernel-trace approach similar to that on inverse semigroups? In order to solve it, we first start to define Pkernel and Ptrace on a left restriction semigroup as follows:

Definition 2.7

For an equivalence ϱ on S , the projection kernel of ϱ is

Pker ( ϱ ) = { a S : a ϱ e , e P ( S ) }

and the projection trace of ϱ is

Ptr ( ϱ ) = ϱ ( P ( S ) × P ( S ) ) .

The following lemma is immediate.

Lemma 2.8

Let ϱ 1 , ϱ 2 be equivalences on S . If ϱ 1 ϱ 2 , then Ptr ( ϱ 1 ) Ptr ( ϱ 2 ) and Pker ( ϱ 1 ) Pker ( ϱ 2 ) .

Recall that a (2, 1)-congruence ρ on a left restriction semigroup S is called

  1. projection-separating if for any a , b S , ( a + , b + ) ρ implies that a + = b + .

  2. projection-pure if and only if e ρ P ( S ) for any e P ( S ) .

By the definition above, it is easy to check that a (2, 1)-congruence ρ on S is projection-separating if and only if Ptr ( ρ ) = ε , where ε is the identical congruence and that ρ is projection-pure if and only if Pker ( ρ ) = P ( S ) . These two classes of (2, 1)-congruences play an important role in the study of left restriction semigroups. We shall denote by R ( S ) the set of projection-pure (2, 1)-congruences on S and by P ( S ) the set of projection-separating (2, 1)-congruences on S , respectively.

By the foregoing argument, the following lemma is straightforward.

Lemma 2.9

Let S be a left restriction semigroup and ρ be a (2, 1)-congruence on S . Then a ˜ b a ρ ˜ ( S / ρ ) b ρ , for any a , b S .

Let ( Q , ) be a partially ordered set. Recall that an interval is the subset of the form:

[ α , β ] = { γ Q : α γ β } ,

for some α , β Q , α β . It is worthy to point out when Q is a complete lattice, any interval is necessarily a complete sublattice of Q . This fact will be frequently used in the following sections.

3 t - and T -operators

In the remainder of this article, we always assume that S is a left restriction semigroup. We denote by C ( S ) the set of congruences and by C 2 , 1 ( S ) the set of (2, 1)-congruences on S , respectively. It is easy to know that under set inclusion, both C ( S ) and C 2 , 1 ( S ) are lattices, even C ( S ) is complete. In [16, Theorem 2.1], the authors pointed out that C 2 , 1 ( S ) is a complete sublattice of C ( S ) , and the smallest and the greatest element of both C ( S ) and C 2 , 1 ( S ) are ε and ω . We shall sometimes use ε ( S ) and ω ( S ) to avoid confusion, and the similar notation for other relations. The main aim of this section is to study t - and T -operators on the complete lattice C 2 , 1 ( S ) .

To begin with, we investigate the (2, 1)-congruences having the same projection trace on left restriction semigroups through the approach of [11], and the next lemma is necessary and used several times.

Lemma 3.1

Let ρ C 2 , 1 ( S ) with Ptr ( ρ ) = τ . Then for a , b S

  1. ( a + ρ ) ˜ ( S / ρ ) ( b + ρ ) a + τ b + ;

  2. ( a ρ ) ˜ ( S / ρ ) ( b ρ ) a ( ˜ τ ˜ ) b ;

  3. ρ ˜ = ˜ τ ˜ and Ptr ( ρ ˜ ) = τ .

Proof

  1. It is immediate from the definition.

  2. Suppose now that ( a ρ ) ˜ ( S / ρ ) ( b ρ ) . Then ( a ρ ) + = ( b ρ ) + , that is to mean a + ρ b + . Note that a ˜ a + and b + ˜ b . Then a ˜ a + ρ b + ˜ b . Hence, a ( ˜ τ ˜ ) b .

Conversely, let a ( ˜ τ ˜ ) b . Then a ˜ x + τ y + ˜ b for x , y S . By using Lemma 2.9, a ρ ˜ ( S / ρ ) x + ρ = y + ρ ˜ ( S / ρ ) b ρ . Therefore, we have proved ( a ρ ) ˜ ( S / ρ ) ( b ρ ) .
  1. Let a ( ρ ˜ ) b . By [22, Proposition 1.5.11, p. 28], there exist x 1 , x 2 , , x n S such that

    a ρ x 1 ˜ x 2 ρ ρ x n ˜ b .

Since ρ is a (2, 1)-congruence on S , by Lemma 2.9 we obtain

a ρ = x 1 ρ ˜ x 2 ρ = = x n ρ ˜ b ρ ,

so that a ρ ˜ ( S / ρ ) b ρ . By using (2), it follows a ( ˜ τ ˜ ) b , which implies ( ρ ˜ ) ( ˜ τ ˜ ) . Clearly, ( ˜ τ ˜ ) ( ρ ˜ ) . Again by (2), ˜ τ ˜ is an equivalence including ρ and ˜ on S . Then it yields ρ ˜ = ˜ τ ˜ . Associating (1) with (2), we have ( ρ ˜ ) P ( S ) = τ .□

Let ϱ be a relation and denote by ϱ the least (2, 1)-congruence on S containing ϱ and by ϱ the greatest congruence on S contained in ϱ . Let ρ C 2 , 1 ( S ) with Ptr ( ρ ) = τ . We put

ρ t = τ , ρ T = ( ρ ˜ ) = ( ˜ τ ˜ ) .

Theorem 3.2

Let S be a left restriction semigroup. If ρ C 2 , 1 ( S ) , then ρ t and ρ T are the least and the greatest (2, 1)-congruences with the same projection trace τ as ρ , respectively.

Proof

Note that τ is the least (2, 1)-congruence including τ so that τ ρ . By hypothesis, we can obtain Ptr ( τ ) = τ since τ Ptr ( τ ) and

τ ρ Ptr ( τ ) Ptr ( ρ ) = τ .

For the remainder, we first show that ρ T is a (2, 1)-congruence with the projection trace τ . By [22, Proposition 1.5.10], we can see that

( ρ ˜ ) = { ( a , b ) S × S : ( x , y S 1 ) ( x a y , x b y ) ρ ˜ }

is the greatest congruence contained in ρ ˜ . Furthermore, ( ρ ˜ ) respects the unary operation + since

( a , b ) ( ρ ˜ ) ( a , b ) ρ ˜ ( a , b ) ˜ τ ˜ a + τ b + a + ρ b + x a + y ρ x b + y ( x a + y ) + τ ( x b + y ) + x a + y ˜ ( x a + y ) + τ ( x b + y ) + ˜ x b + y ( a + , b + ) ( ρ ˜ ) .

Additionally, since ρ ( ρ ˜ ) implies ρ ( ρ ˜ ) ( ρ ˜ ) , then

Ptr ( ρ ) Ptr ( ( ρ ˜ ) ) ( ρ ˜ ) P ( S ) = τ = Ptr ( ρ ) .

Hereby, we obtain Ptr ( ( ρ ˜ ) ) = τ .

In the end, we shall claim that ( ρ ˜ ) is the greatest (2, 1)-congruence with the projection trace τ , where τ = ρ P ( S ) . In fact, if λ C 2 , 1 ( S ) with Ptr ( λ ) = τ , then by Lemma 3.1, we deduce

λ ( λ ˜ ) = ˜ τ ˜ = ρ ˜ .

This shows that λ ( ρ ˜ ) since ( ρ ˜ ) is the greatest (2, 1)-congruence contained in ρ ˜ . Therefore, the proof is completed.□

Motivated by Lawson [20, Theorem 1.4.12, p. 25], we define on a left restriction semigroup S as follows: for x , y S ,

x y if and only if y + x = x + y .

Lemma 3.3

The relation is reflexive, symmetric, and compatible with the multiplication. Moreover, a + b + for any a , b in S .

Proof

By definition, it is not difficult to check that is reflexive and symmetric.

Let a , b , c , d S . If a b and c d , then b + a = a + b , d + c = c + d , and so

( b d ) + a c = ( b d ) + b + a c = ( b d ) + ( a + b ) c (since by Lemma 2.2,  ( b d ) + b + = ( b d ) + ) = a + ( b d ) + b c = a + b d + c (since by (2.1),  b d + = ( b d ) + b ) = b + a c + d = b + a c + d (since  b + a = a + b , d + c = c + d ) = b + ( a c ) + a d = ( a c ) + b + a d (since by (2.1),  a c + = ( a c ) + a ) = ( a c ) + a + b d = ( a c ) + b d (since  b + a = a + b ) .

Hence a c b d , which implies that is compatible with the multiplication. We note that

( b + ) + a + = b + a + = a + b + = ( a + ) + b + ,

and the result follows.□

Proposition 3.4

If ρ C 2 , 1 ( S ) , then

  1. ρ t = { ( a , b ) S × S : ( c S ) c + a = c + b , c + ρ a + ρ b + } = ( ρ ) .

  2. ρ T = { ( a , b ) S × S : ( y S 1 ) ( a y ) + ρ ( b y ) + } .

Proof

(1). By [12, Corollary 3.3], the relation

ξ { ( a , b ) S × S : ( c S ) c + a = c + b , c + ρ a + ρ b + }

is the least (2, 1)-congruence with the projection trace Ptr ( ρ ) on S . Note that by Theorem 3.2, ρ t is also the least (2, 1)-congruence on S with projection trace Ptr ( ρ ) , we can observe that ρ t = ξ .

Let a , b S . If a ( ρ ) b , then b + a = a + b , a + ρ b + , and hence

b + a + a = b + a + b , b + a + ρ a + ρ b + ,

thereby ( a , b ) ξ = ρ t . It follows that ( ρ ) ρ t . Therefore, ( ρ ) ρ t . This shows that Ptr ( ρ ) Ptr ( ρ t ) . Conversely, if ( a , b ) Ptr ( ρ t ) = τ , then by definition, a = a + , b = b + , and a ρ b . Obviously, a + b = a + b + = b + a + = b + a . In other words, ( a , b ) . Therefore, ( a , b ) ( ρ ) and whence Ptr ( ρ t ) Ptr ( ρ ) . We have now verified that Ptr ( ρ t ) = Ptr ( ρ ) . But by Theorem 3.2, ρ t is the least (2, 1)-congruence on S with projection trace Ptr ( ρ ) = Ptr ( ρ ) , now ρ t ( ρ ) . Consequently, ρ t = ( ρ ) .

(2) We prove first that ζ = { ( a , b ) S × S : ( y S 1 ) ( a y ) + ρ ( b y ) + } is a (2, 1)-congruence on S . Obviously, ζ is an equivalence on S . If a ζ b and c S , then by definition, for any y S 1 , ( a c y ) + ρ ( b c y ) + , which follows that a c ζ b c . Therefore, ζ is a right congruence on S . Considering that ρ is a (2, 1)-congruence on S , we have c ( a y ) + ρ c ( b y ) + so that ( c a y ) + = ( c ( a y ) + ) + ρ ( c ( b y ) + ) + = ( c b y ) + . So, ( c a , c b ) ζ and whence ζ is a left congruence on S . Now ζ is a congruence on S . Furthermore, we note a ζ b implies a + ρ b + and so

( a + y ) + = a + y + ρ b + y + = ( b + y ) + .

In other words,

(3.1) a + ρ b + a + ζ b + .

Therefore, ζ is a (2, 1)-congruence on S , and Ptr ( ρ ) Ptr ( ζ ) .

On the other hand, by definition, a + ζ b + can imply that a + ρ b + , so that Ptr ( ζ ) Ptr ( ρ ) . Now Ptr ( ζ ) = Ptr ( ρ ) . So, by Theorem 3.2, we have ζ ρ T . Conversely, if a ρ T b , then a y ρ T b y . Since by Theorem 3.2, ρ T is a (2, 1)-congruence on S , it follows that ( a y ) + ρ ( b y ) + . Therefore, ( a , b ) ζ and whence ρ T ζ . We complete the proof.□

We can now define t - and T -operators on C 2 , 1 ( S ) .

Definition 3.5

On C 2 , 1 ( S ) , we define the t -operator by

t : C 2 , 1 ( S ) C 2 , 1 ( S ) ; ρ ρ t

and the T -operator by

T : C 2 , 1 ( S ) C 2 , 1 ( S ) ; ρ ρ T .

We arrive now at the main result of this section.

Proposition 3.6

Let S be a left restriction semigroup and ρ , θ C 2 , 1 ( S ) . Then the following statements hold:

  1. [ ρ t , ρ T ] is a complete sublattice of C 2 , 1 ( S ) with the same projection trace as ρ .

  2. t 2 = t = T t and T 2 = T = t T .

  3. If ρ θ , then ρ t θ t and ρ T θ T .

Proof

(1) It is immediate from Theorem 3.2 and the fact that an arbitrary interval of a complete lattice is necessarily a complete sublattice.

(2) and (3) are the consequences of (1) and definitions of t - and T -operators.□

As already stated in Section 2, any (2, 1)-congruence ρ on S is projection-separating if and only if Ptr ( ρ ) = ε . In this case, P ( S ) = [ ε t , ε T ] = [ ε , ε T ] is a complete sublattice of C 2 , 1 ( S ) . Thus, we have the following proposition.

Proposition 3.7

Let S be a left restriction semigroup and ρ C 2 , 1 ( S ) . Then the mapping

ϕ : [ ρ t , ρ T ] P ( S / ρ t ) ; ξ ξ / ρ t

is an isotone isomorphism of complete sublattices.

Proof

Suppose now ξ [ ρ t , ρ T ] . Then from Proposition 2.5 it follows that ξ / ρ t is a (2, 1)-congruence on S / ρ t . Observe that ξ / ρ t P ( S / ρ t ) if and only if Ptr ( ξ ) = Ptr ( ρ t ) . Considering Proposition 3.6, it is easy to see that ϕ is well-defined. Accordingly, we have that ϕ is an isotone isomorphism of complete sublattice from [ ρ t , ρ T ] onto [ ρ t / ρ t , ρ T / ρ t ] by Remark 2.6. Since P ( S / ρ t ) = [ ε ( S / ρ t ) , ( ε ( S / ρ t ) ) T ] and ρ t / ρ t = ε ( S / ρ t ) , we only need to verify ρ T / ρ t = ( ε ( S / ρ t ) ) T . Note that ρ T is the greatest (2, 1)-congruence with the same projection trace as ρ t , and thus ρ T / ρ t is the greatest projection-separation (2, 1)-congruence on S / ρ t . Hence, by using the maximality we obtain ρ T / ρ t = ( ε ( S / ρ t ) ) T . Therefore, we complete the proof.□

4 k - and K -operators

Now suppose K = Pker ( ρ ) for ρ C 2 , 1 ( S ) . Let π K be an equivalence on S whose equivalent classes are { K , S \ K } . Then the congruence π K , that is the greatest congruence on S contained in π K , is given by

π K = { ( a , b ) S × S : ( x , y S 1 ) x a y K x b y K } .

As usual, we call π K the syntactic congruence of K ; for syntactic congruence, see [22, p. 28]. We define

ρ k = { ( a , a + ) : a K } .

Theorem 4.1

With the same notations as above,

  1. ρ k is the least (2, 1)-congruence with projection kernel K on S .

  2. Pker ( π K ) = K .

Proof

(1). First, we claim Pker ( ρ k ) = K . If x K , then

( x , x + ) { ( a , a + ) : a K } { ( a , a + ) : a K } = ρ k ,

and whence K Pker ( ρ k ) . On the other hand, by x K , we know that x ρ P ( S / ρ ) , so that x ρ = ( x ρ ) + = x + ρ since ρ is a (2, 1)-congruence on S . It follows that ( x , x + ) ρ . Therefore, we have { ( a , a + ) : a K } ρ , and hence ρ k = { ( a , a + ) : a K } ρ , thereby Pker ( ρ k ) Pker ( ρ ) = K . Now, Pker ( ρ k ) = K , as required.

Now let ξ be a (2, 1)-congruence on S such that Pker ( ξ ) = K . By the foregoing proof, we have verified that { ( a , a + ) : a K } ξ . Thus, ρ k ξ . Consequently, ρ k is the least (2, 1)-congruence with its projection kernel K on S .

(2). Assume now a S . If a Pker ( π K ) , then ( a , e ) π K for some e P ( S ) . Hence a = a + a 1 K since π K is the syntactic congruence over K and a + e 1 = a + e P ( S ) K , where 1 is the identity of S 1 . It follows that Pker ( π K ) K . Conversely, if m K , then by the proof of (1), ( m , m + ) ρ ; so that ( x m y , x m + y ) ρ for x , y S 1 ; in other words, ( x m y ) ρ = ( x m + y ) ρ . This means that

x m y K x m + y K .

So, we have ( m , m + ) π K , so that m Pker ( π K ) , leading to K Pker ( π K ) . Therefore, Pker ( π K ) = K .□

Corollary 4.2

The relation π K is the greatest congruences on S whose projection kernel is K .

Definition 4.3

On C 2 , 1 ( S ) , we define the k -operator by

k : C 2 , 1 ( S ) C 2 , 1 ( S ) ; ρ ρ k

and the K -operator by

K : C 2 , 1 ( S ) C 2 , 1 ( S ) ; ρ ρ K = { ξ C 2 , 1 ( S ) : ρ ξ π K } .

Following [16], if α , β C 2 , 1 ( S ) , then both α β and α β are in C 2 , 1 ( S ) . Moreover, C 2 , 1 ( S ) is a complete subsemilattice of C ( S ) . In this case, the following lemma is evident.

Lemma 4.4

For any (2, 1)-congruence ρ on S whose projection kernel is K , there exists

ρ K = { ξ C 2 , 1 ( S ) : ρ ξ π K } ,

which is the greatest (2, 1)-congruence on S with K as its projection kernel. So, K is well-defined.

Proposition 4.5

Let S be a left restriction semigroup and ρ , θ C 2 , 1 ( S ) . Then the following statements are true:

  1. [ ρ k , ρ K ] is a complete sublattice of C 2 , 1 ( S ) with the same projection kernel as ρ .

  2. k 2 = k = K k and K 2 = K = k K .

  3. If ρ θ , then ρ k θ k .

Proof

(1) It directly follows from Theorem 4.1 and Definition 4.3 and the fact that any interval of a complete lattice is still complete.

(2) and (3) are immediate from the definitions of k - and K -operators.□

It is worth noting that Pker ( ε ) = P ( S ) and any (2, 1)-congruence ρ is projection-pure if and only if Pker ( ρ ) = P ( S ) . Then we can easily deduce that R ( S ) = [ ε k , ε K ] = [ ε , ε K ] so that by Proposition 4.5, the following corollary is necessary.

Proposition 4.6

Let S be a left restriction semigroup and ρ C 2 , 1 ( S ) . Then the mapping

ψ : [ ρ k , ρ K ] R ( S / ρ k ) ; ξ ξ / ρ k

is a complete isotone isomorphism.

Proof

Assume that ξ [ ρ k , ρ K ] . Then in view of Proposition 2.5, we can see that ξ / ρ k is necessarily a (2, 1)-congruence on S / ρ k . Note that ξ / ρ k R ( S / ρ k ) if and only if Pker ( ξ ) = Pker ( ρ k ) . Then by Proposition 4.5, it is not hard to check that ψ is well-defined. Furthermore, by using Remark 2.6 we can see that ψ is a complete isotone isomorphism from [ ρ k , ρ K ] onto [ ρ k / ρ k , ρ K / ρ k ] . On the other hand, because R ( S / ρ k ) = [ ε ( S / ρ k ) , ( ε ( S / ρ k ) ) K ] and ρ k / ρ k = ε ( S / ρ k ) , it suffices to show ρ K / ρ k = ( ε ( S / ρ k ) ) K . Observe that ρ K is the greatest (2, 1)-congruence with the same projection kernel as ρ k , and whence ρ K / ρ k is the greatest projection-pure (2, 1)-congruence on S / ρ k . Therefore, by the maximality we can obtain ρ K / ρ k = ( ε ( S / ρ k ) ) K . This completes the proof.□

5 A min network of (2, 1)-congruences

As applications of k -, K -, t -, and T -operators, in this section we shall give the characterizations of some remarkable (2, 1)-congruences on a left restriction semigroup S .

Let ρ be a (2, 1)-congruence on a left restriction semigroup S . Then ρ is reduced if S / ρ is a reduced left restriction semigroup, i.e., P ( S / ρ ) is a singleton. It is worthy to point out that reduced congruences are generalizations of group and (right)cancellative congruences on inverse and (left) ample semigroups, respectively.

Proposition 5.1

Let S be a left restriction semigroup. If ρ is a (2, 1)-congruence on S , then the following statements equal:

  1. ρ is a reduced congruence on S ;

  2. Ptr ( ρ ) = P ( S ) × P ( S ) ;

  3. ρ [ ω t , ω T ] .

Proof

(1) (2). Assume that ρ is a reduced congruence on S . Then P ( S / ρ ) = 1 . Recall from Proposition 2.4 that P ( S / ρ ) = { x + ρ : x S } . Then ( e , f ) ρ for any e , f P ( S ) . Hence, we have P ( S ) × P ( S ) Ptr ( ρ ) . This, together with the reverse inclusion shows Ptr ( ρ ) = P ( S ) × P ( S ) .

(2) (1). It is immediate from the definition and P ( S / ρ ) = { x + ρ : x S } .

(1) (3). Let ρ be a reduced congruence on S . Then Ptr ( ρ ) = P ( S ) × P ( S ) . Note that Ptr ( ω ) = P ( S ) × P ( S ) , and thus by Proposition 3.6, [ ω t , ω T ] contains all the (2, 1)-congruences whose projection trace are the same as ρ . Thus, ρ [ ω t , ω T ] holds.

(3) (1). It is trivial.□

By Proposition 5.1, we have the following corollary.

Corollary 5.2

Let S be a left restriction semigroup. Then the smallest reduced (2, 1)-congruence σ is equal to ω t . In this case, each (2, 1)-congruence ρ is reduced if and only if ρ [ σ , ω ] . Moreover, σ = { ( a , b ) : ( x S ) x + a = x + b } and σ = .

Proof

It is evident that σ = ω t holds. Furthermore, when putting ρ = ω in Proposition 3.4, the proof is completed.□

A (2, 1)-congruence ρ on a left restriction semigroup S is called a

  1. semilattice congruence if S / ρ itself is a semilattice.

  2. Clifford congruence if S / ρ is a Clifford left restriction semigroup.

Proposition 5.3

Let ρ be a (2, 1)-congruence on S . Then the following conditions equal:

  1. ρ is a semilattice congruence on S .

  2. Pker ( ρ ) = S .

  3. S / ρ = { x + ρ : x S } .

  4. ˜ ρ .

  5. ρ [ ω k , ω K ] .

Proof

It is obvious that (1), (2), and (3) are equivalent. Now we show the others.

(1) (4). Because ρ is a semilattice congruence on S , we can see ( a , a + ) ρ and ( b + , b ) ρ for a , b S . Moreover,

a ˜ b a + = b + a ρ a + = b + ρ b a ρ b .

Hence, it proves ˜ ρ .

(4) (1). It is a direct consequence of a ˜ a + for any a S .

(1) (5). Let ρ be a semilattice congruence on S . Then Pker ( ρ ) = S . Observe that Pker ( ω ) = S and that [ ω k , ω K ] includes all the (2, 1)-congruences whose projection kernels are S , so we have ρ [ ω k , ω K ] .

(5) (1). It is immediate from the fact Pker ( ρ ) = Pker ( ω ) = S .□

Corollary 5.4

Let S be a left restriction semigroup. Then ω k equals ˜ and is the least semilattice congruence η on S . Moreover, any (2, 1)-congruence ρ is a semilattice congruence if and only if ρ [ η , ω ] .

Proof

Since ω itself is a semilattice congruence on S , the least semilattice congruence η does exist. Then from Proposition 5.3 (5) it follows that η = ω k . On the other hand, by Proposition 5.3 (4) we can deduce that ˜ is a semilattice congruence, and thereby η ˜ . In addition, note ˜ η so that ˜ η . Therefore, it has proved η = ω k = ˜ . The rest statement is trivial.□

Theorem 5.5

Let ρ be a (2, 1)-congruence on S and η ( S / ρ ) the least semilattice congruence on S / ρ . Then the following statements are equivalent:

  1. ρ is a Clifford congruence on S .

  2. ρ T is a semilattice congruence on S .

  3. ρ T = ρ η .

  4. ρ T / ρ = η ( S / ρ ) .

Proof

(1) (2). By hypothesis, we can see a x + ρ x + a , for a S and x S 1 . Because ρ is a (2, 1)-congruence on S and x + a + ρ a + x + , we may obtain

( a x ) + = ( a x + ) + ρ ( x + a ) + = ( x + a + ) ρ ( a + x + ) = ( a + x ) + ,

and thus ( a x ) + ρ ( a + x ) + so that a ρ T a + . Therefore, ρ T is a semilattice congruence on S .

(2) (1). Since ρ T is a semilattice congruence on S , we obtain a ρ T a + for a S , and whence ( a x ) + ρ ( a + x ) + = a + x + ρ x + a + , for x S 1 . Thus, we have ( a x ) + ρ x + a + . Multiplying ( a x ) + ρ x + a + on the right hand by a , we obtain ( a x ) + a ρ x + a + a , so that a x + ρ x + a by ( a x ) + a = a x + . Thus, ρ is a Clifford congruence on S .

(2) (3). Note that η is the least semilattice congruence on S . By assumption, it follows that η ρ T , and thus ( ρ η ) ρ T since ρ ρ T . According to Theorem 3.2 and Proposition 5.3 (4), we obtain ρ T = ( ρ ˜ ) and ˜ η . Hence, ( ρ ˜ ) ( ρ ˜ ) ( ρ η ) , which is equal to ρ T ( ρ η ) . Therefore, we have ρ T = ρ η .

(3) (2). Clearly, η ( ρ η ) = ρ T , which together with Corollary 5.4 shows that ρ T is a semilattice congruence on S .

(3) (4). Suppose now that ρ is a (2, 1)-congruence on S . By using Proposition 2.5, S / ( η ρ ) is (2, 1)-isomorphic to ( S / ρ ) / ( ( η ρ ) / ρ ) . Additionally, η η ρ , and thus by Corollary 4.6, η ρ is a semilattice congruence on S . Hence, ( η ρ ) / ρ is necessarily a semilattice congruence on S / ρ . Note that η ( S / ρ ) is the least semilattice congruence on S / ρ , so we have η ( S / ρ ) ( η ρ ) / ρ . On the other hand, define a relation ξ on S as follows:

x ξ y ( x ρ ) η ( S / ρ ) ( y ρ ) .

It is not difficult to check that ξ is a (2, 1)-congruence as well as ρ ξ . Moreover, we can obtain ξ / ρ = η ( S / ρ ) . Again by Proposition 2.5, S / ξ is (2, 1)-isomorphic to ( S / ρ ) / ( ξ / ρ ) = ( S / ρ ) / η ( S / ρ ) . In this case, ξ is also a semilattice congruence on S , which implies η ξ . Hence, ( η ρ ) ξ so that ( η ρ ) / ρ ξ / ρ = η ( S / ρ ) . From the foregoing argument, we obtain η ( S / ρ ) = ( η ρ ) / ρ . Therefore, we conclude ρ T / ρ = η ( S / ρ ) .

(4) (3). Observing the proof of ( 3 ) ( 4 ) , it is easy to see ( η ρ ) / ρ = η ( S / ρ ) . By hypothesis ρ T / ρ = η ( S / ρ ) , it immediately follows ρ T / ρ = ( η ρ ) / ρ so that ρ T = ρ η . This completes the proof.□

Corollary 5.6

Let S be a left restriction semigroup. Then η t is the least Clifford congruence ν on S and ν = η t = ( ω k ) t , where η is the least semilattice congruence on S. In this case, every (2, 1)-congruence ρ is Clifford congruence if and only if ρ [ ν , ω ] .

Proof

Obviously, the least Clifford congruence ν exists on S . Note that η η T = ( η t ) T , and thus by Corollary 5.4, ( η t ) T is a semilattice congruence on S . According to Theorem 5.5 (1), η t is a Clifford congruence on S so that ν η t .

On the other hand, let ρ be any Clifford (2, 1)-congruence on S . By Theorem 5.5 (2), ρ T is a semilattice congruence on S so that η ρ T . Using Proposition 3.6, we have

η t ( ρ T ) t = ρ t ρ ,

whence η t ν certainly holds. Therefore, we obtain ν = η t = ( ω k ) t since ω k = η .□

Proposition 5.7

Let S be a left restriction semigroup. Then ω = σ η .

Proof

In view of Corollaries 5.2 and 5.4, it is not hard to obtain σ = and η = ˜ . Note that a ω b always holds for a , b S , and thus

a + b + a = b + a + a = ( b + a ) + a , ( a + b ) + b = a + b + b = b + a + b .

This, together with ( b + a ) + = ( a + b ) + , shows a b + a ˜ a + b b . so that ω ( ˜ ) . By noting that σ and ˜ η , it yields ω ( σ η σ ) , whence ω ( σ η ) . Consequently, we have proved ω = σ η .□

A (2, 1)-congruence ρ on S is called P-unitary congruence, if S / ρ is P -unitary. In this case, P ( S / ρ ) = { e ρ : e P ( S ) } .

Lemma 5.8

Let S be a left restriction semigroup. If ρ is a (2, 1)-congruence on S, then the following conditions are equivalent:

  1. S / ρ is P -unitary;

  2. b + a Pker ( ρ ) implies that a Pker ( ρ ) for a , b S ;

  3. ( x + y , x + ) ρ implies ( y , y + ) ρ , for x , y S .

Proof

(1) (2). Let b + a Pker ( ρ ) . Then ( b + a ) ρ = e ρ P ( S / ρ ) for some e P ( S ) . Since ρ is a P -unitary congruence, we have a ρ P ( S / ρ ) , thereby a Pker ( ρ ) .

(2) (3). Let ( x + y , x + ) ρ . Then x + y Pker ( ρ ) . By means of (2), we have y Pker ( ρ ) so that ( y , y + ) ρ .

(3) (1). In view of Proposition 2.4, we only need to show that S / ρ is left P -unitary. Suppose now ( e a ) ρ P ( S / ρ ) for e P ( S ) . Then ( e a , e a + ) ρ , which is equal to ( e a + a , e a + ) ρ . By hypothesis, we obtain ( a , a + ) ρ so that a ρ P ( S / ρ ) . Therefore, the proof is completed.□

Proposition 5.9

Let S be a left restriction semigroup. Then σ k = ( ω t ) k is the least P-unitary (2, 1)-congruence π on S . In addition, if ρ is a P -unitary (2, 1)-congruence, then ρ [ π , ω ] .

Proof

First of all, we claim that σ k itself is a P -unitary (2, 1)-congruence on S . In fact, let x , y S . If x + y Pker ( σ k ) , then from Pker ( σ k ) = Pker ( σ ) it follows x + y Pker ( σ ) . Hence, ( x + y , x + y + ) σ . According to Corollary 5.2, we obtain ( y , y + ) σ so that y Pker ( σ ) . Furthermore, y Pker ( σ k ) since Pker ( σ ) = Pker ( σ k ) . By Lemma 5.8, we can see that σ k is a P -unitary congruence on S . Hence, the least P -unitary (2, 1)-congruence π exists on S so that π σ k .

Second, we declare that σ k is contained in any P -unitary (2, 1)-congruence ρ on S . To see this, let a Pker ( σ k ) . Since Pker ( σ k ) = Pker ( σ ) , then a Pker ( σ ) . Hence, we have ( a , a + ) σ . In this case, there is b S such that b + a = b + a + , which is equal to ( b + a ) + a = ( b + a ) + . Clearly, ( ( b + a ) + a , ( b + a ) + ) ρ . Observe that ρ is a P -unitary congruence on S , using Lemma 5.8 again, it yields ( a , a + ) ρ so that a Pker ( ρ ) . Thus, we can know Pker ( σ k ) Pker ( ρ ) . On the other hand, by using Proposition 4.5, it follows that ( σ k ) k ρ k . Noting ( σ k ) k = σ k , it derives σ k ρ k . Associating with ρ k ρ , thereby σ k ρ . Because π is also a P -unitary congruence on S , we immediately obtain σ k π . Therefore, π = σ k holds.

Finally, the equality σ k = ( ω t ) k is a direct consequence of σ = ω t .□

Remark 5.10

As already mentioned in the previous paragraphs, for a left restriction semigroup S , the interval [ σ , ω ] consists of all of its reduced congruences, the interval [ η , ω ] contains all its semilattice congruences, the interval [ ν , ω ] is the set of all the Clifford congruences and the interval [ π , ω ] contains all the P -unitary congruences. These (2, 1)-congruences constitute the complete sublattices of C 2 , 1 ( S ) , respectively. On the other hand, from the universal algebraic viewpoint, the class of P -unitary left restriction semigroups is a quasivariety. Then by [10, Lemma I.11.14, p. 60], the partially ordered set of all P -unitary (2, 1)-congruences on S under inclusion also constitute a complete sublattice of C 2 , 1 ( S ) with the greatest element ω . Meanwhile, each type of (2, 1)-congruence determines the corresponding left restriction semigroups. In this sense, congruences are usually applied to formulate some remarkable semigroups from a given semigroup and have a great influence on the structure of such a semigroup.

In closing this article, we shall present a diagram named the min network of (2, 1)-congruences on left restriction semigroups (Figure 1).

Figure 1 
               A min network of (2, 1)-congruences.
Figure 1

A min network of (2, 1)-congruences.

Acknowledgements

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

  1. Funding information: This research is supported by the National Natural Science Foundation of China (No. 11761034).

  2. Conflict of interest: The authors state no conflict of interest.

References

[1] J. B. Fountain, Adequate semigroups, Proc. Edinb. Math. Soc. 22 (1979), no. 2, 113–125, DOI: https://doi.org/10.1017/S0013091500016230. 10.1017/S0013091500016230Search in Google Scholar

[2] J. B. Fountain and V. Gould, The free ample semigroups. Int. J. Algebra Comput. 19 (2009), no. 4, 527–554, https://doi.org/10.1142/S0218196709005214. Search in Google Scholar

[3] V. Gould, Notes on restriction semigroups and related structures, formerly (weakly) left E-ample semigroups, https://www.researchgate.net/publication/237604491. Search in Google Scholar

[4] C. D. Hollings, From right pp monoids to restriction semigroups: a survey, European J. Pure Appl. Math. 2 (2009), 21–57. Search in Google Scholar

[5] C. Cornock, Restriction Semigroups: Structure, Varietyies and Presentations, Ph.D. Thesis, University of York, 2011. Search in Google Scholar

[6] M. B. Szendrei, Embedding into almost left factorizable restriction semigroups, Comm. Algebra 41 (2013), 1458–1483, https://doi.org/10.1080/00927872.2011.643839. Search in Google Scholar

[7] Y. W. Guo, J. Y. Guo, and X. J. Guo, Combinatorially factorizable restriction monoids, Southeast Asian Bull. Math. 45 (2021), no. 5, 677–696. Search in Google Scholar

[8] Z. Q. Zhang, J. Y. Guo, and X. J. Guo, Congruence-free restriction semigroups, Italian J. Pure Appl. Math. (to appear). Search in Google Scholar

[9] M. Petrich, Congruences on inverse semigroups, J. Algebra 55 (1978), 231–256, DOI: https://doi.org/10.1016/0021-8693(78)90219-3. 10.1016/0021-8693(78)90219-3Search in Google Scholar

[10] M. Petrich, Inverse Semigroups, Wiley, New York, 1984. Search in Google Scholar

[11] F. Pastijn and M. Petrich, Congruences on regular semigroups, Trans. Amer. Math. Soc. 295 (1986), no. 2, 607–633, https://doi.org/10.2307/2000054. Search in Google Scholar

[12] A. El-Qallali, Congruences on ample semigroups, Semigroup Forum 99 (2019), 607–631, DOI: https://doi.org/10.1007/s00233-018-9988-4. 10.1007/s00233-018-9988-4Search in Google Scholar

[13] M. Petrich and N. R. Reilly, A network of congruences on an inverse semigroup, Trans. Am. Math. Soc. 270 (1982), 309–325, https://doi.org/10.1090/S0002-9947-1982-0642343-6. Search in Google Scholar

[14] D. G. Green, The lattice of congruences on an inverse semigroup, Pac. J. Math. 57 (1975), 141–152, DOI: https://doi.org/10.2140/pjm.1975.57.141. 10.2140/pjm.1975.57.141Search in Google Scholar

[15] A. El-Qallali, A network of congruences on an ample semigroup, Semigroup Forum 102 (2021), 612–654, https://doi.org/10.1007/s00233-021-10168-z. Search in Google Scholar

[16] H. J. Liu and X. J. Guo, Congruences on glrac semigroups (I), J. Algebra Appl. (2022), 22502401, DOI: https://doi.org/10.1142/S0219498822502401. 10.1142/S0219498822502401Search in Google Scholar

[17] Y. Y. Feng, L. M. Wang, L. Zhang, and H. Y. Huang, A new approach to a network of congruences on an inverse semigroup, Semigroup Forum 99 (2019), 465–480, https://doi.org/10.1007/s00233-019-09993-0. Search in Google Scholar

[18] C. H. Li, X. J. Guo, and E. G. Liu, Good congruences on perfect rectangular bands of adequate semigroups, Adv. Math. (China) 38 (2009), no. 4, 465–476. Search in Google Scholar

[19] H. J. Liu and X. J. Guo, Congruences on left abundant semigroups, Adv. Math. (China) (to appear). Search in Google Scholar

[20] M. V. Lawson, Inverse Semigroups: The Theory of Partial Symmetries, World Scientific, Singapore, 1998. 10.1142/3645Search in Google Scholar

[21] M. Petrich and N. R. Reilly, Completely Regular Semigroups, NY: Wiley, New York, 1999. Search in Google Scholar

[22] J. M. Howie, Fundamentals of Semigroup Theory, Clarendon Press, Oxford, 1995. 10.1093/oso/9780198511946.001.0001Search in Google Scholar

[23] G. M. S. Gomes and V. Gould, Proper weakly left ample semigroups, Int. J. Algebra Comput. 9 (1999), 721–739, https://doi.org/10.1142/S0218196799000412. Search in Google Scholar

[24] G. M. S. Gomes and M. B. Szendrei, Almost factorizable weakly ample semigroups, Comm. Algebra 35 (2007), no. 11, 3503–3523, https://doi.org/10.1080/00927870701509503. Search in Google Scholar

[25] C. H. Li, J. Y. Fang, L. X. Meng, and B. G. Xu, Almost factorizable weakly type B semigroups, Open Math. 19 (2021), no. 1, 1721–1735, https://doi.org/10.1515/math-2021-0127. Search in Google Scholar

Received: 2022-03-03
Revised: 2022-05-03
Accepted: 2022-08-21
Published Online: 2022-10-12

© 2022 Haijun Liu and Xiaojiang Guo, published by De Gruyter

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

Articles in the same Issue

  1. Regular Articles
  2. A random von Neumann theorem for uniformly distributed sequences of partitions
  3. Note on structural properties of graphs
  4. Mean-field formulation for mean-variance asset-liability management with cash flow under an uncertain exit time
  5. The family of random attractors for nonautonomous stochastic higher-order Kirchhoff equations with variable coefficients
  6. The intersection graph of graded submodules of a graded module
  7. Isoperimetric and Brunn-Minkowski inequalities for the (p, q)-mixed geominimal surface areas
  8. On second-order fuzzy discrete population model
  9. On certain functional equation in prime rings
  10. General complex Lp projection bodies and complex Lp mixed projection bodies
  11. Some results on the total proper k-connection number
  12. The stability with general decay rate of hybrid stochastic fractional differential equations driven by Lévy noise with impulsive effects
  13. Well posedness of magnetohydrodynamic equations in 3D mixed-norm Lebesgue space
  14. Strong convergence of a self-adaptive inertial Tseng's extragradient method for pseudomonotone variational inequalities and fixed point problems
  15. Generic uniqueness of saddle point for two-person zero-sum differential games
  16. Relational representations of algebraic lattices and their applications
  17. Explicit construction of mock modular forms from weakly holomorphic Hecke eigenforms
  18. The equivalent condition of G-asymptotic tracking property and G-Lipschitz tracking property
  19. Arithmetic convolution sums derived from eta quotients related to divisors of 6
  20. Dynamical behaviors of a k-order fuzzy difference equation
  21. The transfer ideal under the action of orthogonal group in modular case
  22. The multinomial convolution sum of a generalized divisor function
  23. Extensions of Gronwall-Bellman type integral inequalities with two independent variables
  24. Unicity of meromorphic functions concerning differences and small functions
  25. Solutions to problems about potentially Ks,t-bigraphic pair
  26. Monotonicity of solutions for fractional p-equations with a gradient term
  27. Data smoothing with applications to edge detection
  28. An ℋ-tensor-based criteria for testing the positive definiteness of multivariate homogeneous forms
  29. Characterizations of *-antiderivable mappings on operator algebras
  30. Initial-boundary value problem of fifth-order Korteweg-de Vries equation posed on half line with nonlinear boundary values
  31. On a more accurate half-discrete Hilbert-type inequality involving hyperbolic functions
  32. On split twisted inner derivation triple systems with no restrictions on their 0-root spaces
  33. Geometry of conformal η-Ricci solitons and conformal η-Ricci almost solitons on paracontact geometry
  34. Bifurcation and chaos in a discrete predator-prey system of Leslie type with Michaelis-Menten prey harvesting
  35. A posteriori error estimates of characteristic mixed finite elements for convection-diffusion control problems
  36. Dynamical analysis of a Lotka Volterra commensalism model with additive Allee effect
  37. An efficient finite element method based on dimension reduction scheme for a fourth-order Steklov eigenvalue problem
  38. Connectivity with respect to α-discrete closure operators
  39. Khasminskii-type theorem for a class of stochastic functional differential equations
  40. On some new Hermite-Hadamard and Ostrowski type inequalities for s-convex functions in (p, q)-calculus with applications
  41. New properties for the Ramanujan R-function
  42. Shooting method in the application of boundary value problems for differential equations with sign-changing weight function
  43. Ground state solution for some new Kirchhoff-type equations with Hartree-type nonlinearities and critical or supercritical growth
  44. Existence and uniqueness of solutions for the stochastic Volterra-Levin equation with variable delays
  45. Ambrosetti-Prodi-type results for a class of difference equations with nonlinearities indefinite in sign
  46. Research of cooperation strategy of government-enterprise digital transformation based on differential game
  47. Malmquist-type theorems on some complex differential-difference equations
  48. Disjoint diskcyclicity of weighted shifts
  49. Construction of special soliton solutions to the stochastic Riccati equation
  50. Remarks on the generalized interpolative contractions and some fixed-point theorems with application
  51. Analysis of a deteriorating system with delayed repair and unreliable repair equipment
  52. On the critical fractional Schrödinger-Kirchhoff-Poisson equations with electromagnetic fields
  53. The exact solutions of generalized Davey-Stewartson equations with arbitrary power nonlinearities using the dynamical system and the first integral methods
  54. Regularity of models associated with Markov jump processes
  55. Multiplicity solutions for a class of p-Laplacian fractional differential equations via variational methods
  56. Minimal period problem for second-order Hamiltonian systems with asymptotically linear nonlinearities
  57. Convergence rate of the modified Levenberg-Marquardt method under Hölderian local error bound
  58. Non-binary quantum codes from constacyclic codes over 𝔽q[u1, u2,…,uk]/⟨ui3 = ui, uiuj = ujui
  59. On the general position number of two classes of graphs
  60. A posteriori regularization method for the two-dimensional inverse heat conduction problem
  61. Orbital stability and Zhukovskiǐ quasi-stability in impulsive dynamical systems
  62. Approximations related to the complete p-elliptic integrals
  63. A note on commutators of strongly singular Calderón-Zygmund operators
  64. Generalized Munn rings
  65. Double domination in maximal outerplanar graphs
  66. Existence and uniqueness of solutions to the norm minimum problem on digraphs
  67. On the p-integrable trajectories of the nonlinear control system described by the Urysohn-type integral equation
  68. Robust estimation for varying coefficient partially functional linear regression models based on exponential squared loss function
  69. Hessian equations of Krylov type on compact Hermitian manifolds
  70. Class fields generated by coordinates of elliptic curves
  71. The lattice of (2, 1)-congruences on a left restriction semigroup
  72. A numerical solution of problem for essentially loaded differential equations with an integro-multipoint condition
  73. On stochastic accelerated gradient with convergence rate
  74. Displacement structure of the DMP inverse
  75. Dependence of eigenvalues of Sturm-Liouville problems on time scales with eigenparameter-dependent boundary conditions
  76. Existence of positive solutions of discrete third-order three-point BVP with sign-changing Green's function
  77. Some new fixed point theorems for nonexpansive-type mappings in geodesic spaces
  78. Generalized 4-connectivity of hierarchical star networks
  79. Spectra and reticulation of semihoops
  80. Stein-Weiss inequality for local mixed radial-angular Morrey spaces
  81. Eigenvalues of transition weight matrix for a family of weighted networks
  82. A modified Tikhonov regularization for unknown source in space fractional diffusion equation
  83. Modular forms of half-integral weight on Γ0(4) with few nonvanishing coefficients modulo
  84. Some estimates for commutators of bilinear pseudo-differential operators
  85. Extension of isometries in real Hilbert spaces
  86. Existence of positive periodic solutions for first-order nonlinear differential equations with multiple time-varying delays
  87. B-Fredholm elements in primitive C*-algebras
  88. Unique solvability for an inverse problem of a nonlinear parabolic PDE with nonlocal integral overdetermination condition
  89. An algebraic semigroup method for discovering maximal frequent itemsets
  90. Class-preserving Coleman automorphisms of some classes of finite groups
  91. Exponential stability of traveling waves for a nonlocal dispersal SIR model with delay
  92. Existence and multiplicity of solutions for second-order Dirichlet problems with nonlinear impulses
  93. The transitivity of primary conjugacy in regular ω-semigroups
  94. Stability estimation of some Markov controlled processes
  95. On nonnil-coherent modules and nonnil-Noetherian modules
  96. N-Tuples of weighted noncommutative Orlicz space and some geometrical properties
  97. The dimension-free estimate for the truncated maximal operator
  98. A human error risk priority number calculation methodology using fuzzy and TOPSIS grey
  99. Compact mappings and s-mappings at subsets
  100. The structural properties of the Gompertz-two-parameter-Lindley distribution and associated inference
  101. A monotone iteration for a nonlinear Euler-Bernoulli beam equation with indefinite weight and Neumann boundary conditions
  102. Delta waves of the isentropic relativistic Euler system coupled with an advection equation for Chaplygin gas
  103. Multiplicity and minimality of periodic solutions to fourth-order super-quadratic difference systems
  104. On the reciprocal sum of the fourth power of Fibonacci numbers
  105. Averaging principle for two-time-scale stochastic differential equations with correlated noise
  106. Phragmén-Lindelöf alternative results and structural stability for Brinkman fluid in porous media in a semi-infinite cylinder
  107. Study on r-truncated degenerate Stirling numbers of the second kind
  108. On 7-valent symmetric graphs of order 2pq and 11-valent symmetric graphs of order 4pq
  109. Some new characterizations of finite p-nilpotent groups
  110. A Billingsley type theorem for Bowen topological entropy of nonautonomous dynamical systems
  111. F4 and PSp (8, ℂ)-Higgs pairs understood as fixed points of the moduli space of E6-Higgs bundles over a compact Riemann surface
  112. On modules related to McCoy modules
  113. On generalized extragradient implicit method for systems of variational inequalities with constraints of variational inclusion and fixed point problems
  114. Solvability for a nonlocal dispersal model governed by time and space integrals
  115. Finite groups whose maximal subgroups of even order are MSN-groups
  116. Symmetric results of a Hénon-type elliptic system with coupled linear part
  117. On the connection between Sp-almost periodic functions defined on time scales and ℝ
  118. On a class of Harada rings
  119. On regular subgroup functors of finite groups
  120. Fast iterative solutions of Riccati and Lyapunov equations
  121. Weak measure expansivity of C2 dynamics
  122. Admissible congruences on type B semigroups
  123. Generalized fractional Hermite-Hadamard type inclusions for co-ordinated convex interval-valued functions
  124. Inverse eigenvalue problems for rank one perturbations of the Sturm-Liouville operator
  125. Data transmission mechanism of vehicle networking based on fuzzy comprehensive evaluation
  126. Dual uniformities in function spaces over uniform continuity
  127. Review Article
  128. On Hahn-Banach theorem and some of its applications
  129. Rapid Communication
  130. Discussion of foundation of mathematics and quantum theory
  131. Special Issue on Boundary Value Problems and their Applications on Biosciences and Engineering (Part II)
  132. A study of minimax shrinkage estimators dominating the James-Stein estimator under the balanced loss function
  133. Representations by degenerate Daehee polynomials
  134. Multilevel MC method for weak approximation of stochastic differential equation with the exact coupling scheme
  135. Multiple periodic solutions for discrete boundary value problem involving the mean curvature operator
  136. Special Issue on Evolution Equations, Theory and Applications (Part II)
  137. Coupled measure of noncompactness and functional integral equations
  138. Existence results for neutral evolution equations with nonlocal conditions and delay via fractional operator
  139. Global weak solution of 3D-NSE with exponential damping
  140. Special Issue on Fractional Problems with Variable-Order or Variable Exponents (Part I)
  141. Ground state solutions of nonlinear Schrödinger equations involving the fractional p-Laplacian and potential wells
  142. A class of p1(x, ⋅) & p2(x, ⋅)-fractional Kirchhoff-type problem with variable s(x, ⋅)-order and without the Ambrosetti-Rabinowitz condition in ℝN
  143. Jensen-type inequalities for m-convex functions
  144. Special Issue on Problems, Methods and Applications of Nonlinear Analysis (Part III)
  145. The influence of the noise on the exact solutions of a Kuramoto-Sivashinsky equation
  146. Basic inequalities for statistical submanifolds in Golden-like statistical manifolds
  147. Global existence and blow up of the solution for nonlinear Klein-Gordon equation with variable coefficient nonlinear source term
  148. Hopf bifurcation and Turing instability in a diffusive predator-prey model with hunting cooperation
  149. Efficient fixed-point iteration for generalized nonexpansive mappings and its stability in Banach spaces
Downloaded on 7.12.2025 from https://www.degruyterbrill.com/document/doi/10.1515/math-2022-0492/html
Scroll to top button