This paper develops a graph-based framework for understanding locally inverse semigroups, introducing new graphical representations that generalize existing concepts and facilitate structural analysis.
Contribution
It introduces a novel presentation and bipartite graph structure for locally inverse semigroups, extending the tools available for their structural study.
Findings
01
Graphs describe idempotents and inverses
02
Characterization of subclasses via graph properties
03
Graph-based methods for semigroup analysis
Abstract
This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the role that Cayley graphs have for group presentations or that Sch\"utzenberger graphs have for inverse monoid presentations. However, our graphs have considerable differences with the latter two, even though locally inverse semigroups generalize both groups and inverse semigroups. For example, the graphs introduced here are not `inverse word graphs'. Instead, they are bipartite graphs with both oriented and non-oriented edges, and with labels on the oriented edges only. A byproduct of the theory developed here is the introduction of a graphical method for dealing with general locally inverse semigroups. These graphs are able to describe, for a locally…
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
A combinatorial approach to the structure of locally inverse semigroups
Luís Oliveira
Departamento de Matemática,
Faculdade de Ciências da Universidade do Porto,
R. Campo Alegre, 687, 4169-007 Porto, Portugal
This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the role that Cayley graphs have for group presentations or that Schützenberger graphs have for inverse monoid presentations. However, our graphs have considerable differences with the latter two, even though locally inverse semigroups generalize both groups and inverse semigroups. For example, the graphs introduced here are not ‘inverse word graphs’. Instead, they are bipartite graphs with both oriented and non-oriented edges, and with labels on the oriented edges only. A byproduct of the theory developed here is the introduction of a graphical method for dealing with general locally inverse semigroups. These graphs are able to describe, for a locally inverse semigroup given by a presentation, many of the usual concepts used to study the structure of semigroups, such as the idempotents, the inverses of an element, the Green’s relations, and the natural partial order. Finally, the paper ends characterizing the semigroups belonging to some usual subclasses of locally inverse semigroups in terms of properties on these graphs.
Key words and phrases:
Locally inverse semigroup, Presentation, Bipartite graph, Language
Let S be a semigroup. The set of idempotents of S is denoted by E(S). Contrarily to the Group Theory case, the study of E(S) is an important tool in Semigroup Theory. Another important concept is the notion of inverse of an element s∈S. An element s′∈S is an inverse of s if ss′s=s and s′ss′=s′. If S is a group, this notion of inverse is equivalent to the usual notion of inverse in Group Theory. We denote the set of inverses of s in S by V(s). The set V(s) may be empty or have multiple elements for a given s. The semigroup S is regular if V(s) is non-empty for all s∈S, and it is inverse if V(s) has exactly one element for each s∈S.
A common alternative characterization of inverse semigroups is as regular semigroups whose idempotents form a subsemilattice. An inverse monoid is an inverse semigroup with an identity element. The class of all inverse monoids constitutes a variety of algebras of type ⟨2,1,0⟩ where the unary operation is the operation of taking the inverse and the nullary operation chooses the identity element.
Throughout this paper, X will denote a non-empty set and X′={x′:x∈X} will denote a disjoint copy of X. Let X=X∪X′. If y=x′∈X′, then y′ denotes x. Let X∗ and X+ be respectively the free monoid and the free semigroup on X. Thus X+ is the set of all non-empty ‘words’ on the ‘alphabet’ X equipped with the concatenation operation, and X∗ is just X+ with the empty word ι adjoined. Let σ be the congruence generated by {(yy′,ι):y∈X} and let ϱ be the Wagner congruence, the least inverse monoid congruence, both on X∗. Then X∗/σ is the free group FG(X) while X∗/ϱ is the free inverse monoid FIM(X), both on X.
An inverse monoid presentation [group presentation] is a pair P=⟨X;R⟩ where R is a relation on X∗. The inverse monoid presented by P is the inverse monoid S=X∗/ρ where ρ is the congruence generated by ϱ∪R; and the group presented by P is the group G=X∗/θ where θ is the congruence generated by σ∪R. We denote S by Inv⟨X;R⟩ and G by G⟨X;R⟩. The word problem for an inverse monoid presentation [group presentation] P consists of knowing if there exist an algorithm to decide, given two words u and v from X∗ as input, whether (u,v)∈ρ [(u,v)∈θ] or not. It is well known that the word problem is undecidable for many group and inverse monoid presentations, that is, no such algorithm exists for many cases.
The structure of FIM(X) was first described by Scheiblich [15, 16]. Another important description was given by Munn [10]. Munn’s approach uses graphical methods, the so called Munn trees. Stephen [17] used Munn’s idea to develop a graphical method to attack the word problem for inverse monoid presentations. He uses inverse word graphs, a natural generalization of Munn trees obtained by dropping the condition of being a tree, to describe the structure of any inverse monoid given by an inverse monoid presentation. These inverse word graphs, called Schützenberger graphs, play for inverse monoid presentations a role similar to the role that Cayley graphs play for group presentations. Both these graphs have revealed themselves to be very important tools in many contexts.
Apart from groups, inverse semigroups and finite semigroups are the two most studied classes of semigroups. The interest in inverse semigroups comes from many different areas. For example, they appear naturally when dealing with partial one-to-one transformations, or they are the natural algebras to consider when generalizing the notion of group preserving the uniqueness of inverses. But, the existence of graphical methods, such as the ones developed by Munn and Stephen, has also boosted the study of these semigroups, specially in Combinatorial Inverse Semigroup Theory. The lack of similar good graphical methods for other classes of semigroups has been a hindrance in the study of those classes.
In this paper we introduce a notion of presentation for locally inverse semigroups. The goal is to develop a graph structure to describe the elements of a locally inverse semigroup given by a locally inverse semigroup presentation. A byproduct of the theory developed here is the introduction of graphical methods to address general locally inverse semigroups.
A locally inverse semigroup is a regular semigroup S where every local submonoid, that is, a submonoid of the form eSe with e∈E(S), is an inverse semigroup. The class LI of all locally inverse semigroups is an e-variety of regular semigroups, a class of regular semigroups closed for homomorphic images, direct products and regular subsemigroups [6, 9], with bifree objects on every set X (see [18] for the definition and existence of bifree objects in LI on every set X).
The structure of the bifree locally inverse semigroup BFLI(X) on a set X has been studied in [1, 2, 3, 13]. In [13], we gave a graph description for the elements of BFLI(X) that can be viewed as the analogue for BFLI(X) of the Munn tree representation for the elements of FIM(X). In the present paper, we adapt those graphs so that we can describe the elements of a locally inverse semigroup given by a locally inverse semigroup presentation. The work done here generalizes [13] in a similar manner as Stephen’s work [17] generalizes Munn’s approach to the free inverse monoid.
However, the graphs considered here have considerable differences when compared with both Cayley graphs and Schützenberger graphs, even though locally inverse semigroups generalize both groups and inverse semigroups. For example, they are not ‘inverse word graphs’ as the latter two are. Instead, the graphs introduced here are bipartite graphs with both oriented and non-oriented edges, and with labels on the oriented edges only.
Bipartite graphs have already been used to study completely 0-simple semigroups. Graham [5] and Houghton [7], independently, associated bipartite graphs to each regular Rees matrix semigroup representing a completely 0-simple semigroup. The vertices of these bipartite graphs are in one-to-one correspondence with the set of \mathrsfsR-classes and \mathrsfsL-classes of the non-trivial \mathrsfsD-class of the completely 0-simple semigroups. More precisely, the vertices are partitioned into ‘left’ and ‘right’ vertices, where the left vertices represent the \mathrsfsR-classes and the right vertices represent the \mathrsfsL-classes. Graham and Houghton used these graphs to study completely 0-simple semigroups.
Recently, Reilly [14] introduced the notion of a fundamental semigroup associated with a bipartite graph Γ. If the vertices of Γ are partitioned into the sets V1 of left vertices and V2 of right vertices, then let P be the set of all walks from a left vertex to a right vertex. If p1,p2∈P, then define p1⋅p2=p1ep2∈P if e is the edge connecting the right vertex of p1 with the left vertex of p2; otherwise, set p1⋅p2=0. Reilly used the previous operation on P∪{0} to introduce the fundamental semigroup of the bipartite graph. These semigroups are 0-direct unions of idempotent generated completely 0-simple semigroups. Reilly applied this concept on the graphs introduced by Graham and Houghton, and showed that the fundamental semigroups obtained have a sort of universal property with respect to completely 0-simple semigroups. The reader should consult [14] for more details.
In this paper, the bipartite graphs we shall consider have a different provenance. The vertices are no longer determined by the set of \mathrsfsR-classes and \mathrsfsL-classes. Instead, the left vertices of the graphs considered here correspond to the elements of an \mathrsfsL-class, while the right vertices correspond to the elements of an \mathrsfsR-class that intersects the previous \mathrsfsL-class. Thus, our graphs shall have more vertices in general than the Graham and Houghton’s graphs. Also, we will not follow Reilly’s approach trying to describe the elements of the locally inverse semigroups as walks in a bipartite graph. Instead, the elements of the locally inverse semigroups will be described as concrete bipartite graphs with two distinguished vertices. We will not distinguish any particular walk between the two distinguished vertices. This approach will allow us to introduce operations on these bipartite graphs that capture the structure of the locally inverse semigroup. Finally, as mentioned already, our bipartite graphs will have two distinct types of edges: non-oriented edges and oriented edges, the latter with labels. The non-oriented edges will describe the inverses and the idempotents inside a \mathrsfsD-class, while the labeled oriented edges will gather information about the partial multiplication with the elements of a generating set inside a \mathrsfsD-class.
In the next section, we recall some concepts and notations used in Semigroup Theory that will be useful to us. In Section 3, we introduce the concept of presentation for locally inverse semigroups. Before we continue with the study of these presentations, we introduce the graphs we shall need and study some of their properties. This will be done in Sections 4 and 5. More precisely, in Section 4, we introduce the birooted locally inverse word graphs and define the language recognized by them; and in Section 5, we study the ‘reduced’ birooted locally inverse word graphs.
We should point out that the notion of language recognized by birooted locally inverse word graphs is crucial for the theory developed here, not only for Sections 4 and 5, but also for the subsequent sections. As usual, this notion comes from associating words to walks inside the graphs, but it has its own peculiarities. Firstly, each walk can have several associated words. Secondly, the words are on a larger alphabet than X, namely
[TABLE]
Thus, the language recognized by a birooted locally inverse word graph will be a subset of the free monoid X∗.
In Section 6, we associate a reduced locally inverse word graph to each idempotent e of a locally inverse semigroup S given by a presentation. We see that these graphs characterize the \mathrsfsD-classes of S and that they are isomorphic if and only if the associated idempotents belong to the same \mathrsfsD-class. In Section 7, we introduce the reduced birooted locally inverse word graph associated with a given element s∈S. We just need to add two roots to the graphs described in Section 6. We show that no two distinct elements of S have the associated reduced birooted locally inverse word graphs isomorphic, and we analyze the relation between these graphs and the structure of S. In particular, we describe the idempotents, the inverses of an element, the Green’s relations, the natural partial order and the product on S using these graphs. Finally, in the last section, we describe some special classes of locally inverse semigroups in terms of particular properties on the reduced locally inverse word graphs.
2. Preliminaries
For concepts and notations left undefined in this paper, the reader should consult [8]. In this paper, S and ≤ will always denote a regular semigroup and its natural partial order, respectively. Recall that, s≤t for s,t∈S if and only if there exist idempotents e,f∈E(S) such that s=te=ft. Let (s]≤ and [s)≤ denote respectively the principal ideal and the principal filter generated by s∈S for the natural partial order. Note that E(S) is an ideal with respect to the natural partial order.
As usual, \mathrsfsR, \mathrsfsL, \mathrsfsH, \mathrsfsD and \mathrsfsJ denote the five Green’s relations on S, and Ks denotes the \mathrsfsK-class of s∈S for \mathrsfsK∈{\mathrsfsR,\mathrsfsL,\mathrsfsH,\mathrsfsD,\mathrsfsJ}. Let ≤\mathrsfsR be the quasiorder defined by
[TABLE]
Let ≤\mathrsfsL be its dual relation and ≤\mathrsfsH=≤\mathrsfsR∩≤\mathrsfsL. Consider also the quasiorder ≤\mathrsfsJ defined by
[TABLE]
If ≥\mathrsfsR, ≥\mathrsfsL, ≥\mathrsfsH and ≥\mathrsfsJ denote the respective reverse relations, then
[TABLE]
Let (s]\mathrsfsK and [s)\mathrsfsK denote respectively the principal ideal and the principal filter generated by s∈S for the relations ≤\mathrsfsK where \mathrsfsK∈{\mathrsfsR,\mathrsfsL,\mathrsfsH,\mathrsfsJ}.
If st\mathrsfsRs for s,t∈S, then the mapping φt:Ls→Lst,u↦ut is a well-defined bijection preserving \mathrsfsR-related elements by the Green’s Lemma (see [8]). The mapping φt is called the right translation of Ls associated with t. Dually, if st\mathrsfsLt, then the mapping ψs:Rt→Rst,u↦su is a well-defined bijection preserving \mathrsfsL-related elements, called the left translation of Rt associated with s.
Let ωr and ωl be the following relations on E(S):
[TABLE]
Consider also the relation ω=ωr∩ωl on E(S). Once more, for e∈E(S), (e]r, (e]l and (e] [[e)r, [e)l and [e)] denote the principal ideals [filters] generated by e for the relations ωr, ωl and ω, respectively. Then ωr [ωl] coincides with the restriction of ≤\mathrsfsR [≤\mathrsfsL] to E(S), while ω coincides with the restriction of both ≤ and ≤\mathrsfsH to E(S).
The locally inverse semigroups can be described using the relations ωr, ωl and ω. A regular semigroup S is locally inverse if for each pair (e,f)∈E(S)×E(S), there exists g∈E(S) such that (e]r∩(f]l=(g]. Since ω is a partial order, the idempotent g is unique for each pair (e,f). If we consider the binary operation ∧ on E(S) defined by e∧f=g, then the algebra (E(S),∧) is called the pseudosemilattice of idempotents of S. Pseudosemilattices were introduced by Nambooripad [11], who also gave an abstract characterization for them.
The operation ∧ can be extended naturally to the whole locally inverse semigroup S. It is well known that e∧f=e1∧f1 if e\mathrsfsRe1 and f\mathrsfsLf1. Thus, without any ambiguity, we can define s∧t for s,t∈S as follows:
[TABLE]
We shall look at the locally inverse semigroups as binary semigroups, that is, algebras of type ⟨2,2⟩ where the first operation is associative.
Let S1 be the monoid obtained from the semigroup S by adjoining an identity element 1 if necessary. A locally inverse semigroup with an identity element must be an inverse semigroup. Thus, if S is a non-inverse locally inverse semigroup, then S1 is no longer locally inverse. However, for technical reasons, it will be often convenient to consider the locally inverse semigroups with an identity adjoined. Therefore, we will use the terminology locally inverse monoid with a different meaning than usual. In the context of this paper, a locally inverse monoid is a regular monoid T with identity 1 such that T∖{1} is a locally inverse semigroup.
We end this section with two lemmas about locally inverse semigroups that will be useful later. Note that, in any semigroup S, if e,f∈E(S), then eS∩Sf=eSf. It is also well known that, if S is locally inverse, then no two idempotents of (f]r are \mathrsfsL-related and no two idempotents of (f]l are \mathrsfsR-related.
Lemma 2.1**.**
Let S be a locally inverse semigroup and a∈fSe for some e,f∈E(S). Then ∣V(a)∩eSf∣=1.
Proof.
Let a′∈V(a). Then aa′∈(f]r and f1=aa′f∈(f]∩Ra. Similarly e1=ea′a∈(e]∩La. Hence Re1∩Lf1 contains an inverse of a, and so V(a)∩eSf=∅. Now, let a′,a1′∈V(a)∩eSf. Then aa′ and aa1′ are \mathrsfsR-related idempotents in (f]l, whence aa′=aa1′. In the same manner we conclude that a′a=a1′a. Thus a′=a1′ and ∣V(a)∩eSf∣=1.
∎
Lemma 2.2**.**
Let S be a locally inverse semigroup, a∈S, e∈E(S) and a′∈V(a)∩Se. Then a′=a1′(f∧e) for all a1′∈V(a)∩Ra′ and all f∈E(S) such that a∈fS.
Proof.
Let f∈E(S) such that a∈fS and let a1′∈V(a)∩Ra′. Since aa′∈(f]r∩(e]l=(f∧e] and aa1′∈E(S)∩Raa′, we must have aa1′(f∧e)=aa′ because S is locally inverse. Hence a1′(f∧e)=a′ since a1′a=a′a.
∎
3. Presentations for locally inverse semigroups
For a nonempty set X, let
[TABLE]
We consider (x∧y) as new letters added to X, and when they appear isolated we may omit the parentheses. Thus X+ and X∗ are the free semigroup and the free monoid on the alphabet X, respectively.
For u∈X+, let λ^u [τ^u] be the first [last] letter of X occurring in u, and let λu [τu] be the first [last] letter of X occurring in u. To make things clearer, if u=(x∧y)z for x,y,z∈X, then λ^u=(x∧y), λu=x, and τ^u=τu=z.
Let ε be the Auinger’s congruence [2] on X+ that turns X+/ε into a model for BFLI(X). We continue to denote by ε the congruence on X∗ obtained by adding the pair (ι,ι) to ε. Then X∗/ε is just the bifree locally inverse semigroup X+/ε with an identity adjoined.
Define x−1=x′ and (x∧y)−1=(y′∧y)(x∧x′) for x,y∈X. If u=z1⋯zn∈X+ with zi∈X for i=1,⋯,n, then set
[TABLE]
Although (u−1)−1=u and uu−1u=u, we call u−1 the formal inverse of u due to the following lemma:
A presentation for locally inverse semigroups is a pair P=⟨X;R⟩ where R is a relation on X+. Let μ be the congruence on X+ generated by ε∪R. The semigroup presented by P is S=X+/μ. Clearly S is locally inverse since it is a homomorphic image of the bifree locally inverse semigroup X+/ε. We write S=LI⟨X;R⟩. Note that (xx′)μ=(x∧x′)μ for all x∈X. Note further that μm=μ∪{(ι,ι)} is a congruence on X∗ since R⊆X+. It is convenient to consider also the locally inverse monoid T=X∗/μm, which is precisely S with a new identity element adjoined. We denote T by LI1⟨X;R⟩. Without further comments, throughout this paper, μ will always represent the congruence generated by ε∪R associated with the presentation P=⟨X;R⟩. Also, we denote μm just by μ since no ambiguity will occur.
There is also another convention we introduce to make the notation used in this paper less cumbersome. Note that X∗ acts naturally on T, both on the left and on the right, as follows:
[TABLE]
where ua and au represent respectively the elements (uμ)a and a(uμ) of T. Thus, from now on, we will write only ua or au to refer to the elements (uμ)a and a(uμ) of T.
Next, we introduce three examples of presentations for locally inverse semigroups. The first two examples will be used later to illustrate and explain some of the concepts and results obtained. The third example is the ‘four-spiral semigroup’. This semigroup is an important example of an idempotent generated bisimple, non-completely simple, semigroup (see [4]). Due to its peculiar structure, it is an interesting example to look at and to see how the technique developed in this paper applies to.
Example 1: Let X1={x,y},
[TABLE]
and R0={(x2,x2z),(x2,zx2),(x2,z1z2):z∈X1,(z1,z2)∈A}. Set
[TABLE]
and consider the presentation P1=⟨X1;R1⟩. Let S1=LI⟨X1;R1⟩ be the locally inverse semigroup presented by P1 and let μ1 be the congruence on X1+ such that S1=X1+/μ1.
Note that x2μ1 works as a zero element of S1 due to the two first pairs of R0. Thus we denote it just as [math]. Also by definition of R0, z1z2∈0 for all (z1,z2)∈A. Hence, also
[TABLE]
Analyzing now R1, we conclude that x′μ1 and y′μ1 are idempotents, and (x′μ1)\mathrsfsL((y′∧x′)μ1)\mathrsfsR(y′μ1). Now, with a few more easy computations, it is not hard to see that S1 is the combinatorial completely 0-simple semigroup with \mathrsfsD-class egg-box picture depicted in Figure 1.
Note that, in the egg-box picture, we chose a representative for each μ1-class in the non-trivial \mathrsfsD-class. From now on, when referring to S1, we identify each μ1-class with its representative indicated in the egg-box picture. Also, the symbol ∗ next to an element of S1 indicates that element is an idempotent. ∎
Example 2: Let S2 be the locally inverse semigroup given by the presentation P2=⟨X2;R2⟩ where X2={z} and R2={(z,z3),(z′,z′2)}. Let μ2 be the congruence on X2+ such that S2=X2+/μ2. Then
[TABLE]
Thus (z1∧z2)μ2z1z2 for each (z1∧z2)∈X2. It is not hard to see now that the set
[TABLE]
is a transversal set for the congruence μ2. We identify each μ2-class with its representative in Z except for (z′zz′)μ2 where we choose z′ instead of z′zz′, although sometimes it will be easier if we consider z′zz′ instead of z′. The semigroup S2 is then the completely simple semigroup with \mathrsfsD-class egg-box picture depicted in Figure 2.
For each u∈X2+, let n1(u) be the number of occurrences of the letter z in u. To make it clear, we consider n1(z∧z)=2 and n1(z∧z′)=1. Also, let n2(u) be the number of maximal nonempty substrings of u with no letter z′, and n(u)=n1(u)−n2(u). For example, if
[TABLE]
then n1(u)=7, n2(u)=3 and n(u)=4. Note now that
[TABLE]
for all u∈X2+. ∎
Example 3: The four-spiral semigroup Sp4 (see [4]) is a semigroup generated by four idempotents, say a, b, c and d, such that
[TABLE]
This semigroup is bisimple but not completely simple. It can be decomposed into the disjoint union of four copies of the bicyclic semigroup B and a copy of the free monogenic semigroup N. The unique \mathrsfsD-class of Sp4 is depicted in Figure 3.
The elements in the same row are \mathrsfsR-equivalent and the elements in the same column are \mathrsfsL-equivalent. The arrows indicate the covers for the natural partial order and the idempotents are identified by ∙
. The name of this semigroup comes from the ‘four-spiral’ made by the placement of its idempotents. If we call x the element ca, then b is an inverse of x and d=x∧x. Hence Sp4=LI⟨{x};{(x′,x′2),(x,(x∧x)x)}⟩. ∎
Let S=LI⟨X;R⟩, a∈S and v∈X+. If av\mathrsfsRa, then φv denotes the right translation of La associated with vμ, that is, φv is the bijective mapping φv:La→Lav,s↦sv which preserves the \mathrsfsR-related elements. If va\mathrsfsLa, then ψv denotes the left translation of Ra associated with vμ, that is, ψv is the bijective mapping ψv:Ra→Rva,s↦vs which preserves the \mathrsfsL-related elements. We collect some information about the left and right translations on S in the following results.
Lemma 3.2**.**
Let S=LI⟨X;R⟩, x∈X, s∈S(x∧x′) and v∈X+ such that λv=x. If sv\mathrsfsRs, then φv:Ls→Lsv is a right translation of Ls with inverse right translation φv−1:Lsv→Ls.
Proof.
φv is obviously a right translation of Ls into Lsv. Further, without loss of generality, we can assume that s is an idempotent; and so s,(vv−1)μ∈((x∧x′)μ]l. Since ((x∧x′)μ)]l is a left normal band, we conclude that s and s(vv−1) are \mathrsfsR-related idempotents of ((x∧x′)μ]l. Hence s=s(vv−1)=(sv)v−1 and φv−1 is the inverse right translation of φv.
∎
Corollary 3.3**.**
Let S=LI⟨X;R⟩, x,y∈X and s∈S(x∧x′). Then:
(i)
φx:Ls→Lsx* is a right translation of Ls with inverse right translation φx′:Lsx→Ls.*
(ii)
If s(y∧y′)\mathrsfsRs, then φy∧y′:Ls→Ls(y∧y′) is a right translation with inverse right translation φy∧x′:Ls(y∧y′)→Ls.
(iii)
If s(x∧y′)\mathrsfsRs, then φx∧y′:Ls→Ls(x∧y′) is a right translation with inverse right translation φx∧x′:Ls(x∧y′)→Ls.
Proof.
(i) is obvious since s∈S(x∧x′).
(ii). Clearly φy∧y′:Ls→Ls(y∧y′) is a right translation of Ls. Let u=(x∧x′)(y∧y′)=(y∧x′)−1 and note that s(y∧y′)=su because s∈S(x∧x′). Hence φy∧y′=φu and, by Lemma 3.2, φy∧x′=φu−1:Ls(y∧y′)→Ls is the inverse right translation of φy∧y′.
The proof of (iii) is analogous. We just need to observe that the second mapping φx∧x′ is precisely φ(x∧y′)−1.
∎
The two previous results have their right-left duals. We indicate next only the dual of Corollary 3.3.
Corollary 3.4**.**
Let S=LI⟨X;R⟩, x,y∈X and s∈(x∧x′)S. Then:
(i)
ψx′:Rs→Rx′s* is a left translation of Rs with inverse left translation ψx:Rx′s→Rs.*
(ii)
If (y∧y′)s\mathrsfsLs, then ψy∧y′:Rs→R(y∧y′)s is a left translation with inverse left translation ψx∧y′:R(y∧y′)s→Rs.
(iii)
If (y∧x′)s\mathrsfsLs, then ψy∧x′:Rs→R(y∧x′)s is a left translation with inverse left translation ψx∧x′:R(y∧x′)s→Rs.
4. Birooted locally inverse word graph
In this section, we introduce the birooted locally inverse word graphs. These combinatorial objects will be fundamental to the characterization of the elements of a locally inverse semigroup. However, we will focus only on general properties of these graphs. We will introduce the crucial concept of language recognized by them, and study how this concept of language behaves under homomorphic images and subgraphs of those graphs.
Birooted locally inverse word graphs are special bipartite graphs with two kinds of edges and with two distinguished vertices. Some edges will have both an orientation and a label from X, while others will have neither. We will call arrows the oriented and labeled edges, and lines the non-oriented and non-labeled edges. The term ‘edges’ will be used to refer to both arrows and lines. In terms of notation, we use e (with a vector on top) to denote an arrow and e (with a line on top) to denote a line. However, since our graphs will have both arrows and lines simultaneously, we will often use the notation e to refer to both of them in general. In fact, we will use the notations e or e, instead of e, only when we want to emphasize the idea that e is a line or an arrow, respectively.
We use the term graph as synonymous of a ‘simple graph’. In the context of this paper, it means that our graphs will not have multiple lines connecting the same vertices and will not have multiple arrows with the same initial or starting vertex, the same label and the same final or ending vertex. Note however that we admit lines and arrows with the same endpoints, and multiple arrows from the same starting vertex to the same ending vertex but with distinct labels.
Let Γ=(\mathrsfsV,\mathrsfsE) be a graph with vertices \mathrsfsV and edges, that is, lines and arrows, \mathrsfsE. We denote by \mathrsfsE and \mathrsfsE the sets of lines and arrows of Γ, respectively. We use also the notations V(Γ) for the set of vertices, E(Γ) for the set of edges, E(Γ) for the set of lines and E(Γ) for the set of arrows, all with respect to the graph Γ. We will consider only bipartite graphs in this paper. Thus \mathrsfsV is partitioned into two sets \mathrsfsVl and \mathrsfsVr such that all edges have one endpoint in \mathrsfsVl and the other endpoint in \mathrsfsVr. We will use also the notations Vl(Γ)=\mathrsfsVl and Vr(Γ)=\mathrsfsVr. The vertices of \mathrsfsVl and \mathrsfsVr will be designated as left and right vertices, respectively. Thus, the sides(a) of a vertex a is either left or right depending on whether a∈\mathrsfsVl or a∈\mathrsfsVr, respectively.
An arrow e starting at a∈\mathrsfsV, labeled by x∈X and ending at b∈\mathrsfsV is represented by the triple e=(a,x,b) with the label at the center. There is no ambiguity with this notation since our graphs do not have arrows with the same initial vertex, the same final vertex, and the same label. The label of e is denoted by ℓ(e), while the starting vertex and the ending vertex are denoted by l(e) and r(e), respectively. Since our graphs are bipartite with no multiple lines with the same endpoints, there is no ambiguity in using (a,b), with a∈\mathrsfsVl and b∈\mathrsfsVr, for denoting the line e with endpoints a and b. Thus \mathrsfsE⊆\mathrsfsVl×\mathrsfsVr. We write l(e) and r(e) to denote a and b, respectively, for e=(a,b).
A walk in Γ is a sequence
[TABLE]
of alternating vertices a0,a1,⋯,an∈\mathrsfsV and edges e1,e2,⋯,en∈\mathrsfsE such that, for all i∈{1,⋯,n}, (i)ai−1 and ai are the two endpoints of ei and (ii) if ei is an arrow then ei starts at ai−1 and ends at ai. The condition (ii) assures that the orientation of the arrows is respected when ‘walking’ p (from a0 to an). The vertex a0 is the initial vertex of p while the vertex an is the final vertex of p. The walk p is designated as an a0−an walk, and the set of all a0−an walks in Γ is denoted by PΓ(a0,an). If no ambiguity occurs we just write P(a0,an) for PΓ(a0,an). The length of p is n, the number of edges. Often, we will indicate only the sequence e1e2⋯en of edges to identify the walk p. If no ambiguity occurs, we may also indicate only the sequence of vertices a0a1⋯an to refer to the walk p.
Any factor p′:=aiei+1⋯ejaj, with j≥i, of p is called a subwalk of p, and a decomposition of p is a sequence p1,⋯,pk of subwalks of p such that p=p1⋯pk (of course, omitting the initial vertex of each pi with i>1 since this vertex is also the final vertex of pi−1). The paths (walks without repetition of edges) of length 1 are called elementary paths. Thus any subpath of p of length 1 is an elementary subpath. The elementary decomposition of p is the unique decomposition of p into its elementary subpaths. Note that p has length n if and only if its elementary decomposition has n subpaths.
The graph Γ is strongly connected if there is an a−b walk for all a,b∈\mathrsfsV. If Γ1 is the graph obtained from Γ by replacing each arrow by a line, then Γ is connected if Γ1 is connected. In other words, the difference between strongly connectedness and connectedness is that we do not take into account the orientation of the arrows in the case of connectedness.
An oriented bipartite graph is a bipartite graph where all arrows start at left vertices and end at right vertices, that is, \mathrsfsE⊆\mathrsfsVl×X×\mathrsfsVr. The content of a vertex a∈\mathrsfsV is the set c(a) of all letters labeling arrows of Γ with a as one of its endpoints. A locally inverse word graph (‘liw-graph’ for short) is a graph Γ=(\mathrsfsV,\mathrsfsE) such that
(i)
Γ is a connected oriented bipartite graph;
(ii)
c(a)=∅ for all a∈\mathrsfsV;
(iii)
if (a,x,b)∈\mathrsfsE, then there are lines (a,b1) and (a1,b) in \mathrsfsE such that (a1,x′,b1)∈\mathrsfsE.
Note that an liw-graph is strongly connected by (iii) and since it is connected. Also, each vertex of Γ is the endpoint of some arrow by (ii), and together with (iii), it is also the endpoint of some line.
When illustrating an liw-graph, note that we do not need to identify which vertices are left vertices and which vertices are right vertices. This is automatically done by the arrows. Whenever the drawing of an liw-graph does not become too complex, we will try to put its vertices in two columns, left column for the left vertices and right column for the right vertices. Also, to help distinguish the lines from the arrows, we draw the lines as dashed lines. The liw-graphs will have many edges and so, the labels of some arrows will have to be placed near edges. Do not forget that only the arrows have labels. In Figure 4 we depict an example of an liw-graph to illustrate our concept.
An elementary path q:=a0e1a1 is called a left or right elementary path depending on whether a0∈\mathrsfsVl or a0∈\mathrsfsVr, respectively. Note that e1 is a line if q is a right elementary path. For the left elementary paths, we have two types: the arrow elementary paths where e1 is an arrow, and the line elementary paths where e1 is a line. To avoid ambiguity, we use the terminology ‘line elementary path’ only for the left elementary paths. Set w(q)={ι} if q is a right elementary path; w(q)={ℓ(e1)}⊆X if q is an arrow elementary path; and w(q)={(x∧y)∈X:x∈c(a0)\mboxandy∈c(a1)} if q is a line elementary path.
Let p be a walk in Γ and let p1p2⋯pk be its elementary decomposition. Note that the elementary subpaths pi alternate between left and right elementary subpaths. Set
[TABLE]
Thus the zi alternate between letters from X and the empty word. Obviously the empty words are to be omitted from the sequences z1⋯zk. If p is a trivial path with no edges, set w(p)={ι}. We say that u∈X∗ is a label for the walk p if u∈w(p). By definition of w it is evident that if q1⋯qj is another decomposition of p, then
[TABLE]
For a,b∈V(Γ), set
(i)
La,b(Γ)=∪{w(p):p∈P(a,b)},
(ii)
La(Γ)=∪{w(p):p\mboxisawalkinΓ\mboxstartingata}, and
(iii)
Lb(Γ)=∪{w(p):p\mboxisawalkinΓ\mboxendingatb}.
The following result relates these three sets and it is an obvious consequence of the strong connectedness of Γ.
Lemma 4.1**.**
For a,b∈V(Γ),
(i)
La(Γ)* is the set of all prefixes of the words from La,b(Γ);*
(ii)
Lb(Γ)* is the set of all suffixes of the words from La,b(Γ).*
A homomorphismφ:Γ→Γ′ between two liw-graphs Γ and Γ′ is a pair (φV,φE) of functions, φV:V(Γ)→V(Γ′) and φE:E(Γ)→E(Γ′), such that (a,b)φE=(aφV,bφV) and (a,x,b)φE=(aφV,x,bφV). In other words, a homomorphism between liw-graphs is a mapping φV on the vertices that preserves line incidence and arrow incidence, orientation and labeling. Thus φV must send left vertices into left vertices and right vertices into right vertices because each vertex of Γ is the endpoint of some arrow. We will use φ for denoting both mappings φV and φE when no ambiguity occurs.
The homomorphism φ is called a monomorphism if φV is one-to-one, an epimorphism if φV is onto, an E-surjective epimorphism if both φV and φE are onto, and an isomorphism if it is a monomorphism and an E-surjective epimorphism. Note that φE is one-to-one if φ is a monomorphism. Thus both φV and φE are bijections if φ is an isomorphism. Further, observe that φ−1=(φV−1,φE−1) is an isomorphism (the inverse isomorphism) from Γ′ to Γ if φ is an isomorphism. Two liw-graphs are isomorphic if there exists an isomorphism from one of them to the other.
Let φ:Γ→Γ′ be an liw-graph homomorphism. Since φ preserves line incidence and arrow incidence and orientation, if p is a walk in Γ, then pφ is a walk in Γ′. Since φ preserves also the labels of the arrows, the following lemma is obvious:
Lemma 4.2**.**
Let φ:Γ→Γ′ be an liw-graph homomorphism, p be a walk in Γ and a∈V(Γ). Then c(a)⊆c(aφ) and w(p)⊆w(pφ).
Let η be an equivalence relation on the vertices of an liw-graph Γ that separates left from right vertices, that is, s(a)=s(b) for any (a,b)∈η. The quotient is the graph Γ/η with vertices V(Γ/η)=V(Γ)/η, lines
[TABLE]
and arrows
[TABLE]
The graph Γ/η is clearly an liw-graph. If φV:V(Γ)→V(Γ/η) is the mapping defined by aφV=aη and φE:E(Γ)→E(Γ/η) is the mapping defined by (a,b)φE=(aη,bη) and (a,x,b)φE=(aη,x,bη), then φ=(φV,φE) is an E-surjective epimorphism. We call φ the natural homomorphism from Γ onto Γ/η.
Conversely, if φ=(φV,φE) is an E-surjective epimorphism from Γ to Γ′ and η is the equivalence relation kerφV on V(Γ), then φV′:V(Γ/η)→V(Γ′) defined by (aη)φV′=aφV and φE′:E(Γ/η)→E(Γ′) defined by (aη,bη)φE′=(a,b)φE and by (aη,x,bη)φE′=(a,x,b)φE are well-defined bijections and φ′=(φV′,φE′) is an isomorphism from Γ/η onto Γ′.
If p is a walk in the liw-graph Γ, let pη be the corresponding path in the quotient liw-graph Γ/η. In face of the previous observations, the following lemma is a particular instance of the last lemma:
Lemma 4.3**.**
Let Γ/η be the quotient of an liw-graph Γ under the equivalence relation η on V(Γ) that separates left from right vertices, and let p be a walk in Γ. Then w(p)⊆w(pη).
An liw-subgraph of an liw-graph Γ is another liw-graph Γ1 such that V(Γ1)⊆V(Γ) and E(Γ1)⊆E(Γ). Thus if a∈V(Γ1) then cΓ1(a)⊆cΓ(a). The next lemma is also obvious:
Lemma 4.4**.**
Let Γ1 be an liw-subgraph of the liw-graph Γ and let p be a walk in Γ1. Then wΓ1(p)⊆wΓ(p).
A birooted locally inverse word graph (‘bliw-graph’ for short) is a triple A=(a,Γ,b) where Γ is an liw-graph, a∈Vl(Γ) and b∈Vr(Γ). The vertices a and b are called the roots of A, a is its left root while b is its right root. We denote by l(A) and r(A) the left and right roots of A respectively.
When depicting a bliw-graph, we identify the left and right roots by a double circle or the symbol
∙
. Note that there is no ambiguity in using the same representation for both left and right roots since the arrows will clarify which one is the left root and which one is the right root. If Γ is the liw-graph of Figure 4, then (α3,Γ,β2) is illustrated in Figure 5.
The language recognized by the bliw-graph A=(a,Γ,b) is the subset
[TABLE]
of X+. Note that ι∈w(p) for any p∈P(a,b) because a is a left vertex, b is a right vertex, and any a−b walk p contains left elementary subpaths.
Lemma 4.5**.**
If A=(a,Γ,b) and A′=(a′,Γ′,b′) are two bliw-graphs such that L(A)⊆L(A′), then La(Γ)⊆La′(Γ′) and Lb(Γ)⊆Lb′(Γ′).
Proof.
This lemma is an obvious consequence of Lemma 4.1.
∎
A homomorphism φ:A→A′ from a bliw-graph A=(a,Γ,b) to a bliw-graph A′=(a′,Γ′,b′) is an liw-graph homomorphism φ:Γ→Γ′ that preserves the roots, that is, aφ=a′ and bφ=b′. If φ preserves only the left root [only the right root, no roots], then we say that φ is a left [right, weak] homomorphism between two bliw-graphs. The notions of [left, right, weak] monomorphim, epimorphism, E-surjective epimorphism and isomorphism between bliw-graphs are now the expected ones. Thus, two bliw-graphs A and A′ are [left, right, weakly] isomorphic if there exists a [left, right, weak] isomorphism φ:A→A′. The quotient of a bliw-graph A=(a,Γ,b) under an equivalence relation η on V(Γ) that separates left from right vertices is the bliw-graph A/η=(aη,Γ/η,bη). A bliw-subgraph of A=(a,Γ,b) is another bliw-graph A1=(a,Γ1,b) where Γ1 is an liw-subgraph of Γ. The next result is a trivial consequence of Lemmas 4.2, 4.3 and 4.4.
Proposition 4.6**.**
Let φ:A→A′ be a homomorphism between two bliw-graphs A=(a,Γ,b) and A′=(a′,Γ′,b′). Let η be an equivalence relation on V(Γ) that separates left from right vertices, and let A1=(a,Γ1,b) be a bliw-subgraph of A. Then
[TABLE]
Let A and A′ be two bliw-graphs. If φ:A→A′ is a homomorphism, then L(A)⊆L(A′) as seen in the previous proposition. In general, we cannot guarantee the converse, that is, the existence of a homomorphism φ:A→A′ if L(A)⊆L(A′). In fact, the same is true for Stephen’s theory for inverse word graphs. However, in Stephen’s theory, if Δ and Δ′ are ‘reduced’ inverse word graphs, then the homomorphism φ:Δ→Δ′ exists if L(Δ)⊆L(Δ′) (see [17, Theorem 2.5]). It is natural to ask now if the same occurs for ‘reduced’ bliw-graphs. In the next section we will see that this question has a positive answer.
5. Reduction of bliw-graphs
In this section, we introduce the reduced bliw-graphs. We prove that the inclusion L(A)⊆L(A′) between reduced bliw-graphs A and A′, together with another condition, is sufficient to guarantee the existence of a homomorphism φ:A→A′ (Proposition 5.5). Fortunately, in Section 6, Lemma 6.4, we will see that this other condition is itself a consequence of the inclusion L(A)⊆L(A′) for the cases we are interested in: reduced bliw-graphs associated with a given locally inverse semigroup. Here, we introduce also two reduction operations to transform bliw-graphs. We then prove that each bliw-graph can be reduced into a unique reduced bliw-graph using these two operations (Proposition 5.6).
Let Γ be an liw-graph. A basic path in Γ is a path q:=a0e1a1e2a2 of length 2 with one arrow. Then q is either a left basic path or a right basic path depending on whether a0 is a left or right vertex, respectively. Thus, e1∈E(Γ) and e2∈E(Γ) if q is a right basic path, and e1∈E(Γ) and e2∈E(Γ) if q is a left basic path. Two right [left] basic paths are equivalent if they have the same starting [ending] vertex and their arrows have the same label. Then Γ is called deterministic [injective] if no two right [left] basic paths are equivalent. A particular consequence of being deterministic [injective] is that no two arrows starting [ending] at a have the same label. A reduced locally inverse word graph (rliw-graph for short) is a deterministic and injective liw-graph.
Obviously, a bliw-graph A=(a,Γ,b) is called reduced [deterministic, injective] if Γ is reduced [deterministic, injective]. We will write rbliw-graph as a short designation for reduced bliw-graph. The importance and usefulness of rliw-graphs and rbliw-graphs will be revealed during this paper. Our first result about them is the following:
Lemma 5.1**.**
Let Γ be an rliw-graph and let a∈V(Γ). If w∈La(Γ)[w∈La(Γ)], then there is unique b∈Vr(Γ)[b∈Vl(Γ)] and a unique a−b[b−a] walk p such that w∈w(p).
Proof.
We prove only for the La(Γ) case since the La(Γ) case is its dual. Let w∈La(Γ) and z=λ^w. Let p and p′ be two walks in Γ, both starting at a and ending at right vertices, such that w∈w(p)∩w(p′). We just need to prove that p=p′. The uniqueness of b is then a trivial consequence. We assume that p=p′ with the intention of getting a contradiction. Without loss of generality, we can assume further that the initial elementary subpaths ae1a1 and ae1′a1′ of p and p′, respectively, have e1=e1′.
Assume first that z=x∈X. If a is a right vertex, then the initial subwalks of p and p′ of length 2 must be equivalent right basic paths, a contradiction since Γ is reduced. If a is a left vertex, then e1 and e1′ are both arrows labeled by x with the same starting vertex, also a contradiction.
Assume now that z=x∧y∈X. If a is a left vertex, then a1=a1′ and y∈c(a1)∩c(a1′). Thus there are two arrows e0=(a0,y,a1) and e0′=(a0′,y,a1′) in Γ for some a0,a0′∈Vl(Γ); whence a0e0a1e1a and a0′e0′a1′e1′a are two distinct equivalent left basic paths in Γ, once again a contradiction. If a is a right vertex, then a1 and a1′ are two distinct left vertices with x∈c(a1)∩c(a1′). Thus there are two arrows e0=(a1,x,a0) and e0′=(a1′,x,a0′) in Γ for some a0,a0′∈Vr(Γ). Once more we get a contradiction because ae1a1e0a0 and ae1′a1′e0′a0′ are two distinct equivalent right basic paths in Γ. Therefore p=p′ and we have proved this lemma.
∎
Corollary 5.2**.**
Let Γ and Γ′ be two liw-graphs such that Γ′ is reduced. If φ:Γ→Γ′ is a homomorphism, then φ is completely determined by the image of a vertex. In particular, there is at most one homomorphism φ:Γ→Γ′ such that aφ=a′ for a∈V(Γ) and a′∈V(Γ′).
Proof.
Let φ:Γ→Γ′ be a homomorphism and choose a∈V(Γ). Let b∈Vr(Γ) and w∈La,b(Γ). Then w∈La′,bφ(Γ′) for a′=aφ by Lemma 4.2. However, by Lemma 5.1, there exists a unique b′∈Vr(Γ′) such that w∈La′,b′(Γ′). Hence, there is only one option for bφ, namely b′. We have shown that the image of a vertex automatically determines the image of all right vertices. Similarly, choosing w∈Lb,a(Γ) for any b∈Vl(Γ), we conclude that the image of a determines the image of all left vertices.
The second part of this corollary is an obvious consequence of the first.
∎
The next two lemmas contain technical details needed to prove Proposition 5.5.
Lemma 5.3**.**
Let Γ and Γ′ be two liw-graphs such that Γ′ is reduced. Let a,b∈V(Γ) and a′,b′∈V(Γ′) such that s(a)=s(a′), s(b)=s(b′), and La,b(Γ)⊆La′,b′(Γ′). For each e∈E(Γ), there exists a unique e′∈E(Γ′) such that ℓ(e)=ℓ(e′), La,l(e)(Γ)⊆La′,l(e′)(Γ′) and Lr(e),b(Γ)⊆Lr(e′),b′(Γ′).
Proof.
Let x=ℓ(e), w1∈La,l(e)(Γ) and w2∈Lr(e),b(Γ). Then
[TABLE]
and there exists p′∈PΓ′(a′,b′) such that w∈w(p′). Then p′ has a decomposition p1′,p3′,p2′ such that w1∈w(p1′), w2∈w(p2′) and p3′ is an arrow elementary path with an arrow f′∈E(Γ′) labeled by x.
By Lemma 5.1, p1′p3′ is the only path of Γ′ starting at a′ and ending at a right vertex labeled by w1x, while p3′p2′ is the only path of Γ′ starting at a left vertex and ending at b′ labeled by xw2. Hence, f′ is the only arrow of Γ′ such that ℓ(f′)=x, w1∈La′,l(f′)(Γ′) and w2∈Lr(f′),b′(Γ′). We have shown that if the arrow e′ announced in the statement of this lemma exists, then it must be unique and equal to f′.
Let us prove now that La,l(e)(Γ)⊆La′,l(f′)(Γ′), and so let u∈La,l(e)(Γ). Again uxw2∈La′,b′(Γ′), and there exists q′∈PΓ′(a′,b′) such that uxw2∈w(q′). By the uniqueness of p3′p2′, the path q′ has a decomposition q1′,p3′,p2′ such that u∈w(q1′). Hence, the final vertex of q1′ is l(f′) and u∈La′,l(f′)(Γ′). We have shown that La,l(e)(Γ)⊆La′,l(f′)(Γ′). We show that Lr(e),b(Γ)⊆Lr(f′),b′(Γ′) similarly.
∎
With the notation introduced in the previous lemma, the language inclusion La,b(Γ)⊆La′,b′(Γ′) induces a (unique) mapping ψ\mathrsfsE:E(Γ)→E(Γ′),e↦e′ that preserves the labels. Without any further comments, we shall always use the notation ψ\mathrsfsE for the mapping from the arrows of Γ to the arrows of Γ′ induced by any such language inclusion. Note however that ψ\mathrsfsE may not preserve incidence, that is, we cannot guaranty that eψ\mathrsfsE and e1ψ\mathrsfsE have a vertex in common if e and e1 are arrows in Γ with a vertex in common (see the example of Figure 7 below). Nevertheless, we can prove a weaker property:
Lemma 5.4**.**
With the notation introduced above and in the previous lemma, let e,e1∈E(Γ). Then:
(i)
If (l(e),r(e1))∈E(Γ), then (l(eψ\mathrsfsE),r(e1ψ\mathrsfsE))∈E(Γ′).
(ii)
If l(e)=l(e1), then (l(eψ\mathrsfsE),b1′),(l(e1ψ\mathrsfsE),b1′)∈E(Γ′) for some b1′∈Vr(Γ′).
(iii)
If r(e)=r(e1), then (a1′,r(eψ\mathrsfsE)),(a1′,r(e1ψ\mathrsfsE))∈E(Γ′) for some a1′∈Vl(Γ′).
Proof.
(i). Let y=ℓ(e1) and choose w∈La,l(e1)(Γ). Then
wy∈La,r(e1)(Γ)⊆La,l(e)(Γ). By Lemma 5.3, w∈La′,l(e1ψ\mathrsfsE)(Γ′) and wy∈La′,l(eψ\mathrsfsE)(Γ′). Hence,
[TABLE]
By Lemma 5.1, there is only one path p′ in Γ′ starting at a′ and ending at a right vertex such that wy∈w(p′). Thus p′∈PΓ′(a′,r(e1ψ\mathrsfsE)). Furthermore, wy∈w(p1′) for some p1′∈PΓ′(a′,l(eψ\mathrsfsE)). Then p1′ is decomposable into p′,p2′, where p2′ is a right elementary path, due to the uniqueness of p′. Hence (l(eψ\mathrsfsE),r(e1ψ\mathrsfsE))∈E(Γ′).
The statements (ii) and (iii) are immediate consequences of (i). For example, to prove (ii), choose another arrow e2 in Γ such that (l(e),r(e2))∈E(Γ) and apply (i) twice, one time for e and e2, and the other time for e1 and e2.
∎
To help understand the statement of Lemma 5.4, we illustrate statement (ii) in Figure 6.
Next, we give a necessary and sufficient conditions for the existence of a homomorphism φ:Γ→Γ′ when Γ′ is reduced. It becomes evident the importance of ψ\mathrsfsE preserving incidence.
Proposition 5.5**.**
Let Γ and Γ′ be two liw-graphs such that Γ′ is reduced. Let a,b∈V(Γ) and a′,b′∈V(Γ′) such that s(a)=s(a′) and s(b)=s(b′). There exists a homomorphism φ:Γ→Γ′ such that aφ=a′ and bφ=b′ if and only if La,b(Γ)⊆La′,b′(Γ′) and the induced mapping ψ\mathrsfsE preserves incidence. Further, the restriction of φE to E is precisely ψ\mathrsfsE.
Proof.
Let φ:Γ→Γ′ be a homomorphism such that aφ=a′ and bφ=b′. Then La1,b1(Γ)⊆La1φ,b1φ(Γ′) for any a1,b1∈V(Γ) by Lemma 4.2. In particular, La,b(Γ)⊆La′,b′(Γ′). Moreover, if e∈E(Γ), then La,l(e)(Γ)⊆La′,l(eφE)(Γ′) and Lr(e),b(Γ)⊆Lr(eφE),b′(Γ′). Thus eφE=eψ\mathrsfsE and ψ\mathrsfsE preserves incidence since it is the restriction of φE to E.
Assume now that La,b(Γ)⊆La′,b′(Γ′) and that the mapping ψ\mathrsfsE preserves incidence. For each arrow e1=(a1,x,b1) of Γ, define a1φV=l(e1ψ\mathrsfsE) and b1φV=r(e1ψ\mathrsfsE). The mapping φV is well defined because ψ\mathrsfsE preserves incidence. Further, e1ψ\mathrsfsE=(a1φV,x,b1φV). Set e1φE=e1ψ\mathrsfsE. If e2=(a2,b2) is a line of Γ, then (a2φV,b2φV) is a line of Γ′ by Lemma 5.4.(i). Set e2φE=(a2φV,b2φV). Clearly, φ=(φV,φE) is now a homomorphism from Γ to Γ′ such that aφ=a′ and bφ=b′ by construction.
∎
The condition of ψ\mathrsfsE preserving incidence cannot be omitted. The Figure 7 has two rliw-graphs Γ and Γ′. Note that La,b(Γ)=La′,b′(Γ′)=Z+ for
[TABLE]
where
[TABLE]
However, there is no homomorphism from Γ to Γ′ since c(a1)={x,y} but no vertex of Γ′ contains both x and y in its content. What fails here for not existing such a homomorphism is the fact that ψ\mathrsfsE does not preserve incidence: observe that (a1,y,b)ψ\mathrsfsE=(a1′,y,b′) and (a1,x,b2)ψ\mathrsfsE=(a0′,x,b2′).
Next, we present a process to transform each bliw-graph A into a unique rbliw-graph B. We begin by introducing two operations on bliw-graphs:
Elementary determination: Let A=(a,Γ,b) be a bliw-graph and let p:=b0e1a1f1b1 and q:=b0e2a2f2b2 be two equivalent right basic paths in Γ. Let η be the equivalence on V(Γ) generated by {(a1,a2),(b1,b2)}. The quotient bliw-graph A/η=(aη,Γ/η,bη) is called an elementary determination of A.
[TABLE]
Elementary injection: Let A=(a,Γ,b) be a bliw-graph and let p:=a1f1b1e1a0 and q:=a2f2b2e2a0 be two equivalent left basic paths in Γ. Let η be the equivalence on V(Γ) generated by {(a1,a2),(b1,b2)}. The quotient bliw-graph A/η=(aη,Γ/η,bη) is called an elementary injection of A.
[TABLE]
We will refer simultaneously to both elementary determinations and elementary injections as elementary reductions. A reduction is a (possibly empty) sequence of elementary reductions. Each time we apply an elementary reduction to a bliw-graph A, the number of vertices decreases. Hence, each reduction is always composed by a finite number of elementary reductions, that is, the elementary reductions have what is commonly called the noetherian property: we cannot apply elementary reductions indefinitely.
Let {p1,q1} and {p2,q2} be two sets of equivalent left and/or right basic paths in Γ, and let A/η1 and A/η2 be the elementary reductions associated with {p1,q1} and {p2,q2}, respectively. Let η=η1∨η2. Note that p2η1 and q2η1 are either equivalent left or right basic paths in A/η1 if η1=η, or p2η1=q2η1 otherwise. Thus either A/η is the elementary reduction of A/η1 associated with the basic paths p2η1 and q2η1, or A/η=A/η1 otherwise. Similarly, either A/η is the elementary reduction of A/η2 associated with the basic paths p1η2 and q1η2, or A/η=A/η2 otherwise. Therefore, the elementary reductions have also the local confluency property, that is, if A1 and A2 are elementary reductions of A, then there exists a bliw-graph A3 such that A3 is a reduction of both A1 and A2.
The next result follows from a general property of noetherian locally confluent systems of rules (see [12]):
Proposition 5.6**.**
If A is a bliw-graph, then there exists a unique rbliw-graph that can be obtained from A by a reduction.
The unique rbliw-graph B that can be obtained from A by a reduction is called the reduced form of A. A complete reduction of A is a sequence of elementary reductions that led to B. In Figure 8 we present a complete reduction for the bliw-graph A=(α3,Γ,β2) of Figure 5. Note that this complete reduction folds the right side of the drawing depicting A over its left side.
Proposition 5.7**.**
Let φ:A→A′ be a homomorphism such that A′ is reduced. Let B be the reduced form of A and let ψ:A→B be the natural E-surjective epimorphism. Then there exists a unique homomorphism φ′:B→A′ such that φ=ψφ′.
Proof.
Note first that if the homomorphism φ′:B→A′ exists, then it must be unique due to Corollary 5.2.
Let p1:=ae1a1f1b1 and p2:=ae2a2f2b2 be two equivalent right basic paths of A such that ℓ(f1)=ℓ(f2)=x, and let A1=A/η be the elementary reduction of A associated with the equivalent right basic paths p1 and p2. Since A′ is reduced, then a1φ=a2φ and b1φ=b2φ. Hence, φ1:A1→A′ defined by (bη)φ1=bφ is a homomorphism too. Further, φ=ψ1φ1 where ψ1 is the natural homomorphism from A to A1.
A similar conclusion can be obtained if p1 and p2 are equivalent left basic paths instead. The proof of this proposition now follows from applying sequentially the previous conclusions to all the elementary reductions of a complete reduction of A.
∎
6. The rliw-graph characterization of a \mathrsfsD-class
From now on, and if nothing is said in contrary, S will denote the locally inverse semigroup LI⟨X;R⟩. Our goal in this section is to construct an rliw-graph Γe for each idempotent e∈E(S) (Proposition 6.1), and then show that e\mathrsfsDf for e,f∈E(S) if and only if Γe and Γf are isomorphic (Proposition 6.9). Hence, these graphs somehow characterize the \mathrsfsD-classes of S. In the path to show that Γe and Γf are isomorphic if and only if e\mathrsfsDf, we describe all isomorphisms from Γe to Γf. We show that these isomorphisms are in a one-to-one correspondence with the elements of Re∩Lf (Proposition 6.6). As a corollary, we conclude that the group of automorphisms of Γe is isomorphic to He (Corollary 6.8).
Let \mathrsfsSl={la:a∈S} and \mathrsfsSr={ra:a∈S}, two disjoint copies of the elements of S. Fix an idempotent e∈S and set
[TABLE]
two disjoint copies of Le and Re, respectively. Let also
[TABLE]
By Lemma 2.1, if a∈Le∩(x∧x′)S for some x∈X, then a has a unique inverse a′ in Re∩S(x∧x′). Further, if a1′ is another inverse of a in Re, then a′=a1′(x∧x′) by Lemma 2.2, and so a′x=a1′x. Let
[TABLE]
Hence, for each a∈Le and x∈X, there is at most one element in \mathrsfsE of the form (la,x,rb) with b∈Re. Let Γe be the bipartite graph Γe=(\mathrsfsV,\mathrsfsE) with vertices \mathrsfsV=\mathrsfsVl∪\mathrsfsVr, partitioned into the left vertices \mathrsfsVl and the right vertices \mathrsfsVr, and edges \mathrsfsE=\mathrsfsE∪\mathrsfsE where \mathrsfsE is the set of lines and \mathrsfsE is the set of arrows.
Recall the semigroups S1 and S2 introduced in Section 3. In Figure 9 we depict Γx′x for the semigroup S1 and Γz′z for the semigroup S2. To make it easier to construct these graphs, we include also in Figure 9 the egg-box picture of the \mathrsfsD-class of x′x in S1 and the egg-box picture of the \mathrsfsD-class of z′z in S2. Observe that these graphs are both reduced liw-graphs. This is not a coincidence as it is proved in the next result.
Proposition 6.1**.**
Γe* is a reduced liw-graph.*
Proof.
Γe is clearly an oriented bipartite graph. Let a∈Le and x∈X such that a∈(x∧x′)S. Then (la,x,ra′x)∈\mathrsfsE for a′∈V(a)∩Re, and x∈c(la). If b∈Re∩S(y′∧y) for some y∈X, then let a be the unique inverse of by′ in Le∩(y∧y′)S given by Lemma 2.1. Note that (la,y,rb)∈\mathrsfsE and y∈c(rb). Assume now that (la,x,rb)∈\mathrsfsE and let a′ be the unique inverse of a in Re∩S(x∧x′). Then (la,ra′)∈\mathrsfsE and b=a′x. Further, (lx′a,rb)∈\mathrsfsE and (lx′a,x′,ra′)∈\mathrsfsE because x′a∈Le∩V(b) and a′=bx′. Thus, both conditions (ii) and (iii) of the definition of liw-graph are satisfied.
We need to prove now that Γe is connected to conclude that Γe is an liw-graph. Observe that it is enough to show that re is connected to each right vertex ra of Γe because each left vertex of Γe is connected to some right vertex.
Let u=z1⋯zn, with n≥0 and zi∈X for i=1,⋯,n, such that a=eu (eu=e if n=0). Set ui=z1⋯zi and ai=eui for i=1,⋯,n, and set a0=e. All ai are \mathrsfsR-related with e because a is \mathrsfsR-related with e. We are done once we show that each rai−1 is connected with rai. We need to consider two cases: zi=x∈X and zi=x∧y∈X. In both cases, let ci=ai−1(x∧x′)\mathrsfsRai, let bi be the inverse of ci belonging to Le∩(x∧x′)S and let di∈S such that cidi=ai−1. Observe that bi∈V(ai−1) because
[TABLE]
Hence ei=(lbi,rai−1)∈\mathrsfsE.
Case 1: zi=x∈X. By definition of bi, fi=(lbi,x,rai)∈\mathrsfsE and rai−1 connects to rai by the right basic path pi=rai−1eilbifirai.
Case 2: zi=x∧y∈X. By Corollary 3.3.(iii), φx∧y:Lci→Lai is a right translation with inverse right translation φx∧x′:Lai→Lci. Hence ci=ai(x∧x′). We can now easily conclude that bi∈V(ai):
[TABLE]
Thus fi=(lbi,rai)∈\mathrsfsE and pi=rai−1eilbifirai is a walk of length 2 connecting rai−1 to rai.
Now that we have shown that Γe is an liw-graph, we need to prove that Γe is reduced. Let rbelafra′x and rbe1la1f1ra1′x be two equivalent right basic paths with ℓ(f)=ℓ(f1)=x. Then both a and a1 are \mathrsfsL-related inverses of b belonging to ((x∧x′)μ]r; and both ab and a1b are \mathrsfsL-related idempotents belonging to (x∧x′)S. Thus ab=a1b and a=a1. We have shown that Γe is deterministic.
Let laera′xflb and la1e1ra1′xf1lb be two equivalent left basic paths with ℓ(e)=ℓ(e1)=x. Note that we can choose a′ and a1′ both in S(x∧x′). Then a′x and a1′x are \mathrsfsR-related inverses of b in S(x′∧x); and so ba′x and ba1′x are \mathrsfsR-related idempotents in ((x′∧x)μ]l. Thus ba′x=ba1′x, a′x=a1′x and a′=a1′. Hence, aa′ and a1a1′ must be \mathrsfsL-related idempotents in ((x∧x′)μ]r, and consequently aa′=a1a1′ and a=a1. We have shown that Γe is injective, and therefore Γe is a reduced liw-graph.
∎
Let us look more carefully at the proof of the connectivity of Γe since it contains more information than what is stated in the previous proposition. We began by choosing an arbitrary a∈Re and assuming that eu=a for some u=z1⋯zn with n≥0 and zi∈X. Then, we defined a sequence a0=e and ai=ez1⋯zi, for i=1,⋯,n, of elements from Re, and constructed a walk pi in Γe from rai−1 to rai. By construction of pi, observe that zi∈w(pi). Thus, p:=p1⋯pn is a walk in Γe with initial vertex re, final vertex ra, and such that u∈w(p). By Lemma 5.1, p is the unique walk q in Γe starting at re and ending at a right vertex of Γe such that u∈w(q). We can now conclude that, for each a∈Re, if eu=a for some u∈X∗, then there exists a unique path p in Γe starting at re, ending at a right vertex, and such that u∈w(p). Furthermore, p must end at ra. This conclusion is just part of a particular case of the following lemma.
Lemma 6.2**.**
Let a,b∈Re and u∈X∗. Then au=b if and only if u∈Lra,rb(Γe).
Proof.
Assume that au=b and let v∈X∗ such that ev=a. By the conclusion made prior to this lemma, there are two walks p and q starting at re and ending at ra and rb, respectively, such that v∈w(p) and vu∈w(q). By Lemma 5.1, q has a decomposition p,q1. Thus q1 is a walk from ra to rb such that u∈w(q1). We have shown that u∈Lra,rb(Γe).
Conversely, assume that u∈Lra,rb(Γe) and let p be the (unique) ra−rb walk such that u∈w(p). Note that p has even length because it starts and ends at right vertices. Consider the decomposition of p into subwalks, all of length 2, say p1,⋯,pn. Thus w(pi)⊆X for i=1,⋯,n, and u=z1⋯zn with zi∈w(pi). Let a0,a1,⋯,an∈Re such that a0=a and rai is the final vertex of the walk pi for i=1,⋯,n. Then ui=z1⋯zi∈Lra,rai(Γe). Also u0=ι∈Lra,ra(Γe) since it labels the trivial path from ra to itself. We prove next that aui=ai by induction, thus ending the proof of this lemma since an=b and un=u.
Clearly au0=a=a0. So, assume that aui−1=ai−1 and let us prove that aui=ai, or equivalently, that ai−1zi=ai. If zi=y, then pi=rai−1eilbfirai where ai−1∈V(b), b∈Le∩(y∧y′)S and ai=b′y for any b′∈V(b)∩Re. In particular, for b′=ai−1, we get ai=ai−1y as desired. Now, if zi=y∧y1, then pi=rai−1eilbfirai where ai−1,ai∈V(b)∩Re, b∈Le∩(y∧y′)S and ai=S(y1′∧y1). By Lemma 2.2, ai−1(y∧y1)=ai once again as desired.
∎
Let us illustrate Lemma 6.2 by considering the rliw-graph Γx′x of Figure 9c and the elements a=(x′x)μ1∈S1 and b=(x′y′)μ1∈S1. Our plan is to find all u∈X1+ such that au=b. We need to consider four sets of walks first. If P1 is the set of all walks from rx′x to rx′ avoiding crossing the vertex rx′, then
[TABLE]
If P2 is the set of all walks from l(y′∧x′)x to rx′y′ avoiding crossing the vertex l(y′∧x′)x, then
[TABLE]
If P3 is the set of all walks from rx′ to itself avoiding crossing the vertices rx′ and l(y′∧x′)x, then
[TABLE]
If P4 is the set of all walks from l(y′∧x′)x to itself avoiding crossing the vertices rx′ and l(y′∧x′)x, then
There is a right-left dual result corresponding to Lemma 6.2. However, there is a peculiarity in this dual result, the roles of a and b must be switched. For that reason, we include a brief proof of it.
Lemma 6.3**.**
Let a,b∈Le and u∈X∗. Then ua=b if and only if u∈Llb,la(Γe).
Proof.
We prove this lemma only for the case where u∈X. The general case follows similarly to the proof of Lemma 6.2. Assume that xa=b for x∈X. Then e1=(lb,x,rb′x)∈E(Γe) for b′∈V(b)∩Re. Since
[TABLE]
we conclude that e2=(la,rb′x)∈E(Γe). Thus x∈Llb,la(Γe). Conversely, if x∈Llb,la(Γe), then there exists b′∈V(b)∩Re such that b′x∈V(a) and b∈(x∧x′)S. Let c∈S such that b′xc=b′. Note that c exists because b′\mathrsfsRb′x. Then
[TABLE]
We have shown that xa and b are \mathrsfsL-related inverses of b′ belonging to (x∧x′)S; whence b=xa since S is locally inverse.
Assume now that (x∧y)a=b for x,y∈X. Since b∈(x∧y)S, there exists a unique inverse b′ of b in Re such that b′∈S(x∧y). Then e1=(lb,rb′)∈E(Γe). Also b′ab′=b′bb′=b and ab′a=cbb′b=cb=a for some c∈S such that a=cb. Thus e2=(la,rb′)∈E(Γe) and x∧y∈Llb,la(Γe). Conversely, if x∧y∈Llb,la(Γe), then x∈c(lb) and there exists c∈Re such that a,b∈V(c) and y∈c(rc). Now
[TABLE]
and c(x∧y)=c. Hence (x∧y)a∈V(c) because c(x∧y)ac=cac=c and (x∧y)ac(x∧y)a=(x∧y)aca=(x∧y)a. Finally, we conclude that (x∧y)a=b because they are \mathrsfsL-related inverses of c in (x∧x′)S.
∎
We use now the rliw-graph Γz′z of Figure 9d (with respect to the semigroup S2) to illustrate Lemma 6.3. Recall the characterization of uμ2 given in Example 2, and observe also that
[TABLE]
Hence Llz,lz′z2(Γz′z)={u∈X2+:λu=z\mboxandn(u)\mboxodd}. Note that this conclusion is not easy to get directly from the rliw-graph Γzz′.
In Proposition 5.5 we showed that, in general, if Γ′ is an rliw-graph, then there exists an liw-graph homomorphism φ:Γ→Γ′ such that aφ=a′ and bφ=b′, for a,b∈V(Γ) and a′,b′∈V(Γ′) with s(a)=s(a′) and s(b)=s(b′), if and only if La,b(Γ)⊆La′,b′(Γ′) and the associated mapping ψ\mathrsfsE preserves incidence. We saw in Figure 7 that we cannot omit, in general, the condition of ψ\mathrsfsE preserving incidence. However, for the cases we are interested in, the cases where the liw-graphs are associated with a locally inverse semigroup presentation, we will see next that this latter condition is always satisfied.
Lemma 6.4**.**
Let e,f∈E(S), a,b∈V(Γe) and a1,b1∈V(Γf) such that s(a)=s(a1) and s(b)=s(b1). If La,b(Γe)⊆La1,b1(Γf), then the induced mapping ψ\mathrsfsE always preserves incidence.
Proof.
Let e1=(ls,x1,rt1) and e2=(ls,x2,rt2) be two arrows of Γe with the same starting vertex. Then e1ψ\mathrsfsE=(ls1,x1,rt3) and e2ψ\mathrsfsE=(ls2,x2,rt4) for some s1,s2∈Lf and t3,t4∈Rf. By Lemma 5.4.(ii) there exists also a right vertex b∈Vr(Γf) such that (ls1,b),(ls2,b)∈E(Γf). We will prove that s1=s2. By duality, we conclude also that if e1′ and e2′ are two arrows with the same ending vertex, then e1′ψ\mathrsfsE and e2′ψ\mathrsfsE have the same ending vertex too; and this lemma becomes proved.
Let s′∈V(s)∩Re∩S(x1∧x1′) and s1′∈V(s1)∩Rf∩S(x1∧x1′). Note that s′ and s1′ exist because s,s1∈(x1∧x1′)S. Further, ss′s1s1′ is an idempotent since ss′ and s1s1′ belong to the semilattice ((x1∧x1′)μ]. We prove next that ss′s1s1′=s1s1′.
Let a∈Le such that
[TABLE]
Let also u,v∈X+ such that s′=uμ and a=vμ. Then
[TABLE]
where the last inclusion follows from the definition of ψ\mathrsfsE. Note there is a1∈Lf such that vu∈Lla1,ls1(Γf). More precisely, a1=la1 if a1∈Vl(Γf) or a1∈V(c1)∩Lf if a1∈Vr(Γf) and a1=rc1. Then vus1=a1 by Lemma 6.3, and
[TABLE]
Hence ss′s1s1′=s1s1′ since they are \mathrsfsL-related idempotents in the semilattice ((x1∧x1′)μ].
Note that s∈(x2∧x2′)S because (ls,x2,rt2) is an arrow of Γe. Hence s1=ss′s1s1′s1∈(x2∧x2′)S and there is an arrow in Γf starting at ls1 and labeled by x2. Since Γf is reduced, we must have s1=s2 as otherwise we would have two distinct equivalent right basic paths starting at b.
∎
Combining Proposition 5.5 with the previous lemma, we obtain:
Corollary 6.5**.**
Let e,f∈E(S), a,b∈V(Γe) and a1,b1∈V(Γf) such that s(a)=s(a1) and s(b)=s(b1). There exists a homomorphism φ:Γe→Γf such that aφ=a1 and bφ=b1 if and only if La,b(Γe)⊆La1,b1(Γf).
In Figure 10 we include again the rliw-graph Γx′x of Figure 9c and also the rliw-graph Γy′, both with respect to the semigroup S1. We order the vertices in Γy′ so that it becomes evident that the two rliw-graphs are isomorphic.
This fact is not a coincidence. Next, we show that the rliw-graph Γe is an invariant of the \mathrsfsD-class De. In other words, we show that if f∈De∩E(S), then Γe and Γf are always isomorphic.
Proposition 6.6**.**
Let e,f∈E(S) such that e\mathrsfsDf. Then Γe and Γf are isomorphic. More precisely, for each a∈Re∩Lf, there exists a unique isomorphism φ:Γe→Γf such that leφ=la, and all isomorphisms from Γe to Γf are of this form.
Proof.
Let a∈Re∩Lf and let a′ be the inverse of a belonging to Le∩Rf. Observe that se=a′ if and only if sa=f for any s∈S. Thus Llf,la(Γf)=Lla′,le(Γe) by Lemma 6.3. By the previous corollary, there are two homomorphisms φ:Γe→Γf and φ′:Γf→Γe such that leφ=la and laφ′=le. Thus φ:Γe→Γf is an isomorphism with inverse isomorphism φ′ due to Corollary 5.2. Further, φ is the only isomorphism from Γe to Γf such that leφ=la.
Finally, we must show there are no other isomorphisms from Γe to Γf. So, let φ:Γe→Γf be an isomorphism such that leφ=lb and reφ=rc for b∈Lf and c∈Rf. Then Lre,le(Γe)=Lrc,lb(Γf), and c∈V(b) because ι∈Lre,le(Γe). Let u,v∈X∗ such that uμ=e and vμ=bc. Then
[TABLE]
by Lemma 6.3. Since Lle,le(Γe)=Llb,lb(Γf), and again by Lemma 6.3, we conclude that eb=ub=b and bce=ve=e. Thus b∈Re∩Lf as wanted.
∎
The next result describes in more detail the isomorphisms of the previous proposition.
Proposition 6.7**.**
Let a∈S, a′∈V(a), e=aa′ and f=a′a, and let φa be the isomorphism from Γe to Γf such that leφa=la whose existence is guaranteed by the previous proposition. Then lsφa=lsa for any s∈Le and rtφa=ra′t for any t∈Re. In particular, reφa=ra′.
Proof.
Let s∈Le and u∈X+ such that uμ=s. Then ue=s and u∈Lls,le(Γe). So, u∈Lls1,la(Γf) for ls1=lsφa, and s1=ua=sa. The proof of rtφa=ra′t for t∈Re is similar once we show that reφa=ra′. Let reφa=rc for some c∈Rf. Then c∈V(a) because ι∈Lre,le(Γe)=Lrc,la(Γf). If u1,u2∈X+ are such that u1μ=e and u2μ=ac, then
[TABLE]
by Lemma 6.2. Since Lre,re(Γe)=Lrc,rc(Γf), we have
[TABLE]
Hence c=a′ because c∈V(a)∩Le∩Rf.
∎
Observe that the isomorphism φa is just the combination of both the right translation of Le associated with a and the left translation of Re associated with a′.
An automorphism of an liw-graph Γ is an isomorphism from Γ into itself. Let Aut(Γ) be the group of automorphisms of Γ.
Corollary 6.8**.**
Let e∈E(S). Then He and Aut(Γe) are isomorphic groups. Further, for b,b1∈Le and c,c1∈Re, there exists φ∈Aut(Γe) such that
(i)
lbφ=lb1* if and only if b\mathrsfsHb1;*
(ii)
rcφ=rc1* if and only if c\mathrsfsHc1;*
(iii)
lbφ=lb1* and rcφ=rc1 if and only if bc=b1c1.*
Proof.
For each a∈He, let φa be the automorphism of Γe such that leφa=la given by Proposition 6.6. Then the mapping a→φa is a bijection from He to Aut(Γe) also by Proposition 6.6. Clearly φa1φa2=φa1a2 for a1,a2∈He by the previous proposition. Hence, the mapping a→φa from He to Aut(Γe) is a group isomorphism.
Let b,b1∈Le. Then b\mathrsfsHb1 if and only if there exists some a∈He such that ba=b1, that is, if and only if there exists some φa∈Aut(Γe) such that lbφa=lb1. We have proved (i) and note that (ii) is the dual of (i). Let us prove (iii) now.
Suppose first that lbφa=lb1 and rcφa=rc1 for some a∈He. Then b1=ba and c1=a−1c for a−1 the inverse of a in the group He. Hence b1c1=baa−1c=bec=bc. Suppose now that b1c1=bc. Since b,b1∈Le and c,c1∈Re, we must have b\mathrsfsHb1 and c\mathrsfsHc1. Thus, there are a,a1∈He such that b1=ba and c1=a1c. Let s,s1∈S such that sb=e and cs1=e. Then
[TABLE]
and a1=a−1, the inverse of a in He. Therefore lbφa=lb1 and rcφa=rc1. We have proved (iii).
∎
The conclusions of Corollary 6.8 are corroborated by the two examples we are using. Note that S1 is an aperiodic semigroup (see Figure 1) and only the identity mapping is an automorphism of the rliw-graph Γx′x of Figure 9c. Now, about S2, the group Hz′z is isomorphic to Z2. If we look carefully to the rliw-graph Γz′z of Figure 9d, we see there are two automorphisms of Γz′z: the identity mapping and another automorphism that sends lz into lz2. This latter automorphism permutes the upper part of Γz′z with its lower part.
We already know that the rliw-graphs Γe are an invariant of the \mathrsfsD-classes of S. The next result tells us even more. It shows us that two distinct \mathrsfsD-classes of S have non-isomorphic rliw-graphs Γe. Thus, the graphs Γe completely characterize and distinguish the \mathrsfsD-classes of S.
Proposition 6.9**.**
Let e,f∈E(S). Then e\mathrsfsDf if and only if Γe and Γf are isomorphic.
Proof.
By Proposition 6.6 we need to show only that e\mathrsfsDf if φ:Γe→Γf is an isomorphism. Let a\mathrsfsLe and b\mathrsfsLf such that leφ=lb and laφ=lf. If u,v∈X+ are such that uμ=a and vμ=b, then
[TABLE]
Thus ab=ub=f and ba=va=e by Lemma 6.3, and consequently
[TABLE]
Hence b∈V(a) and e=ba\mathrsfsDab=f as wanted.
∎
7. The rbliw-graph of an element with respect to a presentation
In this section, we associate an rbliw-graph As=(a,Γ,b) to each element s of S. Of course, the rliw-graph Γ will be one of the graphs Γe, with e\mathrsfsDs, discussed in the previous section. We then go into the description of the major concepts, such as the idempotents, the inverses of an element, the Green’s relations, and the natural partial order, in terms of these rbliw-graphs. We also analyze how the semigroup product and the sandwich operation ∧ on S translate into operations on these rbliw-graphs.
Before defining As, let us prove first the following result, which is crucial to guarantee that As is well defined.
Proposition 7.1**.**
Let e,f∈E(S) and s,t,s1,t1∈S such that s\mathrsfsLe\mathrsfsRt and s1\mathrsfsLf\mathrsfsRt1. Then A=(ls,Γe,rt) and A1=(ls1,Γf,rt1) are isomorphic if and only if e\mathrsfsDf and st=s1t1.
Proof.
Assume first that φ:A→A1 is an isomorphism. Then φ:Γe→Γf is an rliw-graph isomorphism such that lsφ=ls1 and rtφ=rt1. Thus e\mathrsfsDf by Proposition 6.9. By Proposition 6.7, there are a∈Re∩Lf and a′∈V(a)∩Le∩Rf such that lbφ=lba for any b∈Le and rb1φ=ra′b1 for any b1∈Re. In particular, s1=sa and t1=a′t. Hence s1t1=saa′t=set=st.
Assume now e\mathrsfsDf and st=s1t1. Then s\mathrsfsRs1 and t\mathrsfsLt1. Let a∈Re∩Lf such that sa=s1 and consider the isomorphism φa:Γe→Γf given by Proposition 6.6. Then lsφa=ls1 by Proposition 6.7. Let a′ be the inverse of a in Le∩Rf. Then a′t\mathrsfsHt1 and s1a′t=saa′t=st=s1t1. Hence t1=a′t and rtφa=rt1 again by Proposition 6.7. We have shown that φa is an rbliw-graph isomorphism from A to A1.
∎
For each s∈S, choose e∈Ds, a∈Le and b∈Re such that s=ab. Define As=(la,Γe,rb). The previous proposition tells us that the definition of As is, up to isomorphism, independent of the choice of e, a and b, that is, if we choose different f∈E(S), a1∈Lf and b1∈Rf such that a1b1=s, then (la,Γe,rb) and (la1,Γf,rb1) are isomorphic. Further, the previous proposition also tells us that As and At are non-isomorphic if s=t.
Corollary 7.2**.**
The following conditions are equivalent for s,t∈S:
(i)
s=t;
(ii)
As* and At are isomorphic;*
(iii)
L(As)=L(At).
Proof.
(i) and (ii) are equivalent as observed above, and (ii) implies (iii) obviously. From Corollary 6.5 it is also immediate that (iii) implies (ii).
∎
We will work with the rbliw-graphs As up to isomorphism and we will never be stuck to a particular representation (la,Γe,rb) for As. In every particular situation we will choose a representation for As that best fits our purposes. Usually, but not always, if e∈E(S), then we choose the representation (le,Γe,re) for Ae; and if s\mathrsfsRe, then we choose the representation (le,Γe,rs) for As.
Next, we characterize the Green’s relations on S using the rbliw-graphs As.
Proposition 7.3**.**
If s,t∈S, then:
(i)
s\mathrsfsRt* if and only if As and At are left isomorphic.*
(ii)
s\mathrsfsLt* if and only if As and At are right isomorphic.*
(iii)
s\mathrsfsHt* if and only if As and At are left and right isomorphic.*
(iv)
s\mathrsfsDt* if and only if As and At are weakly isomorphic.*
(v)
s\mathrsfsJt* if and only if there exist weak homomorphisms φ:As→At and ψ:At→As.*
Proof.
(ii) is the dual of (i), (iii) follows from (i) and (ii) together, and (iv) follows from Proposition 6.9. Next, we prove (i). So, let s\mathrsfsRt and let e∈Rs∩E(S). Then As=(le,Γe,rs) and At=(le,Γe,rt), and As and At are clearly left isomorphic. Conversely, let φ:As→At be a left isomorphism and let e∈Rs∩E(S) and f∈Rt∩E(S). Then As=(le,Γe,rs) and At=(lf,Γf,rt). Note that φ:As→(lf,Γf,rt1) is an isomorphism for t1∈Rt such that rsφ=rt1. By proposition 7.1 we must have s=es=ft1=t1\mathrsfsRt.
Finally, let us prove (v). We start by assuming there are weak homomorphisms φ:As→At and ψ:At→As. Let e∈E(S)∩Rs, f∈E(S)∩Rt and set
[TABLE]
Let a,b∈Rf such that ra=reφ and rb=rsφ. Consider also u∈X+ such that uμ=s. Then u∈Lre,rs(Γe)⊆Lra,rb(Γf). If u1∈Lrf,ra(Γf) and u2∈Lrb,rt(Γf), then u1uu2∈Lrf,rt(Γf) and
[TABLE]
Thus t∈SsS. Using ψ now, we conclude by symmetry that s∈StS, and consequently t\mathrsfsJs.
Assume now that s\mathrsfsJt, and let e∈E(S)∩Rs and f∈E(S)∩Rt. Thus t=t1st2 for some t1,t2∈S. Further, we can assume that t1\mathrsfsRt, and so t\mathrsfsRt1s\mathrsfsRt1e. If u∈Lre,rs(Γe), then t1eu=t1s. Hence
[TABLE]
and there is a homomorphism φ:Γe→Γf such that reφ=rt1e and rsφ=rt1s. Note now that φ is a weak homomorphism from As=(le,Γe,rs) to At=(lf,Γf,rt). By symmetry, there exists also a weak homomorphism ψ:At→As.
∎
The next result is now a trivial consequence of the previous proposition using Corollary 6.5.
Corollary 7.4**.**
Let As=(a,Γ,b) and At=(a1,Γ1,b1) for s,t∈S. Then:
(i)
s\mathrsfsRt* if and only if La,a(Γ)=La1,a1(Γ1).*
(ii)
s\mathrsfsLt* if and only if Lb,b(Γ)=Lb1,b1(Γ1).*
(iii)
s\mathrsfsHt* if and only if La,a(Γ)=La1,a1(Γ1) and Lb,b(Γ)=Lb1,b1(Γ1).*
(iv)
s\mathrsfsDt* if and only if there is a′∈Vl(Γ) such that La′,a′(Γ)=La1,a1(Γ1).*
(v)
s\mathrsfsJt* if and only if there are a′∈Vl(Γ) and a1′∈Vl(Γ1) such that La′,a′(Γ)⊆La1,a1(Γ1) and La1′,a1′(Γ1)⊆La,a(Γ).*
The idempotents and the inverses of elements of S can also be characterized using the rbliw-graphs As:
Proposition 7.5**.**
Let s,t∈S. Then:
(i)
s∈E(S)* if and only if (l(As),r(As))∈E(As), and if and only if x∧y∈L(As) for some x,y∈X.*
(ii)
t∈V(s)* if and only if there is a weak isomorphism φ:As→At such that (l(As)φ,r(At)) and (l(At),r(As)φ) are edges of At.*
Proof.
(i). If s=e∈E(S), then As=(le,Γe,re) and (le,re) is an edge of Γe by construction of Γe and since e is an inverse of itself. Conversely, let (l(As),r(As)) be an edge of As, and let e∈E(S)∩Rs. Then As=(le,Γe,rs), and e is an inverse of s since (le,rs) is an edge of Γe. Hence s2=ses=s and s∈E(S). It is obvious from the definition of w(⋅) that (l(As),r(As))∈E(As) if and only if x∧y∈L(As) for some x,y∈X, namely x∈c(l(As)) and y∈c(r(As)).
(ii). Let t∈V(s). Then e=st and f=ts are idempotents and
[TABLE]
Further (le,re) and (lt,rs) are edges of Γe because e and f are idempotents respectively. If φ is the identity automorphism of Γe, then φ:As→At is a weak isomorphism such that (l(As)φ,r(At)) and (l(At),r(As)φ) are edges of Γe, as desired.
Conversely, let φ:As→At be a weak isomorphism such that
[TABLE]
Choose e∈E(S)∩Rt and set At=(le,Γe,rt). Let a∈Le and b∈Re such that la=l(As)φ and rb=r(As)φ. Then φ:As→(la,Γe,rb) is an isomorphism, and s=ab by Corollary 7.2. Note that
[TABLE]
By hypothesis, (la,rt)∈E(Aat) and (le,rb)∈E(Ab), and so at,b∈E(S) by (i). Further
[TABLE]
whence t∈V(s).
∎
Let us look now to the relations ω, ωr and ωl on E(S).
Proposition 7.6**.**
The following conditions are equivalent for e,f∈E(S):
We prove this result only for the ωr case since the ωl case is the dual. Further, the equivalence between (ii) and (iii) follows from Corollary 6.5. If Lle,le(Γe)⊆Llf,lf(Γf) and uμ=e for some u∈X+, then u∈Llf,lf(Γf) and ef=uf=f. If fωre, then vf=f whenever ve=e for v∈X∗, and Lle,le(Γe)⊆Llf,lf(Γf). Thus (i) and (iii) are equivalent.
∎
Corollary 7.7**.**
The following conditions are equivalent for e,f∈E(S):
(i)
fωe;
(ii)
There is a homomorphism φ:Ae→Af;
(iii)
Lle,re(Γe)⊆Llf,rf(Γf).
Proof.
Once again, (ii) and (iii) are equivalent due to Corollary 6.5. Also (ii) implies (i) by Proposition 7.6, using both ωr and ωl. Assume fωe and let φ:Γe→Γf be the homomorphism such that leφ=lf (Proposition 7.6 again). Let b∈Rf and x,y∈X such that reφ=rb and
[TABLE]
Then x∧y′∈Lle,re(Γe)⊆Llf,rb(Γf). Since f(x∧y′)=fe(x∧y′)=f, we must have b=f as otherwise Γf would not be injective (y′∈c(rb)∩c(rf) and (lf,rb) and (lf,rf) are two edges of Γf). Hence reφ=rf as wanted.
∎
Now that we have a characterization of the relations ωr, ωl and ω on E(S), let us describe the natural partial order and the quasiorders ≤\mathrsfsR, ≤\mathrsfsL, ≤\mathrsfsH and ≤\mathrsfsJ on S using the rbliw-graphs As.
Proposition 7.8**.**
If s,t∈S, then:
(i)
t≤s* if and only if there is a homomorphism φ:As→At.*
(ii)
t≤\mathrsfsRs* if and only if there is a left homomorphism φ:As→At.*
(iii)
t≤\mathrsfsLs* if and only if there is a right homomorphism φ:As→At.*
(iv)
t≤\mathrsfsHs* if and only if there are a left homomorphism φ:As→At and a right homomorphism φ′:As→At.*
(v)
t≤\mathrsfsJs* if and only if there is a weak homomorphism φ:As→At.*
Proof.
(i). Assume first that t≤s and let e∈Rs∩E(S). It is well known that there exists an f∈(e]∩Rt such that fs=t. Then
[TABLE]
and, by Corollary 7.7, there is a homomorphism φ:(le,Γe,re)→(lf,Γf,rf). Let t1∈Rf such that rsφ=rt1 and let u∈X+ such that uμ=s. Then
[TABLE]
and t1=fu=fs=t. Hence, φ is also a homomorphism from As to At.
Assume now that φ:As→At is a homomorphism. Let e∈Rs∩E(S) and f∈Rt∩E(S). Then As=(le,Γe,rs) and At=(lf,Γf,rt), and so leφ=lf and rsφ=rt. Let g∈Rf such that reφ=rg. Then φ is a homomorphism from Ae=(le,Γe,re) to Ag=(lf,Γf,rg), and g∈E(S) since (lf,rg)=(le,re)φE∈E(Γf). If uμ=s for some u∈X+, then u∈Lre,rs(Γe)⊆Lrg,rt(Γf) and gs=gu=t. Similarly, there is a g1∈E(S)∩Lt such that sg1=t. Hence t≤s.
(ii) follows from (i) and Proposition 7.3.(i) using the following observation:
[TABLE]
(iii) is the dual of (ii), and (iv) is just (ii) and (iii) put together. If we look carefully to the proof of Proposition 7.3.(v), we realize that we have proved, in fact, the statement (v) of the present result (and used it for both s≤\mathrsfsJt and t≤\mathrsfsJs).
∎
Once more, due to Corollary 6.5, the following result is trivial.
Corollary 7.9**.**
Let As=(a,Γ,b) and At=(a1,Γ1,b1) for s,t∈S. Then:
(i)
t≤s* if and only if L(As)⊆L(At).*
(ii)
t≤\mathrsfsRs* if and only if La,a(Γ)⊆La1,a1(Γ1).*
(iii)
t≤\mathrsfsLs* if and only if Lb,b(Γ)⊆Lb1,b1(Γ1).*
(iv)
t≤\mathrsfsHs* if and only if La,a(Γ)⊆La1,a1(Γ1) and Lb,b(Γ)⊆Lb1,b1(Γ1).*
(v)
t≤\mathrsfsJs* if and only if there is a1′∈Vl(Γ1) such that La,a(Γ)⊆La1′,a1′(Γ1).*
Before we continue, let us see how the theory developed so far applies to an example, the example of the four-spiral semigroup Sp4.
Example of the four-spiral semigroup: As observed in Example 3, the four-spiral semigroup Sp4 is given by the presentation
[TABLE]
We begin constructing the rliw-graph Γx′x. For that purpose, we represent the (unique) \mathrsfsD-class of Sp4 in Figure 11a, indicating also the elements of Rx′x and of Lx′x. We abbreviate and write only z for the element x′(x∧x). An inspection of this figure immediately tells us that V(xi)={zi,zi−1x′} and V(x′xi+1)={zi,zix′} for i∈N, where z0 is the empty word, and V(x′x)={x′x,x′}. Thus E(Γx′x) is the set
[TABLE]
Further, since zx=x′x and zi+1x=zi for i∈N, then E(Γx′x) is the set
Each of the left vertices la of Γx′x represents one of the \mathrsfsR-classes of Sp4, namely the \mathrsfsR-class Ra, while each of the right vertices rb of Γx′x represents one of the \mathrsfsL-classes of Sp4, namely the \mathrsfsL-class Lb. Note that only the identity mapping is an automorphism of Γx′x since rx′x is the only vertex of degree 2 (number of edges). This observation corroborates the fact that the \mathrsfsH-classes of Sp4 are trivial.
The lines of Γx′x also form an infinite descending ‘zigzag’ path starting at rx′x and passing through all the vertices. This reflects the fact that we can reorder the rows and the columns of the egg-box picture of Sp4 so that the idempotents form an infinite descending ‘stair’ (see Figure 11c).
Although Γx′x has no non-trivial automorphism, it has plenty of endomorphisms. Note that Γx′x is an infinite descending chain of copies of the ‘block’ depicted in Figure 11d. The endomorphisms of Γx′x are then obtained by ‘sliding down’ these blocks. Thus, the set of endomorphisms of Γx′x, with the usual composition of mappings, is isomorphic to the free monogenic monoid. By Proposition 7.8, for each a∈Sp4, (a]≤ is an infinite descending chain for the natural partial order ≤. This is a well-known fact about Sp4 which was already expressed in Figure 3 by its arrows. ∎
Finally, let us return to the general case of a locally inverse semigroup S given by a presentation and pay some attention to the two operations defined on S, namely the semigroup product and the sandwich operation. We begin by analyzing the sandwich operation ∧.
Given two bliw-graphs A1=(a1,Γ1,b1) and A2=(a2,Γ2,b2), set
[TABLE]
that is, take the union of Γ1 and Γ2, add the edge (l(A1),r(A2)) for the new graph to become connected, and keep the left root of Γ1 and the right root of Γ2. Clearly A1\owedgeA2 is a bliw-graph too. If A1 and A2 are reduced, set also A1∧A2 as the reduced form of A1\owedgeA2. Let ϕ:A1\owedgeA2→A1∧A2 be the natural E-surjective epimorphism. Although A1 and A2 are reduced, we cannot guarantee that the left homomorphism ϕ∣A1:A1→A1∧A2 and the right homomorphism ϕ∣A2:A2→A1∧A2 are monomorphims. The complete reduction of A1\owedgeA2 into A1∧A2 may identify some vertices (and edges) of A1 or of A2 even when A1 and A2 are reduced. We will write only ϕ also to refer to both restrictions ϕ∣A1 and ϕ∣A2.
Any homomorphism ψ:A1\owedgeA2→B is a combination of a left homomorphism ψ1=ψ∣A1:A1→B with a right homomorphism ψ2=ψ∣A2:A2→B that satisfy
[TABLE]
Once again, if no ambiguity occurs, we will write ψ also to refer to both ψ1 and ψ2. If B is reduced, then ψ induces a (unique) homomorphism ψ:A1∧A2→B such that ψ=ϕψ by Proposition 5.7.
Conversely, if ψ:A1∧A2→B is a homomorphism, then we denote by ψ the homomorphism ϕψ:A1\owedgeA2→B.
Hence, we can look at ψ as a combination of a left homomorphism ψ1=ψ∣A1ϕ with a right homomorphism ψ2=ψ∣A2ϕ that coincide on A1ϕ∩A2ϕ and satisfy
[TABLE]
Let s,t∈S. Although As∧At and As∧t are not isomorphic in general, there is a sort of ‘Universal Property’ between them that gives us some insight into the operation ∧ on S.
Proposition 7.10**.**
Let s,t,a,b∈S. There is a homomorphism φ:As∧At→Aa if and only if a∈(s∧t]. In particular, a∈E(S) and there is a homomorphism φ^:As∧At→As∧t. Further, for any homomorphism φ:As∧At→Ab, there exists a unique homomorphism ψ:As∧t→Ab such that φ=φ^ψ.
Proof.
Assume first there is a homomorphism φ:As∧At→Aa. Note that (l(Aa),r(Aa))∈E(Aa) because l(Aa)=l(As)φ, r(Aa)=r(At)φ and (l(As)φ,r(At)φ)∈E(Aa). By Proposition 7.5.(i) we must have a∈E(S). Further, by Proposition 7.6, a∈(ss′]r for any s′∈V(s) since φ∣As:As→Aa is a left homomorphism. Similarly, a∈(t′t]l for any t′∈V(t), and so a∈(s∧t] because S is a locally inverse semigroup.
Assume now that a∈(s∧t]. Then a∈(ss′]r for any s′∈V(s) and there is a left homomorphism φ1:As→Aa again by Proposition 7.6. Similarly, there is also a right homomorphism φ2:At→Aa. Note now that
[TABLE]
because a is an idempotent. Hence, φ1 and φ2 combined give us a homomorphism φ:As\owedgeAt→Aa. Using Proposition 5.7, we obtain a homomorphism φ:As∧At→Aa such that φ=ϕφ.
In particular, for a=s∧t, we conclude there is a homomorphism φ^:As∧At→As∧t. If φ:As∧At→Ab is another homomorphism, then bω(s∧t) and there exists a unique homomorphism ψ:As∧t→Ab by Corollaries 5.2 and 7.7. Clearly φ=φ^ψ again by Corollary 5.2 applied to the homomorphisms from As∧At to Ab.
∎
As for the operation ∧ on S, we will introduce an operation ⋅ between rbliw-graphs that is related with the product of S. The rbliw-graphs As⋅At and Ast will not be isomorphic for s,t∈S in general. However, the analogue of Proposition 7.10 for the operation ⋅ can be shown. We split it into the next three results, but first let us introduce the operation ⋅ on rbliw-graphs.
Let A1=(a1,Γ1,b1) and A2=(a2,Γ2,b2) be two bliw-graphs, and set
[TABLE]
Then A1⊙A2 is a bliw-graph, and the difference between A1⊙A2 and A1\owedgeA2 is only on the new edge added. We add (l(A2),r(A1)) for the A1⊙A2 case and (l(A1),r(A2)) for the A1\owedgeA2 case. Therefore, by construction, the identity mapping from A1⊙A2 to A2\owedgeA1 is a weak isomorphism: A1⊙A2 and A2\owedgeA1 have the same underlying liw-graph but with a different choice of roots.
Let A1⋅A2 be the reduced form of A1⊙A2 when A1 and A2 are reduced. Then A1⋅A2 and A2∧A1 have the same underlying rliw-graph and the identity mapping between them is a weak isomorphism. Further, the natural E-surjective epimorphism ϕ:A2\owedgeA1→A2∧A1 is also the natural E-surjective epimorphism from A1⊙A2 to A1⋅A2. Similar to the case of the operations \owedge and ∧:
(i)
Any homomorphism ψ:A1⊙A2→B is a combination of a left homomorphism ψ1=ψ∣A1:A1→B with a right homomorphism ψ2=ψ∣A2:A2→B that satisfy
[TABLE]
(ii)
If B is reduced, then any homomorphism ψ:A1⊙A2→B induces a unique homomorphism ψ:A1⋅A2→B such that ψ=ϕψ.
(iii)
If ψ:A1⋅A2→B is a homomorphism, then ψ denotes the homomorphism ϕψ from A1⊙A2 to B.
It is well known that st\mathrsfsRs(t∧s)\mathrsfsL(t∧s)\mathrsfsR(t∧s)t\mathrsfsLst and st=s(t∧s)t for any s,t∈S. Hence
[TABLE]
Thus, the identity mapping on Γt∧s induces a weak isomorphism from Ast to At∧s. It is now obvious that the homomorphism φ^:At∧As→At∧s given by Proposition 7.10 is also a weak homomorphism from As⋅At to Ast. In the next result we prove that φ^:As⋅At→Ast is, in fact, a homomorphism.
Proposition 7.11**.**
Let s,t∈S. Then φ^:As⋅At→Ast is a homomorphism.
Proof.
Choose idempotents e and f such that e\mathrsfsLs and f\mathrsfsRt. Then
As=(ls,Γe,re) and At=(lf,Γf,rt). Further, if Γ′=Γe∪{(lf,re)}∪Γf, then As⊙At=(ls,Γ′,rt) and At\owedgeAs=(lf,Γ′,re). Let u,v∈S and x,y,x1,y1∈X such that s=uμ, t=vμ, f∈((x∧y)μ] and e∈((x1∧y1)μ]. Note that s=(u(x1∧y1))μ and t=((x∧y)v)μ since s∈S(x1∧y1) and t∈(x∧y)S. By Lemmas 6.2 and 6.3,
[TABLE]
and so
[TABLE]
If Γ is the reduced form of Γ′, then
As⋅At=(a1,Γ,b1) and At∧As=(a2,Γ,b2)
for a1=lsϕ, b1=rtϕ, a2=lfϕ and b2=reϕ. Thus
[TABLE]
Set At∧s=(lt∧s,Γt∧s,rt∧s). Then lt∧s=a2φ^ and rt∧s=b2φ^. Let a∈Lt∧s and b∈Rt∧s such that la=a1φ^ and rb=b1φ^. Then φ^ is a homomorphism from As⋅At to (la,Γt∧s,rb). Further (x∧y)v∈Lrt∧s,rb(Γt∧s) and u(x1∧y1)∈Lla,lt∧s(Γt∧s). Hence
[TABLE]
Thus ab=s(t∧s)t=st and Ast=(la,Γt∧s,rb) by Proposition 7.1. We have shown that φ^ is a homomorphism from As⋅At to Ast.
∎
Proposition 7.12**.**
Let φ:As⋅At→Aa be a homomorphism for s,t,a∈S. Then there exists a unique homomorphism ψ:Ast→Aa such that φ=φ^ψ.
Proof.
By Corollary 5.2 it is enough to show the existence of ψ. Let As=(ls,Γe,re) and At=(lf,Γf,rt) for idempotents e∈Ls and f∈Rt. Let Aa=(a,Γ,b). Thus a=lsφ and b=rtφ. If a1=lfφ and b1=reφ, then (a1,Γ,b1)=Ab for some b∈S such that a\mathrsfsDb. Further, φ is a homomorphism from At∧As to Ab. Let ψ be the homomorphism from At∧s to Ab such that φ=φ^ψ given by Proposition 7.10. Since l(Ast)=(l(As⋅At))φ^=lsφ^ and r(Ast)=(r(As⋅At))φ^=rtφ^, we have
[TABLE]
Thus ψ is also a homomorphism from Ast to Aa, and we have proved this proposition.
∎
Corollary 7.13**.**
For s,t,a∈S, we have a≤st if and only if there is a homomorphism φ:As⋅At→Aa.
Proof.
By Proposition 7.8.(i), a≤st if and only if there is a homomorphism ψ:Ast→Aa. By the last two results, there is a homomorphism ψ:Ast→Aa if and only if there is a homomorphism φ:As⋅At→Aa.
∎
The following corollary deals with a special product case.
Corollary 7.14**.**
Let s,t∈S.
(i)
st=t* if and only if there exists a left homomorphism φ:As→At such that (l(At),r(As)φ)∈E(At).*
(ii)
st=s* if and only if there exists a right homomorphism φ:At→As such that (l(At)φ,r(As))∈E(As).*
Proof.
(i). If st=t, then there is a homomorphism ψ:As⋅At→At
by Corollary 7.13. Note further that φ=ψ∣As is a left homomorphism while ψ∣At is the identity mapping. In particular,
[TABLE]
Assume now that there is a left homomorphism φ:As→At such that (l(At),r(As)φ)∈E(At), and define the mapping φ1:As⊙At→At by setting φ1∣As=φ and letting φ1∣At be the identity mapping. Clearly, φ1 is a homomorphism since (l(At),r(As)φ)∈E(At), whence φ1:As⋅At→At is a homomorphism too. Let ψ be the right homomorphism ϕ∣Atφ^:At→Ast. Let also ψ′:Ast→At be the homomorphism such that φ1=φ^ψ′ given by Proposition 7.12. Then
[TABLE]
are right homomorphisms too. By Corollary 5.2, ψψ′ and ψ′ψ must be the identity automorphisms of At and Ast, respectively. Since ψ′ is a homomorphism, we conclude that ψ′ is an isomorphism with inverse isomorphism ψ. Finally, by Corollary 7.2, we must have st=t.
The proof of (ii) is similar.
∎
We end this section with a remark. Let S1 be a locally inverse semigroup and let X be a subset of S1. For each x∈X choose an inverse x′∈V(x). It may happen that we choose the same inverse for two distinct elements of X. Let X′ be the multiset (it may contain multiple copies of the same element) of all those inverses such that x→x′ becomes a bijection from X to X′. Assume that S1 is generated by X∪X′ as a type ⟨2,2⟩ algebra. Consider now X and X′ as sets of formal letters. Then S1 is a homomorphic image of X+ and there is a presentation P=⟨X;R⟩ such that S1=LI⟨X;R⟩. Thus, we can use the techniques developed in this paper and analyze the structure of S1 using rbliw-graphs whose arrows are labeled by letters from X∪X′.
8. Some special classes of locally inverse semigroups
In this last section, we study the structure of the rbliw-graphs for special classes of locally inverse semigroups. Some of these classes include normal bands, normal bands of groups, left [right] generalized inverse semigroups, generalized inverse semigroups, E-solid locally inverse semigroups, strict regular semigroups and idempotent generated locally inverse semigroups.
We begin by relating some \mathrsfsD-class structural properties with structural properties about rbliw-graphs. Let Γ be the graph obtained from an liw-graph Γ by deleting all arrows. By Proposition 7.5, the elements of a \mathrsfsD-class De of S are all idempotents if and only if the bipartite graph Γe is complete. Thus we have the following trivial result:
Proposition 8.1**.**
Let S be a locally inverse semigroup S and e∈E(S). Then De is a rectangular band if and only if Γe is a complete bipartite graph. Thus, S is a normal band if and only if Γe is a complete bipartite graph for all e∈E(S).
We denote by dl(a) the number of lines of Γ with a as one of its endpoints. Note that if a\mathrsfsLe\mathrsfsRb for e∈E(S), then dl(la) and dl(rb) give the number of idempotents in Ra and Lb respectively. The following proposition and its corollary are now obvious.
Proposition 8.2**.**
Let D be a \mathrsfsD-class of S and let e∈D be an idempotent. Then each \mathrsfsR-class of D has only one idempotent if and only if dl(a)=1 for all a∈Vl(Γe); and each \mathrsfsL-class of D has only one idempotent if and only if dl(a)=1 for all a∈Vr(Γe).
A left [right] generalized inverse semigroup is a regular semigroup whose idempotents constitute a left [right] normal band. They can be described also as the locally inverse semigroups whose \mathrsfsR-classes [\mathrsfsL-classes] have only one idempotent. Thus, inverse semigroups are the semigroups which are simultaneously left and right generalized inverse semigroups. A generalized inverse semigroup is a regular semigroup whose idempotents constitute a normal band. These latter semigroups cannot be described by conditions on the number of idempotents in their \mathrsfsR-classes and/or \mathrsfsL-classes.
Corollary 8.3**.**
The locally inverse semigroup S is
(i)
a left generalized inverse semigroup if and only if dl(a)=1 for all e∈S and a∈Vl(Γe);
(ii)
a right generalized inverse semigroup if and only if dl(a)=1 for all e∈S and a∈Vr(Γe);
(iii)
an inverse semigroup if and only if dl(a)=1 for all e∈S and a∈V(Γe).
Let Γ be an liw-graph. The graph Γ is not connected in general. The maximal connected subgraphs of Γ are called the line-connected components of Γ. Two vertices of Γ are line-connected if they belong to the same line-connected component. We denote by C(Γ) the set of all line-connected components of Γ, and by ΩΓ(a) (or simply by Ω(a) if no ambiguity occurs) the line-connected component of Γ containing a∈V(Γ). Thus S is a left [right] generalized inverse semigroup if and only if Ω(a) has only one right [left] vertex, for all e∈E(S) and a∈Γe; and S is an inverse semigroup if and only if Ω(a) is the trivial connected bipartite graph with only two vertices and one line, for all e∈E(S) and a∈Γe.
Before we characterize the generalized inverse semigroups using the line-connected components, we should remark the following about inverse semigroups. If S is, in fact, an inverse semigroup and s∈S, then we can represent As by As=(le,Γe,rs) where e is the unique idempotent in the \mathrsfsR-class of s∈S. If we contract each line-connected component of Γe into a single vertex, we obtain precisely the Schützenberger graph of the \mathrsfsR-class Rs (see [17] for the definition of these latter graphs).
Proposition 8.4**.**
The locally inverse semigroup S is a generalized inverse semigroup if and only if Ω(a) is a complete bipartite graph for all e∈E(S) and a∈Γe.
Proof.
Assume that S is a generalized inverse semigroup and let e∈E(S) and a∈Γe. Let a1,a2∈Le and b1,b2∈Re such that
[TABLE]
is a path in Ω(a). Then a1,a2∈V(b1) and b2∈V(a2). Hence a1b2=a1eb2=a1b1a2b2 is the product of two idempotents, and so it is an idempotent since E(S) is a normal band. Thus there is an edge with endpoints la1 and rb2 in Γe by Proposition 7.5. From the previous observation, it follows trivially by graph arguments that the bipartite graph Ω(a) is complete.
Assume now that the bipartite graphs Ω(a) are complete for all e∈E(S) and a∈Γe. Let e,f∈E(S). Then
[TABLE]
for e1=e(f∧e)∈E(S) and f1=(f∧e)f∈E(S), and ef=e1f1. Consider the representation (le1,Γf∧e,rf1) of Aef and note that le1,rf1∈Ω(lf∧e). Since Ω(lf∧e) is complete, there is an edge connecting le1 and rf1 in Γf∧e. Hence ef is an idempotent. We have shown that E(S) is a subsemigroup of S. It is well known that the set of idempotents of a locally inverse semigroup is a subsemigroup precisely when S is a generalized inverse semigroup.
∎
The core of a semigroup S1 is the subsemigroup C(S1) generated by all idempotents. It is well known that s∈C(S1) if and only if there are idempotents e1,⋯,en,f1,⋯,fn−1∈E(S1) such that
[TABLE]
Further, the core of a locally inverse [regular] semigroup is known to be locally inverse [regular]. The next result establishes the relationship between the core of S and the line-connected components of Γe for e∈E(S).
Proposition 8.5**.**
Let (la,Γe,rb) be a representation of As for some s∈S. Then s∈C(S) if and only if la and rb are line-connected in Γe.
Proof.
Assume that s∈C(S) and let e1,e2,⋯,en and f1,⋯,fn−1 be idempotents of S such that s\mathrsfsRe1\mathrsfsLf1\mathrsfsRe2\mathrsfsL⋯\mathrsfsLfn−1\mathrsfsRen\mathrsfsLs and s=e1f1e2⋯fn−1en. Then there are a1,⋯,an∈Le and b1,⋯,bn∈Re such that
[TABLE]
Note that (lai,Γe,rbi) and (lai+1,Γe,rbi) are representations of Aei and Afi, respectively, and that ei=(lai,rbi) and fi=(lai+1,rbi) are edges of Γe. Further
[TABLE]
and b=bn. Hence, there is a walk in Γe from la and rb with no arrows, and la and rb belong to the same line-connected component of Γe.
Assume now that la and rb belong to the same line-connected component of Γe. Let
[TABLE]
be a walk from la=la1 to rb=rbn with no arrows. Thus e1,⋯,en and f1,⋯,fn−1 are edges of Γe, and ai,ai+1∈V(bi). Then ei=aibi and fi=ai+1bi are idempotents, and biai=e=biai+1. Hence
[TABLE]
and s∈C(S).
∎
A characterization for the idempotent generated locally inverse semigroups using liw-graphs is now obvious.
Corollary 8.6**.**
The locally inverse semigroup S is idempotent generated if and only if Γe is connected for each e∈E(S).
An liw-graph Γ is line-transitive if for each pair of lines (e,f) of Γ, there exists φ∈Aut(Γ) such that eφ=f. Thus, any line-transitive liw-graph is also left vertex-transitive [right vertex-transitive], that is, for each pair (a,b) of left [right] vertices of Γ, there exists φ∈Aut(Γ) such that aφ=b. Note also that if Γ is reduced, then any one of these three transitivity properties implies the arrow-transitivity property, that is, for each pair (e,f) of arrows of Γ with the same label, there exists φ∈Aut(Γ) such that eφ=f.
The line-distance between two vertices a and b of Γ is their distance in Γ, that is, is the minimal length between all paths in Γ connecting those vertices. If there is no path between a and b in Γ, then their line-distance is infinite. Note that if Γ is reduced and the line-distance between a and b is 2, then these vertices have the same side but there is no φ∈Aut(Γ) such that aφ=b. Hence, any left and right vertex-transitive rliw-graph has no adjacent lines. So, for rliw-graphs, edge-transitivity is equivalent to left and right vertex-transitivity put together.
Proposition 8.7**.**
Let e∈E(S). Then
(i)
De* is a group if and only if Γe is line-transitive.*
(ii)
De* is a left group (that is, a direct product of a group with a left zero semigroup) if and only if Γe is right vertex-transitive.*
(iii)
De* is a right group (that is, a direct product of a group with a right zero semigroup) if and only if Γe is left vertex-transitive.*
Proof.
Note that (ii) follows from Proposition 7.3.(ii) since De is a left group if and only if it has only one \mathrsfsL-class. Similarly, (iii) follows from Proposition 7.3.(i). Finally, (i) follows from (ii) and (iii) together.
∎
Clifford semigroups, also known as semilattices of groups, have many different characterizations. One of them is as regular semigroups with \mathrsfsH=\mathrsfsD. Thus each \mathrsfsD-class of a Clifford semigroup is a subgroup. Similarly, left [right] Clifford semigroups can be defined as regular semigroups with \mathrsfsL=\mathrsfsD [\mathrsfsR=\mathrsfsD]. The following result is now an obvious consequence of the previous proposition.
Corollary 8.8**.**
The locally inverse semigroup S is
(i)
a Clifford semigroup if and only if Γe is line-transitive for all e∈E(S).
(ii)
a left [right] Clifford semigroup if and only if Γe is right [left] vertex-transitive for all e∈E(S).
The analysis of the arrow-transitive case is also interesting. Next, we prove that all liw-graphs Γe of S are arrow-transitive if and only if S is a strict regular semigroup, that is, S is a regular subsemigroup of direct products of completely simple and completely 0-simple semigroups. Alternatively, and also convenient to us, strict regular semigroups can be defined as regular semigroups whose local submonoids are Clifford semigroups. We begin with the following lemma:
Lemma 8.9**.**
Let e∈E(S). Then Γe is arrow-transitive if and only if De∩xx′Sxx′ is either the empty set or a subgroup of S for each x∈X.
Proof.
Assume first that Γe is arrow-transitive and that De∩xx′Sxx′=∅ for some x∈X. Let s,t∈De∩xx′Sxx′. Consider two representations (la,Γe,rb) and (la1,Γe,rb1) of As and At respectively. Hence a1\mathrsfsLa\mathrsfsLe and a1,a∈xx′S. By construction of Γe, there must exist two arrows e=(la,x,rc) and f=(la1,x,rc1) in Γe. Now, since Γe is arrow-transitive, there exists φ∈Aut(Γe) such that eφ=f. Thus φ is a left isomorphism from As onto At, and s\mathrsfsRt by Proposition 7.3.(i). Similarly, using the fact that b1\mathrsfsRb\mathrsfsRe and b1,b∈Sxx′, we can show that s\mathrsfsLt. Consequently, De∩xx′Sxx′ is precisely an \mathrsfsH-class of De. Finally, since xx′Sxx′ is an inverse submonoid of S, De∩xx′Sxx′ must be a maximal subgroup of S.
Assume now that De∩xx′Sxx′ is either the empty set or a subgroup of S for each x∈X. Let e=(la,x,rb) and f=(la1,x,rb1) be two arrows of Γe labeled by x∈X. Then b=a′x for some a′∈V(a)∩Re∩Sxx′ and b1=a1′x for some a1′∈V(a1)∩Re∩Sxx′. So, aa′,a1a1′∈E(De)∩xx′Sxx′ and, consequently, aa′=a1a1′ because De∩xx′Sxx′ is a subgroup by assumption. Hence ab=a1b1, and (la,Γe,rb) is isomorphic to (la1,Γe,rb1) by Proposition 7.1. We have shown that there exist φ∈Aut(Γe) such that eφ=f. Therefore Γe is arrow-transitive.
∎
Proposition 8.10**.**
The locally inverse semigroup S is a strict regular semigroup if and only if Γe is arrow-transitive for all e∈E(S).
Proof.
Assume first that S is a strict regular semigroup, and let e∈E(S) and x∈X. Since xx′Sxx′ is a Clifford semigroup, De∩xx′Sxx′ is either empty or an \mathrsfsH-class of De. Hence Γe is arrow-transitive by Lemma 8.9.
Assume now that Γe is arrow transitive for all e∈E(S). By Lemma 8.9, for each x∈X, De∩xx′Sxx′ is either empty or a subgroup for all e∈E(S). So, each \mathrsfsD-class of xx′Sxx′ is a group and xx′Sxx′ is a Clifford semigroup. Let now f be an idempotent of S and let x∈X such that fωrxx′. Note that φ:fSf→fSfxx′,s↦sxx′ is an isomorphism. Hence fSfxx′ is a regular subsemigroup of xx′Sxx′ and, consequently, it is a Clifford semigroup too. We have shown that all local submonoids fSf of S are Clifford semigroups. So, S is a strict regular semigroup.
∎
No automorphism of an rliw-graph Γ can send a vertex a into another vertex at line-distance 2 from a as, otherwise, this would contradict the fact of Γ being reduced. Hence, we will consider also the following weak version of vertex-transitivity: an liw-graph is almost vertex-transitive if for each pair (a,b) of vertices of Γ, there exists φ∈Aut(Γ) such that aφ is at line-distance at most 2 from b. This condition is clearly equivalent to say that for each pair of vertices (a,b) of different sides, there exists φ∈Aut(Γ) such that aφ and b are connected by a line. The orbitO(a) of a vertex a∈Γ is the set
[TABLE]
The orbit O(a) is full if each vertex b∈Γ with s(b)=s(a) is connected by a line to some vertex of O(a). Observe that Γ is almost vertex-transitive if and only if all its orbits are full.
Proposition 8.11**.**
Let a∈S and e,f∈E(S) such that e\mathrsfsLa\mathrsfsRf. Then
(i)
Ra* is a subsemigroup of S if and only if the orbit of la in Γe is full.*
(ii)
La* is a subsemigroup of S if and only if the orbit of ra in Γf is full.*
Proof.
We prove only (i) since (ii) is its dual. Assume first that Ra is a subsemigroup of S and let rb be a right vertex of Γe. Since each \mathrsfsH-class of Ra is a group, there exists b′∈V(b)∩Ha. Hence b′b\mathrsfsHab and there is a left-isomorphism φ from Aab=(la,Γe,rb) onto Ab′b=(lb′,Γe,rb). Thus lb′∈O(la) and (lb′,rb)∈E(Γe) because b′b∈E(S). We have shown that the orbit of la in Γe is full.
Assume now that O(la) is full in Γe and let s∈Ra. Choose b∈Re such that s=ab. Hence (la,Γe,rb) is a representation of As. Since O(la) is full, there exists φ∈Aut(Γe) such that (la1,rb) is a line of Γe for la1=laφ. Thus Aa1b=(la1,Γe,rb) is left isomorphic to (la,Γe,rb), and a1b\mathrsfsRab by Proposition 7.3.(i). Consequently a1b\mathrsfsHab because a1b,ab∈Lb. Finally, observe that a1b∈E(S) since (la1,rb) is a line in Γe (Proposition 7.5). We have shown that each \mathrsfsH-class of Ra has an idempotent. Therefore, Ra is a subsemigroup of S.
∎
The next two results are now obvious consequences of this last proposition.
Corollary 8.12**.**
Let e∈E(S). Then De is a completely simple subsemigroup of S if and only if Γe is almost vertex-transitive.
Corollary 8.13**.**
The locally inverse semigroup S is completely regular (that is, a normal band of groups) if and only if Γe is almost vertex-transitive for all e∈E(S).
A \mathrsfsD-class D of S is a rectangular group if D is a completely simple subsemigroup of S and the product of any two idempotents of D is another idempotent of D. If we look carefully to the proof of Proposition 8.4, we conclude that the product of any two idempotents of a completely simple \mathrsfsD-class De is another idempotent if and only if the line-connected components of Γe are complete bipartite graphs. The next corollary follows now from Corollary 8.12.
Corollary 8.14**.**
The \mathrsfsD-class De is a rectangular group if and only if Γe is almost vertex-transitive and its line-connected components are all (isomorphic) complete bipartite graphs.
We say that the line-connected components of Γe are almost vertex-transitive if for any two line-connected vertices a and b of Γe with different sides, there exists φ∈Aut(Γe) such that aφ is connected to b by a line. A locally inverse semigroup S is E-solid if all \mathrsfsH-classes of its core C(S) are groups. In fact, for S to be E-solid, it is enough to show that Hfg is a group for all e,f,g∈E(S) such that f\mathrsfsLe\mathrsfsRg. The next result relates E-solid locally inverse semigroups with liw-graphs with almost vertex-transitive line-connected components.
Proposition 8.15**.**
The locally inverse semigroup S is E-solid if and only if each line-connected components of Γe is almost vertex-transitive, for all e∈E(S).
Proof.
Let S be an E-solid locally inverse semigroup. Consider e∈E(S) and a,b∈De such that a\mathrsfsLe\mathrsfsRb and la is line-connected to rb in Γe. Then (la,Γe,rb) is a representation of Aab and ab∈C(S) by Proposition 8.5. Since S is an E-solid locally inverse semigroup, Hab contains an idempotent f and there exists b′∈V(b)∩Ha. Hence Af=(lb′,Γe,rb) is left-isomorphic to Aab and rb is adjacent to lb′∈O(la). We can now conclude that the line-connected components of Γe are almost vertex-transitive.
Assume now that, for all e∈E(S), the line-connected components of Γe are almost vertex-transitive. Let e, f and g be three idempotents of S such that f\mathrsfsLe\mathrsfsRg. We can represent Afg as (lf,Γe,rg) and
[TABLE]
is a walk in Γe from lf to rg. Thus, there exists φ∈Aut(Γe) such that (la,rg)∈E(Γe) for la=lfφ since the line-connected components of Γe are almost vertex-transitive. So Aag=(la,Γe,rg) is left-isomorphic to Afg and ag\mathrsfsRfg. But both ag and fg belong to Lg. Hence ag\mathrsfsHfg. Finally, ag∈E(S) because (la,rg)∈E(Γe). We have shown that Hfg contains an idempotent and, therefore, S is an E-solid locally inverse semigroup.
∎
We end this paper by considering the case where each vertex is the endpoint of exactly one arrow.
A presentation P=⟨X;R⟩ is called X-straight if λu=λv and τu=τv for all (u,v)∈R. Note that λu=λv and τu=τv for all (u,v)∈ε where ε is the Auinger’s congruence on X+. Then λu=λv and τu=τv for all (u,v)∈μ if and only if P is an X-straight presentation. If
[TABLE]
for x,y∈X, then S is the disjoint union of the subsemigroups Sx,y/μ if and only if P is X-straight. By the description of the maximal subsemilattices of the bifree locally inverse semigroup X+/ε given in [13], it is not hard to verify that E(Sx,y/μ) are the maximal subsemilattices of S if P is X-straight.
A locally inverse semigroup is called straight if its maximal subsemilattices are disjoint. Hence S is straight if P is an X-straight presentation. However, the converse is not true: if S is an inverse semigroup, then S is obviously straight but the presentation P is not X-straight.
Proposition 8.16**.**
The sets c(a) are singleton sets for all e∈E(S) and a∈V(Γe) if and only if P is X-straight.
Proof.
Assume that c(a) are singleton sets for all e∈E(S) and a∈V(Γe), and let (u,v)∈R. Let x=λu, y=λv and e∈E(S) such that e\mathrsfsRuμ=vμ. Then e∈(x∧x′)S∩(y∧y′)S, and (le,x,rex) and (le,y,rey) are two arrows of Γe. Hence x=y. Similarly, we show that τu=τv, and so P is X-straight.
Assume now that P is X-straight, let e∈E(S) and choose a\mathrsfsLe and x1,x2∈c(la). Then there are arrows e1=(la,x1,rb1) and e2=(la,x2,rb2) in Γe, and a∈(x1∧x1′)S∩(x2∧x2′)S. Hence a=uμ=vμ for some u∈x1X∗ and v∈x2X∗, and
[TABLE]
for y1=τu and y2=τv. Thus x1=x2 because P is X-straight, and so c(la) is a singleton set. We can conclude that c(rb) is a singleton set for all b\mathrsfsRe similarly.
∎
Acknowledgments: This work was partially supported by CMUP (UID/ MAT/00144/2019), which is funded by FCT with national (MCTES) and European structural funds through the programs FEDER, under the partnership agreement PT2020.
Bibliography18
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] K. Auinger, The bifree locally inverse semigroup on a set, J. Algebra 166 (1994), 630–650.
2[2] K. Auinger, On the Bifree Locally Inverse Semigroup, J. Algebra 178 (1995), 581–613.
3[3] B. Billhardt, Bifree locally inverse semigroups as expansions, J. Algebra 283 (2005), 505–521.
4[4] K. Byleen, J. Meakin and F. Pastijn, The fundamental four-spiral semigroup, J. Algebra 54 (1978), 6–26.
5[5] R. L. Graham, On finite 0-simple semigroups and graph theory, Math. Syst. Theory 2 (1968), 325–339.
6[6] T. Hall, Identities for existence varieties of regular semigroups, Bull. Austral. Math. Soc. 40 (1989), 59–77.
7[7] C. H. Houghton, Completely 0-simple semigroups and their associated graphs and groups, Semigroup Forum 14 (1977), 41–67.
8[8] J. Howie, Fundamentals of Semigroups Theory, Clarendon Press, Oxford , 1995.