One-relator group

In the mathematical subject of group theory, a one-relator group is a group given by a group presentation with a single defining relation. One-relator groups play an important role in geometric group theory by providing many explicit examples of finitely presented groups.

Formal definition

A one-relator group is a group G that admits a group presentation of the form

where X is a set (in general possibly infinite), and where r∈F(X) is a freely and cyclically reduced word.

If Y is the set of all letters x∈X that appear in r and X′=X∖Y then

G=⟨Y∣r=1⟩∗F(X′).

For that reason X in (1) is usually assumed to be finite where one-relator groups are discussed, in which case (1) can be rewritten more explicitly as

where X={x1,…,xn} for some integer n≥1.

Freiheitssatz

Let G be a one-relator group given by presentation (1) above. Recall that r is a freely and cyclically reduced word in F(X). Let y∈X be a letter such that y or y−1 appears in r. Let X1⊆X∖{y}. The subgroup H=⟨X1⟩≤G is called a Magnus subgroup of G.

A famous 1930 theorem of Wilhelm Magnus, known as Freiheitssatz, states that in this situation H is freely generated by X1, that is, H=F(X1). See also for other proofs.

Properties of one-relator groups

Here we assume that a one-relator group G is given by presentation (2) with a finite generating set X={x1,…,xn} and a nontrivial freely and cyclically reduced defining relation 1≠r∈F(X).

One-relator groups with torsion

Suppose a one-relator group G given by presentation (2) where r=sm where m≥2 and where 1≠s∈F(X) is not a proper power (and thus s is also freely and cyclically reduced). Then the following hold:

Magnus–Moldavansky method

Starting with the work of Magnus in the 1930s, most general results about one-relator groups are proved by induction on the length |r| of the defining relator r. The presentation below follows Section 6 of Chapter II of Lyndon and Schupp and Section 4.4 of Magnus, Karrass and Solitar for Magnus' original approach and Section 5 of Chapter IV of Lyndon and Schupp for the Moldavansky's HNN-extension version of that approach.

Let G be a one-relator group given by presentation (1) with a finite generating set X. Assume also that every generator from X actually occurs in r.

One can usually assume that #X≥2 (since otherwise G is cyclic and whatever statement is being proved about G is usually obvious).

The main case to consider when some generator, say t, from X occurs in r with exponent sum 0 on t. Say X={t,a,b,…,z} in this case. For every generator x∈X∖{t} one denotes xi=t−ixti where i∈ℤ. Then r can be rewritten as a word r0 in these new generators X∞={(ai)i,(bi)i,…,(zi)i} with |r0|<|r|.

For example, if r=t−2btat3b−2a2t−1at−1 then r0=b2a1b−2−2a−22a−1.

Let X0 be the alphabet consisting of the portion of X∞ given by all xi with m(x)≤i≤M(x) where m(x),M(x) are the minimum and the maximum subscripts with which xi±1 occurs in r0.

Magnus observed that the subgroup L=⟨X0⟩≤G is itself a one-relator group with the one-relator presentation L=⟨X0∣r0=1⟩. Note that since |r0|<|r|, one can usually apply the inductive hypothesis to L when proving a particular statement about G.

Moreover, if Xi=t−iX0ti for i∈ℤ then Li=⟨Xi⟩=⟨Xi|ri=1⟩ is also a one-relator group, where ri is obtained from r0 by shifting all subscripts by i. Then the normal closure N=⟨⟨X0⟩⟩G of X0 in G is

N=⟨⋃i∈ℤLi⟩.

Magnus' original approach exploited the fact that N is actually an iterated amalgamated product of the groups Li, amalgamated along suitably chosen Magnus free subgroups. His proof of Freiheitssatz and of the solution of the word problem for one-relator groups was based on this approach.

Later Moldavansky simplified the framework and noted that in this case G itself is an HNN-extension of L with associated subgroups being Magnus free subgroups of L.

If for every generator from X0 its minimum and maximum subscripts in r0 are equal then G=L∗⟨t⟩ and the inductive step is usually easy to handle in this case.

Suppose then that some generator from X0 occurs in r0 with at least two distinct subscripts. We put Y− to be the set of all generators from X0 with non-maximal subscripts and we put Y+ to be the set of all generators from X0 with non-maximal subscripts. (Hence every generator from Y− and from Y− occurs in r0 with a non-unique subscript.) Then H−=⟨Y−⟩ and H+=⟨Y+⟩ are free Magnus subgroups of L and t−1H−t=H+. Moldavansky observed that in this situation

G=⟨L,t∣t−1H−t=H+⟩

is an HNN-extension of L. This fact often allows proving something about G using the inductive hypothesis about the one-relator group L via the use of normal form methods and structural algebraic properties for the HNN-extension G.

The general case, both in Magnus' original setting and in Moldavansky's simplification of it, requires treating the situation where no generator from X occurs with exponent sum 0 in r. Suppose that distinct letters x,y∈X occur in r with nonzero exponents α,β accordingly. Consider a homomorphism f:F(X)→F(X) given by f(x)=xy−β,f(y)=yα and fixing the other generators from X. Then for r′=f(r)∈F(X) the exponent sum on y is equal to 0. The map f induces a group homomorphism ϕ:G→G′=⟨X∣r′=1⟩ that turns out to be an embedding. The one-relator group G' can then be treated using Moldavansky's approach. When G′ splits as an HNN-extension of a one-relator group L, the defining relator r0 of L still turns out to be shorter than r, allowing for inductive arguments to proceed. Magnus' original approach used a similar version of an embedding trick for dealing with this case.

Two-generator one-relator groups

It turns out that many two-generator one-relator groups split as semidirect products G=Fm⋊ℤ. This fact was observed by Ken Brown when analyzing the BNS-invariant of one-relator groups using the Magnus-Moldavansky method.

Namely, let G be a one-relator group given by presentation (2) with n=2 and let ϕ:G→ℤ be an epimorphism. One can then change a free basis of F(X) to a basis t,a such that ϕ(t)=1,ϕ(a)=0 and rewrite the presentation of G in this generators as

G=⟨a,t∣r=1⟩

where 1≠r=r(a,t)∈F(a,t) is a freely and cyclically reduced word.

Since ϕ(r)=0,ϕ(t)=1, the exponent sum on t in r is equal to 0. Again putting ai=t−iati, we can rewrite r as a word r0 in (ai)i∈ℤ. Let m,M be the minimum and the maximum subscripts of the generators occurring in r0. Brown showed that ker⁡(ϕ) is finitely generated if and only if m<M and both am and aM occur exactly once in r0, and moreover, in that case the group ker⁡(ϕ) is free. Therefore if ϕ:G→ℤ is an epimorphism with a finitely generated kernel, then G splits as G=Fm⋊ℤ where Fm=ker⁡(ϕ) is a finite rank free group.

Later Dunfield and Thurston proved that if a one-relator two-generator group G=⟨x1,x2∣r=1⟩ is chosen "at random" (that is, a cyclically reduced word r of length n in F(x1,x2) is chosen uniformly at random) then the probability pn that a homomorphism from G onto ℤ with a finitely generated kernel exists satisfies

0.0006<pn<0.975

for all sufficiently large n. Moreover, their experimental data indicates that the limiting value for pn is close to 0.94.

Examples of one-relator groups

Generalizations and open problems

See also