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.
Morse stability in a tree
Statement
In a geometric tree, a geodesic segment is its unique endpoint geodesic and has Hausdorff distance zero from it. If an arc-length path travels distance out a branch and returns to the same point, and is a -quasi-geodesic, then .
Facts & Assumptions
Given: The indicated segment or excursion, with its length parametrization, and .
Unique geodesics in trees are proved in Geodesic triangles in trees are tripods.
Hausdorff distance and the two quasi-geodesic inequalities are defined in Hg toolkit local geodesics and hausdorff control.
Verification
By F1 the endpoint geodesic has the same image as the given segment. Each point in either image belongs to the other image, hence has distance zero from it. Both suprema defining their Hausdorff distance are zero by F2, including for a constant segment.
If the excursion begins at parameter , its return occurs at and . The lower quasi-geodesic inequality in F2 gives . Multiplying by yields . Thus for instance a -quasi-geodesic cannot have such an excursion of length outwards exceeding ; for every such excursion has . This is a necessary bound, not an assertion that every path meeting it is quasi-geodesic.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 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
- Druţu–Kapovich §9.2 and Theorem 9.38; tree specialization (standard reference, not scraped)