[Paper Review] Nielsen methods and groups acting on hyperbolic spaces

Ilya Kapovich, Richard Weidmann|ArXiv.org|Mar 2, 2002

advanced mathematical theories4 citations

TL;DR

This paper establishes that any n-generated group acting by isometries on a δ-hyperbolic space is either free (with the orbit map being a quasi-isometric embedding) or contains a nontrivial element with translation length at most δC(n), where C(n) is a computable constant depending only on n. The proof uses Nielsen transformations to analyze generating tuples and applies geometric group theory techniques in hyperbolic spaces to control translation lengths.

ABSTRACT

We show that for any positive integer $n$ there exists a constant $C(n)>0$ such that any $n$-generated group $G$, which acts by isometries on a $δ$-hyperbolic space (with $δ>0$), is either free or has a nontrivial element with translation length at most $δC(n)$.

Motivation & Objective

• To generalize Gromov's conjecture on hyperbolic groups by showing that any n-generated group acting on a δ-hyperbolic space is either free or has a nontrivial element of small translation length.
• To provide a constructive proof of this dichotomy using Nielsen transformations, which preserve the generated subgroup while allowing minimality arguments.
• To establish that the constant C(n) in the bound on translation length is recursive and thus algorithmically computable, even though its asymptotic growth is not specified.
• To extend the result to R-trees by taking δ → 0, showing that in such cases, the first generator can be made to have arbitrarily small translation length via Nielsen equivalence.
• To recover and strengthen Gromov’s claim about subgroups of word-hyperbolic groups, albeit with a different constant than originally stated.

Proposed method

• Apply Nielsen transformations—elementary changes to generating tuples that preserve the generated subgroup—to reduce the problem to a minimal generating tuple.
• Use a geometric minimality condition that combines combinatorial ordering (analogous to lexicographical order) with geometric control in δ-hyperbolic spaces.
• Construct a quasigeodesic path σ from x to ux using the group action and the structure of alternating products in the generating tuple.
• Employ quasigeodesic tracking and Hausdorff distance estimates to relate the length of the path σ to the word length of group elements.
• Use the (K,K)-quasigeodesic property of σ to derive lower bounds on the path length in terms of the word length of the group element, ensuring the orbit map is a quasi-isometric embedding.
• Establish a recursive bound C(n) on translation length via inductive control over the lengths of intermediate group elements in the product decomposition.

Experimental results

Research questions

• RQ1 Can any n-generated group acting on a δ-hyperbolic space be shown to be either free or contain a nontrivial element of small translation length?
• RQ2 Is it possible to ensure that such a small translation element can be made part of a Nielsen-equivalent generating tuple, even when the action is non-discrete or non-faithful?
• RQ3 Does the constant C(n) in the translation length bound depend only on n and can it be computed algorithmically?
• RQ4 Can the result be extended to R-trees by taking δ → 0, and does this imply that the first generator can be made arbitrarily close to elliptic?
• RQ5 To what extent do Nielsen methods, traditionally used in free groups, generalize to groups acting on hyperbolic spaces with geometric control?

Key findings

• For any n ∈ ℕ, there exists a recursive constant C(n) such that any n-generated group acting by isometries on a δ-hyperbolic space is either free (with the orbit map a quasi-isometric embedding) or has a nontrivial element with translation length ≤ δC(n).
• The orbit map G → X, g ↦ gx is a quasi-isometric embedding if and only if G is free on the generating tuple and the action is discrete and quasiconvex.
• The constant C(n) is recursive and thus algorithmically computable, although the paper does not determine its asymptotic growth in n.
• In the case of R-trees (0-hyperbolic spaces), the result implies that for any ε > 0, there exists a Nielsen-equivalent generating tuple where the first generator has translation length ≤ ε.
• The proof establishes that the orbit map for the subgroup H generated by the first n−1 generators is a quasi-isometric embedding, which is used to control the length of paths in the hyperbolic space.
• The construction of the quasigeodesic σ and its comparison to geodesics via Hausdorff distance allows the derivation of a lower bound on path length in terms of word length, proving the quasi-isometric embedding property.