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 complex path is a map continuous from the usual real metric to (Intervals of : the nine order-convex forms, nondegeneracy, and length, The absolute value makes a metric space: is a metric, its open balls are the intervals , 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 and is a partition of as in Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, define
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 , its order, and the arithmetic that is left undefined, Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in ). The path is rectifiable when these sums are bounded above by a real number, equivalently when . 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 , define and call every path rectifiable. This convention does not invoke a partition, whose definition requires distinct endpoints.
Facts & Assumptions
Given: Reals and a continuous map .
The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane: is a metric with finite nonnegative real values.
Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions: For , a partition is a finite strictly increasing list with ; finite sums are as in Finite sums and finite products, by recursion and sums of nonnegative terms are nonnegative by Laws of finite sums and finite products.
The extended real line , its order, and the arithmetic that is left undefined and Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in : Every subset of has an extended-real supremum; for a nonempty set of real numbers bounded above in , that supremum is the real least upper bound.
Proof
If , every partition chord contributes , a finite nonnegative real by [F1]. The finite sum is therefore a finite nonnegative real by [F2].
The set of partition sums is nonempty: the list with , , , and tail 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.
If , the definition assigns length and rectifiability directly; no partition is available or used.
Depends on
- The complex numbers as $\mathbb R[x]/(x^2+1)$, with the real embedding and imaginary unit $i$
- The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane
- Continuity of a map between metric spaces, at a point and globally, in the $\varepsilon$-$\delta$ form
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- The absolute value makes $\mathbb{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
- Partition of $[a,b]$ as a finite strictly increasing list $a = t_0 < t_1 < \dots < t_n = b$, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions
- Complete ordered field (least-upper-bound property)
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Every subset of $\overline{\mathbb{R}}$ has a least upper bound and a greatest lower bound in $\overline{\mathbb{R}}$, agreeing with the real supremum and infimum on nonempty sets bounded in $\mathbb{R}$
- Finite sums and finite products, by recursion
- Laws of finite sums and finite products
Used by
- Filled complex triangles, their oriented three-edge boundary contours, diameter, and perimeter Definition
- Rectifiable complex contours, reversal, concatenation, closedness, and orientation Definition
- A finite coordinate path and a bounded nonrectifiable path Example
- Complex path length equals coordinate length and piecewise speed integral Theorem
- Complex path length is invariant under monotone surjective reparametrization Theorem
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
- E. Stein and R. Shakarchi, Complex Analysis, Princeton Lectures in Analysis II, Chapter 1, Section 3 (standard reference, not scraped)
- L. V. Ahlfors, Complex Analysis, 3rd ed., Chapter 4, Section 1.2 (standard reference, not scraped)