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.
Independent loxodromics have disjoint pole neighbourhoods
Statement
Independent loxodromics have four pairwise disjoint open pole neighbourhoods in the boundary.
Facts & Assumptions
Given: Two independent loxodromic isometries of a metric space satisfying the Gromov product condition.
Each has two distinct poles; independence means that their pole sets are disjoint (Hg toolkit loxodromics and independent poles).
The Gromov-sequence boundary topology is Hausdorff (Boundary products have controlled representative and basepoint dependence).
Proof
List the poles as , placing the positive and negative poles of the first isometry before those of the second. By F1 each pair is distinct and the two pairs are disjoint, so all four points are distinct.
For each of the six pairs , F2 supplies disjoint open sets containing and containing . Fix these six pairs of sets successively; this is finite existential instantiation, not an invocation of AC. Define . An intersection with no indices denotes the whole boundary. Each is open as a finite intersection of open sets and contains .
If , then and , hence . Thus these are the four required open neighbourhoods. Repeated poles, an empty boundary or a singleton boundary are excluded by step 1.1; empty sub-intersections in step 2.1 cause no restriction. This construction assumes the two independent isometries and asserts no existence of such a pair.
Depends on
Used by
Dependency tree · two levels
7 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 Theorem 7.3 pp.32–33; four-pole separation (standard reference, not scraped)