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.
Complex Coordinate and Path Transport
1 · Prerequisites
- 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
- Connectedness
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- 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
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- 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
- Simple Field Extensions and the Construction of the Complex Numbers
- Suprema and Infima
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page makes the identification precise for real-linear maps, metric topology, and total derivatives. It defines polygonal length directly for complex-valued paths, then transfers length, bounded variation, piecewise- speed, and monotone reparametrization through the coordinate isometry. The proofs retain arbitrary real affine parameters, singleton intervals, corners, zero-speed pieces, pauses, and reversal.
The prerequisite interfaces are the complex metric and real coordinate model, the Euclidean total derivative, the Euclidean path-length results, connectedness, and arc length. The A-page items distinguish facts inherited from these published suppliers from the type-specific transport arguments proved here.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The complex coordinate map preserves real scalar multiplication
Statement
Let be the coordinate bijection . Here a map is real-linear when it preserves addition and multiplication by real scalars embedded in via The complex numbers as , with the real embedding and imaginary unit . Then is real-linear: for all and ,
Facts & Assumptions
Given: The complex field and the coordinate map .
is the real coordinate plane, with coordinate arithmetic: Each complex number has a unique form ; is bijective and preserves addition, and .
The complex numbers as , with the real embedding and imaginary unit : The canonical real embedding is the constant-class map; the imaginary unit is the class of , so an embedded real has coordinate form .
Proof
Write . The embedded scalar has coordinates by [F2], so the coordinate multiplication formula in [F1] gives for every , including .
Additivity and bijectivity are [F1]; step 1.1 supplies real homogeneity. These are exactly the stated real-linearity conditions, so is a real-linear bijection.
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.
The complex coordinate isometry transports topology and affine segments
Statement
Equip with and with the Euclidean metric . The coordinate bijection is a bijective isometry and a homeomorphism. For every and every ,
For each , the image is open, closed, bounded, compact, or connected exactly when has the corresponding property in the indicated ambient metric or topological space. Moreover,
Subsets use their induced metric and topology.
Facts & Assumptions
Given: The coordinate map and the two ambient metric spaces.
is the real coordinate plane, with coordinate arithmetic and The complex coordinate map preserves real scalar multiplication: is a bijection preserving addition and real scalar multiplication.
Open ball, closed ball and sphere in a metric space and The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement define balls and open and closed sets; Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed establishes the metric topology; Isometry, isometric embedding, and the subspace metric on a subset defines isometry; Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological defines homeomorphism.
Interior, closure, boundary, limit point, isolated point and dense subset of a metric space: interior is tested by contained balls, closure by balls meeting the set, and boundary is closure minus interior.
Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space: a subset is bounded when it is empty or lies in some open ball.
Open cover, subcover, compact metric space, and compact subset of a metric space and The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset: compact subsets use the induced metric and continuous images of compact subsets are compact.
A continuous image of a connected space is connected, and connectedness is a topological property: a continuous image of a connected subset, with its induced topology, is connected.
Proof
For , [F2] gives , so bijectivity [F1] makes an isometry. For every , exactly when ; hence , and the inverse has the reverse correspondence. If is open, let be the family of all open balls contained in . Every point of lies in one such ball by the definition of openness, and every member of is contained in , so . The ball correspondence maps this union to a union of open Euclidean balls; the arbitrary-union clause of [F3] makes open. The same argument for the inverse shows that both maps are open. Equality of distances gives continuity of both maps with , so the bijection is a homeomorphism by [F3].
Real-linearity [F1] gives for every real .
By the ball correspondence in step 1.1, a ball around is contained in exactly when its image ball is contained in ; likewise a ball around meets exactly when its image ball meets . The definitions in [F4] therefore give the interior and closure identities. Bijectivity preserves set difference, so it also gives the boundary identity. Openness transfers by the same ball test, and closedness transfers because complements correspond under the bijection.
If , then and boundedness, compactness, and connectedness agree for the identical empty subsets. Otherwise, ball correspondence transfers containment in a ball in both directions, proving boundedness. The restrictions and are continuous. Applying the compact-image theorem [F6] to these restrictions proves compactness in both directions; applying the connected-image theorem [F7] proves connectedness in both directions.
Real total derivatives transport through the complex coordinate isometry
Statement
Let be open in , let , and let . Define . The set is open by The complex coordinate isometry transports topology and affine segments. A map is real-linear when it preserves addition and multiplication by embedded real scalars. Then is totally differentiable at exactly when there is a real-linear such that, with ,
as , , and . In that case
The map need not be complex-linear; this is a real total-derivative statement.
Facts & Assumptions
Given: The open set , the point , the map , and the coordinate map .
The complex coordinate isometry transports topology and affine segments and The complex coordinate map preserves real scalar multiplication: is a bijective real-linear isometry, and is open.
A linear map in Euclidean coordinates: A linear map between Euclidean coordinate spaces preserves real linear combinations.
The total (Fréchet) derivative as the linear first-order approximation with remainder: Total differentiability is a linear first-order approximation whose Euclidean remainder divided by the input norm tends to zero.
Proof
The inverse is real-linear: for arbitrary , choose with and , possible by [F1]. Additivity of gives ; for every , its real homogeneity gives .
The correspondence sends each real-linear to a real-linear map by [F1], [F2], and step 1.1. Conversely, for each real-linear , the map is real-linear by the same facts, and the two constructions are inverse because and are identity maps. Thus this is a bijection between the real-linear maps on the two coordinate spaces.
For corresponding from step 2.1, put . Additivity gives . If and , then the definition of and give . The isometry [F1] therefore gives for ; the bijective isometry also sends exactly to and sends the condition exactly to . Hence the two remainder limits are equivalent.
By [F3], total differentiability of at means that some real-linear has Euclidean remainder ratio tending to zero. Steps 2.1 and 3.1 identify such maps bijectively with real-linear and identify their remainder ratios, so this condition is equivalent to existence of the stated with the complex remainder ratio tending to zero. For each corresponding pair, the Euclidean derivative is .
Complex path length equals coordinate length and piecewise speed integral
Statement
Let and let be continuous. Put , where and . For every partition, the complex polygonal sum of equals the Euclidean polygonal sum of , and
including singleton intervals. Consequently, is rectifiable exactly when both and have bounded variation.
If and there is a finite partition such that on each piece the path is differentiable in the interior and its derivative extends continuously to the closed piece, then
Corners and zero-speed pieces are allowed. On a singleton interval the length and coordinate variations are zero, and the piecewise-speed sum is empty.
Facts & Assumptions
Given: The continuous complex path and, when , the stated finite subdivision.
The complex coordinate isometry transports topology and affine segments: is a bijective isometry from to .
Polygonal length and rectifiability of complex paths and Paths in , inscribed polygonal sums, arc length as their supremum, and rectifiability: Both lengths are suprema over the same interval partitions, with singleton length zero.
Real and imaginary parts, complex conjugation, and modulus: and , so the coordinates of are .
A path in is rectifiable exactly when every coordinate has bounded variation: A continuous path is rectifiable exactly when both coordinate functions have bounded variation, including the singleton case.
A continuous piecewise- path is rectifiable and its length is the sum of the speed integrals over its pieces: A continuous piecewise- Euclidean path has finite length equal to the sum of the speed integrals on the pieces; derivatives need not match at corners.
The -norms for rational , and : For , .
Proof
The path is continuous: for any , [F1] gives , so the continuity condition for implies that for . By [F3], . For each partition point pair, [F1] identifies the chord lengths; summing termwise gives equal polygonal sums by [F2].
If , taking the supremum of those equal sums over the identical partition set in [F2] gives . If , both lengths are zero by [F2].
Apply [F4] to the continuous path . The length equality in step 2.1 identifies its rectifiability with that of , and [F3] identifies its coordinate functions with and . Thus the bounded-variation equivalence holds in both directions.
Under the piecewise- hypothesis with , [F5] applies to on the given subdivision. Substituting the length equality from step 2.1 gives the first integral formula and finiteness; [F6] gives the displayed square-root integrand. No derivative equality at adjacent endpoints is required by [F5].
If , [F2] gives zero for both lengths, [F4] gives zero coordinate variations, and the speed sum is empty. Hence all stated boundary conventions hold.
Complex path length is invariant under monotone surjective reparametrization
Statement
Let and . Suppose is continuous and is continuous, surjective, and either nondecreasing or nonincreasing in the sense of Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of , with the dictionary to monotone sequences. Then
The equality includes finite and infinite lengths, constant pauses, reversal, and singleton intervals. A nondecreasing map preserves parameter order; a nonincreasing map reverses it. When , is constant and there is no nontrivial orientation to distinguish.
Facts & Assumptions
Given: The intervals, continuous path, and continuous surjective monotone map in the statement.
Polygonal length and rectifiability of complex paths: A complex path must be continuous from the usual real metric to , and its length is the extended-real supremum of its partition sums, with singleton length zero.
The complex coordinate isometry transports topology and affine segments and Complex path length equals coordinate length and piecewise speed integral: is an isometry and the length of every continuous complex path equals that of its coordinate path, including singleton intervals.
Arc length is invariant under every continuous surjective monotone reparametrization, including pauses and reversal: A continuous surjective nondecreasing or nonincreasing reparametrization preserves Euclidean polygonal length, including pauses, reversal, and singleton intervals.
Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of , with the dictionary to monotone sequences: Nondecreasing maps preserve order and nonincreasing maps reverse order.
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, The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded, and Intervals of : the nine order-convex forms, nondegeneracy, and length: Continuity is the metric - condition on the indicated interval subspaces; the real metric is and the complex metric is .
Proof
The composite is continuous. Indeed, fix and . By continuity of at choose such that and imply . By continuity of at choose such that and imply . The implication in [F5] then proves continuity of the composite at .
If , surjectivity forces , so both lengths are zero by [F1]. If while , then and are constant paths and both lengths are zero by [F1]. Thus the equality covers all singleton cases.
Put . By the isometry in [F2], is continuous and . The Euclidean reparametrization theorem [F3] gives .
Apply the complex-to-coordinate length equality [F2] to and, using step 1.1, to . Together with step 2.1 this yields .
By [F4], the nondecreasing case preserves order and the nonincreasing case reverses it. If , a nondecreasing surjection must attain at and at ; a nonincreasing surjection must attain at and at . If , the map is constant and there is no nontrivial orientation.
5 · Examples, counterexamples and false statements
None yet.
Sources
- J. Lebl, Guide to Cultivating Complex Analysis, Section 1.1.1
- E. Stein and R. Shakarchi, Complex Analysis, Princeton Lectures in Analysis II, Chapter 1, Section 1.1
- E. Stein and R. Shakarchi, Complex Analysis, Princeton Lectures in Analysis II, Chapter 1, Section 3
- L. V. Ahlfors, Complex Analysis, 3rd ed., Chapter 4, Section 1.2
- J. Lebl, Guide to Cultivating Complex Analysis, Sections 2.1.2 and 2.2.2
- U. Lang, Differential Geometry I, Section 1.1