Alphabeta Math
Session-authored (Fable 5 assisted)
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.

8 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 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Arc Length and Rectifiable Curves: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

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 p,qRn, the line segment γ(t)=(1t)p+tq on [0,1] has

L(γ)=qp2.

More generally, a polygonal path with successive vertices p0,,pm, traversing each segment once and in that order on adjacent parameter subintervals, has

L=i<mpi+1pi2.

For m=0 the path is constant and the empty sum is zero.

Facts & Assumptions

Given: The segment or polygonal path in the statement.

[L1]

A piecewise C1 path has length equal to the sum of the integrals of the speeds on its pieces (A continuous piecewise-C1 path is rectifiable and its length is the sum of the speed integrals over its pieces).

[L2]

Length is additive over adjacent parameter subintervals (Arc length is additive across every subdivision point and decreases under restriction).

Verification

technique · direct
1.1

The segment derivative is the constant vector qp, so [L1] gives L(γ)=01qp2dt=qp2.

givenL1algebra
2.1

On a polygonal path, the i-th affine piece has length pi+1pi2 by step 1.1, independently of its positive traversal time.

step 1.1algebra
3.1

Add the piece lengths using [L1] or [L2] to obtain the displayed sum. If m=0, the path is constant and both sides are zero.

step 2.1L1L2
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

For every θ0, the unit-circle path t(cost,sint) on [0,θ] has length θ

Example

For every real θ0, let

γθ:[0,θ]R2,γθ(t)=(cost,sint).

Then L(γθ)=θ. No geometric definition of angle or of π is used: sine and cosine are the published power-series functions.

Facts & Assumptions

Verification

technique · computation
1.1

If θ>0, [L1]--[L2] give γθ(t)=(sint,cost).

givenL1L2
2.1

By [L3], γθ(t)2=sin2t+cos2t=1.

step 1.1L3
3.1

Apply [L4] and [L5] to get L(γθ)=0θ1dt=θ.

step 2.1L4L5
4.1

If θ=0, the domain is a singleton and the defined length is 0=θ.

given
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The continuous path γ(x)=(x,xsin(1/x)) on [0,1], with γ(0)=(0,0), is not rectifiable

Counterexample

Define f:[0,1]R by f(0)=0 and f(x)=xsin(1/x) for x>0. Then f is continuous, but the graph path γ(x)=(x,f(x)) is not rectifiable.

Facts & Assumptions

Given: The function f and graph path γ.

[L1]

The number π is positive, and the shift formulas give sin(π/2+kπ)=(1)k for integers k0 (Pi as twice the smallest positive zero of cosine, Quarter-turn values and shifts by pi/2 and pi).

[L2]

The harmonic series diverges, the p=1 case of the rational p-series theorem (For rational p>0, 1/kp converges iff p>1); 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).

[L3]

Bounded variation means that all partition variation sums are bounded above (Bounded variation and total variation on an interval).

[L4]

A path is rectifiable exactly when all of its coordinate functions have bounded variation (A path in Rn is rectifiable exactly when every coordinate has bounded variation).

[L5]

Reciprocals of positive naturals tend below every positive bound (For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε).

[L6]

sinx1 for every real x (Parity and the Pythagorean identity for sine and cosine).

Verification

technique · divergent-variation
1.1

Since f(x)x for x>0, f(x)0=f(0) as x0; away from zero it is continuous. Thus γ is a path.

givenL6
1.2

Put xk=2/((2k+1)π). Positivity of π and [L5] give xk0, so choose K with xK1; and [L1] gives f(xk)=(1)kxk.

givenL1L5
2.1

For N>K, take the partition whose points are 0,xN,xN1,,xK,1, omitting a repeated endpoint if xK=1. Its variation contribution from consecutive xk is f(xk)f(xk+1)=xk+xk+1xk.

step 1.2L3
3.1

Since xk=2/((2k+1)π)1/(π(k+1)), [L2] says the tails k=KN1xk are unbounded. Hence the variation sums in step 2.1 are unbounded and f is not of bounded variation.

step 2.1L2algebra
4.1

The first coordinate xx has bounded variation, but the second does not by step 3.1. Therefore [L4] says the graph path is not rectifiable.

step 3.1L4
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The Koch curve is a uniform limit of polygonal paths of lengths (4/3)n but is not rectifiable

Counterexample

There are polygonal paths κn:[0,1]R2 that converge uniformly to a path κ and satisfy

L(κn)=(43)n,

yet the limit path is not rectifiable: L(κ)=+. 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.

[L1]

The recursion theorem produces a sequence once its initial value and update rule are specified (The recursion theorem).

[L3]

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).

[L5]

Arc length is the supremum of inscribed polygonal sums, and a piecewise-C1 polygonal path has length equal to the sum of its edge lengths (Paths in Rn, inscribed polygonal sums, arc length as their supremum, and rectifiability, A continuous piecewise-C1 path is rectifiable and its length is the sum of the speed integrals over its pieces).

[L6]

Uniform convergence gives only L(κ)lim infnL(κn) (Arc length is lower semicontinuous under uniform convergence of paths).

Verification

technique · construction
1.1

Define R(x,y):=(x/23y/2,3x/2+y/2). Since (3)2=3, direct expansion gives Rv2=v2 and vRv2=v2 for every vR2.

L2algebra
2.1

Put κ0(t)=(t,0). Recursively, suppose κn is affine between consecutive points of σn:={j/4n:0j4n}. For an old edge from A=κn(j/4n) to A+v=κn((j+1)/4n), prescribe the five successive values of κn+1 at parameters (4j+r)/4n+1, 0r4, to be A, A+v/3, A+v/3+Rv/3, A+2v/3, and A+v, and make κn+1 affine between them. The endpoint prescriptions agree on adjacent old edges, so [L1] gives the sequence.

step 1.1L1construct
3.1

Every old vertex is retained. By step 1.1, each old edge of length is replaced by four edges of length /3. Induction therefore gives 4n edges of length 3n in κn, and [L5] gives L(κn)=4n3n=(4/3)n.

step 1.1step 2.1L5algebra
4.1

On an old edge of length 3n, compare κn+1 with the affine chord κn. At the five subdivision parameters their differences have norms at most 0,3n/12,3n/2,3n/12,0. On each intervening interval the difference is affine, so the triangle inequality gives suptκn+1(t)κn(t)21/(23n). Consequently, for m>n, telescoping and the finite geometric-sum identity give suptκm(t)κn(t)2<3/(43n).

step 1.1step 2.1step 3.1L2algebra
5.1

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 z2z1+z2, obtained from the coordinate decomposition and norm axioms in [L2], makes the convergence κnκ uniform. Each κn is continuous, and [L3] makes κ continuous, hence a path.

step 4.1L2L3construct
6.1

Fix n. Every vertex of σn remains unchanged in every later path, so uniform convergence gives κ(j/4n)=κn(j/4n) for all 0j4n. Thus the inscribed polygonal sum of κ on σn is σn(κ)=4n3n=(4/3)n. These sums are unbounded by [L4]. The defining supremum in [L5] is therefore +, so κ is not rectifiable.

step 3.1step 5.1L4L5
7.1

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.

step 6.1L7
8.1

Lower semicontinuity is consistent with the result but cannot prove it: [L6] yields only L(κ)lim infn(4/3)n=+, a vacuous upper bound. The retained-vertex partitions in step 6.1 supply the necessary lower bounds.

step 3.1step 5.1step 6.1L4L6
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-08-13Open item page →

γ(t)=(t,t) on [1,1] is rectifiable of length 22 but is not differentiable at 0

Example

The path

γ:[1,1]R2,γ(t)=(t,t),

is rectifiable with length 22, but it is not differentiable at 0 and hence is not C1.

Facts & Assumptions

Verification

technique · computation
1.1

On [1,0] the derivative is (1,1), and on [0,1] it is (1,1); each has Euclidean norm 2 by [L3].

givenL1L3
1.2

The right difference quotients at 0 equal (1,1) and the left difference quotients equal (1,1). They have different limits, so the vector derivative at 0 does not exist.

givenL1
2.1

By [L2], the two pieces have lengths 2 and 2, so the total length is 22.

step 1.1L2
3.1

Thus the path is rectifiable by step 2.1 but not differentiable, and therefore not continuously differentiable, at its corner.

step 2.1step 1.2
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-13Open item page →

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

Let γ(t)=t on [0,1]. Let η:[0,1]R be the polygonal path with successive values 0,1,0,1 at parameters 0,1/3,2/3,1. Both traces are [0,1], but

L(γ)=1,L(η)=3.

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.

Verification

technique · computation
1.1

The identity path has constant derivative and speed 1, so [L1]--[L2] give L(γ)=1.

givenL1L2algebra
1.2

On the three parameter thirds, η has derivatives 3,3,3, hence speed 3. Each speed integral is 3(1/3)=1, so [L1]--[L2] give L(η)=3.

givenL1L2algebra
2.1

Every value of either path lies in [0,1], and each path traverses the whole segment, so their traces agree even though steps 1.1--1.2 give different lengths.

step 1.1step 1.2
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Sawtooth paths converge uniformly to a line segment while every sawtooth has length 2 and the limit has length 1

Counterexample

For each integer k1, let γk:[0,1]R2 be the polygonal path through

pk,j=(j2k,1(1)j4k),0j2k,

at the corresponding parameters j/(2k). Then γk converges uniformly to γ(t)=(t,0), but

L(γk)=2for every k,L(γ)=1.

Facts & Assumptions

Verification

technique · construction
1.1

Every γk(t) has first coordinate t and second coordinate between 0 and 1/(2k), so suptγk(t)γ(t)21/(2k)0 by [L3].

givenL3
1.2

On each of the 2k parameter intervals, γk has derivative (1,1) or (1,1) and hence constant speed 2. By [L1]--[L2], each piece contributes 2/(2k) and L(γk)=2.

givenL1L2algebra
1.3

The limit path has constant derivative (1,0) and speed 1, so [L1]--[L2] give L(γ)=1.

givenL1L2algebra
2.1

Thus lengths do not converge to the length of the uniform limit. The valid inequality [L4] reads 12, as expected.

step 1.1step 1.2step 1.3L4
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The graph path t(t,c(t)) of the Cantor function is rectifiable although its second coordinate is not absolutely continuous

Example

Let c be the Cantor function and define γ(t)=(t,c(t)) on [0,1]. Then γ is a rectifiable path, but its second coordinate c 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.

[L2]

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 Rn is rectifiable exactly when every coordinate has bounded variation).

[L3]

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).

[L7]

Verification

technique · construction
1.1

The identity coordinate and c are nondecreasing by [L1], hence have bounded variation by [L2]. Their pairing is continuous by componentwise continuity.

givenL1L2L7
1.2

The 2n retained stage intervals have pairwise disjoint interiors and total length 2n3n=(2/3)n, which tends to zero by [L4] and [L6].

L4L6
1.3

By [L5], the sum of the absolute increments of c over those same intervals is 2n2n=1 for every n.

L5
2.1

Therefore [L2] makes γ rectifiable; quantitatively its length is at most the sum of the two coordinate variations, namely 2.

step 1.1L2
3.1

Taking ε=1/2, every proposed δ>0 is defeated by a sufficiently large n: step 1.2 makes the total interval length below δ, while step 1.3 leaves total image increment 1. This contradicts [L3], so c is not absolutely continuous.

step 1.2step 1.3L3

Sources