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

Lemma 30. Let \mathcal{G} be a graph of groups with \Gamma finite and G = \pi_1 \mathcal{G} finitely generated. If G_e is finitely generated for every edge e \in E ( \Gamma ) , then G_v is finitely generated for every v \in V ( \Gamma ) .

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 S be a finite generating set for G , and for each e \in E ( \Gamma ) let S_e be a finite generating set for the edge group G_e . By the Normal Form Theorem, every g \in S can be written in the form

g = g_0 t_1^{\pm 1} g_1 \cdots t_n^{\pm 1} g_n

where each t_i is a stable letter and each g_i \in G_{v_i} for some v_i \in V ( \Gamma ) . For a fixed v \in V ( \Gamma ) , let

\displaystyle S_v = \bigcup_{g\in S} \{ g_i : g_i \in G_v \} \cup \bigcup_{e \text{ adjoining } v} \partial_e^{\pm} ( S_e ) ,

where for each e \in E ( \Gamma ) adjoining v the plus or minus is chosen so that \partial_e^\pm : G_e to G_v . It is clear then that S_v is contained in G_v . To see that S_v is finite, note that since S is finite, the first union is finite; and since \Gamma 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 S_v generates G_v .

Let \gamma \in G_v . Because S generates G , we have

\gamma = \gamma_1 \cdots \gamma_m

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

\gamma = g_0 t_1^{\pm 1} g_1 t_n^{\pm 1} g_n , or 1 = \gamma^{-1} g_0 t_1^{\pm 1} g_1 t_n^{\pm 1} g_n .

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 g_i is either contained in G_v or is a product of elements of the incident edge groups, and in both cases lie in S_v . \square

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

Definition. Recall that H \subset G is a retract if the inclusion H \hookrightarrow G has a left inverse \rho : G \to H . Similarly, we call H a virtual retract if H is a retract of a finite index subgroup of G .

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 D is a virtual retract.

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

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 D is quasi-convex.

About these ads