Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups

We prove the following results: (1) There is a one-relator inverse monoid $\mathrm{Inv}\langle A\:|\:w=1 \rangle$ with undecidable word problem; and (2) There are one-relator groups with undecidable submonoid membership problem. The first of these results answers a problem originally posed by Margolis, Meakin and Stephen in 1987.


Introduction
The study of algorithmic questions in algebra has a long history which has its origins in fundamental problems in logic and topology investigated in the beginning of the 20th century by Thue, Tietze, and Dehn. One of the most fundamental algorithmic questions concerning algebraic structures is the word problem, which asks whether two terms written over generators represent the same element of the structure. Markov and Post proved independently that the word problem for finitely presented monoids is undecidable in general. This result was later extended to groups by Novikov and Boone (see e.g. [3,22] and the references therein). It is therefore natural to ask for which classes of monoids and groups the word problem is decidable. Many interesting families of finitely presented groups and monoids are known to have decidable word problem, such as hyperbolic groups (in the sense of Gromov), automatic groups and monoids, and monoids and groups which admit presentations by finite complete rewriting systems; see [3,5,9,22]. It is natural to imagine that the word problem might be decidable for groups or monoids which are, in some sense, close to being free. The class of one-relator groups falls into this category, and it is a consequence of classical work of Magnus [23] that the word problem is decidable for one-relator groups.
In contrast, it is still not known whether the word problem is decidable for one-relator monoids, that is, monoids defined by presentations of the form Mon A|u = v where A is a finite alphabet and u and v are words in the free monoid A * . This is one of the most important and fundamental longstanding open questions in this area. While this problem remains open in general, it has been solved in a number of special cases in work of Adjan [1], Adjan and Oganessian [2], and Lallement [17]. In particular, in [1] Adjan proved that the word problem for one-relator monoids of the form Mon A | w = 1 is decidable.
More recently, Ivanov, Margolis and Meakin [13] discovered an entirely new approach to the word problem for one-relator monoids, which uses ideas from the theory of inverse monoids. Inverse monoids are a class that lies between groups and general monoids. While groups are an algebraic abstraction of permutations, and monoids of arbitrary mappings, inverse monoids correspond to partial bijections and provide an algebraic framework for studying partial symmetries of structures. Utilising [2], Ivanov, Margolis and Meakin made the fundamental observation that a positive solution to the word problem for one-relator inverse monoid presentations of the form Inv A | w = 1 would imply a positive solution to the word problem for arbitrary one-relator monoids Mon A | u = v ; see [13,Thoerem 2.2]. This result motivated subsequent work investigating the question of whether all one-relator inverse monoids of the form Inv A | w = 1 have decidable word problem. This problem has now been shown to have a positive answer in several cases including when w is: an idempotent word [27], a sparse word [11], a one-relator surface group relation, a Baumslag-Solitar relation, or a relation of Adjan type; see [13,26] and [29,Section 7]. Here w ∈ (A ∪ A −1 ) * is called an idempotent word if it freely reduces to the identity element in the free group F G(A). It is important to note that for inverse monoid presentations one cannot assume that the word w in the defining relation w = 1 is a reduced word. For example, the presentations Inv a | and Inv a | aa −1 = 1 define different monoids, the first being the free inverse monoid of rank one, and the second being the well-known bicyclic monoid (see for instance [12,Section 1.6]).
There are several places in the literature where it is mentioned that the problem of whether inverse monoids of the form Inv A|w = 1 have decidable word problem remains unsolved; see e.g. [25,Section 2.3], [11,29]. The first place this question appears in the literature is in the paper [28] of Margolis, Meakin and Stephen. Indeed, in [28, Conjecture 2] the following conjecture is stated: "If M = Inv A|w = 1 , then the word problem for M is decidable." The first main goal of this paper is to give some new constructions and use them to prove that, in general, this conjecture does not hold. The first main result of this paper is: There is a one-relator inverse monoid Inv A | w = 1 with undecidable word problem.
We shall establish Theorem A by first proving some new results concerning the submonoid membership problem in one-relator groups. There are a number of different membership problems that have been investigated in group theory. The most natural such problems are the subgroup membership problem (also called the generlised word problem), the rational subset membership problem, and the submonoid membership problem. The subgroup membership problem for finitely generated groups asks: Given a finite subset X of a group G and an element g ∈ G, does g belong to the subgroup of G generated by X? The submonoid and rational subset membership problems are defined analogously; see Section 2 below for formal definitions of these decision problems. The subgroup membership problem is a natural generalisation of the word problem. Mihailova showed that the direct product of two copies of the free group of rank two contains a finitely generated subgroup in which the membership problem is undecidable; see [22,Chapter IV]. On the other hand, the subgroup membership problem is decidable for free groups, and for free abelian groups. In fact, for these two classes the more general rational subset membership problem is known to be decidable as a consequence of results of Benois and Grunschlag; see e.g. [18] for further background and references. The submonoid membership problem, and rational subset membership problem, for groups have been investigated in detail in a series of papers of Lohrey and Steinberg; see e.g. [19,20].
In this paper we shall be specifically interested in membership problems in one-relator groups. Since Magnus's fundamental work, many interesting results about one-relator groups have been proved; see [22, Chapter II, Section 5]. One-relator groups are still an active topic of research, with recent results including e.g. [21,32,37]. Several important algorithmic problems remain open for one-relator groups including the conjugacy problem, isomorphism problem, and the subgroup membership problem; see [4,Problem 18 and Problem 19]. Not much is known in general about the subgroup membership problem for one-relator groups. Magnus's original solution to the word problem [23] showed that membership is decidable in subgroups generated by subsets of the generating set. Pride [31] showed that membership can be decided in certain subgroups of two-generated one-relator groups. The second main result of this paper concerns the more general question of whether the submonoid membership problem is decidable in one-relator groups. Specifically, we shall prove the following result.
Theorem B. There are one-relator groups with undecidable submonoid membership problem.
In fact we show that there is a one-relator group with a fixed finitely generated submonoid in which membership is undecidable.
A corollary of Theorem B is that the rational subset membership problem is undecidable for one-relater groups in general. Theorem B will be used to prove Theorem A, but we stress that Theorem A is not an immediate corollary of Theorem B. A new construction is needed which encodes the submonoid membership problem from Theorem B into the word problem of a one-relator inverse monoid.
The general fact that there is a connection between the word problem in inverse monoids, and the submonoid membership problem for groups, is something that was first observed by Ivanov, Margolis and Meakin in [13]. Their result [13,Theorem 3.3] implies that in the case that the monoid Inv A|w = 1 is E-unitary (this will be defined in Section 3) it has decidable word problem if its maximal group homomorphic image Gp A | w = 1 has decidable prefix membership problem. They also prove that if w is a cyclically reduced word then Inv A | w = 1 is E-unitary. These results have subsequently been applied to solve the word problem for certain families of E-unitary one-relator inverse monoids Inv A | w = 1 ; see [13,26,29,15].
Theorem B arose from consideration of the natural question of which right-angled Artin groups arise as subgroups of one-relator groups. Given any finite graph the associated right-angled Artin group is the group defined by a presentation with generating set the vertices of the graph, and defining relations specifying that two generators commute if they are joined by an edge in the graph. These groups are also known as graph groups, and partially commutative groups. They were originally introduced by Baudisch, and since then this class has attracted a lot of attention in geometric group theory; see [6,36]. There are known interesting connections between one-relator groups and right-angled Artin groups, for example right-angled Artin groups arise in Wise's solution to Baumslag's conjecture about residual finiteness of one-relator groups; see [37].
Clearly right-angled Artin groups give a common generalisation of free groups, where the defining graph has no edges, and free abelian groups, where the graph is complete. Now by Magnus's Freiheitssatz free groups occur commonly and naturally as subgroups of one-relator groups. On the other hand not all free abelian groups embed in one-relator groups. Moldavanski [30] proved that a non-cyclic abelian subgroup of a one-relator group is either free abelian of rank two, or is locally cyclic. In particular, this answers the question of which finitely generated abelian groups embed in one-relator groups. In light of these results, it is not unreasonable to ask more generally which finitely generated right-angled Artin groups arise as subgroups of one-relator groups. In this paper we shall show that for any finite forest F the right angled Artin group A(F ) embeds into a one-relator group. When combined with results of Lohrey and Steinberg from [19], the existence of one-relator groups embedding these right-angled Artin groups will allow us to prove Theorem B.
The paper is structured in the following way. In Section 2 we give some basic background and definitions concerning right-angled Artin groups, we show that A(F ) embeds into a one-relator group for any finite forest F , and then we use this to prove Theorem B (see Theorem 2.4). We begin Section 3 with some preliminaries on the theory of inverse monoid presentations. Then we give a new general construction in Theorem 3.8, which is then combined with Theorem B in order to prove Theorem A (see Theorem 3.9). We conclude the paper in Section 4 with a discussion of some open problems and directions for possible future research.

One-relator groups with undecidable submonoid membership problem
We assume that the reader has familiarity with basic notions from group theory; see e.g. [22]. The necessary background on the theory of inverse monoids will be covered in the beginning of Section 3. A more detailed account of combinatorial inverse semigroup theory may be found in [29].
Right-angled Artin subgroups of one-relator groups. Since later we shall be working both with inverse monoid presentations, and group presentations, to avoid any confusion we shall use Gp A | R to denote the group defined by the presentation with generators A and defining relations R. Let Γ be a finite simplicial graph with vertex set V Γ and edge set EΓ. So EΓ is a set of two-element subsets of V Γ. The right-angled Artin group A(Γ) associated with the graph Γ is the group defined by the presentation Given a finite simplicial graph Γ, and an isomorphism ψ : ∆ 1 → ∆ 2 between two finite induced subgraphs of Γ, we use A(Γ, ψ) to denote the HNNextension of A(Γ) with respect to the isomorphism between the subgroups A(∆ 1 ) and A(∆ 2 ) of A(Γ) that is induced by ψ. This is a well-defined HNNextension since by standard results on right-angled Artin groups (see for example [6]) the subgroups A(∆ 1 ) and A(∆ 2 ) each naturally embed into A(Γ), and thus ψ induces an isomorphism between A(∆ 1 ) and A(∆ 2 ). Therefore, by the HNN-extension A(∆, ψ) of A(∆) with respect to ψ : ∆ 1 → ∆ 2 we mean the group defined by the presentation By standard results on HNN-extensions, the group A(Γ) embeds naturally into this HNN-extension A(Γ, ψ). Let P n denote the path with n vertices. The next result shows how this construction can be used to embed A(P 4 ) into a one-relator group.
Furthermore, A(P 4 ) embeds into this one-relator group via the mapping in- Proof. The group A(P 4 ) is defined by the presentation and A(P 4 , ψ) is defined by the presentation We now perform some Tietze transformations to show this is the one-relator group given in the statement of the proposition. Eliminating the redundant generators d, c and b, in this order yields The last two relations are consequences of the first, obtained via conjugation by t, and therefore they are redundant and can be removed. This shows that Since A(P 4 ) embeds naturally in the HNN-extension A(P 4 , ψ), this completes the proof.
In [16,Theorem 1.8] it is shown that if F is any finite forest then A(F ) embeds into A(P 4 ). Combined with the above proposition this gives the following result.
Theorem 2.2. For any finite forest F , the right angled Artin group A(F ) embeds into a one-relator group. Remark 2.3. While it is not important for the main results of this paper, it is still perhaps worth noting that there is some evidence that the converse of this result is also true, that is, there is evidence that a right-angled Artin group A(Γ) embeds into some one-relator group if and only if Γ is a forest. Indeed, suppose that A(Γ) embeds into a one-relator group. Seeking a contradiction suppose Γ is not a forest and let C n with n > 2 be the smallest cycle which embeds into Γ as an induced subgraph. It follows from [30] that the only finitely generated free abelian groups that embed into one-relator groups are Z and the free abelian group of rank 2. It follows that Γ is triangle free, that is, n = 3. On the other hand, Droms [8] proved that A(Γ) is coherent if and only if every circuit in Γ of length more than 3 has a chord. Thus if A(Γ) is coherent then for all k ≥ 4 the cycle C k does not embed into A(Γ) as an induced subgraph. It is an open question whether all one-relator groups are coherent, but if they all are then it would then follow that n cannot take any value greater than 3, and we could conclude that Γ is a forest. In related work, it has recently been proved that one-relator groups with torsion are coherent; see [21]. Of course it seems probable that if the converse of Theorem 2.2 is true it might be deduced without reference to the question of coherence of one-relator groups. Since this converse is not needed for the main results in this article we shall not explore it further in this paper.
Undecidability of the submonoid membership problem. Throughout we shall use A * to denote the free monoid over the alphabet A, and we use A + to denote the free semigroup. Let G be a finitely generated group with a finite group generating set X. This means that X ∪ X −1 is a monoid generating set for G and there is a canonical monoid homomorphism π : (X ∪ X −1 ) * → G. The submonoid membership problem for G is the following decision problem: This generalises the subgroup membership problem, also called the generalised word problem, for G which takes the same input but asks whether π(w) ∈ π((W ∪ W −1 ) * ), that is, whether w belongs to the subgroup generated by W . The submonoid membership problem is itself a special case of a more general problem called the rational subset membership problem where the input is a finite automaton A over X, and the question is whether π(w) ∈ π(L(A)) where L(A) is the language recognised by A. Alternatively, the class of rational subsets of a group is the smallest class that contains all finite subsets, and is closed with respect to the operations of union, product, and taking the submonoid generated by a set. We shall not be working with finite automata or regular languages in this paper. We refer the reader to [18] for more details on the rational subset membership problem for groups. There are non-uniform variants of these decision problems as well, where the subset of the group is fixed. Given a fixed subset S of G the membership problem for S within G is the decision problem with input a word w ∈ (X ∪ X −1 ) * and question: π(w) ∈ S?
We may now state and prove the main result of this section.
Theorem 2.4. Let G be the one-relator group Gp a, t | atat −1 a −1 ta −1 t −1 = 1 . Then there is a fixed finitely generated submonoid M of G such that the membership problem for M within G is undecidable.
Proof. It was proved in [19,Theorem 7] that there is a fixed finitely generated submonoid N of A(P 4 ) such that the membership problem for N within A(P 4 ) is undecidable. Let θ be an the embedding of A(P 4 ) into G given in Proposition 2.1, and let M be the image of N under this embedding.
Then it follows that M is a finitely generated submonoid of G such that the membership problem for M within G is undecidable.
Since any finitely generated submonoid of a group is a rational subset we obtain the following corollary.
Corollary 2.5. There are one-relator groups with undecidable rational subset membership problem.
It would be interesting to try to classify those one-relator groups for which the rational subset membership problem is decidable. Similarly, it would be interesting to characterise the one-relator groups with decidable submonoid membership problem. As mentioned in the introduction, whether there are one-relator groups with undecidable subgroup membership problem also remains as an interesting open problem; see [4,Problem 18] .

One-relator inverse monoids with undecidable word problem
In this section we shall introduce a new construction which, when combined with the results from Section 2, will be used to construct one-relator inverse monoids of the form Inv A | w = 1 with undecidable word problem. Before giving the construction and results, we first recall some background on free inverse monoids and inverse monoid presentations. For basic concepts from semigroup theory we refer the reader to [12].
Preliminaries on inverse monoid presentations. An inverse monoid is a monoid M such that for every m ∈ M there is a unique element m −1 ∈ M satisfying mm −1 m = m and m −1 mm −1 = m −1 . The element m −1 is called the inverse of m. It follows from the definition that for all x, y ∈ M we have x = xx −1 x, (x −1 ) −1 = x, (xy) −1 = y −1 x −1 , and xx −1 yy −1 = yy −1 xx −1 . In fact, inverse monoids form a variety of algebras, in the sense of universal algebra, defined by these identities together with associativity. It follows from this that free inverse monoids exist. For any set A the free inverse monoid F IM (A) generated by A may be concretely described in the following way. Let A −1 = {a −1 : a ∈ A} be a set of formal inverses of the letters from A, where we assume the sets A and A −1 are disjoint. Given any word x for all x ∈ A, and we set 1 −1 = 1. Let ν be the congruence on (A ∪ A −1 ) * generated by the set We call ν the Vagner congruence on (A ∪ A −1 ) * . The free inverse monoid F IM (A) on alphabet A is then isomorphic to (A ∪ A −1 ) * /ν. For the rest of this article we identify F IM (A) with (A ∪ A −1 ) * /ν. The inverse monoid defined by the presentation Inv A | u i = v i (i ∈ I) , where u i , v i ∈ (A ∪ A −1 ) * for i ∈ I, is defined to be the quotient of the free inverse monoid F IM (A) determined by these defining relations. Therefore, Inv The theory of inverse monoid presentations has developed significantly over the last few decades. The word problem for free inverse monoids was solved by Scheiblich and Munn; see [12,Chapter 5]. That work shows that the elements of F IM (X) may be represented by finite connected subgraphs of the Cayley graph of the free group F G(X), which are now commonly known as Munn trees. Other important work for the study of the word problem for finitely presented inverse monoids are the automata-theoretic methods introduced by Stephen in [33]. We shall not need the details of Stephen's theory in this article, but they are needed in the original proofs of some of the background results which we use, most notably Proposition 3.7 below. For an excellent overview of Stephen's techniques and results see [13, Section 2] and [29].
Throughout this section M will always denote an inverse monoid defined by a finite presentation Inv A | R and G will be used to denote the maximal group homomorphic image Gp A | R of M . If U and V are monoids we write U ≤ V to mean that U is a submonoid of V . Given any subset W of (A ∪ A −1 ) * , by the submonoid of M generated by W we shall mean the submonoid of M generated by the subset Our main interest in this article will be inverse monoids defined by presentations of the form Inv A | r i = 1 (i ∈ I) .
If M is the monoid defined by this presentation then the maximal group image G of M is the group defined by the presentation Gp A | r i = 1 (i ∈ I) .
We use F G(A) to denote the free group over A. We identify F G(A) with the set of freely reduced words in (A ∪ A −1 ) * . For any word w ∈ (A ∪ A −1 ) * we use red(w) to denote the word obtained by freely reducing w. It is well known, and straightforward to prove, that a word e ∈ (A ∪ A −1 ) * represents an idempotent in the free inverse monoid F IM (A) if and only if red(e) = 1 in F G(A). We call words in (A∪A −1 ) * with this property idempotent words. For a word w ∈ (A ∪ A −1 ) * we use pref(w) to denote the set of all prefixes of w. So If X is a subset of a monoid then we use Mon X to denote the submonoid generated by X.  Proof. Since ab is right invertible it follows that abb −1 a −1 = 1. Since idempotents commute in an inverse monoid, right multiplying by a then gives a = a(bb −1 )(a −1 a) = a(a −1 a)(bb −1 ) = abb −1 .  Inv A | e = 1, r 1 = 1, r 2 = 1, . . . , r m = 1 are equivalent, that is, the identity map on (A ∪ A −1 ) * induces an isomorphism between the inverse monoids defined by these two presentations.
Proof. Clearly all of the defining relations in the first presentation are consequences of the defining relations in the second presentation. For the converse, from Corollary 3.2 it follows that r 1 = er 1 is a consequence of the defining relations in the first presentation, and from this it then follows that r 1 = er 1 = 1 and hence e = 1 is also a consequence of the defining relations.
Construction and application to one-relator inverse monoids. We shall use H * K to denote the free product of two groups H and K, where we assume H ∩ K = ∅. A reduced sequence of length n is a list g 1 , g 2 , . . . , g n (n ≥ 0) such that g i = 1 for all 1 ≤ i ≤ n, each g i belongs to one of the factors H or K, and g i ∈ H if and only if g i+1 ∈ K for all 1 ≤ i ≤ n − 1. It is standard basic result that each element of H * K can be uniquely written as g 1 . . . g n where g 1 , . . . , g n is a reduced sequence; see [22,Chapter IV]. Below we shall refer to this as the normal form theorem for free products of groups. The length of an element of H * K is defined to be the length of the unique reduced sequence representing that element. Then S, T and N are submonoids of H * F G(t) such that S is the disjoint union T ∪ N , and T is an ideal of S. This holds since {t, t 2 , t 3 , . . .} is an ideal of the monoid {1, t, t 2 , t 3 , . . .} and the preimage of an ideal, with respect to a surjective homomorphism, is itself an ideal.
Since H ∪tHt −1 ⊆ N it follows that V ⊆ N . As t is in T , and T is disjoint from N , it follows that t ∈ U \ V . Thus U \ V is non-empty. Let z ∈ U \ V .
Since z ∈ V it follows that x j = t for some j, but then since T is an ideal of S, and t ∈ T , it follows that z ∈ T . This proves that U \ V ⊆ T . Note also that Since T is an ideal of S it then follows that U \ V is an ideal of U .
The following lemma is a straightforward exercise. Lemma 3.5. Let T be a submonoid of a monoid S such that S \ T is an ideal of S. Then for any subset X ⊆ S we have Mon X ∩ T = Mon X ∩ T .
The next result will be needed for the proof of Theorem 3.8 below.
Since tht −1 ∈ Mon H ∪ tT t −1 , and by assumption tht −1 = 1, we can write Since each of H and tT t −1 is a submonoid of H * F G(t) we can combine adjacent terms in this product if they both belong either to H or both to tT t −1 , and we can remove any resulting terms that are equal to 1. Repeating this if necessary, we can write tht −1 = s 1 s 2 . . . s n (⋄) where n ≥ 1, each s i belongs to H ∪ tT t −1 , where s i = 1 for all 1 ≤ i ≤ n and s i ∈ H ⇔ s i+1 ∈ tT t −1 for all 1 ≤ i ≤ n − 1. By the normal form theorem for free products of groups applied to the free product H * F G(t), at least one of the terms s i must belong to tT t −1 . If n > 1 then either s i+1 ∈ H or s i−1 ∈ H but in both cases this would imply that s 1 s 2 . . . s n has length at least four in the free product H * F G(t). But this contradicts (⋄) since tht −1 has length three in H * F G(t). We conclude that n = 1 and s 1 ∈ tT t −1 . (An alternative way to see this is to observe that the submonoid Mon H ∪ tT t −1 of the group H * F G(t) is in a natural way isomorphic to the free product H * T of the monoids H and T .) This implies tht −1 ∈ tT t −1 and thus h ∈ T , completing the proof of the lemma.
The following result is an important basic consequence of Stephen's procedure (see [33]). Proof. This result follows from the argument given in the second paragraph of the proof of [13,Proposition 4.2]. We note that the statement [13,Proposition 4.2] actually carries the additional assumption that the defining relators are cyclically reduced words. However, this is not used in their proof, and the result holds with that assumption removed. Alternatively, this proposition can be seen to be a corollary of [34,Theorem 3.2].
Given a finite list of words u 1 , . . . , u m ∈ (A ∪ A −1 ) * we define . This is clearly an idempotent word. The following result gives a general construction which will later be used to construct one-relator inverse monoids with undecidable word problem.
is a group and thus is E-unitary. It is well-known that free inverse monoids are E-unitary (see for example [27,Theorem 1.1]) so in particular the monoid Inv t | is E-unitary.
In [14,Proposition 7.1] Jones proves that the free product of two Eunitary inverse semigroups is again an E-unitary inverse semigroup. Jones's result can be applied to prove that the free product of two E-unitary inverse monoids is again an E-unitary inverse monoid. Alternatively, this fact can be deduced as a corollary of a result of Stephen [35,Theorem 6.5] which gives sufficient conditions for the amalgamated free product of two E-unitary inverse semigroups to again be E-unitary. To apply Stephen's result one observes that the free product of two inverse monoids is isomorphic to the amalgamated semigroup free product where the identity elements of the two monoids are identified. It may then be verified that the hypotheses of [35,Theorem 6.5] are satisfied in this situation. Therefore, the free product S of the inverse monoid (1) with Inv t | , which has inverse monoid presentation is also E-unitary. Now K = G * F G(t) is the maximal group image of both S and also of M . It follows that the identity mapping on A ∪ {t} induces surjective homomorphisms φ, ψ and θ that make the following diagram commute: since homomorphisms map idempotents to idempotents. This completes the proof that M is E-unitary.
For the second part of the theorem, we shall prove the following key claim: To prove ( ‡), first suppose that [u] G ∈ T . This means we can write where j q ∈ J for 1 ≤ q ≤ l. Since this equation is written over the alphabet A ∪ A −1 and all these letters represent invertible elements in M , and all the defining relations in the presentation of G also hold in M , it follows that Since [tw j t −1 ] M is right invertible in M for all j ∈ J, by applying Corollary 3.2 it then follows that which is right invertible in M since it is a product of right invertible elements. For the proof of the converse implication of ( ‡), let U R be the submonoid of right units of M . Let  [33,Theorem 3.8]) that the canonical homomorphism ♮ : M → K from M onto its maximal group image K = G * F G(t) induces an embedding of each R-class of M into K. In particular ♮ induces an embedding of the right units U R , which is the R-class of the identity element 1 M of M , into the group K. It follows that U R is isomorphic to the submonoid of the group K generated by {[p] K : p ∈ P }. From the definition of e this is equal to the submonoid of K generated by the set Since the submonoid of K generated by  Let W = {w 1 , . . . , w k } be a finite subset of (A ∪ A −1 ) * such that the membership problem for T = Mon W within G is undecidable. Such a set W exists by Theorem 2.4. Set e = e(a, z, tw 1 t −1 , . . . , tw k t −1 , a −1 , z −1 ). Then by Theorem 3.8 the one-relator inverse monoid Inv a, z, t | eazaz −1 a −1 za −1 z −1 = 1 has undecidable word problem. This completes the proof.
Since the inverse monoid constructed in the proof of Theorem 3.9 is Eunitary we immediately obtain the following result.

Conclusions and open problems
We have seen in Theorem 3.9 that there are one relator inverse monoids of the form Inv A|w = 1 with undecidable word problem. The key question for future research in this area is therefore: Question 4.1. For which words w ∈ (A ∪ A −1 ) * does Inv A | w = 1 have decidable word problem?
As mentioned in the introduction, there are many examples of words, or classes of words, for which it has been shown that Inv A | w = 1 has decidable word problem. For example it is true when w is an idempotent word; see [27]. In light of the results of Ivanov, Margolis and Meakin [13], of particular importance is the case where w is a reduced word. Indeed, the result [13, Theorem 2.2] states that if the word problem is decidable for all one relator inverse monoids Inv A | w = 1 with w a reduced word, then it is decidable for all one-relator monoids Mon A | u = v . Note that in the examples of one-relator inverse monoids Inv A | w = 1 with undecidable word problem constructed in this paper, the word w is not a reduced word. Under the stronger assumption that w is cyclically reduced, to show that the one-relator inverse monoid has decidable word problem it suffices, by [13,Theorem 3.1], to show that the corresponding one-relator group has a decidable prefix membership problem. As mentioned in the introduction, the prefix membership problem for one-relator groups has been shown to be decidable in a number of special cases. See also [7] for some more recent results showing that the prefix membership problem is decidable for certain classes of one-relator groups which are low down in the Magnus-Moldovanskii hierarchy.
Let M be the one-relator E-unitary inverse monoid Inv A | w = 1 with undecidable word problem given by the proof of Theorem 3.9. By Proposition 3.7 the group of units U of M is finitely generated, and since M is E-unitary it follows that U is isomorphic to a finitely generated subgroup of the one-relator group Gp A | w = 1 . Therefore the group of units U of M has decidable word problem, while the monoid M itself does not have decidable word problem. This shows that in general the word problem for one-relator inverse monoids of the form Inv A | w = 1 does not reduce to the word problem for their groups of units. This contrasts sharply with the situation for one-relator monoid presentations of the form Mon A | w = 1 . Adjan proved that one-relator monoids of the form Mon A | w = 1 have decidable word problem. He did this by first proving that the group of unit of a special one-relator monoid Mon A|w = 1 is a one-relator group, and then showing that the word problem for the monoid can be reduced to solving the word problem in this group, which in turn is decidable by Magnus's theorem. This reduction result was later extended by Makanin [24] who showed that the monoid M defined by the presentation Mon A | w 1 = 1, . . . , w k = 1 has a finitely presented group of units, and that M has decidable word problem if and only if its group of units also does. Thus, the example constructed in Theorem 3.9 shows that there is no hope in general of using the same reduction to the group of units approach for the word problem for inverse monoids of the form Inv A | w 1 = 1, . . . , w k = 1 . Further results showing the contrasting behaviour of inverse monoids defined by presentations of this form, when compared to monoids defined by such presentations, will be explored in the paper [10] where the groups of units of these inverse monoids are investigated.