Arc Length and Rectifiable Curves
About this page
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.
✓ 13 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 13 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
Linear Algebra
Real Analysis
- Bounded Variation and the Riemann–Stieltjes Integral
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Foundations of the Real Numbers for Analysis
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Properties of the Integral and the Working FTC
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Riemann Integral: Definition and Integrability
- Topology of ℝ
Set Theory
2 · Logical flowchart
3 · Items
Definition
Paths in ℝⁿ, inscribed polygonal sums, arc length as their supremum, and rectifiability
Corollary
Every endpoint chord is no longer than the arc: ‖γ(b)-γ(a)‖₂≤ L(γ)
Lemma
Refining a partition cannot decrease its inscribed polygonal length
Theorem
A path in ℝⁿ is rectifiable exactly when every coordinate has bounded variation
Theorem
Arc length is additive across every subdivision point and decreases under restriction
Theorem
Arc length is invariant under every continuous surjective monotone reparametrization, including pauses and reversal
Proposition
A C-Lipschitz map multiplies path length by at most C; isometries preserve length and scalar dilation multiplies it by the absolute scale
Theorem
Arc length is lower semicontinuous under uniform convergence of paths
Theorem
If γ:[a,b]→ℝⁿ is continuous, differentiable on (a,b), and γ' extends continuously to [a,b], then L(γ)=∫ₐᵇ‖γ'(t)‖₂ dt
Corollary
If f is continuous on [a,b], differentiable on (a,b), and f' extends continuously to [a,b], then the graph of f has length ∫ₐᵇ√1+f'(t)² dt
Corollary
A continuous piecewise-C¹ path is rectifiable and its length is the sum of the speed integrals over its pieces
Definition
The arc-length function s_γ(t)=L(γ|_[a,t]) of a rectifiable path
Lemma
The arc-length function is continuous and nondecreasing, with increments equal to subpath lengths; it is strictly increasing exactly when no nondegenerate subpath is constant
Theorem
Every rectifiable path factors through its arc-length function as a unit-speed path on [0,L]
Corollary
A regular C¹ path has a C¹ arc-length reparametrization with derivative of Euclidean norm one
Sources
- A. R. Shastri, Metric Spaces, Sections 5--6
- U. Lang, Differential Geometry I, Section 1.1
- T. M. Apostol, Mathematical Analysis, Section 6.10
- A. R. Shastri, Metric Spaces, Section 5
- J. Denzler, Calculus of Variations, Section 4.9
- T. M. Apostol, Mathematical Analysis, Theorem 6.19
- U. Lang, Differential Geometry I, Lemma 1.1