Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Polygonal length and rectifiability of complex paths

Definition

For a≤b, a complex path is a map γ:[a,b]→C continuous from the usual real metric to dC(z,w)=∣z−w∣ (Intervals of R: the nine order-convex forms, nondegeneracy, and length, The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, Continuity of a map between metric spaces, at a point and globally, in the ε-δ form, The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane). Its domain and parametrization are part of the path, not merely its trace.

If a<b and P=(n,t) is a partition of [a,b] as in Partition of [a,b] as a finite strictly increasing list a=t0<t1<⋯<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, define

ℓPC(γ):=∑j<n∣γ(tj+1)−γ(tj)∣,LC(γ):=sup⁡PℓPC(γ)∈R‾.

The sum is the ordinary finite real sum of the moduli of the chords. Its supremum is taken in the extended real line (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined, Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R). The path is rectifiable when these sums are bounded above by a real number, equivalently when LC(γ)<+∞. A bounded trace alone does not imply rectifiability; the companion worked example gives a continuous path with bounded trace and unbounded partition sums.

On a singleton interval [a,a], define LC(γ)=0 and call every path rectifiable. This convention does not invoke a partition, whose definition requires distinct endpoints.

Facts & Assumptions

Given: Reals a≤b and a continuous map γ:[a,b]→C.

[F1]

The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane: dC(z,w)=∣z−w∣ is a metric with finite nonnegative real values.

Proof

1.1givenF1F2

If a<b, every partition chord contributes ∣γ(tj+1)−γ(tj)∣=dC(γ(tj+1),γ(tj)), a finite nonnegative real by [F1]. The finite sum is therefore a finite nonnegative real by [F2].

2.1F2F3step 1.1construct

The set of partition sums is nonempty: the list with n=1, t0=a, t1=b, and tail tk=b is a partition. Thus [F3] supplies its extended-real supremum. Since every sum is nonnegative, the supremum is not −∞; it is finite exactly when some real number bounds all partition sums above. This is the stated rectifiability criterion.

3.1givenF2∎

If a=b, the definition assigns length 0 and rectifiability directly; no partition is available or used.

Depends on

Used by

Dependency tree · two levels

56 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