2
$\begingroup$

Here I am asking for an analogue of Generating infinite index subgroups of a free group

Let $F$ be a nonabelian finitely generated free group, let $H \leq F$ be a finitely generated subgroup of infinite index, and let $x \in F$. Must there be some $y \in F$ such that $[F : \langle H, yxy^{-1}\rangle] =\infty$ ?

$\endgroup$
  • 1
    $\begingroup$ This can be answered the same way as your other one. Choose y to not be readable at the base and not cancel too much of x. $\endgroup$ – Benjamin Steinberg Jan 7 '15 at 13:22
5
$\begingroup$

The proof is like before. Let $\Gamma$ be the Stallings graph for $H$. Choose a word $w$ labeling a path from the base point to a vertex q where some letter or its inverse, call it a, cannot be read. If $axa^{-1}$ is reduced, then by sowing an edge a at q followed by x as a loop, we obtain a Stallings graph of an infinite index subgroup containing H and $yxy^{-1}$ where $y=wa$. Else choose b different than a or its inverse and sow at q a pair of edges labeled ab followed by $x$ as a loop. This results in a Stallings graph of an infinite index subgroup containing H and $yxy^{-1}$ with y=wab.

$\endgroup$
  • $\begingroup$ And how do we know that after sowing the index does not become finite? What letter cannot be read after sowing? $\endgroup$ – Pablo Jan 7 '15 at 15:35
  • 1
    $\begingroup$ We may assume that x has at least 2 letters. Otherwise replace it by $cxc^{-1}$ for some other letter $c$. But if x has more than one letter then the loop I sowed in labeled by x has missing letters at the end point of the first edge. $\endgroup$ – Benjamin Steinberg Jan 7 '15 at 15:47
  • 1
    $\begingroup$ @Pablo, a finite Stallings graph represents an infinite-index subgroup iff some vertex has less than maximal degree. $\endgroup$ – HJRW Jan 7 '15 at 16:30
  • $\begingroup$ @HJRW To which nonfree groups does this generalize? $\endgroup$ – Pablo Jan 7 '15 at 16:36
  • 3
    $\begingroup$ It generalizes to hyperbolic groups and quasiconvex subgroups. $\endgroup$ – HJRW Jan 7 '15 at 16:52

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.