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.
Non-elementary hyperbolic groups contain a rank-two free subgroup
Statement
Every non-elementary hyperbolic group contains a free subgroup of rank .
Facts & Assumptions
Given: A non-elementary hyperbolic group .
Every non-elementary hyperbolic group contains independent infinite-order elements with pairwise disjoint attracting and repelling neighborhoods . Their boundary actions have north--south dynamics: for all sufficiently large , (Kapovich--Benakli, Theorem 2.28, Proposition 4.2, and Theorem 4.3.)
Proof
By [A1], choose independent infinite-order elements with disjoint attracting and repelling neighborhoods on the boundary.
Choose large enough for all four north--south inclusions in [A1]. Write , , , and . If is a nonempty reduced word in , choose a letter distinct from both and and a point . Acting from right to left, [A1] gives successively. [A1, step 1.1, choose] because reducedness says . Thus , while , and these domains are disjoint. Hence , so is not trivial. 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
19 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
- Brian H. Bowditch, A course on geometric group theory, Section 6.11.1 (S4) (standard reference, not scraped)
- Ilya Kapovich and Nadia Benakli, Boundaries of hyperbolic groups, Theorem 2.28, Proposition 4.2, and Theorem 4.3 (standard reference, not scraped)