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.
Loxodromic elements have north south boundary dynamics
Statement
For an infinite-order element of a finitely generated hyperbolic group and neighbourhoods of its positive and negative poles, there is an integer such that The proof is choice-free. In fact the same assertion holds for every loxodromic isometry of a metric space satisfying the product condition.
Facts & Assumptions
Given: Such an isometry, a basepoint , a product constant , its poles , and their two neighbourhoods.
Loxodromic poles, their distinctness and the isometry action on boundary classes are well-defined. The explicit orbit-chain verification gives positive stable length and joint product estimates without properness or AC (Hg toolkit loxodromics and independent poles).
Write for the supremal boundary product at . Every representing pair has mixed joint liminf at most . The sets form a neighbourhood base at (Boundary products have controlled representative and basepoint dependence).
The metric product formula and product inequality hold at every basepoint (Hg toolkit slim triangles products and four point constants).
Every infinite-order element of the stated hyperbolic group is loxodromic (Infinite order elements have positive stable translation length).
Proof
Put , and . By the quantitative conclusion in F1, choose , an integer and such that and, for every , Thus each pole's canonical sequence has product with its corresponding th orbit point at least on its tail.
For any Gromov sequence and fixed , put . It is finite in . For all sufficiently large , the Gromov property gives . Since , F3 yields . Interchanging bounds every difference on that tail by . Taking tail infima and suprema therefore gives . This argument uses only bounded real sequences.
For representing sequences and and an interior point , apply F3 with bridge . For every , all sufficiently late products and are at least and . Thus their joint liminf satisfies after letting decrease to zero. This is a joint tail estimate; neither boundary class nor the bridge point is being selected simultaneously for a family.
Choose with and , using F2 and increasing the two thresholds to zero if necessary. For any we have . Fix any representing sequence of this one class. For with , step 1.1 gives for the canonical negative orbit . By step 2.1 and F2, . The second entry exceeds , hence . Step 1.2 now gives . This bound is uniform in every class outside , although its individual sequence tail cutoff need not be uniform.
The product formula and isometry identities give exactly . Taking liminf and using step 3.1 yields . The image sequence represents by F1. Step 1.1 gives for the canonical positive orbit. Applying step 2.1 with bridge therefore gives All expressions involving an interior point are finite, so no subtraction of infinite boundary products has occurred.
Choose so large that and . Then for every we have both the hypothesis of step 3.1 and in step 4.1, for every . Hence . The integer is chosen from constants independent of ; there is no appeal to pointwise convergence to claim uniformity.
The inverse isometry is loxodromic, with poles interchanged, the same sequence of lengths , and the same orbit constants in step 1.1. Apply step 5.1 to , now using the excluded neighbourhood and the target neighbourhood . This supplies such that for all . Taking gives both inclusions for the same tail.
F4 and the boundary/isometry conventions in F1 specialize the result to the given group. If one excluded complement is empty its inclusion is automatic; the uniform proof also covers singleton complements, including a boundary consisting only of the two poles. The constants permit , and is the only quantity whose positivity is needed to choose large integers. Each argument fixes at most one representative of one given class; the final bound is independent of that representative and class. Only finitely many threshold witnesses are used. Thus neither AC, proper-ray selection, compactness, the general quasi-isometry extension theorem nor Morse stability is used.
Depends on
Used by
Dependency tree · two levels
10 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
- Canary Proposition 5.1 pp.25–26 and Theorem 5.7 pp.28–29; complete convergence-action proof (standard reference, not scraped)