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 is defined by the length of a unique shortest curve
Statement
Riemannian distance is the length of a unique shortest curve. In fact both attainment and uniqueness can fail.
Facts & Assumptions
Given: First use the Euclidean metric on with endpoints . Then use the induced metric on with endpoints .
Riemannian distance on a connected manifold: On a connected Riemannian manifold define . Lengths are those of def-riemannian-speed-and-length. For each pair , lem-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 cor-cauchy-reals-lub-complete 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.
Length is additive under concatenation and invariant under reversal: Length adds under finite concatenation and is unchanged by reversal.
Newton–Leibniz needs only continuity on , differentiability on , and a Riemann-integrable extension of the interior derivative: Let . Suppose is continuous on and differentiable on . If is Riemann integrable and then No derivative of at either endpoint is assumed, and the two endpoint values assigned to the integrable extension do not enter the conclusion.
Refutation
For a piecewise path in between the prescribed points, its Euclidean speed is . On each smooth piece this is at least . Integrating and telescoping the endpoint differences gives ; Newton–Leibniz applies to the continuously differentiable coordinates on every closed piece.
For any piecewise path in , subdivide its parameter interval so that each piece lies in one open arc admitting a smooth angle coordinate. Such a finite subdivision exists: the inverse images of these arcs cover the compact interval; a finite subcover has a positive Lebesgue number, so sufficiently short equal subintervals refine it. Refine further at the original smooth-piece endpoints. Choose an angle value at the initial point and successively add integer multiples of to each local angle so adjacent values agree at the joining parameter. This gives a continuous piecewise angle with . Differentiation gives speed .
For , travel along the horizontal axis from to , along the upper semicircle of radius , and along the axis from to . All three pieces avoid the origin. Their lengths are , , and : the semicircle parametrization has speed for , with reversal giving the required direction. Additivity and reversal yield . Consequently the infimum is .
If an admissible path had length , then the integral of would be zero. This function is continuous and nonnegative on each smooth piece, so it vanishes on each piece (a positive value would give a positive integral on a small interval). Thus and there. Newton–Leibniz and continuity at the subdivision points imply . The intermediate value theorem gives a parameter with , contradicting avoidance of the origin. Hence the infimum on is not attained.
For the antipodal endpoints, take . Then for some integer . Integrating and applying Newton–Leibniz on the pieces gives . The paths and for have speed , length , and distinct images. Both attain the distance. This proves failure of uniqueness as well as the failure of existence in step 3.1.
Source locator
Lee, pp. 337–338, Riemannian length and distance. The nonattainment and antipodal calculations, including the finite angle-lift construction, are supplied above; no geodesic existence theorem is used.
Depends on
- Riemannian distance on a connected manifold
- Local comparison of a riemannian metric with the euclidean metric
- Length is additive under concatenation and invariant under reversal
- Newton–Leibniz needs only continuity on $[a,b]$, differentiability on $(a,b)$, and a Riemann-integrable extension of the interior derivative
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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)