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.
Complex path length equals coordinate length and piecewise speed integral
Statement
Let and let be continuous. Put , where and . For every partition, the complex polygonal sum of equals the Euclidean polygonal sum of , and
including singleton intervals. Consequently, is rectifiable exactly when both and have bounded variation.
If and there is a finite partition such that on each piece the path is differentiable in the interior and its derivative extends continuously to the closed piece, then
Corners and zero-speed pieces are allowed. On a singleton interval the length and coordinate variations are zero, and the piecewise-speed sum is empty.
Facts & Assumptions
Given: The continuous complex path and, when , the stated finite subdivision.
The complex coordinate isometry transports topology and affine segments: is a bijective isometry from to .
Polygonal length and rectifiability of complex paths and Paths in , inscribed polygonal sums, arc length as their supremum, and rectifiability: Both lengths are suprema over the same interval partitions, with singleton length zero.
Real and imaginary parts, complex conjugation, and modulus: and , so the coordinates of are .
A path in is rectifiable exactly when every coordinate has bounded variation: A continuous path is rectifiable exactly when both coordinate functions have bounded variation, including the singleton case.
A continuous piecewise- path is rectifiable and its length is the sum of the speed integrals over its pieces: A continuous piecewise- Euclidean path has finite length equal to the sum of the speed integrals on the pieces; derivatives need not match at corners.
The -norms for rational , and : For , .
Proof
The path is continuous: for any , [F1] gives , so the continuity condition for implies that for . By [F3], . For each partition point pair, [F1] identifies the chord lengths; summing termwise gives equal polygonal sums by [F2].
If , taking the supremum of those equal sums over the identical partition set in [F2] gives . If , both lengths are zero by [F2].
Apply [F4] to the continuous path . The length equality in step 2.1 identifies its rectifiability with that of , and [F3] identifies its coordinate functions with and . Thus the bounded-variation equivalence holds in both directions.
Under the piecewise- hypothesis with , [F5] applies to on the given subdivision. Substituting the length equality from step 2.1 gives the first integral formula and finiteness; [F6] gives the displayed square-root integrand. No derivative equality at adjacent endpoints is required by [F5].
If , [F2] gives zero for both lengths, [F4] gives zero coordinate variations, and the speed sum is empty. Hence all stated boundary conventions hold.
Depends on
Polygonal length and rectifiability of complex paths
The complex coordinate isometry transports topology and affine segments
Real and imaginary parts, complex conjugation, and modulus
Paths in , inscribed polygonal sums, arc length as their supremum, and rectifiability
A path in is rectifiable exactly when every coordinate has bounded variation
A continuous piecewise- path is rectifiable and its length is the sum of the speed integrals over its pieces
The -norms for rational , and