[Paper Review] The Tits Alternative for $Out(F_n)$ II: A Kolchin Type Theorem

Mladen Bestvina, Mark Feighn+1 more|ArXiv.org|Dec 3, 1997

Geometric and Algebraic Topology17 citations

TL;DR

This paper establishes a Kolchin-type theorem for $\mathrm{Out}(F_n)$, proving that every finitely generated unipotent polynomially growing (UPG) subgroup of $\mathrm{Out}(F_n)$ is filtered—meaning it admits a representative via an upper triangular automorphism on a filtered marked graph. The key contribution is a structural characterization analogous to Kolchin's theorem for unipotent linear groups, showing such subgroups preserve a nested sequence of subgraphs with controlled dynamics.

ABSTRACT

The proof of the Tits alternative for $Out(F_n)$ is completed. The main tool is a Kolchin type theorem, proved in this paper. It states that a finitely generated subgroup of $Out(F_n)$ consisting of unipotent automorphisms can be conjugated into an upper-triangular subgroup (this is interpreted via train-tracks).

Motivation & Objective

• To establish a structural characterization of unipotent polynomially growing (UPG) subgroups in $\mathrm{Out}(F_n)$, analogous to Kolchin's theorem for unipotent linear groups.
• To prove that every finitely generated UPG subgroup of $\mathrm{Out}(F_n)$ lifts to a group of upper triangular homotopy equivalences on a filtered marked graph.
• To provide a dynamical and geometric framework for understanding the action of UPG automorphisms using train track theory and $F_n$-trees with trivial edge stabilizers.
• To resolve the Tits Alternative for $\mathrm{Out}(F_n)$ by showing UPG subgroups are either solvable or contain $F_2$, via the filtered structure.
• To investigate whether every UPG subgroup is contained in a finitely generated UPG subgroup, leaving this as an open question.

Proposed method

• Use relative train track representatives to model UPG automorphisms with upper triangular structure relative to a filtration of a marked graph.
• Apply the concept of bouncing sequences to analyze the growth of edge images under iteration, proving they grow at most linearly and eventually stabilize.
• Construct a filtered marked graph $G$ with a filtration $G_0 \subset \cdots \subset G_K = G$, where each edge $E_i$ is mapped to a path with prefixes and suffixes in $G_{i-1}$.
• Lift the UPG subgroup to a group $\mathcal{Q}$ of upper triangular homotopy equivalences on $G$, using vertex stabilizers and inductive arguments on the tree fixed by the group.
• Use equivariant maps and homotopy equivalences between trees and graphs to construct representatives that preserve the upper triangular form across the filtration.
• Apply induction on the rank of the free group and analyze stabilizers of vertices in an $F_n$-tree to build the required filtered graph structure.

Experimental results

Research questions

• RQ1 Can every finitely generated UPG subgroup of $\mathrm{Out}(F_n)$ be realized as a group of upper triangular automorphisms on a filtered marked graph?
• RQ2 What is the minimal number of edges required to represent a UPG subgroup in such a filtered graph?
• RQ3 How does the dynamics of UPG automorphisms on $F_n$-trees with trivial edge stabilizers relate to their algebraic structure?
• RQ4 Is every UPG subgroup of $\mathrm{Out}(F_n)$ contained in a finitely generated UPG subgroup?
• RQ5 To what extent do UPG subgroups resemble unipotent linear groups or unipotent mapping class groups in their algebraic and geometric behavior?

Key findings

• Every finitely generated UPG subgroup of $\mathrm{Out}(F_n)$ is filtered, meaning it lifts to a group of upper triangular homotopy equivalences on a filtered marked graph.
• The number of edges in such a filtered marked graph can be bounded by $\frac{3n}{2} - 1$ for $n > 1$, providing a quantitative control on the complexity of the representation.
• The proof relies on constructing a tree with trivial edge stabilizers fixed by the group and using inductive lifting of representatives from vertex stabilizers to the full graph.
• Bouncing sequences of edges under iteration of UPG automorphisms grow at most linearly and eventually stop growing, implying stabilization of edge images.
• Edge stabilizers in the associated $F_n$-tree become trivial after finitely many iterations, a key step in proving the existence of upper triangular representatives.
• The group $\mathcal{Q}$ of upper triangular maps on a filtered marked graph forms a group under composition, and its image in $\mathrm{Out}(F_n)$ is isomorphic to the original UPG subgroup.