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.
Arc Length and Rectifiable Curves: Examples and Counterexamples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Arc Length and Rectifiable Curves
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- 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
- Filters and Ultrafilters
- Foundations of the Real Numbers for Analysis
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- 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
- Sine, Cosine, and the Definition of Pi
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
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
For , the line segment on has
More generally, a polygonal path with successive vertices , traversing each segment once and in that order on adjacent parameter subintervals, has
For the path is constant and the empty sum is zero.
Facts & Assumptions
Given: The segment or polygonal path in the statement.
A piecewise path has length equal to the sum of the integrals of the speeds on its pieces (A continuous piecewise- path is rectifiable and its length is the sum of the speed integrals over its pieces).
Length is additive over adjacent parameter subintervals (Arc length is additive across every subdivision point and decreases under restriction).
Verification
The segment derivative is the constant vector , so [L1] gives .
On a polygonal path, the -th affine piece has length by step 1.1, independently of its positive traversal time.
Add the piece lengths using [L1] or [L2] to obtain the displayed sum. If , the path is constant and both sides are zero.
For every , the unit-circle path on has length
Example
For every real , let
Then . No geometric definition of angle or of is used: sine and cosine are the published power-series functions.
Facts & Assumptions
Given: A real and the displayed path.
Vector differentiation is componentwise (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral).
for every real (Parity and the Pythagorean identity for sine and cosine).
A path has length equal to the integral of its speed (If is continuous, differentiable on , and extends continuously to , then ).
The integral of the constant function on is (If on then for every partition ; in particular every constant function is integrable, with ).
Verification
If , [L1]--[L2] give .
By [L3], .
Apply [L4] and [L5] to get .
If , the domain is a singleton and the defined length is .
The continuous path on , with , is not rectifiable
Counterexample
Define by and for . Then is continuous, but the graph path is not rectifiable.
Facts & Assumptions
Given: The function and graph path .
The number is positive, and the shift formulas give for integers (Pi as twice the smallest positive zero of cosine, Quarter-turn values and shifts by pi/2 and pi).
The harmonic series diverges, the case of the rational -series theorem (For rational , converges iff ); a nonnegative series converges exactly when its partial sums are bounded above (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).
Bounded variation means that all partition variation sums are bounded above (Bounded variation and total variation on an interval).
A path is rectifiable exactly when all of its coordinate functions have bounded variation (A path in is rectifiable exactly when every coordinate has bounded variation).
Reciprocals of positive naturals tend below every positive bound (For every in a complete ordered field there is a natural with ).
for every real (Parity and the Pythagorean identity for sine and cosine).
Verification
Since for , as ; away from zero it is continuous. Thus is a path.
Put . Positivity of and [L5] give , so choose with ; and [L1] gives .
For , take the partition whose points are , omitting a repeated endpoint if . Its variation contribution from consecutive is .
Since , [L2] says the tails are unbounded. Hence the variation sums in step 2.1 are unbounded and is not of bounded variation.
The first coordinate has bounded variation, but the second does not by step 3.1. Therefore [L4] says the graph path is not rectifiable.
The Koch curve is a uniform limit of polygonal paths of lengths but is not rectifiable
Counterexample
There are polygonal paths that converge uniformly to a path and satisfy
yet the limit path is not rectifiable: . The path is one side of the Koch snowflake, so the closed snowflake boundary is nonrectifiable as well.
Facts & Assumptions
Given: The Euclidean plane and the unit interval.
The recursion theorem produces a sequence once its initial value and update rule are specified (The recursion theorem).
The real numbers are a complete ordered field (The Cauchy-sequence reals have the least-upper-bound property), so the nonnegative real has a square root (Square roots exist: a unique with ; the positives are ); the standard basis gives the coordinate decomposition of vectors in (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ); and the Euclidean norm is homogeneous and satisfies the triangle inequality (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
A uniformly Cauchy sequence of real-valued functions has a uniform limit; a uniform limit of continuous real-valued functions is continuous; and a vector-valued map is continuous exactly when its coordinates are continuous (A sequence of real-valued functions converges uniformly if and only if it is uniformly Cauchy, The uniform limit of continuous real-valued functions on a metric space is continuous, A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions).
The sequence tends to zero, while tends to (For the sequence is null, and for the sequence diverges to ).
Arc length is the supremum of inscribed polygonal sums, and a piecewise- polygonal path has length equal to the sum of its edge lengths (Paths in , inscribed polygonal sums, arc length as their supremum, and rectifiability, A continuous piecewise- path is rectifiable and its length is the sum of the speed integrals over its pieces).
Uniform convergence gives only (Arc length is lower semicontinuous under uniform convergence of paths).
Euclidean isometries preserve length, and length is additive across subdivision points (A -Lipschitz map multiplies path length by at most ; isometries preserve length and scalar dilation multiplies it by the absolute scale, Arc length is additive across every subdivision point and decreases under restriction).
Verification
Define . Since , direct expansion gives and for every .
Put . Recursively, suppose is affine between consecutive points of . For an old edge from to , prescribe the five successive values of at parameters , , to be , , , , and , and make affine between them. The endpoint prescriptions agree on adjacent old edges, so [L1] gives the sequence.
Every old vertex is retained. By step 1.1, each old edge of length is replaced by four edges of length . Induction therefore gives edges of length in , and [L5] gives .
On an old edge of length , compare with the affine chord . At the five subdivision parameters their differences have norms at most . On each intervening interval the difference is affine, so the triangle inequality gives . Consequently, for , telescoping and the finite geometric-sum identity give .
Each coordinate sequence is uniformly Cauchy by step 4.1, so [L3] supplies uniform coordinate limits. Let be the resulting vector-valued limit. The inequality , obtained from the coordinate decomposition and norm axioms in [L2], makes the convergence uniform. Each is continuous, and [L3] makes continuous, hence a path.
Fix . Every vertex of remains unchanged in every later path, so uniform convergence gives for all . Thus the inscribed polygonal sum of on is . These sums are unbounded by [L4]. The defining supremum in [L5] is therefore , so is not rectifiable.
The classical Koch snowflake boundary is the concatenation of three isometric copies of . By [L7], each copy is nonrectifiable, and a rectifiable concatenation would have rectifiable restrictions. Hence the snowflake boundary is nonrectifiable.
Lower semicontinuity is consistent with the result but cannot prove it: [L6] yields only , a vacuous upper bound. The retained-vertex partitions in step 6.1 supply the necessary lower bounds.
on is rectifiable of length but is not differentiable at
Example
The path
is rectifiable with length , but it is not differentiable at and hence is not .
Facts & Assumptions
Given: The V-shaped path .
Vector differentiation is componentwise (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral).
A piecewise path has length equal to the sum of its speed integrals (A continuous piecewise- path is rectifiable and its length is the sum of the speed integrals over its pieces).
is the nonnegative number whose square is (Square roots exist: a unique with ; the positives are ).
Verification
On the derivative is , and on it is ; each has Euclidean norm by [L3].
The right difference quotients at equal and the left difference quotients equal . They have different limits, so the vector derivative at does not exist.
By [L2], the two pieces have lengths and , so the total length is .
Thus the path is rectifiable by step 2.1 but not differentiable, and therefore not continuously differentiable, at its corner.
Two paths can have the same trace and endpoints but different lengths: one traverses once and another traverses it forward, backward, and forward
Counterexample
Let on . Let be the polygonal path with successive values at parameters . Both traces are , but
Thus length belongs to a parametrized path, not to its trace alone. The difference is caused by backtracking, which is excluded by monotone reparametrization invariance.
Facts & Assumptions
Given: The paths and .
A continuous piecewise- path has length equal to the sum of the integrals of its speeds over the pieces (A continuous piecewise- path is rectifiable and its length is the sum of the speed integrals over its pieces).
The integral of a constant on is (If on then for every partition ; in particular every constant function is integrable, with ).
Verification
The identity path has constant derivative and speed , so [L1]--[L2] give .
On the three parameter thirds, has derivatives , hence speed . Each speed integral is , so [L1]--[L2] give .
Every value of either path lies in , and each path traverses the whole segment, so their traces agree even though steps 1.1--1.2 give different lengths.
Sawtooth paths converge uniformly to a line segment while every sawtooth has length and the limit has length
Counterexample
For each integer , let be the polygonal path through
at the corresponding parameters . Then converges uniformly to , but
Facts & Assumptions
Given: The zigzag paths above.
A continuous piecewise- path has length equal to the sum of the integrals of its speeds over the pieces (A continuous piecewise- path is rectifiable and its length is the sum of the speed integrals over its pieces).
The integral of a constant on is (If on then for every partition ; in particular every constant function is integrable, with ).
The sequence of real numbers tends to zero (For every in a complete ordered field there is a natural with ).
Uniform convergence guarantees only (Arc length is lower semicontinuous under uniform convergence of paths).
Verification
Every has first coordinate and second coordinate between and , so by [L3].
On each of the parameter intervals, has derivative or and hence constant speed . By [L1]--[L2], each piece contributes and .
The limit path has constant derivative and speed , so [L1]--[L2] give .
Thus lengths do not converge to the length of the uniform limit. The valid inequality [L4] reads , as expected.
The graph path of the Cantor function is rectifiable although its second coordinate is not absolutely continuous
Example
Let be the Cantor function and define on . Then is a rectifiable path, but its second coordinate is not absolutely continuous. Thus rectifiability, even together with continuity and coordinatewise monotonicity, does not imply absolute continuity.
Facts & Assumptions
Given: The Cantor set stages and Cantor function.
The Cantor function is continuous, nondecreasing, and satisfies , (The Cantor function is continuous on , The Cantor function is well defined, satisfies whenever , is surjective onto , and is constant on every interval removed from the Cantor set).
A real function has bounded variation exactly when it is a difference of two nondecreasing functions (Jordan decomposition for functions of bounded variation), and a path is rectifiable exactly when all coordinates have bounded variation (A path in is rectifiable exactly when every coordinate has bounded variation).
Absolute continuity requires small total input length to force small total endpoint increment over every finite family of intervals with disjoint interiors (Absolute continuity on a compact interval).
At stage , the Cantor construction retains disjoint closed intervals of length , indexed by the first ternary digits in (The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds, The Cantor set is exactly the set of with every , and this gives a bijection with ).
The Cantor function reads those first ternary digits as binary digits, so its increments over the retained stage- intervals are all and sum to (The Cantor function on , defined on the Cantor set through ternary digits and extended constantly across each removed interval, The Cantor function is well defined, satisfies whenever , is surjective onto , and is constant on every interval removed from the Cantor set).
A vector-valued function is continuous exactly when all its coordinate functions are continuous (A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions).
Verification
The identity coordinate and are nondecreasing by [L1], hence have bounded variation by [L2]. Their pairing is continuous by componentwise continuity.
The retained stage intervals have pairwise disjoint interiors and total length , which tends to zero by [L4] and [L6].
By [L5], the sum of the absolute increments of over those same intervals is for every .
Therefore [L2] makes rectifiable; quantitatively its length is at most the sum of the two coordinate variations, namely .
Taking , every proposed is defeated by a sufficiently large : step 1.2 makes the total interval length below , while step 1.3 leaves total image increment . This contradicts [L3], so is not absolutely continuous.
Sources
Standard references
Recommended treatments; not extraction sources.