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.
Halfspace separation for the local-geodesic mesh
Statement
In a geodesic space with -slim triangles, , let occur in this order on a geodesic, with . Put . Then Furthermore and . Distances between nonempty sets mean infima of pairwise distances.
Facts & Assumptions
Given: The space and three collinear points as in the statement.
Slimness and point-to-set distances use the infimum convention in Hg toolkit slim triangles products and four point constants.
Proof
Fix for , and write , . Let be the midpoint of a chosen segment from to . Triangle inequalities and the halfspace assumptions give and for each .
For every , slimness of triangle at supplies on or with . Suppose it is on . Then , while , so . Therefore . Since this holds for every , .
Taking the infimum over gives the first bound; both sets are nonempty since they contain , respectively. They are disjoint because . Thus any does not belong to , which is precisely the asserted strict inequality.
If , then , proving the endpoint bound by taking an infimum. Interchanging gives the other bound. No closest point to a halfspace or bisector has been selected, and all segment selections are finite.
Depends on
Used by
Dependency tree · two levels
3 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
- Drutu–Kapovich, revised Lemma 11.46, printed pp.375–377 (PDF indices 395–397) (standard reference, not scraped)