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 continuous piecewise- path is rectifiable and its length is the sum of the speed integrals over its pieces
Statement
Let be continuous. Suppose there is a partition such that on each the restriction is differentiable in the interior and its derivative has a continuous extension to that closed subinterval. Then is rectifiable and
No agreement between and is required, so corners are allowed. For a singleton interval the empty sum and the length are zero.
Facts & Assumptions
Given: The piecewise path and subdivision.
Each piece is rectifiable with length equal to its speed integral (If is continuous, differentiable on , and extends continuously to , then ).
Arc length is additive over adjacent parameter subintervals (Arc length is additive across every subdivision point and decreases under restriction).
Proof
By [L1], the -th restriction is rectifiable and has length .
Repeated application of [L2] expresses the total length as the sum of the finitely many piece lengths.
Substituting step 1.1 into step 2.1 proves the formula and finiteness. Endpoint derivative extensions are local to each piece, so no matching condition is used.
On a singleton there are no nondegenerate pieces, and both the empty sum and the defined length are zero.
Depends on
Used by
- The scalar line integral of one is the arc length Corollary
- Sawtooth paths converge uniformly to a line segment while every sawtooth has length √2 and the limit has length 1 Counterexample
- The Koch curve is a uniform limit of polygonal paths of lengths (4/3)ⁿ but is not rectifiable Counterexample
- Two paths can have the same trace and endpoints but different lengths: one traverses [0,1] once and another traverses it forward, backward, and forward Counterexample
- Banach algebra valued contour integral Definition
- Filled complex triangles, their oriented three-edge boundary contours, diameter, and perimeter Definition
- Reversal, concatenation, closed paths, and oriented piecewise-C1 reparametrizations Definition
- A continuous argument computed along a spiralling contour Example
- A line segment has length equal to the distance between its endpoints, and a finitely piecewise-linear path has length equal to the sum of its edge lengths Example
- ML bounds for rational integrands on a semicircular arc and a line segment Example
- The winding numbers of a keyhole contour about the origin and about an excluded point Example
- γ(t)=(t,|t|) on [-1,1] is rectifiable of length 2√2 but is not differentiable at 0 Example
- FALSE: contour length depends only on the trace and ignores multiplicity False statement
- A plane domain with trivial fundamental group is homologically simply connected Lemma
- Contour integral commutes with bounded linear maps Lemma
- On a convex open set the difference quotient is an average of the derivative along the segment Lemma
- Complex contours as planar rectifiable paths: the Euclidean, coordinate-BV, and piecewise-C1 dictionaries Remark
- A circle traversed k times has winding number k inside and 0 outside Theorem
- For piecewise-C1 contours the Riemann–Stieltjes integral agrees with the parametric complex integral and the published real line integrals Theorem
- Line-integral estimates by arc length and the supremum of the field Theorem
Dependency tree · two levels
11 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
- U. Lang, Differential Geometry I, Section 1.1 (standard reference, not scraped)