Last time, we used the following lemma without justification, so let’s prove it now.

**Lemma 30. **Let be a graph of groups with finite and finitely generated. If is finitely generated for every edge , then is finitely generated for every .

This is not completely trivial: it is certainly possible for finitely generated group to have subgroups that are not finitely generated. Indeed, recall the proof that every countable group embeds in the free group on three generators.

**Pf.** Let be a finite generating set for , and for each let be a finite generating set for the edge group . By the Normal Form Theorem, every can be written in the form

where each is a stable letter and each for some . For a fixed , let

,

where for each adjoining the plus or minus is chosen so that . It is clear then that is contained in . To see that is finite, note that since is finite, the first union is finite; and since is finite there can be only finitely many edges adjoining a given vertex, so the second union is finite. Hence it remains to prove that generates .

Let . Because generates , we have

where . Each has a normal form as above, so we get an expression of the form

, or .

By the Normal Form Theorem, the expression on the right can then be simplified. After the simplification process, we have no stable letters left, and every is either contained in or is a product of elements of the incident edge groups, and in both cases lie in .

Remember that Theorem 19 said is LERF, answering our question (b). But in fact, we get more from the proof of Theorem 19.

**Definition.** Recall that is a **retract** if the inclusion has a left inverse . Similarly, we call a **virtual retract** if is a retract of a finite index subgroup of .

For instance, Marshall Hall’s Theorem implies that every finitely generated subgroup of a free group is a virtual retract.

**Theorem 20.** Every finitely generated subgroup of is a virtual retract.

**Pf.** Consider the setup of the proof of Theorem 19. We start with a subgroup and end up with a finitely sheeted covering space . The graph of spaces is built using the “obvious” bijection between elevations to and elevations to . Thus the identification extends to a topological retraction . Now, we shall build a map . We build it at each vertex space, one at a time. From the proof of Lemma 29, we see that the core of each is a topological retract of the corresponding . Furthermore, we can choose the retraction so that for each long loop of degree that we added is mapped to a null-homotopic loop in . This allows you to piece together the map into a retraction .

Exercise 14 asserted that a (virtual) retract is quasi-isometrically embedded, and so Theorem 20 has the following corollary:

**Corollary.** Every finitely generated subgroup of is quasi-convex.

## Leave a comment

Comments feed for this article