The algebra of rewriting for presentations of inverse monoids
N.D. Gilbert, E.A.McDougall

TL;DR
This paper develops a formal algebraic framework using groupoids to analyze rewriting systems for inverse monoid presentations, introducing pseudoregular groupoids and a novel approach to relation modules.
Contribution
It introduces a new formalism based on groupoids and the Squier complex for inverse monoids, including the concept of pseudoregular groupoids and a method to derive relation modules.
Findings
Defined pseudoregular groupoids as fundamental groupoids of the Squier complex.
Provided a free presentation of the relation module using properties of idempotent separating maps.
Constructed the module of identities via properties of pseudoregular groupoids.
Abstract
We describe a formalism, using groupoids, for the study of rewriting for presentations of inverse monoids, that is based on the Squier complex construction for monoid presentations. We introduce the class of pseudoregular groupoids, an example of which now arises as the fundamental groupoid of our version of the Squier complex. A further key ingredient is the factorisation of the presentation map from a free inverse monoid as the composition of an idempotent pure map and an idempotent separating map. The relation module of a presentation is then defined as the abelianised kernel of this idempotent separating map. We then use the properties of idempotent separating maps to derive a free presentation of the relation module. The construction of its kernel - the module of identities - uses further facts about pseudoregular groupoids.
Peer Reviews
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.
Taxonomy
TopicsGeometric and Algebraic Topology · semigroups and automata theory · Homotopy and Cohomology in Algebraic Topology
The algebra of rewriting for presentations of inverse monoids
N.D. Gilbert and E.A. McDougall
Department of Mathematics and the Maxwell Institute for the Mathematical Sciences, Heriot-Watt University, Edinburgh, EH14 4AS
[email protected] (corresponding author)
Abstract.
We describe a formalism, using groupoids, for the study of rewriting for presentations of inverse monoids, that is based on the Squier complex construction for monoid presentations. We introduce the class of pseudoregular groupoids, an example of which now arises as the fundamental groupoid of our version of the Squier complex. A further key ingredient is the factorisation of the presentation map from a free inverse monoid as the composition of an idempotent pure map and an idempotent separating map. The relation module of a presentation is then defined as the abelianised kernel of this idempotent separating map. We then use the properties of idempotent separating maps to derive a free presentation of the relation module. The construction of its kernel - the module of identities - uses further facts about pseudoregular groupoids.
Key words and phrases:
inverse monoid, presentation, groupoid, crossed module
2010 Mathematics Subject Classification:
Primary: 20M18, Secondary: 20L05, 20M50
Introduction
Inverse semigroups (and inverse monoids) comprise a class of algebraic structures that sit naturally between the class of semigroups and the class of groups, and are the natural candidates for semigroups that are structurally closest to groups. However, inverse semigroup presentations do not sit quite so naturally between semigroup presentations and group presentations, but have particular features that set them apart. For example, a finitely generated free inverse semigroup is not finitely presented as a semigroup [24], does not have a regular language of normal forms [8], and no free inverse monoid has context-free word problem [1].
In this paper we consider presentations of inverse monoids as rewriting systems, and attempt to replicate the formalism for describing rewriting in monoid presentations due to Squier [25, 26], and for group presentations due to Cremanns-Otto [6] and Pride [22]. Given a monoid presentation with generating set , Squier associates to a graph that has vertex set (the free monoid on ) and, for all , has an edge from to whenever is a relation in . A path in therefore corresponds to a chain of equivalences betwen words in as consequences of the relations in , and a homotopy relation is imposed to identify paths corresponding to such equivalences that are naturally considered to be essentially the same. If this homotopy relation is finitely generated, then is said to have finite derivation type. For monoid presentations of groups, a theorem of Squier [26, Theorem 4.3] shows that if one finite presentation of has finite derivation type then all finite presentations of do. The main result of [6] is that finite derivation type (for groups) is equivalent to the homological finiteness property .
An important component of the treatment of groups (given by monoid presentations) in [6] is the way in which free reductions are handled within the formalism. An approach based on the categorical algebra of monoidal groupoids and crossed modules, and refashioning the results of [22], was given in [9]. This approach is refined and extended in [11]. In any similar approach to presentations of inverse monoids, we encounter the problem of handling the Wagner congruence (see [27], for example), which defines the free inverse monoid as a quotient of a free monoid, and as mentioned above, is not finitely generated. To get around this problem , given a presentation of an inverse monoid , we define a –complex as in [14, 21] whose edges encode the applications of relations, and whose –cells impose an appropriate homotopy relation, but we take as vertex set an inverse monoid constructed canonically from . The presentation map from the free inverse monoid on to factors through , which has as an idempotent separating image. We then work with the fundamental groupoid of this –complex: the use of groupoids in this general setting originates with the work of Kilibarda [14]. As a groupoid whose set of identities is an inverse monoid, our fundamental groupoid is an example of a pseudoregular groupoid, whose properties are considered in section 2. We then aim to connect the structure of the fundamental groupoid with the relation module of : for group presentations the condition is equivalent to finite presentation of the relation module.
We define the relation module of in section 3. We take a more direct approach than in earlier work of the first author [10], since the relation module can now be naturally defined in terms of the map , and as in [10] we show that the relation module is isomorphic to the first homology of the Schützenberger graph of . In section 4 we establish the connection between the relation module and the fundamental groupoid of our –complex. We use an intermediate construction of a free crossed module of groupoids, and derive a free presentation of the relation module as an –module.
1. Background notions and notation
Our basic reference for the theory of inverse semigroups is Lawson’s book [16]. Aspects of the theories of groups and inverse semigroups are considered by side-by-side in [19]. We shall also make use of other algebraic constructions that may be less familiar, and we give brief introductions here.
1.1. Groupoids
A groupoid is a small category in which every morphism is invertible. We consider a groupoid as an algebraic structure (as in [12, 16]) whose elements are its morphisms, with a partial associative partial binary operation given by composition of morphisms. The set of vertices of is denoted , and for each vertex there exists an identity morphism . An element has domain and range in , with and . For the star of in is the set , and the local group at is the set .
Example 1.1**.**
Let be any set and let be an equivalence relation on . Then is a groupoid with vertex set , and with partial composition if . If we obtain the simplicial groupoid on .
Example 1.2**.**
Let be a topological space and a subspace of . Then the set of fixed-end-point homotopy classes of paths in with end-points in is a groupoid, the fundamental groupoid . We shall make use of the fundamental groupoid of a –complex , with its [math]–skeleton, in section 4.
Example 1.3**.**
An inverse semigroup may be considered as a groupoid , with equal to the set of idempotents of . The groupoid composition on is the restricted product on : the composition is defined if and only if , and then . This point of view is an important theme in [16].
1.2. Clifford Semigroups
Clifford semigroups constitute a class of inverse semigroups that will be of importance in the description of relation modules in section 3.
Let be a meet semilattice, and let be a family of groups indexed by the elements of . For each pair with , let be a group homomorphism, and suppose that the following two axioms hold:
- •
is the identity homomorphism on
- •
if then
The collection
[TABLE]
is a presheaf of groups over and the group operations on the make the disjoint union into an inverse semigroup, called a Clifford semigroup over , with binary operation
[TABLE]
where and .
Our description of relation modules in section 3 also depends on the factorization of an inverse semigroup homomorphism from a free inverse monoid as a composition of an idempotent pure map and an idempotent separating map. We recall the definitions of these types of map here:
Definition 1.1**.**
- (a)
A congruence on an inverse semigroup is said to be idempotent pure if and for some imply that . 2. (b)
A congruence on an inverse semigroup is said to be idempotent separating if and imply that .
Any inverse semigroup homomorphism induces a congruence on by
[TABLE]
We say that is idempotent pure (respectively, idempotent separating) if has this property. The kernel of an inverse semigroup homomorphism is the preimage of :
[TABLE]
We recall that any inverse semigroup has a maximum group image and that is –unitary if the quotient map is idempotent pure. Free inverse monoids are –unitary. See [16, section 2.4] for more properties of –unitary inverse semigroups.
The connection that we need between Clifford semigroups and idempotent separating maps is given by the following result (see [16, Lemma 5.2.2]).
Proposition 1.4**.**
If a homomorphism of inverse semigroups is idempotent separating then its kernel is a Clifford semigroup over .
1.3. Schützenberger graphs
We shall use left Schützenberger graphs in this paper. Let be an inverse semigroup generated by a set . There exists a presentation map from the free inverse semigroup on to . The (left) Schützenberger graph has vertex set , and for and , an –labelled edge from to whenever . The connected component containing the idempotent is the full subgraph on the vertex set , the –class of in . Some examples of Schützenberger graphs may be found in section 3.1.
1.4. Modules for inverse semigroups
Modules for inverse semigroups were first defined by Lausch [15].
Definition 1.2**.**
Let be an inverse semigroup with semilattice of idempotents . Consider a Clifford semigroup (see section 1.2), in which each is an additively written abelian group with identity . The disjoint union is a commutative inverse semigroup under the operation
[TABLE]
for and . Then is an –module [15, section 2] if there exists a map , written , such that
- (i)
for all and , 2. (ii)
for all and , 3. (iii)
for all and , 4. (iv)
for all and .
A free –module has as basis a family of sets , and is the free abelian group on the set
[TABLE]
with and with –action defined by , see [15, section 3].
Lemma 1.5**.**
Let be a surjective idempotent separating homomorphism with kernel . Then is an –module, with –action defined by for any with .
1.5. Crossed modules of groupoids
We now present the rudiments of the theory of crossed modules of groupoids. For further information we refer to [5], and for the use of crossed modules in the theory of group presentations to [2].
Definition 1.3**.**
Let be a groupoid with vertex set . Then a crossed -module
[TABLE]
consists of:
- (1)
a disjoint union of groups , indexed by , 2. (2)
a homomorphism of groupoids, 3. (3)
an action of on , denoted , such that an edge with and , acts on with .
The action of on satisfies
[TABLE]
Definition 1.4**.**
Consider a crossed –module
[TABLE]
along with a set and a function such that . Then is said to be the free crossed -module on if for any crossed –module
[TABLE]
and function such that there exists a unique morphism of crossed –modules such that .
We sketch the construction of free crossed modules: see [5, section 7.3].
Proposition 1.6**.**
[5*, Proposition 7.3.7]**
Given a groupoid , a set and a function such that , then a free crossed -module on exists and is unique up to isomorphism.*
Proof.
For each we define and
[TABLE]
We define to be the free group on , and . Then we have a map , defined on generators by , and an action of on , defined on generators by whenever . We let denote the subgroup of generated by the elements of the form , for . Then is normal in , invariant under the –action, and contained in the kernel of . So induces and this is a free crossed module on . Uniqueness follows from the usual universal argument.
We note that there exists a function induced by mapping to , and that .
1.5.1. Modules and crossed modules
Definition 1.5**.**
Consider a crossed module in which is trivial: that is, maps each to . We write . By CM2 each is then abelian, and is a –module. The concept of a free –module then follows: given a set and a function with , a –module is free on , if for any –module and function such that , there exists a unique morphism of –modules.
More generally, we have:
Proposition 1.7**.**
- (1)
Let be a crossed –module, and let be the quotient groupoid , with the natural map. Then is a –module, where for and with we have
[TABLE] 2. (2)
If is a free crossed module with basis then is a free –module with basis the image of the induced map .
Proof.
The claimed –action is well-defined, since if with , then for some , and then by CM2,
[TABLE]
Now let be an arbitrary -module, and consider the disjoint union of groups , where . We let act on by conjugation on each and via on . Let be the projection map: we claim that is a crossed –module. For and with we have:
[TABLE]
and for ,
[TABLE]
since is abelian. So is a crossed –module.
Now given , we define
[TABLE]
We note that , and so by freeness of , there is an induced morphism of crossed –modules, with . Composing with the second projection gives a morphism that factors through , and is easily seen to be a map of –modules.
The maps used in the proof are illustrated below.
[TABLE]
2. Semiregular and pseudoregular groupoids
We now introduce some additional structure on a groupoid, originating in work of Brown and Gilbert [3], and further developed by Gilbert in [9] and by Brown in [4].
Definition 2.1**.**
Let be a groupoid, with object set and domain and range maps . Then is semiregular if
- •
is a monoid, with identity ,
- •
there are left and right actions of on , denoted , , which for all and satisfy:
- (a)
; ; , 2. (b)
, 3. (c)
; ; ; , 4. (d)
; , whenever is defined, 5. (e)
.
From [9, section 1] we have the following facts.
Proposition 2.1**.**
- (a)
Let be a semiregular groupoid. Then there are two everywhere defined binary operations on given by:
[TABLE]
Each of the binary operations and make into a monoid, with identity . 2. (b)
The binary operation and the monoid structure on make the semiregular groupoid into a strict monoidal groupoid if and only if the operations and on coincide.
Definition 2.2**.**
In view of part (c) of Proposition 2.1, we say that a semiregular groupoid is monoidal if the operations and coincide. (Brown [4] calls such semiregular groupoids commutative whiskered groupoids.)
2.1. Pseudoregular groupoids
In considering presentations of inverse monoids, we shall want to consider semiregular groupoids in which the vertex set is an inverse monoid.
Definition 2.3**.**
A semiregular groupoid is a pseudoregular groupoid if is an inverse monoid.
The name pseudoregular is chosen to reflect the close structural connection between inverse monoids and pseudogroups, which are inverse semigroups of partial homeomorphisms of topological spaces (see [16, section 1.1]).
In a pseudoregular groupoid , the operations, and given in proposition 2.1(a) each make into a monoid, but not necessarily an inverse monoid, as we show in the next example.
Example 2.2**.**
Let be a crossed module of groups. Add a zero [math] to to form the inverse semigroup and let act on as the trivial endomorphism . The product is then a pseudoregular groupoid, with the following structure. The subset is a semiregular groupoid (see [9, Proposition 1.3(ii)]) with vertex set , with and , and with composition defined when . For the additional arrows in we define and composition and so the local group at [math] is a copy of . The left and right actions of are given by:
[TABLE]
Then is a crossed monoid (originally monoïde croisé) in the sense of Lavendhomme and Roisin [17, Example 1.3C], and is a pseudoregular groupoid , with vertex set . The –operation on recovers the semidirect product :
[TABLE]
and the operations and coincide, but is not inverse. This follows from the results of [20], but can also be seen directly, as follows.
For any , the element is an idempotent in :
[TABLE]
But for distinct we have
[TABLE]
and so the idempotents in do not commute. Since is a subgroup of and the other elements are idempotents, is regular (and indeed orthodox, since is a subsemigroup).
In a pseudoregular groupoid , it is natural to consider for each idempotent . The operation then makes into a semigroup. However, as the following example shows, the identity arrow at is not necessarly an identity element for .
Example 2.3**.**
Let be the semilattice with and consider the simplicial groupoid with vertex set , and and given by the projection maps. Let be the subgroupoid of defined by
[TABLE]
Right and left actions of on are defined by multiplication:
[TABLE]
making pseudoregular. The –operation is given by
[TABLE]
The star at [math] is , but the identity arrow is not an identity element in .
We can, however, remedy the problem illustrated in Example 2.3 by passing to a subsemigroup that does admit as an identity. For an idempotent we define
[TABLE]
It is clear that the operation now makes into a monoid with identity . The range map restricts to a semigroup morphism whose image is a monoid with identity . For we set and define
[TABLE]
Proposition 2.4**.**
In a pseudoregular groupoid , the binary operation and the groupoid composition coincide on and under each operation is a group. Furthermore if is monoidal, then is abelian, and the family of abelian groups , is a –module.
Proof.
For we have
[TABLE]
Since it is clear that is a subgroup of the local group at in the groupoid .
If is monoidal, then and coincide,and
[TABLE]
So is abelian. Now for we define by . Then for :
[TABLE]
and so each is a homomorphism. Furthermore, if then
[TABLE]
and clearly is the identity on . Therefore is a presheaf of abelian groups and a –action is now given by . It is easy to check that the conditions in Definition 1.2 for a Lausch –module are satisfied.
3. The relation module of an inverse monoid presentation
Let be a group generated by a set , with corresponding presentation map . Let be the kernel of : then conjugation in induces a –action on the abelianisation of , and is the relation module. As shown in [2, Corollary 5.1], the relation module is isomorphic to the first homology group of the Cayley graph .
In [10] the first author introduced relation modules for inverse monoid presentations by adapting work of Crowell [7] on group presentations. It was remarked in [10] that
Defining the relation module in this way permits the introduction of the concept in other algebraic settings where the operation of abelianisation has no obvious counterpart.
However, it turns out (as we shall see below) that we can indeed define the relation module of an inverse monoid presentation as the abelianisation of a certain Clifford semigroup, in a precise analogy of the construction for groups. We first describe a factorization result for inverse semigroups homomorphisms. Our discussion is based on [18, page 265], to which we refer for further details. The result originates in [23, Theorem 4.2].
Proposition 3.1**.**
Let be a congruence on the inverse semigroup . Then there exists a smallest congruence on whose trace is the same as the trace of , defined by
[TABLE]
Furthermore,
- (a)
For we have
[TABLE] 2. (b)
The canonical map is idempotent separating, 3. (c)
If is –unitary then the canonical map is idempotent pure.
Proof.
(a) We first show that the conditions (3.1) and (3.2) are equivalent. First assume that (3.1) holds and set . Then and, since we have
[TABLE]
Now if (3.2) holds, take . Since we have , and since we have . Similarly .
(b) Suppose that with and . By Lallement’s Lemma [13, Lemma 2.4.3], there exist with and . If now then , and so . Hence is idempotent separating.
(c) Suppose that, for and , we have . Then there exists with and , and if is –unitary, we have and so is idempotent pure.
We now consider an inverse monoid presentation of an inverse monoid . We set , and so is then a quotient of the free monoid , with canonical map , and also a quotient of the free inverse monoid , with associated presentation map . The Wagner congruence on induces the natural map , and , and we may factorize as in Proposition 3.1. We set and so have the commutative diagram
[TABLE]
Since is –unitary, the map is idempotent pure and we obtain from [18] the following structural information on .
Lemma 3.2**.**
[18*, Lemma 1.6]**
Let be a presentation of an inverse monoid . Then the following are equivalent:*
- (a)
the presentation map is idempotent pure. 2. (b)
* is equivalent to a presentation of the form where for some set and idempotents , of .* 3. (c)
Each Schützenberger graph, is a tree.
Definition 3.1**.**
An inverse monoid is arboreal [10] if it satisfies the conditions of Lemma 3.2.
Corollary 3.3**.**
An arboreal inverse monoid is –unitary.
Proof.
It follows from part (b) of Lemma 3.2 that has maximum group image and that the quotient map factorizes as . Since is idempotent pure and is surjective, the map is idempotent pure.
The factorization of shown in (3.3) gives us an idempotent separating homomorphism . By Proposition 1.4,
[TABLE]
is a Clifford semigroup, and so is a union of groups , indexed by the idempotents of . Hence has the natural abelianisation
[TABLE]
that is an –module by Lemma 1.5.
Definition 3.2**.**
The relation module of the presentation is the –module .
We now draw the connection between relation modules and Schützenberger graphs. For the left Schützenberger graph , the cellular chain group is the free abelian group on the –class in , and is the free abelian group on the set
[TABLE]
The boundary map maps . Now
[TABLE]
and
[TABLE]
and by defining
[TABLE]
we get an –module structure on each of and . The boundary map is then a map of –modules, and its kernel is an –module , with the group being the first homology group of the connected component containing .
For we define . Then is a submonoid of and is the reverse of the language accepted by the Schützenberger graph when regarded as an automaton with input alphabet and unique start/accept state , see [27]. (The reversal arises because we assume that as an automaton, reads input words from the left, but the action on states is by left multiplication in .) Let denote the fundamental group . A closed path in is labelled by a unique word whose reverse is in : we write for the homotopy class of in .
Lemma 3.4**.**
There is a group isomorphism mapping the homotopy class to , where is the reverse of and is the unique preimage in of .
Proof.
If then and
[TABLE]
Hence . To verify that is well-defined on , suppose that . Then can be obtained from by the insertion and deletion of subwords with . Considering one such step, if for some we have and then
[TABLE]
in the subgroup of : since the relation is trivial on , we deduce that , and so is well-defined.
Now for we have
[TABLE]
since is the identity of the group and . Hence is a homomorphism.
If we set to be any word in with . Then and so and . Therefore is surjective.
Now suppose that . Then , and since is –unitary, we deduce that . Since is idempotent pure, and is freely reducible to the empty word: hence the circuit at in labelled by is homotopic to the constant path at , and is trivial. Therefore is injective.
Theorem 3.5**.**
The –modules
[TABLE]
are isomorphic.
Proof.
We identify with to exploit Lemma 3.4: for each there is a group isomorphism . The action of on is induced by the family of maps , in which the image of a closed path in is mapped to the image of in , where (and so labels a path from to in ). We note that the isomorphism maps
[TABLE]
where is the unique element of with .
By Lemma 1.5, the –action on is induced by conjugation in : for with image ,
[TABLE]
for any with . We set . Then for ,
[TABLE]
using the fact that is idempotent separating. Therefore the diagram
[TABLE]
commutes, and the family of maps is an –module isomorphism.
3.1. Examples of relation modules
Example 3.6**.**
Let be the semilattice , generated as an inverse monoid by . The Schützenberger graph is
[TABLE]
and the relation module is therefore
[TABLE]
where all the structure maps are inclusions.
Example 3.7**.**
The bicyclic monoid is the inverse monoid presented by . The Schützenberger graph is the semi-infinite path
[TABLE]
The relation module is therefore trivial. This is no surprise: is an arboreal inverse monoid, and this Example illustrates Lemma 3.2.
Example 3.8**.**
Given an inverse monoid with presentation , we add a zero to to obtain . For we take the generating set (with ), and we have a presentation of given by
[TABLE]
In the Schützenberger graph there is a loop at [math] for each element of . If has relation module then the relation module of can be thought of schematically as
[TABLE]
where the map carries a circuit in labelled by a word to the element of determined by .
Example 3.9**.**
The symmetric inverse monoid on the set is generated by the transposition and the identity map on : then is the empty map , and The Schützenberger graph is
[TABLE]
The relation module is therefore
[TABLE]
4. The Squier complex of an inverse monoid presentation
In this section we show that we can obtain a presentation of the relation module , derived from an inverse monoid presentation with presentation map , from a free crossed module that is in turn derived from a Squier complex associated to .
Definition 4.1**.**
Let be an inverse monoid presentation of , with presentation map factorised as in (3.3), as
[TABLE]
with idempotent pure and idempotent separating. We write for : then the Squier complex of is the –complex constructed as follows.
- •
The vertex set is .
- •
The edge set consists of all -tuples with and . Such an edge will start at and end at , so each edge corresponds to the application of a relation from in . An edge path in therefore corresponds to a succession of such applications.
- •
The 2-cells correspond to applications of non-overlapping relations, and so a 2-cell is attached along every edge path of the form:
[TABLE]
This attachment of –cells makes the two edge paths between and homotopic in .
Proposition 4.1**.**
The fundamental groupoid is pseudoregular and monoidal.
Proof.
The actions of on single edges in given by
[TABLE]
induce a pseudoregular structure on the fundamental groupoid. The –cells of ensure that, if and are the homotopy classes of edge-paths of length in , then , and a straightforward induction extends this to arbitrary edge-paths.
It will be convenient in what follows to describe operations in the fundamental groupoid as being performed on edge-paths in rather than on fixed-end-point homotopy classes.
Let . Then has vertex set , which we recognise as one of the groups that make up the kernel of .
Lemma 4.2**.**
Let . Then is a group.
Proof.
The set is a monoid under the operation , and for we define
[TABLE]
where a superscript denotes the inverse in the inverse monoid and a superscript denotes the inverse in the groupoid . Now
[TABLE]
Since we have , and since and is a subgroup of with identity , then . So
[TABLE]
Similarly , and is a group.
Since we shall be working exclusively in the groupoid hereon, we shall abbreviate to .
Lemma 4.3**.**
Suppose that and set and . Then and
[TABLE]
Therefore in and : moreover and so .
Lemma 4.4**.**
A path can be written as a product of single edges in the group . Hence is generated by the subset of homotopy classes of single edges in , and these classes are represented by edges of the form with .
Proof.
The vertex set of the connected component of that contains is the group (with identity ), and for a path in this component we define
[TABLE]
If is a single edge and , then
[TABLE]
since . Then by Lemma 4.3, we have and so
[TABLE]
and .
Now if then
[TABLE]
and
[TABLE]
But and so and therefore . The Lemma then follows easily by induction on the length of a path.
Now suppose that a path with is a composition and that is the path
[TABLE]
for some path . Then
[TABLE]
Now if and then
[TABLE]
Hence if and are paths differing by a cancelling pair of edges in then in the group .
Now consider a –cell in the component of containing :
[TABLE]
with
[TABLE]
Then by Lemma 4.3, , and . Hence path homotopy induced by the above –cell in is equivalent to the relation
[TABLE]
(where above). These considerations show that:
Proposition 4.5**.**
Given and with , we set . Then the following are a set of defining relations for the group on the generating set :
[TABLE]
4.1. A crossed module from an inverse monoid presentation
As in Example 1.3, we regard as a groupoid (although we shall drop the arrow superscript hereon) with vertex set , and we define
[TABLE]
Proposition 4.6**.**
* is a crossed module of groupoids.*
Proof.
By Lemma 4.2, each is a group, and so is a disjoint union of groups indexed by , and is a groupoid with vertex set . Then is a groupoid homomorphism, and is the identity on .
An action of on is defined using the actions in the pseudoregular groupoid as follows: for and we define
[TABLE]
Then CM1 holds, since . For CM2, since the binary operations and on coincide by Proposition 4.1, then
[TABLE]
and
[TABLE]
So . Therefore is a crossed module of groupoids.
We shall now show that the crossed module is free, and give an explicit basis. To do this, we give a construction of a free crossed –module directly from an inverse monoid presentation of and show that it is isomorphic to the one in Proposition 4.6.
Suppose that , and set and . Then and so . Since is idempotent separating, for a unique with
[TABLE]
Hence and . So for we define
[TABLE]
and consider the set , along with the function which maps . Then
[TABLE]
with
[TABLE]
Since is idempotent separating, we conclude that . The free crossed -module with basis is then constructed as in Proposition 1.6.
Theorem 4.7**.**
The crossed –module is isomorphic to the free crossed –module .
Proof.
For , we retain the notation and . We define by . We then have , and so . Moreover,
[TABLE]
Therefore and by freeness of there exists a crossed module morphism mapping
[TABLE]
where and . We claim that is an isomorphism, and we verify this by constructing its inverse.
We define by , where is defined in Proposition 4.5. We consider the effect of this map on a defining relation
[TABLE]
as given in Proposition 4.5. We set and . Then
[TABLE]
In the group we have
[TABLE]
Now and so
[TABLE]
Since is idempotent separating, and therefore
[TABLE]
So in we have
[TABLE]
and induces a homomorphism that is the inverse of .
As a module for the groupoid , we see by Proposition 1.7 that is free, with basis function . However, we can say more.
Proposition 4.8**.**
* is the free –module on the –set in which .*
Proof.
The groupoid action of extends to one of . If with image , and with , then we define
[TABLE]
As a component of the free –module , the group is the free abelian group with basis
[TABLE]
which is the correct basis for as the free –module on the –set .
4.2. A presentation for the relation module
From an inverse monoid presentation of an inverse monoid we have now constructed a free crossed module and for each we have a crossed module of groups . Since is the vertex set of the component of containing , the map is surjective. By Propositions 2.4 and 4.1,
[TABLE]
is abelian and we have a short exact sequence of groups
[TABLE]
Lemma 4.9**.**
Each group is free, the sequence (4.2) splits and, and are isomorphic groups.
Proof.
The group is a subgroup of and the maximum group image map is idempotent pure. Its restriction therefore has trivial kernel and so is isomorphic to a subgroup of a free group and is free. By (1.2), acts trivially on and so the splitting of the sequence (4.2) induces an isomorphism .
Theorem 4.10**.**
Let be an inverse monoid presentation of an inverse monoid . There exists a short exact sequence of –modules
[TABLE]
in which is a free –module and is induced by .
Proof.
The –module structure on is given by Proposition 2.4, that on by Proposition 4.8, and that on by Lemma 1.5. Lemma 4.9 gives us, for each , a short exact sequence of abelian groups
[TABLE]
and these assemble into the sequence (4.3). It remains to check that is then a map of –modules.
Let with image , and let with . Then the action of on is defined by lifting to and acting on in the crossed module :
[TABLE]
where . Hence
[TABLE]
But and .
Acknowledgements
A version of these results is presented in the second author’s PhD thesis at Heriot-Watt University, Edinburgh. The generous financial support of a PhD Scholarship from the Carnegie Trust for the Universities of Scotland is duly and gratefully acknowledged.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] T. Brough, Word problem languages for free inverse monoids. In Descriptional complexity of formal systems , Lecture Notes in Comput. Sci. 10952, Springer (2018) 24-36.
- 2[2] R. Brown and J. Huebschmann, Identities among relations. In Low Dimensional Topology , R. Brown and T.L. Thickstun ( eds. ), London Math. Soc. Lect. Notes 48, Cambridge University Press (1982) 153-202.
- 3[3] R. Brown and N.D. Gilbert, Automorphism structures for crossed modules and algebraic models of 3-types. Proc. London Math. Soc. (3) 59 (1989) 51-73.
- 4[4] R. Brown, Possible connections between whiskered categories and groupoids, Leibniz algebras, automorphism structures and local-to-global questions. Journal of Homotopy and Related Structures, vol. 1(1), 2010, pp.1-13.
- 5[5] R. Brown, P.J. Higgins, and R. Sivera, Nonabelian algebraic topology. Filtered spaces, crossed complexes, cubical homotopy groupoids. EMS Tracts in Mathematics 15. European Mathematical Society (2011).
- 6[6] R. Cremanns and F. Otto, For groups the property of having finite derivation type is equivalent to the homological finiteness condition F P 3 𝐹 subscript 𝑃 3 FP_{3} . J. Symb. Comput. 22 (1996) 155-177.
- 7[7] R.H. Crowell, The Derived Module of a Homomorphism. Advances in Mathematics 6 (1971) 210-238.
- 8[8] A. Cutting and A. Solomon, Remarks concerning finitely generated semigroups having regular sets of unique normal forms. J. Aust. Math. Soc. 70 (2001) 293–309.
