Abstract
We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by subsemigroups and extensions of finite Rees index. We prove an analogue of Hopf’s Theorem, stating that an infinite group has 1, 2 or infinitely many ends, for left cancellative semigroups and that the cardinality of the set of ends is invariant in subsemigroups and extension of finite Green index in left cancellative semigroups.
Introduction
The study of ends in group theory has been extensive and has had widespread influence. Stallings’ Theorem characterising groups with more than one end has been used in such varied topics as distancetransitive graphs [13], groups with contextfree word problem [14], pursuitevasion problems in infinite graphs [17] and to describe accessible groups [5]. This paper follows the trend of relating geometric properties of semigroups to algebraic properties, see for example [8, 16] and [11]. We consider the notions of ends for a semigroup and try to recover some basic theorems from the theory of ends of groups. In the case of a finitely generated group, the ends of the group are defined to be the ends of the Cayley graph of G with respect to the generating set A. This definition is invariant under change of finite generating set A. For a full definition for ends of graphs see [4]. In particular, the paper will focus on generalising the following theorems for semigroups.
Theorem 1.1
[9, Satz IV] Let G be an infinite finitely generated group and let H be a subgroup of finite index. Then the number of ends of H is the same as the number of ends of G.
Theorem 1.2
[9, Satz II] An infinite finitely generated group has 1, 2 or \(2^{\aleph _0}\) ends.
In this paper we consider the definition of the ends of a digraph introduced by Zuther in [21] and apply it to the left and right Cayley graphs of a semigroup.
In [10] Jackson and Kilibarda introduce a definition for the number of ends of a semigroup. Their definition is based on the number of ends of the underlying undirected Cayley graph associated with a finitely generating semigroup. Jackson and Kilibarda prove that the number of ends of a semigroup is invariant under change of finite generating set and provide examples of semigroups with n ends in the left Cayley graph and m ends in the right Cayley graph for any prescribed positive integers n and m. In a follow up paper [12] some of the authors of this paper, together with Malcev, used the definition of Jackson and Kilibarda to investigate the relationship between the number of ends when considering subsemigroups of finite index. It was demonstrated that the number of ends was invariant under taking subsemigroups of finite Rees index. Also, the number of ends was shown to be invariant under taking subsemigroups of finite Green index when restricted to the class of cancellative semigroups. These notions of index are defined later in the paper.
We argue that although there are many ways to generalise the notion of ends to a semigroup; by preserving the notion of direction there is a greater chance of interrelating the algebraic structure and the ends.
In the remainder of this section we introduce the relevant definitions and technical results required to prove our main theorems. In Sect. 2, we prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by subsemigroups and extensions of finite Rees index. In Sect. 3, we prove an analogue of Hopf’s Theorem, stating that an infinite group has 1, 2 or infinitely many ends, for left cancellative semigroups and that the cardinality of the set of ends is invariant in subsemigroups and extensions of finite Green index in left cancellative semigroups.
In this paper we will use the notation \(\mathbb {N}\) to denote the set of positive integers and \(\mathbb {N}_0\) to denote the set of nonnegative integers.
Let \(\Omega \) be any set and let \(\Gamma \subseteq \Omega \times \Omega \). We will refer to \(\Gamma \) as a digraph on \(\Omega \), the elements of \(\Omega \) as the vertices of \(\Gamma \), and the elements of \(\Gamma \) as edges. A walk in \(\Gamma \) is just a (finite or infinite) sequence \((v_0, v_1, \ldots )\) of (not necessarily distinct) vertices such that \((v_i, v_{i+1})\in \Gamma \) for all i. An antiwalk is a sequence \((v_0, v_1, \ldots )\) of (not necessarily distinct) vertices such that \((v_{i+1}, v_{i})\in \Gamma \) for all i. For a walk or antiwalk \(\mathbf {\alpha }=(\alpha _0, \alpha _1,\ldots )\) in \(\Gamma \) we may write \(\{\mathbf {\alpha }\}\) for the set \(\{\alpha _0, \alpha _1,\ldots \}\) of vertices which occur in \(\mathbf {\alpha }\). A path in \(\Gamma \) is just a walk consisting of distinct vertices. If \(\varvec{\alpha }=(\alpha _0, \alpha _1,\ldots , \alpha _n)\) is a walk in \(\Gamma \), then the length of \(\varvec{\alpha }\) is n and it is straightforward to verify that \(\varvec{\alpha }\) contains a path from \(\alpha _0\) to \(\alpha _n\). A ray in \(\Gamma \) is just an infinite path \((v_0, v_1, \ldots )\) such that \((v_i, v_{i+1})\in \Gamma \) for all i and an antiray is an infinite path \((v_0, v_1, \ldots )\) such that \((v_{i+1}, v_{i})\in \Gamma \) for all i. If \(\varvec{\alpha }=(\alpha _0, \alpha _1, \ldots , \alpha _m)\) and \(\varvec{\beta }=(\beta _0, \beta _1, \ldots , \beta _n)\) are arbitrary finite sequences of vertices from \(\Omega \), then we denote by \(\varvec{\alpha }^{\smallfrown }\varvec{\beta }\) the sequence \((\alpha _0, \alpha _1, \ldots , \alpha _m, \beta _0, \beta _1, \ldots , \beta _n)\).
The outdegree of a vertex \(\alpha \) in a digraph \(\Gamma \) is just \(\{\beta \in \Omega :(\alpha ,\beta )\in \Gamma \}\). A digraph \(\Gamma \) is outlocally finite if every vertex has finite outdegree.
If \(\Sigma \subseteq \Omega \), then \(\Gamma \cap (\Sigma \times \Sigma )\) is the induced subdigraph of \(\Gamma \) on \(\Sigma \). If \(\Sigma \) and \(\Sigma '\) are infinite subsets of \(\Omega \), then we write \(\Sigma '\preccurlyeq \Sigma \) if there exist infinitely many disjoint paths (including paths of length 0) in \(\Gamma \) with initial vertex belonging to \(\Sigma \) and final vertex belonging to \(\Sigma '\). It is straightforward to verify that \(\preccurlyeq \) is reflexive on infinite subsets of \(\Omega \) but not necessarily transitive, symmetric, or antisymmetric. However, it was shown in [21] that if \(\preccurlyeq \) is restricted to the set of rays and antirays on \(\Gamma \), then it is transitive, and hence a preorder. Let \(\mathbf {r}\) and \(\mathbf {r'}\) be rays or antirays. If \(\mathbf {r} \preccurlyeq \mathbf {r'}\) and \(\mathbf {r'} \preccurlyeq \mathbf {r}\), then we write \(\mathbf {r} \approx \mathbf {r'}\). It follows that \(\approx \) is an equivalence relation and \(\preccurlyeq \) induces a partial order on \(\approx \)classes of rays and antirays. As such we refer to rays and antirays as being equivalent if they belong to the same \(\approx \)class; and inequivalent otherwise. We denote this poset by \(\Omega \Gamma \), and as in [21] we refer to \(\approx \)classes of rays and antirays as the ends of \(\Gamma \). Note that an equivalence class can contain both rays and antirays.
In this paper the direction of \(\preccurlyeq \) is the reverse of that in [21]. That is, for rays \(\mathbf {r}_1\) and \(\mathbf {r}_2\), if there are infinitely many disjoint paths with initial vertex \(\mathbf {r}_1\) and final vertex in \(\mathbf {r}_2\) then the notation in [21] would be \(\mathbf {r}_1\preccurlyeq \mathbf {r}_2\) whereas in this paper the notation would be \(\mathbf {r}_2\preccurlyeq \mathbf {r}_1\). The reason for this alteration is to reflect that the set of vertices that can be reached by a path from \(\mathbf {r}_1\) contains the set of vertices that can be reached by a path from a cofinite set of vertices of \(\mathbf {r}_2\). Readers should note that by reversing the direction of \(\preccurlyeq \) the properties of antisymmetry and transitivity are preserved.
Zuther’s definition is a generalisation of the definition of ends introduced by Halin in [7]. When restricted to graphs Zuther’s definition and Halin’s definition coincide. The definition of ends used by Hopf in [9] is given in terms of connected components of complements of ascending sequences of compact subsets of a topological space. Initially this may appear to be quite different from the definition introduced by Zuther. However, when restricted to the case of locally finite graphs there is a natural bijection between the set of ends considered by Hopf and the equivalence classes of rays under Halin’s definition. In particular, for locally finite graphs and therefore for Cayley graphs of finitely generated groups the cardinality of the set of ends under the topological and graphtheoretical definitions remain the same. For a detailed proof of this correspondence see [4, Sect. 8.5].
We finish this section with some technical results which will be needed later.
Lemma 1.3
Let \(\Gamma \) be a digraph on \(\Omega \) and let \(\varvec{\alpha }=(\alpha _0, \alpha _1, \ldots )\) be an infinite walk (or antiwalk) in \(\Gamma \) such that every vertex of \(\varvec{\alpha }\) occurs only finitely many times. Then \(\varvec{\alpha }\) contains a ray \(\mathbf {r}\) (or antiray, respectively) such that \(\mathbf {r}\) has infinitely many disjoint paths to every infinite subset of \(\{\alpha _0, \alpha _1, \ldots \}\), and every infinite subset of \(\{\alpha _0, \alpha _1, \ldots \}\) has infinitely many disjoint paths to \(\mathbf {r}\).
Proof
We prove that \(\varvec{\alpha }\) contains a ray in the case that \(\varvec{\alpha }\) is a walk; an analogous argument proves that \(\varvec{\alpha }\) contains an antiray in the case that it is an antiwalk.
Let \(a(0)=1\) and for every \(i\ge 1\) define \(a(i)=\max \{j\in \mathbb {N}:\alpha _j=\alpha _{a(i1)}\}+1\), i.e. \(\alpha _{a(i)1}\) is the last appearance of \(\alpha _{a(i1)}\) in \(\varvec{\alpha }\). We will show that
is the required ray. Since \((\alpha _{i}, \alpha _{i+1})\in \Gamma \) for all i, in particular, \((\alpha _{a(i1)}, \alpha _{a(i)})=(\alpha _{a(i)1}, \alpha _{a(i)})\in \Gamma .\) Hence \(\mathbf {r}\) is an infinite walk where \(\alpha _{a(i)}\not =\alpha _{a(j)}\) for all \(i,j\in \mathbb {N}\) such that \(i\not =j\) and so \(\mathbf {r}\) is a ray.
Let \(\Sigma \) be any infinite subset of \(\{\alpha _0, \alpha _1, \ldots \}\). If infinitely many elements in \(\Sigma \) are vertices of \(\mathbf {r}\), then \(\mathbf {r}\preccurlyeq \Sigma \) and \(\Sigma \preccurlyeq \mathbf {r}\). If only finitely many elements of \(\Sigma \) belong to \(\mathbf {r}\), then \(\Sigma \setminus \{\mathbf {r}\} \preccurlyeq \Sigma \) and \(\Sigma \preccurlyeq \Sigma \setminus \{\mathbf {r}\}\) and so we may assume without loss of generality that \(\Sigma \) contains no elements in \(\{\alpha _{a(0)}, \alpha _{a(1)}, \ldots \}\).
We define infinitely many disjoint paths from \(\Sigma \) to \(\mathbf {r}\) by induction. Let \(b(0)\in \mathbb {N}\) be any number such that \(\alpha _{b(0)}\in \Sigma \). Then there exists \(k(0)\in \mathbb {N}\) such that \(a(k(0))\le b(0)<a(k(0)+1)\) and \(\varvec{\beta }_0:=(\alpha _{a(k(0))}, \alpha _{a(k(0))+1}, \ldots , \alpha _{b(0)}, \ldots , \alpha _{a(k(0)+1)})\) is a walk from \(\alpha _{a(k(0))}\) in \(\mathbf {r}\) to \(\alpha _{a(k(0)+1)}\) in \(\mathbf {r}\) via \(\alpha _{b(0)}\in \Sigma \). Since every finite walk contains a path, we conclude that there is a path contained in \(\varvec{\beta }_0\) from a vertex of \(\mathbf {r}\) to \(\alpha _{b(0)}\in \Sigma \) and a path back from \(\alpha _{b(0)}\) to a vertex of \(\mathbf {r}\).
Suppose that we have defined the values \(b(0), \ldots , b(i1), k(0), \ldots , k(i1)\in \mathbb {N}\) and finite walks \(\varvec{\beta }_0, \varvec{\beta }_1, \ldots , \varvec{\beta }_{i1}\) for some \(i\ge 1\). Choose \(k(i), b(i)\in \mathbb {N}\) so that \(b(i)>a(k(i))\), \(\alpha _j\) does not equal any vertex in any of \(\varvec{\beta }_0, \varvec{\beta }_1, \ldots , \varvec{\beta }_{i1}\) for all \(j>a(k(i))\), and \(\alpha _{b(i)}\in \Sigma \). Then we define
By construction, if \(i\not =j\), then \(\varvec{\beta }_i\) and \(\varvec{\beta }_j\) are disjoint and so we have infinitely many disjoint paths (contained in the \(\varvec{\beta }_i\)) from \(\mathbf {r}\) to \(\Sigma \) and back, as required. \(\square \)
Lemma 1.4
Let \(\Gamma \) be an outlocally finite digraph on a set X and let \(\mathbf {w}_0, \mathbf {w}_1, \ldots \) be finite walks of bounded length in \(\Gamma \) with distinct final vertices. Then every vertex in the sequence \(\mathbf {w}_0^\smallfrown \mathbf {w}_1^\smallfrown \ldots \) occurs only finitely many times.
Proof
Let \(K\in \mathbb {N}\) be a bound on the lengths of \(\mathbf {w}_0, \mathbf {w}_1, \ldots \). If a vertex v occurs in infinitely many of \(\mathbf {w}_0, \mathbf {w}_1, \ldots \), then the set B of vertices that can be reached from v by a path of length at most K contains the final vertex of \(\mathbf {w}_i \) for infinitely many \(i\in \mathbb {N}\). But the final vertices of the \(\mathbf {w}_i\) are distinct and so B is infinite, contradicting the assumption that \(\Gamma \) is outlocally finite. \(\square \)
Lemma 1.5
Let \(\Gamma \) be an outlocally finite digraph on \(\Omega \), let \(\Sigma \subseteq \Omega \) be infinite and let \(\alpha _0\in \Omega \) such that there is a path from \(\alpha _0\) to every \(\beta \in \Sigma \). Then there exists a ray \(\mathbf {r}\) in \(\Gamma \) starting at \(\alpha _0\) such that \(\Sigma \preccurlyeq \mathbf {r}\).
Proof
We construct \(\mathbf {r}\) recursively. Start by setting \(\Sigma _0:=\Sigma \) and let \(P_0\) be a set containing precisely one path \(q_\beta \) from \(\alpha _0\) to \(\beta \) for all \(\beta \in \Sigma _0\). Then, since \(\alpha _0\) has finite outdegree and there is a path in \(P_0\) from \(\alpha _0\) to every \(\beta \in \Sigma _0\), there exists a vertex \(\gamma _0\) such that \((\alpha _0,\gamma _0)\in \Gamma \) and there is a path \(q_{\beta }\in P_0\) from \(\alpha _0\) via \(\gamma _0\) to every \(\beta \) in the infinite subset \(\Sigma _1\subseteq \Sigma _0\).
Let \(\beta _1\in \Sigma _1\) be fixed and also fix a path
Let \(P_1=\{q_{\beta }\in P_0:\beta \in \Sigma _1\}\). If \(\beta \in \Sigma _1\) is arbitrary and \(q_{\beta }\in P_1\), then there exists \(i(\beta )\in \mathbb {N}\) such that \(\delta _{i(\beta )}\) is the last vertex belonging to both the paths \(p_1\) and \(q_{\beta }\). The number \(i(\beta )\) exists since, in particular, both paths go through \(\gamma _0\). For each \(\beta \in \Sigma _1\) we have \(2\le i(\beta )\le n\). If \(\{\beta \in \Sigma _1:i(\beta )=m\}\) is finite for all \(2\le m\le n\) then \(\Sigma _1\) would be finite. Hence, there exists \(m\in \mathbb {N}\) such that \(2\le m\le n\) and \(\Sigma _2=\{\beta \in \Sigma _1:i(\beta )=m\}\) is infinite. Set \(\alpha _1=\delta _m\). Since \(m\ge 2\), \(\alpha _1\not =\alpha _0\) and, by construction, there is a path from \(\alpha _1\) to every element \(\beta \) of the infinite set \(\Sigma _2\) (consisting of the vertices between \(\alpha _1\) and \(\beta \) in \(q_{\beta }\in P_1\)) such that the only vertex in \(p_1\) and this path is \(\alpha _1\). Set \(P_2\) to the set of paths from \(\alpha \) to \(\beta \in \Sigma _2\) from the previous sentence.
We may repeat the above process ad infinitum to obtain for all \(i>0\): \(\beta _{i+1}\in \Sigma _{2i+1}\) and a path \(p_{i+1}\in P_{2i+1}\) from \(\alpha _i\) to \(\beta _{i +1}\), an \( \alpha _{i+1}\) in \(p_{i+1}\), an infinite \(\Sigma _{2i+2}\subseteq \Sigma _{2i+1}\) and an infinite set \(P_{2i+2}\) of paths from \(\alpha _{i+1}\) to every element of \(\Sigma _{2i+2}\) such that the only vertex in \(p_{i+1}\) and any path in \(P_{2i+2}\) is \(\alpha _{i+1}\).
Hence there is a walk \(\mathbf {r}\) containing \(\{\alpha _i:i\in \mathbb {N}\}\) consisting of the vertices on the paths \(p_{i+1}\) between \(\alpha _i\) and \(\alpha _{i+1}\). In fact, by construction, the only vertex on both \(p_{i}\) and \(p_{i+1}\) is \(\alpha _{i+1}\), and so the walk \(\mathbf {r}\) is a ray. Moreover, there are infinitely many paths from \(\mathbf {r}\) to \(\Sigma \) consisting of the remaining vertices on \(p_{i+1}\) between \(\alpha _{i+1}\) and \(\beta _{i+1}\). Again by construction the only vertex on both \(p_{i}\) and \(p_{i+1}\) is \(\alpha _{i+1}\) and so the paths from \(\alpha _{i+1}\in \mathbf {r}\) to \(\beta _{i+1}\in \Sigma \) are disjoint. \(\square \)
The ends of a semigroup
Throughout this section, we let S be a finitely generated semigroup and let A be any finite generating set for S. The right Cayley graph \(\Gamma _{r}(S,A)\) of S with respect to A is the directed graph with vertex set S and edges \((s, sa)\in \Gamma _{r}(S,A)\) for all \(s\in S\) and for all \(a\in A\). We refer to a as a label of the edge (s, sa). The left Cayley graph \(\Gamma _l(S,A)\) is defined dually.
If S is a semigroup, then the dual \(S^*\) of S is just the set S with multiplication \(*\) defined by \(x* y=yx\) for all \(x,y\in S\). It follows directly from the definition that \(\Gamma _l(S,A)=\Gamma _r(S^{*},A)\). Therefore to understand the end structure of semigroups, it suffices to study right Cayley graphs only.
We require the following lemma to prove the results in this section.
Lemma 2.1
Let S be a semigroup, let T be a subsemigroup of S generated by a finite set A, and let \(s\in S\). Suppose that \(\langle T, s\rangle \setminus T=n\in \mathbb {N}\). Then there exists \(N\in \mathbb {N}\) such that for all \(b_1, b_2, \ldots , b_{n}\in A\cup \{s\}\) if \(s, sb_1, \ldots , sb_1\ldots b_n\) are distinct, then there exists \(i\le n\) and \(a_1, a_2, \ldots , a_j\in A\) such that \(j\le N\) and \(sb_1\ldots b_i=a_1\ldots a_j\).
Proof
Let \(X:=\{s c_1c_2\ldots c_i\in T:c_j \in A \cup \{s\},\ 1\le i \le n\}\). Then X is finite and so there exists \(N\in \mathbb {N}\) such that every element of X can be given as a product of elements of A of length at most N. By the pigeonhole principle, there exists i such that \(sb_1\ldots b_i\in T\) and hence \(sb_1\ldots b_i\in X\). It follows that there exist \(a_1, \ldots , a_j\in A\) such that \(j\le N\) and \(sb_1\ldots b_{i}=a_1\ldots a_j\), as required. \(\square \)
Proposition 2.2
Let S be a semigroup, let T be a subsemigroup of S generated by a finite set A, and let \(s\in S\). If \(\langle T, s\rangle \setminus T\) is finite, then \(\Omega \Gamma _r(T, A)\) is isomorphic (as a partially ordered set) to \(\Omega \Gamma _r(\langle T, s\rangle , A\cup \{s\})\).
Proof
For the sake of brevity, we denote \(\Gamma _r(\langle T, s\rangle , A\cup \{s\})\) by \(\Gamma \). We use \(\preccurlyeq \) to denote the preorder defined above on the rays and antirays of \(\Gamma \). We prove the proposition in two steps. The first step is to show that every ray or antiray in \(\Gamma \) is equivalent to a ray or antiray with vertices in T and edges labelled by elements of A. The second step is to show that if \(\mathbf {r}\) and \(\mathbf {r}'\) are rays or antirays with vertices in T, edges labelled by elements of A, and \(\mathbf {r}\preccurlyeq \mathbf {r}'\), then there exist infinitely many disjoint paths from \(\mathbf {r}'\) to \(\mathbf {r}\) with edges labelled by elements of A. So, the first step ensures that every end \(\omega \) of \(\Gamma \), contains a ray or antiray \(\mathbf {r}_{\omega }\) with vertices in T and edges labelled by elements of A. The second step implies that the mapping \(\Psi :\Omega \Gamma \longrightarrow \Omega \Gamma _r(T, A)\) defined so that \(\Psi (\omega )\) equals the end of \(\Omega \Gamma _r(T, A)\) containing \(\mathbf {r}_{\omega }\) is an isomorphism. We only give the proof of these steps for rays, an analogous argument can be used for antirays.
Let \(U=\langle T, s\rangle \setminus T\), let \(n=U\), and let \(\mathbf {r}=(x, xb_1, xb_1b_2, \ldots )\) be a ray in \(\Gamma \) for some \(b_1, b_2, \ldots \in A\cup \{s\}\) and \(x\in \langle T, s\rangle \). Since U is finite, only finitely many elements of \(\mathbf {r}\) can lie in U, and so we may assume without loss of generality that \(x, xb_1, xb_1b_2, \ldots \in T\). If \(b_i\not =s\) for all i, then there is nothing to prove.
If \(b_k\) is the first occurrence of s in \(\{b_1, b_2, \ldots \}\), then since the vertices of \(\mathbf {r}\) are distinct so are the elements \(b_k, b_kb_{k+1}, \ldots , b_kb_{k+1}\ldots b_{k+n}\). Hence by Lemma 2.1 there exist \(i, N\in \mathbb {N}\) and \(a_1, a_2, \ldots , a_j\in A\) such that \(j\le N\) and \(b_kb_{k+1}\ldots b_{k+i}=sb_{k+1}\ldots b_{k+i} =a_1\ldots a_j\). Hence
is a walk in \(\Gamma \) with vertices in T and edges labelled by elements of A. We repeatedly apply Lemma 2.1 to successive occurrences of s in \(\{b_1, b_2, \ldots \}\) to obtain finite walks \(\mathbf {w}_1\), \(\mathbf {w}_2,\ldots \) with vertices in T and edges labelled by elements of A. The length of \(\mathbf {w}_{i}\) is bounded by N for all \(i\in \mathbb {N}\) and the final vertices are distinct, and hence by Lemma 1.4 every vertex in the sequence \(\mathbf {w}_{0}^\smallfrown \mathbf {w}_{1}^\smallfrown \ldots \) occurs only finitely many times. Let \(\mathbf {w}\) be the walk obtained by replacing the subpaths of \(\mathbf {r}\) by the \(\mathbf {w}_i\). Every vertex of \(\mathbf {w}\) not in some \(\mathbf {w}_{i}\) occurs only once, since \(\mathbf {r}\) is a ray. Hence every vertex of \(\mathbf {w}\) occurs only finitely many times, and so by Lemma 1.3 there is a subray \(\mathbf {r}'\) of \(\mathbf {w}\) such that \(\mathbf {r}\approx \mathbf {r}'\), as required.
For the second step of the proof, let \(\mathbf {r}\) and \(\mathbf {r}'\) be rays in \(\Gamma \) with vertices in T, edges labelled by elements of A, and \(\mathbf {r}\preccurlyeq \mathbf {r}'\). Since \(\mathbf {r}\preccurlyeq \mathbf {r}'\), there exist infinitely many disjoint paths in \(\Gamma \) from \(\mathbf {r}'\) to \(\mathbf {r}\). We may assume without loss of generality that there are at least n vertices in each of these paths after the last occurrence of s as an edge label. Hence, by repeatedly applying Lemma 2.1, there exists \(N\in \mathbb {N}\) and infinitely many paths from \(\mathbf {r}'\) to \(\mathbf {r}\) labelled by elements of A. Moreover, there is a path of length at most N from every element in one of the new paths to some element in the original path it was obtained from by applying Lemma 2.1. If infinitely many of these new paths are disjoint, then there is nothing to prove. Otherwise infinitely many of these paths have nonempty intersection with a finite subset of T, and so infinitely many paths contain some fixed element \(t \in T\). Hence there are paths of length at most N from t to infinitely many vertices in the original paths, which contradicts the outlocal finiteness of \(\Gamma \). \(\square \)
Corollary 2.3
Let S be a finitely generated semigroup and let A and B be any finite generating sets for S. Then \(\Omega \Gamma _r(S,A)\) is isomorphic (as a partially ordered set) to \(\Omega \Gamma _r(S,B)\).
Proof
It suffices to show that \(\Omega \Gamma _r(S,A)\) is isomorphic to \(\Omega \Gamma _r(S,A\cup {\{s\}})\) for any \(s\in S\), since then \(\Omega \Gamma _r(S,A)\) is isomorphic to \(\Omega \Gamma _r(S,A\cup B)\) is isomorphic to \(\Omega \Gamma _r(S,B)\), as required. Certainly S is a finitely generated subsemigroup of S such that \(\langle S, s\rangle \setminus S\) is finite, and so it follows by Proposition 2.2 that \(\Omega \Gamma _r(S,A)\) is isomorphic to \(\Omega \Gamma _r(S,A \cup {\{s\}})\), as required. \(\square \)
Following from Corollary 2.3 we define \(\Omega S=\Omega \Gamma _{r}(S, A)\) for any finite generating set A of S. We refer to \(\Omega S\) as the ends of S.
It is easy to see that adjoining an identity to a semigroup will not change the cardinality of the set of ends, ie \(\Omega S=\Omega S^1\). For a formal proof of this see Corollary 2.4. Hence, when considering the cardinality of the set of ends of a semigroup we may always assume that the semigroup is a monoid. In addition when considering the ends of an infinite finitely generated group G (under Zuther’s definition) we have from Corollary 2.3 that for any finite semigroup generating set A for G the set of ends of \(\Gamma _r(S,A)\) is isomorphic to the set of ends of \(\Gamma _r(S, A\cup A^{1})\). As the generating set \(A\cup A^{1}\) is closed under taking inverses the digraph \(\Gamma _r(S, A\cup A^{1})\) is in fact a graph. Also, as the degree of each vertex in the graph is at most 2A the graph is locally finite. Hence, when considering the cardinality of the set of ends of a group we are justified in using Hopf’s theorems.
Note that if S is an infinite finitely generated group, then it follows by Hopf’s Theorem [9, Satz II] that the ends of S form an antichain with 1, 2, or \(2^{\aleph _0}\) elements.
In Sect. 5 we give examples of finitely generated semigroups with any finite number or \(\aleph _0\) ends (Examples 5.5, 5.3). Any group with \(2^{\aleph _0}\) group ends will also have \(2^{\aleph _0}\) ends as a semigroup. It is easy to see that the free monoid on two generators will have \(2^{\aleph _0}\) ends as all pairs of rays are incomparable. It is not known whether, in the absence of the Continuum Hypothesis, there exists a finitely generated semigroup S such that \(\Omega S\) has \(\kappa \) elements where \(\aleph _0<\kappa < 2^{\aleph _0}\). The question of which posets can occur as the partial order of ends \(\Omega S\) of some finitely generated semigroup S is unresolved.
If S is a semigroup and T is a subsemigroup of S, then the Rees index of T in S is just \(S\setminus T+1\).
Corollary 2.4
Let S be a finitely generated semigroup and let T be a subsemigroup of S of finite Rees index. Then the partial order \(\Omega S\) of the ends of S is isomorphic to the partial order \(\Omega T\) of the ends of T.
Proof
Since S is finitely generated, it follows by [18, Theorem 1.1], that T is finitely generated. Let A be any finite generating set for T and let \(s\in S\setminus T\) be arbitrary. Then \(\langle T, s\rangle \setminus T\subseteq S\setminus T\) and so \(\langle T, s\rangle \setminus T\) is finite. It follows from Proposition 2.2 that \(\Omega \Gamma _r(T, A)\) is isomorphic \(\Omega \Gamma _r(\langle T, s\rangle , A\cup \{s\})\), and hence \(\Omega T\) is isomorphic to \(\Omega \langle T, s\rangle \). Since \(T\lneq \langle T, s\rangle \le S\), by repeating this process (at most \(S\setminus T\) times) we have shown that \(\Omega S\) is isomorphic to \(\Omega T\). \(\square \)
The number of ends of a left cancellative semigroup
In this section we prove that the right Cayley graph of a left cancellative semigroup can only have a restricted number of ends, unlike the general case (see Proposition 5.5).
A semigroup S is left cancellative if \(x=y\) whenever \(ax=ay\) where \(a,x,y\in S\). Right cancellative is defined analogously. A semigroup is cancellative if it is both left and right cancellative.
A left or right cancellative monoid contains only one idempotent (the identity). A left cancellative semigroup contains at most one idempotent in every \(\mathcal {L}\)class, and the analogous statement holds for right cancellative semigroups. The structure of a cancellative semigroup S is straightforward to describe: either S is \(\mathcal {R}\) trivial or S is a monoid with group of units G, every \(\mathcal {R}\)class is of the form xG, and every \(\mathcal {L}\)class is of the form Gx for some \(x\in S\) (see for example [15]). We start this section by giving an analogous description of the structure of a left cancellative semigroup. It is possible to deduce these results from [19] although they are not couched in this notation, and so we include a proof for the sake of completeness.
A right group is the direct product of a group G and right zero semigroup E.
Theorem 3.1
[3, Theorem 1.27] A semigroup is a right group if and only if it is left cancellative and \(\mathcal {R}\)simple.
Proposition 3.2
Let S be a left cancellative semigroup and let U be the set of regular elements in S. Then:

(i)
\(S\setminus U\) is an ideal (in the case when S is a group it is empty);

(ii)
if U is nonempty, then U is a right group;

(iii)
if \(x\in S\) has nontrivial \(\mathcal {R}\)class \(R_x\), then \(R_x=xU\);

(iv)
if \(x\in S\) is arbitrary and U is nonempty, then xU is an \(\mathcal {R}\)class of S (not necessarily containing x).
Proof
Let \(x,y \in S\) and assume that xy is a regular element. It follows that there exists \(z\in S\) such that \(xyzxy=xy\). By cancelling we see that \(yzxy=y\) and hence y must be a regular element. From \(yzxy=y\) we must have \(yzxyzx=yzx\), again by cancelling we see \(xyzx=x\) and hence x is also a regular element. This means that \(S\setminus U\) is an ideal of S.
For the second part we assume that U is nonempty. If S contains a regular element then it contains an idempotent. Let e and f be idempotents in S. Then \(e^2f=ef\) and \(f^2e=fe\) and so, by cancelling, \(ef=f\) and \(fe=e\). Thus \(e\mathcal {R}f\) and, since every regular element is \(\mathcal {R}\)related to an idempotent, the regular elements of S are contained in a single \(\mathcal {R}\)class of S. If x and y are regular, then there exists \(x'\in S\) such that \(xx'x=x\) and, since \(y\mathcal {R}x'\), there exists \(z\in S\) such that \(yz=x'\). Hence \(xyzxy=xx'xy=xy\) and so xy is regular. Hence, U is a subsemigroup of S and by part one \(S\setminus U\) is an ideal and so U is \(\mathcal {R}\)simple. It follows from Theorem 3.1 that U is a right group
We now prove parts three and four together. Let \(x\in S\) and assume U is nonempty. Let \(e\in U\) be an idempotent. Then as all elements in U are \(\mathcal {R}\) related xU is contained within an \(\mathcal {R}\)class, say R. Let y be an element of R distinct from xe. Then there exists \(s,t \in S\) such that \(xes=y\) and \(yt=xe\). It follows that \(xest=xe\) and hence \(xestst=xest\). By cancelling \((st)^2=st\) is an idempotent and as \(S\setminus U\) is an ideal \(s,t\in U\). This means that \(R=xU\). If x lies in a nontrivial \(\mathcal {R}\)class then there exists \(y\mathcal {R}x\) such that \(y\ne x\) and there exists \(s,t \in S\) such that \(xs=y\) and \(yt=x\). Then as before we see that st is an idempotent and \(x=xst\) so \(x\in xU\). \(\square \)
Lemma 3.3
A left cancellative semigroup S has either one \(\mathcal {R}\)class or infinitely many \(\mathcal {R}\)classes.
Proof
We show that either S is regular or \((x, x^2)\not \in \mathcal {R}\) for some \(x\in S\). Suppose that \((x,x^2)\in \mathcal {R}\) for all \(x\in S\). Then there exists \(s\in S^1\) such that \(x^2s=x\). Hence \(x^2st=xt\) and so \((xs)t=t\) for all \(t\in S\). Hence xs is a left identity for S and so xs is an idempotent and \(x\mathcal {R}xs\). Thus S is regular and so by [3, Exercise 1.11.4] has only one \(\mathcal {R}\)class. If there exists \(x\in S\) such that \((x, x^2)\not \in \mathcal {R}\), then \((x^i, x^j)\not \in \mathcal {R}\) for all \(i,j\in \mathbb {N}\) such that \(i\not =j\). Hence S has infinitely many \(\mathcal {R}\)classes. \(\square \)
Corollary 3.4
If S has infinitely many \(\mathcal {R}\)classes at least one of which is infinite, then it has infinitely many infinite \(\mathcal {R}\)classes.
Proof
Since there is at least one infinite \(\mathcal {R}\)class in S, that \(\mathcal {R}\)class is of the form yU for some \(y\in S\), and \(yU=U\) by left cancellativity, it follows that U is infinite. From the proof of Lemma 3.3, there exists \(x\in S\) such that \((x^i, x^j)\not \in \mathcal {R}\) for all \(i,j\in \mathbb {N}\) such that \(i\not =j\). By Proposition 3.2, \(x^iU\) is an \( \mathcal {R}\)class of S for all \(i\in \mathbb {N}\) and \(x^iU=U\) and, in particular, \(x^iU\) is infinite for all \(i\in \mathbb {N}\). It suffices to show that the sets \(x^iU\) are disjoint. Suppose to the contrary that \(x^iU\cap x^jU\not =\emptyset \) for some \(i,j\in \mathbb {N}\) with \(i<j\). Then, by left cancellativity, \(x^{ji}U\cap U\not =\emptyset \) and so \(x^{ji}\in U\) since \(S\setminus U\) is an ideal. Therefore infinitely many powers of x, namely, \(x^{ji}, x^{2j2i}, \ldots \), are \(\mathcal {R}\)related, contradicting our assumption. \(\square \)
Right groups are a special case of Rees matrix semigroups where \(I=1\) and the multiplication matrix P consists of identity elements. Hence as a corollary to Proposition 5.5 below we have.
Corollary 3.5
Let G be a finitely generated group and let E be a finite right zero semigroup. Then \(\Omega (G\times E)=\Omega G\).
Lemma 3.6
Let S be a finitely generated left cancellative semigroup with no infinite \(\mathcal {R}\)classes. If the Cayley graph of S with respect to a finite generating set contains a ray \(\mathbf {r}\) and there is an \(s\in S\) such that there are paths from infinitely many points in \(\mathbf {r}\) to s, then \(\Omega S\) is infinite.
Proof
Let A be a finite generating set for S, let \(\mathbf {r}=(r_0, r_1, \ldots )\) be a ray in \(\Gamma _r(S, A)\) and let \(s\in S\) such that there are infinitely many paths from \(\mathbf {r}\) to s. We may write \(r_0\) as a product \(a_1\ldots a_n\) of generators in A.
Assume, seeking a contradiction, that S has finitely many ends. Since S is left cancellative, \(\mathbf {r}_i=(s^i, s^ia_1, \ldots , s^ia_1\ldots a_n=s^ir_0, s^ir_1, \ldots )\) is a ray for all \(i\in \mathbb {N}\). Thus, by assumption, there exist \(i,j\in \mathbb {N}\) such that \(i<j\) and \(\mathbf {r}_i\approx \mathbf {r}_j\). Again using the left cancellativity of S, it follows that \(\mathbf {r}_{ji}\approx \mathbf {r}\) and so there is a path from \(s^{ji}r_k\) to \(r_l\) for some \(k,l\in \mathbb {N}\). There is a path from s to \(s^{ji}r_k\) and hence to \(r_l\). But in this case, \(r_l\mathcal {R}r_{l+1}\mathcal {R}\ldots \) and so S has an infinite \(\mathcal {R}\)class, which is a contradiction. \(\square \)
The main results of this section are given below.
Theorem 3.7
Let S be an infinite finitely generated left cancellative semigroup. Then \(\Omega S=1,2\) or \(\Omega S\ge \aleph _0\).
Proof
If S has only one \(\mathcal {R}\)class, then by [3, Theorem 1.27] it follows that \(S\cong G\times E\) where G is a group and E is a right zero semigroup. Since S is finitely generated, it follows that G is finitely generated and E is finite. Hence, by Corollary 3.5, \(\Omega S=\Omega G\) and by Hopf’s Theorem [9, Satz I], \(\Omega G=1,2\) or \(2^{\aleph _0}\).
Suppose that S has more than one \(\mathcal {R}\)class. Then Lemma 3.3 implies that S has infinitely many \(\mathcal {R}\)classes. If S contains an infinite \(\mathcal {R}\)class then then by Corollary 3.4 S contains infinitely many infinite \(\mathcal {R}\)classes. As S is finitely generated every vertex has finite outdegree. Let r be an element of an infinite \(\mathcal {R}\)class R. Then there exists a path from r to infinitely many elements of R. By Lemma 1.5, there exists a ray starting at r that has paths to infinitely many elements of R. As \(r\in R\), it follows that all the elements of the ray must also be in R and hence each infinite \(\mathcal {R}\)class contains a ray. Furthermore, none of these rays can be equivalent as the \(\mathcal {R}\)classes are distinct. Thus \(\Omega S\ge \aleph _0\).
Assume that S has no infinite \(\mathcal {R}\)class. Let \(\Gamma \) denote the Cayley graph of S with respect to some finite generating set A for S. If \(\Gamma \) contains a ray \(\mathbf {r}\) and there is an \(s\in S\) such that there are paths from infinitely many points in \(\mathbf {r}\) to s, then \(\Omega S\) is infinite by Lemma 3.6. If \(\Gamma \) contains an antiray \(\mathbf {r}\), then there exists \(a\in A\) such that infinitely many of the elements in \(\mathbf {r}\) are of the form at for some \(t\in S\). In particular, there is a path from a to every at in \(\mathbf {r}\) and so by Lemma 1.5 there exists a ray \(\mathbf {r}'\) such that \(\mathbf {r}\preccurlyeq \mathbf {r}'\). But then there are paths from infinitely many of the vertices in \(\mathbf {r}'\) to any fixed element in \(\mathbf {r}\), and so \(\Omega S\) is infinite by Lemma 3.6.
Suppose that the Cayley graph of S does not have the property of Lemma 3.6. Seeking a contradiction assume that S has finitely many ends, and let \(\mathbf {r}_1,\mathbf {r}_2, \ldots , \mathbf {r}_n\) be rays belonging in distinct ends such that the end containing \(\mathbf {r}_1\) is minimal with respect to \(\preccurlyeq \). Since \(\mathbf {r}_i\not \preccurlyeq \mathbf {r}_1\), there exists a finite \(F\subseteq S\) such that all paths from \(\mathbf {r}_1\) to every \(\mathbf {r}_i\) pass through F. By assumption there exists element s in \(\mathbf {r}_1\) such that there are no paths from s to any element of F and hence to any element in any \(\mathbf {r}_i\). Since S is left cancellative, \(s\mathbf {r}_1\) and \(s\mathbf {r}_2\) are rays. If \(s\mathbf {r}_1\approx \mathbf {r}_i\) or \(s\mathbf {r}_2\approx \mathbf {r}_i\), then there is a path from s to \(\mathbf {r}_i\) and so \(i=1\). In particular, \(s\mathbf {r}_1\approx s\mathbf {r}_2\) and so, since S is left cancellative, \( \mathbf {r}_1\approx \mathbf {r}_2\), a contradiction. We have shown that S either has 1 or infinitely many ends. \(\square \)
Corollary 3.8
Let S be an infinite finitely generated cancellative semigroup that is not a group. Then \(\Omega S=1\) or \(\Omega S\ge \aleph _0\).
Proof
Since S is cancellative, it is certainly left cancellative and so \(\Omega S=1, 2\), or \(\Omega S\ge \aleph _0\) by Theorem 3.7. If \(\Omega S=2\), then from the proof of Theorem 3.7, S has only one \(\mathcal {R}\)class and hence is a group. \(\square \)
As mentioned above, it is not known what cardinalities \(\Omega S\) can have, even for restricted types of semigroups such as those which are left cancellative. We prove that \(\Omega S\) has cardinality \(2^{\aleph _0}\) for a particular type of cancellative semigroup. Ore’s Theorem (see for instance [3, Theorem 1.23]) states that if a cancellative semigroup S satisfies the condition that \(sS\cap tS\not =\emptyset \) for all \(s,t\in S\) then S can be embedded in a group.
Theorem 3.9
A finitely generated cancellative semigroup which cannot be embedded in a group has \(2^{\aleph _0}\) ends.
Proof
Let S be a cancellative semigroup that cannot be embedded in a group. As S is not groupembeddable there exists \(s,t\in S\) such that \(sS\cap tS=\emptyset \). Firstly we show that all elements of \(\{s,t\}^*\) are distinct. Let \(u=u_1u_2\ldots u_n,v=v_1,v_2\ldots v_m \in \{s,t\}^*\) and assume \(u=_S v\), without loss of generality we assume the length of u is less than or equal to the length of v. If u is a prefix of v then \(u=v=uv'\). It follows that \(v'\) is a left identity for all elements of S. The first letter of \(v'\) is (without loss of generality) s and hence \(tx=v'tx\in sS\) for all \(x\in S\). If u is not a prefix of v then there exists a position \(i\le n\) such that \(u_j=v_j\) for all \(j<i\) but \(u_i\ne v_j\). As \(u_j=v_j\) for all \(j<i\) and \(u=_S v\) it follows by leftcancellativity that \(u_i\ldots u_n=v_i\ldots v_m\) and \(u_i\ne v_j\), however, \(sS\cap tS=\emptyset \) a contradiction.
We now show that for \(u,v\in \{s,t\}^*\) we have \(v\in uS\) if and only if u is a prefix of v. Clearly if u is a prefix of v then \(v\in uS\). With the aim of getting a contradiction assume that \(u=u_1u_2\ldots u_n\) is not a prefix of \(v=v_1v_2\ldots v_m\) but \(v\in uS\). This means there exists \(x\in S\) such that \(ux=v\). As u is not a prefix of v there exists \(1\le i\le n\) such that \(u_j=v_j\) for all \(j<i\) but \(u_i\ne v_j\). But then by leftcancellativity \(u_i\ldots u_n x=_S v_i\ldots v_m\). Then as \(\{u_i,v_i\}=\{s,t\}\) it follows that \(sS\cap tS\ne \emptyset \).
Combining these facts gives a copy of the free semigroup on two generators as a subsemigroup of S and there can be no paths between elements, this means S has at least \(2^{\aleph _0}\) ends. This is also the maximum possible number of ends so \(\Omega S=2^{\aleph _0}\). \(\square \)
Subsemigroups of finite Green index
In [20] Wallace introduced a generalisation of Green’s relations involving subsemigroups. Let S be a semigroup, let T be a subsemigroup of S and let \(x,y\in S\). We say x is \(\mathcal {R}^T\) related to y, denoted \(x\mathcal {R}^T y\) if there exists \(s,t \in T^1\) such that \(xs=y\) and \(yt=x\). We may define \(\mathcal {L}^T\), \(\mathcal {H}^T\) and \(\mathcal {D}^T\) analogously. As with Green’s \(\mathcal {R}\), \(\mathcal {L}\), \(\mathcal {H}\) and \(\mathcal {D}\) relations \(\mathcal {R}^T\), \(\mathcal {L}^T\), \(\mathcal {H}^T\) and \(\mathcal {D}^T\) are all equivalence relations on S.
It follows from Proposition 3.2 that if T is a subsemigroup of a left cancellative semigroup S, then \(\mathcal {R}^T=\mathcal {R}^V\) where V is the right group of regular elements of T.
Let S be a semigroup and let T be a subsemigroup of S. We say T is of finite Green index in S if \(S\setminus T\) has finitely many \(\mathcal {H}^T\)classes. We say the Green index of T in S is the number of \(\mathcal {H}^T\)classes in \(S\setminus T\) plus one.
Let S be a semigroup and let T be a subsemigroup of finite Green index. It was shown in [2] that S is finitely generated if and only if T is finitely generated. If T is a submonoid of a leftcancellative monoid S and T has finite Green index in S, then, since the complement of the group of units is an ideal, the group of units of T has finite index in the group of units of S.
Lemma 4.1
If \(S=G\times E\) is a right group, G is infinite and T is a subsemigroup of finite Green index then \(T=K\times E\) is a right group where K is of finite index in G.
Proof
One can see S has only one \(\mathcal {R}^S\)class, therefore the \(\mathcal {H}^S\)classes of S are the \(\mathcal {L}^S\)classes of S. As \((g,e)\cdot (h,f)=(gh,f)\) we see that \(\mathcal {L}^S\)classes are of the form \(G\times \{e\}\) for each \(e\in E\).
If T contains no elements of the form (g, e) for some fixed \(e\in E\) then the \(\mathcal {R}^T\)class of each (h, e) must be trivial. This follows as (h, e)(g, f) can only be of the form (hg, f) where \(f\ne e\) and then there exists no element \((g',f')\in T\) such that \((hg,f)(g',f')=(k,e)\) as T contains no elements of the form (g, e).
For each \(e\in E\) we let \(K_e\) be those elements \(g\in G\) such that \((g,e)\in T\). We now show each \(K_e\) contains \(1_G\). Let \(e\in E\). One can see \(K_e\) is a subsemigroup of G as in particular \((g,f)(h,e)=(gh,e)\) so \(K_fK_e\subseteq K_e\). It is easy to see that a subsemigroup of finite Rees index in G is equal to G so we may assume \(G\setminus K_e\) is infinite. As \(\mathcal {H}^T\)classes are contained in \(\mathcal {H}^S\)classes and as \(G\setminus K_e\) is infinite we must have at least one nontrivial \(\mathcal {H}^T\)class containing distinct elements \((g,e),(g',e)\) with \(g,g'\not \in K_e\). As these elements are \(\mathcal {H}^T\)related they are \(\mathcal {R}^T\)related and hence there exists \((h,f),(h',f,)\in T\) such that \((g,e)(h,f)=(g',e)\) and \((g',e) (h',f')=(g,e)\). This means \(f=f'=e\) and furthermore that \(ghh'=g\). It follows \(hh'=1_G\) is an element of \(K_e\). Hence, \(K_e\subseteq K_f\) for all \(e,f\in E\) so \(K_e=K_f\) for all \(e,f\in E\). We call this semigroup K.
As \(K\times E\) has finite Green index in \(G\times E\) it must follow that K has finite Green index in G. It was shown in [6, Corollary 34] that if K is a subsemigroup of finite Green index in a group G then K is a subgroup of G with finite group index. \(\square \)
Lemma 4.2
Let S be a semigroup generated by A and let T be a subsemigroup of S generated by B with Green index \(n\in \mathbb {N}\). If \(s\in S\) and \(a_1, a_2, \ldots , a_{m +k}\in A\) such that the number of \(\mathcal {R}^T\)classes containing any of \(sa_1a_2\ldots a_{m+1}, sa_1a_2\ldots a_{m+2}, \ldots , sa_1a_2\ldots a_{m+k}\) is at least n, then there exist \(i>m\) and \(b_1, b_2, \ldots , b_j\in B\) such that \(sa_1\ldots a_i=b_1\ldots b_j\).
Proof
If \(sa_1a_2\ldots a_{m+1}, sa_1a_2\ldots a_{m+2}, \ldots , sa_1a_2\ldots a_{m+k}\) contains elements from n \(\mathcal {R}^T\)classes then \(sa_1a_2\ldots a_{m+i}\) is an element of T for some i. Any element of T can be expressed over B and hence there exists \(b_1,b_2\ldots b_j\in B\) such that \(sa_1a_2\ldots a_{m+i} =b_1b_2\ldots b_j\). \(\square \)
Theorem 4.3
Let S be an infinite finitely generated left cancellative semigroup and let T be a subsemigroup of S of finite Green index. Then \(\Omega S=\Omega T\).
Proof
If S is right simple, then \(S\cong G\times E\) for some finitely generated group G and E is a finite right zero semigroup. Since T has finite Green index in S, it follows that \(T\cong H\times E\) where H is a subgroup of finite index in G. In other words, T is a right group and so by Corollary 3.5 \(\Omega T=\Omega H\) and \(\Omega S=\Omega G\). From Hopf’s theorem [9, Satz IV] we know \(\Omega G=\Omega H\), hence, \(\Omega S=\Omega T\).
Let U be the right group of regular elements in S. Since S is finitely generated, it follows that T is finitely generated. Let A and B be finite generating sets for S and T, respectively, such that \(B\subseteq A\). Since \(S\setminus U\) is an ideal, U is also finitely generated. Hence, as T is also left cancellative, the right group of regular elements V of T is finitely generated. It follows by Proposition 3.2 that \(\mathcal {R}^T=\mathcal {R}^V\), and so V has finite Green index in U.
Suppose that S has more than one \(\mathcal {R}\)class. Then, by Lemma 3.3, S has infinitely many \(\mathcal {R}\)classes. If S has no infinite \(\mathcal {R}\)classes, then since \(\mathcal {R}^T\)classes are contained in \(\mathcal {R}^S\)classes, it follows that T has finite Rees index in S and so by Corollary 2.4, the theorem follows. We now consider the case that S has infinitely many infinite \(\mathcal {R}\)classes. By Proposition 3.5, U either has 1, 2, or \(2^{\aleph _0}\) ends.
If U has \(2^{\aleph _0}\) ends, then, since \(S\setminus U\) is an ideal, S has \(2^{\aleph _0}\) ends. Since V has finite Green index in U and U is a right group, V has \(2^{\aleph _0}\) ends and so T has \(2^{\aleph _0}\) ends also.
Suppose that U has 1 or 2 ends. Then S and T have at least \(\aleph _0\) ends, since every pair of infinite \(\mathcal {R}\)classes contain a pair of inequivalent rays. Let \( \Sigma (S)\) be the set of ends of S containing a ray that has nonempty intersection with infinitely many \(\mathcal {R}^S\)classes. By [21, Lemma 2.8], if \(\omega \) is an end of \( \Gamma _r(S, A)\), then every ray in \(\omega \) is contained in a strongly connected component or intersects infinitely many strongly connected components (but not both). Since strongly connected components of \(\Gamma _r(S, A)\) are precisely \(\mathcal {R}^S\)classes, it follows that \(\Omega S=\max \{\aleph _0, \Sigma (S)\}\) and \(\Omega T=\max \{\aleph _0, \Sigma (T)\}\). We conclude the proof by showing that \(\Sigma (S)=\Sigma (T)\).
Let \(\mathbf {r}\) be a ray or antiray in \(\Gamma _r(S, A)\) that has nonempty intersection with infinitely many \(\mathcal {R}^S\)classes. Since every \(\mathcal {R}^S\)class is a union of \(\mathcal {R}^T\)classes, \(\mathbf {r}\) has nonempty intersection with infinitely many \(\mathcal {R}^T\)classes. Since there are only finitely many \(\mathcal {R}^T\)classes in \(S\setminus T\), we may assume without loss of generality that the elements in \(\mathbf {r}\) are in T. Let n be the number of \(\mathcal {R}^{T}\)classes in \(S\setminus T\) and let \((xc_1, xc_1 c_2, \ldots , xc_1\ldots c_m)\) be a subpath of \(\mathbf {r}\) that has nonempty intersection with \(n+1\), \(\mathcal {R}^T\)classes. By left cancellativity, the path \((c_1, c_1 c_2, \ldots , c_1\ldots c_m)\) has nonempty intersection with at least \(n+1\) \(\mathcal {R}^T\)classes also. It follows that there exists i such that \(c_1\ldots c_i\in T\). Hence \(c_1\ldots c_i\) is a product \(b_1b_2\ldots b_j\) of elements in the generating set B for T. Recursively replacing every such path \((xc_1, xc_1 c_2, \ldots , xc_1\ldots c_i)\) by the corresponding walk \((xb_1, xb_1b_2, \ldots , xb_1\ldots b_j)\) we obtain a walk \(\mathbf {w}=(w_0, w_1, \ldots )\) in \(\Gamma _r(T, B)\) that has nonempty intersection with infinitely many \(\mathcal {R}^T\)classes contained in T. If \(i<j\) and \(w_i\mathcal {R}^T w_j\), then \(w_i\mathcal {R}^T w_{i+1}\mathcal {R}^T \ldots \mathcal {R}^T w_{j}\). But \(\mathbf {w}\) has nonempty intersection with infinitely many \(\mathcal {R}^T\)classes and so every vertex of \(\mathbf {w}\) occurs only finitely many times. Hence, by Lemma 1.3, \(\mathbf {w}\) is equivalent to a ray or antiray in \(\Gamma _r(T, B)\).
Let \(\mathbf {r}_1\) be a ray or antiray and let \(\mathbf {r}_2\) be a ray or antiray in \(\Gamma _r(T, B)\) such that \(\mathbf {r}_1\) and \(\mathbf {r}_2\) have nonempty intersection with infinitely many \(\mathcal {R}^S\)classes. If \(\mathbf {r}_1\) is equivalent to \(\mathbf {r}_2\) in \(\Gamma _r(T, B)\), then clearly \(\mathbf {r}_1\) is equivalent to \(\mathbf {r}_2\) in \(\Gamma _r(S, A)\). Suppose that \(\mathbf {r}_1\) is equivalent to \(\mathbf {r}_2\) in \(\Gamma _r(S, A)\). In this case, there are infinitely many disjoint paths from \(\mathbf {r}_1\) to \(\mathbf {r}_2\) and vice versa. By repeatedly applying Lemma 4.2, there exist infinitely many paths from \(\mathbf {r}_1\) to \(\mathbf {r}_2\) labelled by elements of B. If infinitely many of these paths are disjoint, then the proof is complete. Otherwise infinitely many of these paths have nonempty intersection with a finite subset of S, and so infinitely many paths contain some fixed element \(s\in S\). But then there exists a path from s to element in \(\mathbf {r}_2\) and a path from that vertex to an element in \(\mathbf {r}_1\), and so infinitely many elements in \(\mathbf {r}_1\) are \(\mathcal {R}^S\)related, a contradiction. We have shown that for all rays or antirays \(\mathbf {r}_1\) and \(\mathbf {r}_2\) in \(\Gamma _r(T, B)\) such that \(\mathbf {r}_1\) and \(\mathbf {r}_2\) have nonempty intersection with infinitely many \(\mathcal {R}^S\)classes, \(\mathbf {r}_1\) is equivalent to \(\mathbf {r}_2\) in \(\Gamma _r(T,B)\) if and only if they are equivalent in \(\Gamma _r(S,A)\). Therefore \(\Sigma (S)= \Sigma (T)\), as required. \(\square \)
Examples
In this section we give several examples of finitely generated semigroups S and describe \(\Omega S\) for these examples.
The following example shows that unlike in the groups case it is possible for a left cancellative semigroup to have \(\aleph _0\) ends.
Example 5.1
The semigroup \(\mathbb {N}_0 \times \mathbb {N}_0\) under componentwise addition has \(\aleph _{0}\) ends. For the sake of brevity we use \(\Gamma \) to denote the Cayley graph \(\Gamma _r(\mathbb {N}_0 \times \mathbb {N}_0,\{(0,0),(0,1),(1,0)\})\). We show that any ray in \(\Gamma \) is equivalent to one of
for each \(i\in \mathbb {N}_0\). We first note that there are no antirays in \(\Gamma \). Any ray either contains finitely many elements in the first component of its vertices, finitely many elements in the second component of its vertices or infinitely many distinct elements in both components. In the first case as elements are eventually of the form (i, j) for some fixed i the ray is equivalent to \(((i,0),(i,1),(i,2), \ldots )\). Equivalently if the ray has finitely many elements in the second component of its vertices then it will be equivalent to some \(((0,i),(1,i),(2,i), \ldots )\). In the case that the ray has infinitely many distinct elements in both components then for any element (i, j) where \(i<j\) there is a path from (i, i) to (i, j) to (j, j) and we see that the ray is equivalent to \(((0,0),(1,0),(1,1),(2,1), (2,2), \ldots ) \).
The following example demonstrates the existence of antirays which are not equivalent to any ray. It also shows that it is possible to have antirays in a semigroup with trivial \(\mathcal {R}\)classes.
Example 5.2
Let M be the monoid \(Mon\langle a,b aba=b \rangle \). It is easy to check that \(aba\longrightarrow b\) and \(b^2a\longrightarrow ab^2\) is a complete rewriting system. For more details on rewriting systems see [1, Chapter 1]. In a similar way to Example 5.1 we can show that this monoid has \(\aleph _0\) ends. For a diagram of a portion of the right Cayley graph see Fig. 1.
The following example demonstrates that in general a subsemigroup of finite Green index may have a different number of ends from the original semigroup.
Example 5.3
Let \(\{0,1\} \) be the semigroup with the usual multiplication (of real numbers) and \(G=Grp\langle a\rangle \) be an infinite cyclic group. Consider the semigroup \(\langle a \rangle \times \{0,1\}\) with generating set \(\{(a,0),(a,1),(a^{1},0),(a^{1},1)\}\). Then \(T=\langle a \rangle \times \{1\}\) is a subsemigroup and \(\langle a \rangle \times \{0\}\) is an \(\mathcal {H}^T\)class in the complement. Hence \(\langle a \rangle \times \{1\}\) has finite Green index in \(\langle a \rangle \times \{0,1\}\). However, by inspection we see \(\langle a \rangle \times \{0,1\}\) has 4 ends corresponding to the two ends of \(\langle a \rangle \times \{1\}\) and \(\langle a \rangle \times \{0\}\), however, \(\langle a \rangle \times \{1\}\) has only 2 ends. For a diagram of a portion of the right Cayley graph of \(\langle a \rangle \times \{0,1\}\) see Fig. 2.
Following Theorem 4.3 one might question whether for a left cancellative semigroup it is possible to show that the end poset of a subsemigroup of finite Green index is isomorphic to the end poset of the semigroup. The following example answers this in the negative.
Example 5.4
Consider the semigroup \(S=\mathbb {Z}\times \mathbb {Z}\times \mathbb {N}_0\) under componentwise addition. The subsemigroup \(T=\mathbb {Z}\times \mathbb {Z} \times (\mathbb {N}_0\setminus \{1\})\) is of finite Green index as the complement consists of 1 \(\mathcal {H}^T\)class. One can see that S has \(\aleph _0\) ends corresponding to each \(\mathbb {Z}\times \mathbb {Z}\times \{i\}\) and to \(\{0\}\times \{0\}\times \mathbb {N}_0\). In the poset of ends of S any two elements are comparable. Either by inspection or by Theorem 4.3 we see that T also has \(\aleph _0\) ends. However, there are no paths from \(\mathbb {Z}\times \mathbb {Z}\times \{2\}\) to \(\mathbb {Z}\times \mathbb {Z}\times \{3\}\) or vice versa and hence the ends in these components cannot be comparable.
The following proposition describes the left and right end posets of Rees matrix semigroups. As a corollary we see that for any \(n,m\in \mathbb {N}\) there exists a semigroup with n left ends and m right ends.
Recall a Rees matrix semigroup \(\mathcal {M}[G;I,\Lambda ;P]\) has elements \(I\times G \times \Lambda \) where G is a group and I and \(\Lambda \) are index sets. Multiplication is defined by \((i,g,\lambda )(j,h,\mu )=(i,gp_{\lambda j}h,\mu )\) where \(P=(p_{\lambda j})_{\lambda \in \Lambda ,j\in I}\) is a \(\Lambda \times I\) matrix over G.
Proposition 5.5
If S is the Rees matrix semigroup \(\mathcal {M}[G;I,\Lambda ;P]\) where \(I=\{i_1,i_2, \ldots , i_n\}\) and \(\Lambda =\{\lambda _1,\lambda _2, \ldots \lambda _m\}\), G is a finitely generated group and P is a \(m\times n\) matrix with entries in G then the right ends of S form an antichain of size \(n\cdot \Omega G\) and the left ends of S form an antichain of size \(m\cdot \Omega G\).
Proof
Let X be a finite semigroup generating set for G containing \(1_G\) and let
Clearly A is a finite generating set for S.
Let \(\Gamma _i\) be the induced subgraph of \(\Gamma _r(S,A)\) on the vertices \(\{i\} \times G \times \Lambda \) and let \(\Gamma _{\lambda ,i}\) be the subgraph of \(\Gamma _i\) with vertices \(\{i\} \times G \times \{\lambda \}\) and edges with labels \((i,p_{\lambda ,i}^{1}x,\lambda )\). As \((i,g,\lambda )(j,h,\mu )=(i,gp_{\lambda ,j}h,\mu )\) note that \(\Gamma _r(S,A)\) is the disjoint union of the \(\Gamma _i\). This means that \(\Omega \Gamma _r(S,A)\) is n incomparable copies of \(\Omega \Gamma _i\). As all ends in \(\Omega G\) are incomparable it suffices to show that \(\Omega \Gamma _i\) is isomorphic to \(\Omega G\) for all \(i \in I\).
We first note that for a fixed \(\lambda \in \Lambda \), \(\Gamma _{\lambda ,i}\) is isomorphic to \(\Gamma _r(G,X)\). We now prove that any ray in \(\Gamma _i\) is equivalent to a ray in \(\Gamma _{\lambda ,i}\), the proof for antirays is analogous. Let \(\mathbf {r}=((i,g_0,\lambda _{j_0}),(i,g_1,\lambda _{j_1})\ldots )\) be a ray and let \(\mathbf {r'}=((i,g_0,\lambda ),(i,g_1,\lambda )\ldots )\) be a sequence in \(\Gamma _{\lambda ,i}\). We show that there is an infinite walk \(\mathbf {w}\) in \(\Gamma _{\lambda ,i}\) containing \(\mathbf {r'}\) in which every vertex appears finitely often.
We construct \(\mathbf {w}\) by concatenating the shortest paths in \(\Gamma _{\lambda ,i}\) between each \((i,g_k,\lambda )\) and \((i,g_{k+1},\lambda )\). These shortest paths exist because \(\Gamma _{\lambda ,i}\) is isomorphic to \(\Gamma (G,X)\). Next we show that there is a global bound on the lengths of these shortest paths. If \((i,g,\mu )=(i,h,\nu ) (j,p_{\xi ,k}^{1}x,\pi )\) then it follows \(\mu =\pi \) and \(g=hp_{\nu ,j}p_{\xi ,k}^{1}x\). This means the shortest path in \(\Gamma _{\lambda ,i}\) between any consecutive elements of \( \mathbf {r'}\) is of length less than or equal to \(K=\max \{p_{\mu ,j}p_{\nu ,k}^{1}_X:j,k\in I, \mu ,\nu \in \Lambda \}+1\). As \(\mathbf {r}\) is a ray it follows there are at most \(\Lambda \) repetitions of vertices in \( \mathbf {r'}\). Every vertex of \(\mathbf {w}\) has a path of length less than K to a vertex of \(\mathbf {r'}\) and as \(\Gamma _{\lambda ,i}\) is outlocally finite this means that if some vertex v appears infinitely often in \(\mathbf {w}\) then infinitely many elements of \(\mathbf {r'}\) can be reached from v by a path of length less than or equal to K. But each vertex in \(\mathbf {r'}\) appears at most \(\Lambda \) times so any infinite set of elements of \(\mathbf {r'}\) contains infinitely many vertices, a contradiction. By Lemma 1.3, \(\mathbf {w}\) contains a ray \(\mathbf {s}\) with infinitely many disjoint paths from \(\mathbf {s}\) to and from \(\mathbf {r'}\) and hence to and from \(\mathbf {r}\).
This means any ray in \(\Gamma _i\) is equivalent to a ray in \(\Gamma _{\lambda ,i}\). To complete the proof we must now verify that if we have rays \(\mathbf {r}_1\) and \(\mathbf {r}_2\) in \(\Gamma _{\lambda ,i}\) such that \(\mathbf {r}_1 \not \preccurlyeq \mathbf {r}_2\) then \(\mathbf {r}_1 \not \preccurlyeq \mathbf {r}_2\) in \(\Gamma _i\). Let \(\mathbf {r}_1\) and \(\mathbf {r}_2\) be incomparable rays in \(\Gamma _{\lambda ,i}\). As the rays are incomparable in \(\Gamma _{\lambda ,i}\) there exists a finite set \(F=\{(i,f_1,\lambda ),\ldots ,(i,f_m,\lambda )\}\) such that all paths from \(\mathbf {r}_1\) to \(\mathbf {r}_2\) in \(\Gamma _{\lambda ,i}\) pass through F. For any edge \(((i,g,\mu ),(i,gp_{\mu ,j}p_{\nu ,k}^{1}x,\xi ))\) we have a word \(w=x_1x_2\ldots x_p\) over X of minimal length such that \(w=_G p_{\mu ,j}p_{\nu ,k}^{1}x\) and a corresponding path
This means that any path in \(\Gamma _i\) has a corresponding walk in \(\Gamma _{\lambda ,i}\) such that any point on the walk has a path of length less than \(K+2\) to a vertex on the path in \(\Gamma _i\). This means any path \(\pi \) from \(\mathbf {r}_1\) to \(\mathbf {r}_2\) in \(\Gamma _i\) has a corresponding walk in \(\Gamma _{\lambda ,i}\) and this must pass through F and hence \(\pi \) must contain an element that can be reached from F by a path of length less than or equal to \(K+2\). As \(\Gamma _i\) is outlocally finite there are only finitely many such elements so \(\mathbf {r}_1 \not \preccurlyeq \mathbf {r}_2\). \(\square \)
References
 1.
Book, R.V., Otto, F.: Stringrewriting systems, Texts and monographs in computer science. SpringerVerlag, Berlin (1993)
 2.
Cain, A.J., Gray, R., Rǔskuc, N.: Green index in semigroups: generators, presentations and automatic structures. Semigroup Forum 85(3), 448–476 (2012)
 3.
Clifford, A.H., Preston, G.B.: The algebraic theory of semigroups, mathematical surveys, vol. 1. American Mathematical Society, Providence (1961)
 4.
Diestel, R.: Graph theory, 4th edn. SpringerVerlag, Berlin (2010)
 5.
Dunwoody, M.J.: The accessibility of finitely presented groups. Inventiones Mathematicae 81(3), 449–457 (1985)
 6.
Gray, R., Ruškuc, N.: Green index and finiteness conditions for semigroups. J. Algebra 320, 3145–3164 (2008)
 7.
Halin, R.: Über unendliche Wege in Graphen. Math. Ann. 157, 125–137 (1964)
 8.
Hoffmann, M., Thomas, R.M.: A geometric characterization of automatic semigroups. Theoretical Computer Sci. 369, 300–313 (2006)
 9.
Hopf, H.: Enden offener Räume und unendliche diskontinuierliche Gruppen. Comment. Math. Helv. 16, 81–100 (1944)
 10.
Jackson, D.A., Kilibarda, V.: Ends for monoids and semigroups. J. Aust. Math. Soc. 87, 101–127 (2009)
 11.
Johnson, M., Kambites, M.: Greens \({\cal J}\)order and the rank of tropical matrices. J. Pure Appl. Algebra 217, 280–292 (2013)
 12.
Kilibarda, V., Maltcev, V., Craik, S.: Ends for subsemigroups of finite index. Semigroup Forum 91, 401–414 (2015)
 13.
Macpherson, H.: Infinite distance transitive graphs of finite valency. Combinatorica 2, 63–69 (1982)
 14.
Muller, D.E., Schupp, P.E.: Contextfree languages, groups, the theory of ends, secondorder logic, tiling problems, cellular automaton and vector addition systems. Bull. AMS 4, 331–334 (1981)
 15.
Rees, D.: On the ideal structure of a semigroup satisfying a cancellation law. Quart. J. Math., Oxford Ser. 19, 101–108 (1948)
 16.
Remmers, J.H.: On the geometry of semigroups presentations. Adv. Math. 36, 283–296 (1980)
 17.
Robertson, N., Seymour, P., Thomas, R.: Excluding infinite minors. Discrete Math. 95, 303–319 (1991)
 18.
Ruškuc, N.: On large subsemigroups and finiteness conditions of semigroups. Proc. London Math. Soc. 76, 383–405 (1998)
 19.
Satyanarayana, M.: On left cancellative semigroups. Semigroup Forum 6, 317–329 (1973)
 20.
Wallace, A.D.: Relative ideals in semigroups. II. The relations of Green. Acta Math. Acad. Sci. Hungar 14, 137–148 (1963)
 21.
Zuther, J.: Ends in digraphs. Discrete Math. 184, 225–244 (1998)
Author information
Affiliations
Corresponding author
Additional information
Communicated by Victoria Gould.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Craik, S., Gray, R., Kilibarda, V. et al. Ends of semigroups. Semigroup Forum 93, 330–346 (2016). https://doi.org/10.1007/s0023301698149
Received:
Accepted:
Published:
Issue Date:
Keywords
 Digraph
 Ends
 Cayley graph