Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13
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.

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 inf⁡nL(κn) (Arc length is lower semicontinuous under uniform convergence of paths).

Verification

technique · construction
1.1

Define R(x,y):=(x/2−3 y/2,3 x/2+y/2). Since (3)2=3, direct expansion gives ∥Rv∥2=∥v∥2 and ∥v−Rv∥2=∥v∥2 for every v∈R2.

L2algebra
2.1

Put κ0(t)=(t,0). Recursively, suppose κn is affine between consecutive points of σn:={j/4n:0≤j≤4n}. 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, 0≤r≤4, 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 3−n in κn, and [L5] gives L(κn)=4n3−n=(4/3)n.

step 1.1step 2.1L5algebra
4.1

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

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 ∥z∥2≤∣z1∣+∣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 0≤j≤4n. Thus the inscribed polygonal sum of κ on σn is ℓσn(κ)=4n3−n=(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 inf⁡n(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∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

91 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