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.
The exponential map scales geodesic time
Statement
Assume . For and , and whenever these equivalent conditions hold, In particular, if , then for every .
Facts & Assumptions
Given: A boundaryless smooth manifold with an affine connection, , and .
Under The Axiom of Countable Choice (), Geodesic scaling identity gives and, for , ; for the scaled geodesic is constant on .
Domain and exponential map of a connection says exactly when and then .
Proof
Suppose first that . By [F1], iff , and on that domain . Applying [F2] proves both the domain equivalence and the exponential identity.
If , then , while [F1] makes the constant curve on ; hence and . Thus the equivalence and identity also hold at zero.
Let and . Then by [F2]. Since is an interval containing , it contains , so step 1.1 or 1.2 gives . Thus every fibre domain is star-shaped about zero. Negative parameters are covered by step 1.1 whenever the corresponding geodesic time lies in the maximal interval.
On an empty manifold there are no initial vectors. In dimension zero only step 1.2 occurs, and in dimension one the proof is unchanged. Zero velocity and zero scale were handled explicitly; membership is always at the interior time of an open maximal interval, including when the original time is a finite endpoint candidate. The stated is inherited through [F1]--[F2], and no additional selection is made.
Depends on
Used by
Dependency tree · two levels
10 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
- Ved Datar, Lectures on Riemannian Geometry, Proposition 17.1.4(2)--(3), p.128 (standard reference, not scraped)