Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-28
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Disjoint-axis hyperbolic automorphisms satisfy ping-pong on a tree

Statement

Let g and h be hyperbolic automorphisms of a simplicial tree whose axes are disjoint. Then there exist positive integers m,n such that gm and hn freely generate a free subgroup of rank 2.

Facts & Assumptions

Given: Hyperbolic tree automorphisms g and h with disjoint axes.

[L1]

A hyperbolic tree automorphism preserves a unique axis and translates along it by its translation length. (Tree automorphisms without inversions are either elliptic or hyperbolic)

Proof

technique · direct
1.1

Let Ag and Ah be the disjoint axes from [L1], and let [p,q] be the unique geodesic joining them with pAg and qAh. Removing p from the tree leaves two components meeting the two rays of Ag, call them Xg+ and Xg. Define Xh+ and Xh similarly at q. These four half-trees are pairwise disjoint.

L1givenconstruct
2.1

Choose m,n>0 so large that m(g)>d(p,q) and n(h)>d(p,q). Then [L1] implies gm(TXg)Xg+ and gm(TXg+)Xg, and similarly hn(TXh)Xh+ and hn(TXh+)Xh. Indeed, a sufficiently long translation along an axis carries everything on one side of the basepoint across the bridge segment [p,q] into the corresponding attracting half-tree.

L1step 1.1algebra
3.1

Pick a vertex x outside the four half-trees. Any reduced word in g±m and h±n sends x into the domain attached to its first letter by step 2.1, and successive letters cannot bring it back because the four domains are disjoint. So no nonempty reduced word acts trivially. Therefore gm and hn freely generate a free subgroup of rank 2.

step 1.1step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources