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.
Riemannian distance on a connected manifold
Definition
On a connected Riemannian manifold define .
Lengths are those of Riemannian speed and length. For each pair , Any two points in a connected smooth manifold can be joined by a piecewise c one curve supplies a curve, so the set of lengths is nonempty, contains a finite real number and is bounded below by zero. Applying the least-upper-bound property The Cauchy-sequence reals have the least-upper-bound property to the negatives gives a finite nonnegative infimum. On the empty connected manifold this defines the empty distance function; there are no pairs to evaluate. No minimizing curve is part of this definition.
Source locator
Lee, Chapter 13, pp.337–340, Proposition 13.25, Lemma 13.28 and Theorem 13.29; finite piecewise refinements and pauses are treated explicitly here.
Depends on
Used by
- Length and distance on the circle Example
- Riemannian distance is defined by the length of a unique shortest curve False statement
- The distance function is smooth on all of m times m False statement
- A smooth map with pointwise operator norm at most c is c lipschitz for riemannian distance Proposition
- Length dominates endpoint distance Proposition
- Riemannian distance is a metric Theorem
Dependency tree · two levels
13 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
- John M. Lee, Introduction to Smooth Manifolds, second edition (standard reference, not scraped)