9
$\begingroup$

Given a finitely generated subgroup of a finitely generated hyperbolic group. Is it true that the inclusion of each subgroup is a quasiisometric embedding ?

The first example for a group that does not have this property is a Baumslag-Solitar group $BS(1,m)= \langle a,b| bab^{-1}=a^m\rangle$. We have $a^{m^k}=b^kab^{-k}$ for each $k$. This shows for example that the inclusion of the subgroup generated by $a$ is not a quasiisometric embedding.

Then one can consider the class of groups with the property that the inclusion of any subgroup is a quasiisometric embedding. Has this class been studied?

$\endgroup$

3 Answers 3

12
$\begingroup$

The answer to the first question is "no". Look at the Rips' construction http://en.wikipedia.org/wiki/Small_cancellation_theory. The finitely generated normal subgroup there is usually very badly distorted. I do not see many general properties of the class of groups where every f.g. subgroup is undistorted. It contains so diverse groups as free groups and Tarski monsters. Studying hyperbolic groups with this property makes more sense but I doubt anything general is known about this class either.

$\endgroup$
11
$\begingroup$

For more than you ever wanted to know on the subject, check out http://berstein.wordpress.com/2011/02/23/quasi-convex-subgroups-of-hyperbolic-groups/

and references therein (the short answer is: no. An interesting counterexample is contained in

An example of a non-quasiconvex subgroup of a word hyperbolic group with exotic limit set

by

Ilya Kapovich)

$\endgroup$
9
$\begingroup$

To add to the examples given, let G be the fundamental group of a closed hyperbolic 3-manifold that fibers over the circle, and let F be the fiber subgroup. Then F is a surface subgroup that is not quasiisometrically embedded.

$\endgroup$
1
  • $\begingroup$ (As Richard knows) the famous Virtually Fibered Conjecture is equivalent to: 'Every hyperbolic 3-manifold group is not locally quasiconvex'. $\endgroup$
    – HJRW
    Dec 7, 2011 at 16:20

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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