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.
Length is additive under concatenation and invariant under reversal
Statement
Length adds under finite concatenation and is unchanged by reversal.
Facts & Assumptions
Given: Piecewise curves, with matching endpoints for concatenation.
Riemannian length is independent of piecewise c one subdivision: Riemannian length is independent of admissible finite subdivision and of corner derivative conventions.
Line integrals under reversal and concatenation: Let be a piecewise- path, and let be a continuous scalar field and a continuous vector field on a set containing its trace. Then If piecewise- paths satisfy , and and are continuous on a set containing both traces, then
Proof
For curves on , their concatenation has derivatives on the first half and on the second. Substitution gives the two contributions and , hence their sum. The same finite integral calculation as for scalar line integrals applies to these scalar speeds.
The reversed curve has velocity and therefore the same norm at the reversed time. Substitution reverses the integration limits and cancels the minus sign, giving . Repeating the first calculation proves finite concatenation; constant pieces and zero-length intervals contribute zero.
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
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
- John M. Lee, Introduction to Smooth Manifolds, second edition (standard reference, not scraped)