Given a finitely presented group , Rips constructed a hyperbolic group and a surjection with finitely generated kernel . In this post and the next we will see how the Rips construction has been used to produce draconic subgroups of hyperbolic groups.

Besides the Rips construction, our main tool will be Higman’s Embedding Theorem: any recursively presented group embeds in some finitely presented group. (A *recursive presentation* is a presentation with a finte set of generators and a recursively enumerable set of defining relations.) Pathological behavior is embedded in a finitely presented group via this theorem, and pulled back to some hyperbolic group via the Rips construction. As Bridson points out, Bieri has shown is not finitely presented unless is finite, so that the Rips construction does not directly produce pathological finitely presented subgroups of nice groups. The 1-2-3 Theorem of Baumslag, Bridson, Miller, Short produces (under some conditions) finitely presented subgroups of as the pullback . (Compare with the Mihailova construction in an upcoming blog post.)

**1. Small Cancellation Groups **

In his original paper, Rips constructed as a *small cancellation group*. We will give a brief overview of the motivation for studying these groups. The theory of small cancellation groups is developed in Combinatorial Group Theory (Lyndon and Schupp) chapter 5. See also chapter 4 for a proof of the Higman Embedding Theorem.

Dehn exhibited an algorithm solving the word problem for fundamental groups of closed surfaces. Given a presentation of a group, the word problem asks if two words in represent the same group element, or equivalently it asks if a given word represents the trivial element. We will always assume that has been closed under the operations of inverses and cyclic conjugations. One can solve this problem for fundamental groups of closed hyperbolic surfaces by studying the geometry of the universal cover.

The universal cover of the standard presentation of the fundamental group of a torus is the plane tesselated by squares. Observe that any closed curve in the 1-skeleton encloses a square that has two consecutive edges (half its boundary) on . The universal cover of the standard presentation of the fundamental group of a genus surface, , is the hyperbolic plane tessellated by -gons. Since the circumference of a hyperbolic circle is an exponential function of its radius, the fundamental domains bubble out exponentially as we move outwards from a fixed domain. One may therefore expect (and it is true) that any closed curve in the 1-skeleton encloses a -gon for which more than half its boundary lies on . (In the picture below, imagine the boundary loop of the union of octagons sharing a vertex with the central octagon.)

This geometric observation suggests an algorithm for solving the word problem in hyperbolic surface groups. Dehn’s algorithm works as follows. Given a word , search for a substring, , of that is a prefix of a relator with . (Remember, is closed under inverses and cyclic conjugation.) If no such substring exists, then does not represent the identity element of . If we find such , replace it by inside to obtain a new shorter word representing the same element as . Repeat.

Under the standard presentation, we have seen that fundamental domains of hyperbolic surface groups are polygons that intersect each other in at most a single edge. Small cancellation groups are groups with presentations satisfying certain combinatorial conditions that generalize this situation. Some of these small cancellation conditions force Dehn’s algorithm to work. The role of the region enclosed by a curve in the 1-skeleton of a hyperbolic tessellation is now played by *van Kampen diagrams*. A van Kampen diagram for a reduced word representing in is a finite planar graph with vertices of valence at least 3, together with a distinguished vertex on the boundary and with edges labelled by words in such that:

- no edge word represents ,
- reading around each bounded region gives a relator (without cancellation)
- reading around the boundary of starting at gives (without cancellation)

Observe that an edge common to two bounded regions (or traversed twice along the periphery of a bounded region) must be labelled by a *piece*: a common prefix of two distinct elements of . A presentation is said to satisfy the small cancellation condition for some if every piece that is a prefix of a relator has length less than . If the pieces are small fractions of the relators for which they are prefixes, one can expect to see the same exponential bubbling of regions towards the boundary of as with the hyperbolic surfaces. Indeed, Greendlinger’s Lemma, proved by studying the combinatorics of van Kampen diagrams and their duals, is stronger than the statement that every word representing a trivial element in a presentation contains a substring that is more than half of a relator.

Therefore Dehn’s algorithm solves the word problem in groups. The Dehn function in such a group consequently satisfies , so groups are -hyperbolic.

**2. The Rips Construction **

Theorem 1Given any finitely presented group and any real number , there is a group and a short exact sequence

with finitely generated.

The idea of the proof is to add two new generators to the presentation of and suitable noise (words in ) to the desired relators so that the noise precludes much cancellation in the new presentation but disappears when are mapped to . Let

where * represents a different long noise word every time it occurs. For example, the following words have little overlap:

It’s not too hard to generate algorithmically suitable noise words as a function of and the presentation.

The kernel is normally generated by . The conjugation relations make a normal subgroup of , so that is actually 2-generated.

**3. First Applications **

Rips produced the first applications of his construction to show that subgroups of small cancellation groups do not behave like subgroups of free groups:

Theorem 2 (Rips)There is a small cancellation group such that:

- has finitely generated subgroups whose intersection is not finitely generated.
- has a finitely generated but not finitely presented subgroup
- The subgroup membership problem in is not solvable. Indeed, there is a subgroup () for which there is no algorithm deciding whether a word in the generating set for represents an element of the subgroup.
- contains an infinite ascending chain of -generated groups. ( fixed.)

The proof works by embedding recursively presented groups exhibiting the relevant behavior in a finitely presented group and applying the Rips construction. Using covering space theory, one shows that is a free basis for the subgroup of the free group it generates. Therefore the amalgamated free product

of two copies of along this subgroup has two finitely generated free subgroups and with infinitely generated intersection. Applying the Rips construction to a finitely presented group into which this recursively presented group embeds, one sees that and are 4-generated, but is not finitely generated.

Parts (2)-(4) are proved similarly. (2) uses a finitely generated, recursively presented but not finitely presented group, such as the Lamplighter group. (3) uses a recursively presented group with unsolvable word problem (for instance

,

where is recursively enumerable but not recursive). (4) uses a finitely presented group with an ascending chain of 1-generated subgroups, such as the Baumslag-Solitar group .

Observe that one can obtain a group exhibiting all these pathologies simultaneously by simply taking to be the direct product presentation of various finite presentations that would produce the various pathologies individually.

**4. Isomorphism problem for hyperbolic groups **

The isomorphism problem seeks an algorithm to decide whether two presentations from among some class of groups represent isomorphic groups. Until recently, the isomorphism problem for hyperbolic groups was open. Baumslag, Miller, and Short used the Rips construction to suggest that the isomorphism problem is difficult.

Recall that the *rank* of a group is the minimum number of elements needed to generate it. Grushko’s Theorem says that the rank of a free product of groups is the sum of the ranks of the free factors. Baumslag, Miller and Short proved that for any , there is no algorithm that given any presentation for a hyperbolic group known to have rank either 2 or can determine which is the case. If rank is impossible to detect, they argue, then it should be difficult to tell if two groups are isomorphic.

One proves their theorem as follows. Given a finitely presented group , apply the Rips construction to a free product of copies of . If does not represent the trivial group, Grushko’s Theorem implies that the resulting group has rank at least . On the other hand, if represents the trivial group, then is 2-generated. If one could solve the isomorphism problem for the stated class of groups, then one could determine if any given finite presentation represents the trivial group, which is impossible.