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.
Hg toolkit local geodesics and hausdorff control
Definition
Use the metric, segment and point-to-set conventions of Hg toolkit slim triangles products and four point constants. A path parametrized by arc length is a continuous map on a real interval such that each compact restriction has length . Here length is the supremum, over finite subdivisions , of . In particular .
For , an arc-length path is -local geodesic if each restriction to a compact subinterval of length at most is an isometric parametrization. The condition is vacuous beyond the arc-length requirement. Results converting locality into global estimates must specify a positive radius when needed.
As in Quasi-geodesics and quasi-geodesic metric spaces, a -quasi-geodesic is a map , where , , satisfying for all . This does not assume continuity, arc-length parametrization or properness. A compact-interval segment has nonempty domain with ; a one-point domain is allowed.
For nonempty subsets , their Hausdorff distance is A supremum is if its set of values is unbounded; otherwise it exists by completeness. Thus takes values in , and no finite-valued metric on all subsets is claimed. In particular means both point-to-set suprema are at most , even if closest points do not exist. The formula excludes empty subsets. These are definitions and require no simultaneous choices.
Depends on
Used by
Dependency tree · two levels
6 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 Theorem 9.38 and §9.6 (standard reference, not scraped)