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 and be hyperbolic automorphisms of a simplicial tree whose axes are disjoint. Then there exist positive integers such that and freely generate a free subgroup of rank .
Facts & Assumptions
Given: Hyperbolic tree automorphisms and with disjoint axes.
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
Let and be the disjoint axes from [L1], and let be the unique geodesic joining them with and . Removing from the tree leaves two components meeting the two rays of , call them and . Define and similarly at . These four half-trees are pairwise disjoint.
Choose so large that and . Then [L1] implies and , and similarly and . Indeed, a sufficiently long translation along an axis carries everything on one side of the basepoint across the bridge segment into the corresponding attracting half-tree.
Pick a vertex outside the four half-trees. Any reduced word in and sends 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 and freely generate a free subgroup of rank .
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
- Jean-Pierre Serre, Trees (standard reference, not scraped)
- C. Loh, Geometric Group Theory: An Introduction (2015 course version) (standard reference, not scraped)