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.
A local geodesic constant in a cayley graph
Statement
In the unit-edge Cayley tree of a free group on a finite alphabet, every reduced edge path, parametrized by arc length, is geodesic on every real subinterval. It is therefore globally -quasi-geodesic and -local geodesic for every .
Facts & Assumptions
Given: Such a reduced edge path .
The tree construction and real-subinterval geodesicity are proved in Free Cayley trees from reduced-word normal form.
The zero-slim positive-locality conclusion is included in Local geodesics in a hyperbolic space are uniform quasi geodesics.
Verification
By F1, for every in the path between them is the unique geodesic, of length . Hence . The two inequalities are both this equality, and restricting to proves locality for each . In particular this supplies a concrete zero-slim instance of F2 for any positive radius, such as .
For example, in the free group on the reduced path labelled has length and endpoint word length . Its subpath between parameters and has distance , even though both endpoints lie inside edges. A one-letter path has endpoint distance , and a zero-length restriction has distance . These are the same equality from step 1.1, without additive error.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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, free-tree specialization (standard reference, not scraped)