Alphabeta Math
Pipeline-generated
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

2 · Summary

This page makes the identification C≅R2 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-C1 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

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

The complex coordinate map preserves real scalar multiplication

Statement

Let Φ:C→R2 be the coordinate bijection Φ(a+bi)=(a,b). Here a map is real-linear when it preserves addition and multiplication by real scalars embedded in C via The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i. Then Φ is real-linear: for all z,w∈C and r∈R,

Φ(z+w)=Φ(z)+Φ(w),Φ(rz)=rΦ(z).

Facts & Assumptions

Given: The complex field and the coordinate map Φ.

[F1]

C is the real coordinate plane, with coordinate arithmetic: Each complex number has a unique form a+bi; Φ is bijective and preserves addition, and Φ((a+bi)(u+vi))=(au−bv,av+bu).

[F2]

The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i: The canonical real embedding is the constant-class map; the imaginary unit is the class of x, so an embedded real r has coordinate form r+0i.

Proof

1.1givenF1F2algebra

Write z=a+bi. The embedded scalar has coordinates (r,0) by [F2], so the coordinate multiplication formula in [F1] gives Φ(rz)=(ra,rb)=r(a,b)=rΦ(z) for every r, including r=0.

2.1F1step 1.1∎

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.

DefinitionDefinition: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

The complex coordinate isometry transports topology and affine segments

Statement

Equip C with dC(z,w)=∣z−w∣ and R2 with the Euclidean metric d2. The coordinate bijection Φ(a+bi)=(a,b) is a bijective isometry and a homeomorphism. For every z,w∈C and every t∈R,

Φ((1−t)z+tw)=(1−t)Φ(z)+tΦ(w).

For each A⊆C, the image Φ[A] is open, closed, bounded, compact, or connected exactly when A has the corresponding property in the indicated ambient metric or topological space. Moreover,

Φ[int⁡dCA]=int⁡d2Φ[A].

Φ[A‾ dC]=Φ[A]‾ d2.

Φ[∂dCA]=∂d2Φ[A].

Subsets use their induced metric and topology.

Facts & Assumptions

Given: The coordinate map Φ and the two ambient metric spaces.

[F1]
[F4]

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.

[F7]

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

1.1F1F2F3

For z,w∈C, [F2] gives d2(Φz,Φw)=dC(z,w), so bijectivity [F1] makes Φ an isometry. For every r>0, u∈BC(z,r) exactly when Φu∈B2(Φz,r); hence Φ[BC(z,r)]=B2(Φz,r), and the inverse has the reverse correspondence. If U⊆C is open, let BU be the family of all open balls contained in U. Every point of U lies in one such ball by the definition of openness, and every member of BU is contained in U, so U=⋃BU. The ball correspondence maps this union to a union of open Euclidean balls; the arbitrary-union clause of [F3] makes Φ[U] 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].

1.2F1algebra

Real-linearity [F1] gives Φ((1−t)z+tw)=Φ((1−t)z)+Φ(tw)=(1−t)Φ(z)+tΦ(w) for every real t.

2.1F3F4step 1.1

By the ball correspondence in step 1.1, a ball around z is contained in A exactly when its image ball is contained in Φ[A]; likewise a ball around z meets A exactly when its image ball meets Φ[A]. 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.

3.1F5F6F7step 1.1given∎

If A=∅, then Φ[A]=∅ 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 Φ∣A and Φ−1∣Φ[A] 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.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Real total derivatives transport through the complex coordinate isometry

Statement

Let U⊆C be open in dC, let z∈U, and let f:U→C. Define fR:=Φ∘f∘Φ−1:Φ[U]→R2. The set Φ[U] is open by The complex coordinate isometry transports topology and affine segments. A map L:C→C is real-linear when it preserves addition and multiplication by embedded real scalars. Then fR is totally differentiable at Φ(z) exactly when there is a real-linear L such that, with r(h):=f(z+h)−f(z)−L(h),

∣r(h)∣∣h∣⟶0

as h→0, h≠0, and z+h∈U. In that case

DfR(Φ(z))=Φ∘L∘Φ−1.

The map L need not be complex-linear; this is a real total-derivative statement.

Facts & Assumptions

Given: The open set U, the point z∈U, the map f, and the coordinate map Φ.

[F2]

A linear map L:Rm→Rn in Euclidean coordinates: A linear map between Euclidean coordinate spaces preserves real linear combinations.

[F3]

The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder: Total differentiability is a linear first-order approximation whose Euclidean remainder divided by the input norm tends to zero.

Proof

1.1givenF1algebrachoose

The inverse Φ−1 is real-linear: for arbitrary u,v∈R2, choose ζ,ω∈C with Φ(ζ)=u and Φ(ω)=v, possible by [F1]. Additivity of Φ gives Φ−1(u+v)=Φ−1(Φ(ζ+ω))=ζ+ω=Φ−1u+Φ−1v; for every λ∈R, its real homogeneity gives Φ−1(λu)=Φ−1(Φ(λζ))=λζ=λΦ−1u.

2.1givenF1F2step 1.1algebra

The correspondence L↦Φ∘L∘Φ−1 sends each real-linear L to a real-linear map A by [F1], [F2], and step 1.1. Conversely, for each real-linear A, the map L=Φ−1∘A∘Φ is real-linear by the same facts, and the two constructions are inverse because Φ−1∘Φ and Φ∘Φ−1 are identity maps. Thus this is a bijection between the real-linear maps on the two coordinate spaces.

3.1givenF1step 2.1algebra

For corresponding L,A from step 2.1, put k=Φ(h). Additivity gives Φ(z+h)=Φ(z)+k. If r(h)=f(z+h)−f(z)−L(h) and ρ(k)=fR(Φ(z)+k)−fR(Φ(z))−A(k), then the definition of fR and A(k)=Φ(L(h)) give ρ(k)=Φ(r(h)). The isometry [F1] therefore gives ∥ρ(k)∥2/∥k∥2=∣r(h)∣/∣h∣ for h≠0; the bijective isometry also sends h→0 exactly to k→0 and sends the condition z+h∈U exactly to Φ(z)+k∈Φ[U]. Hence the two remainder limits are equivalent.

4.1givenF3step 2.1step 3.1∎

By [F3], total differentiability of fR at Φ(z) means that some real-linear A has Euclidean remainder ratio tending to zero. Steps 2.1 and 3.1 identify such maps A bijectively with real-linear L and identify their remainder ratios, so this condition is equivalent to existence of the stated L with the complex remainder ratio tending to zero. For each corresponding pair, the Euclidean derivative is A=Φ∘L∘Φ−1.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Complex path length equals coordinate length and piecewise speed integral

Statement

Let a≤b and let γ:[a,b]→C be continuous. Put Γ:=Φ∘γ=(x,y), where x(t)=Re⁡γ(t) and y(t)=Im⁡γ(t). For every partition, the complex polygonal sum of γ equals the Euclidean polygonal sum of Γ, and

LC(γ)=LR2(Γ),

including singleton intervals. Consequently, γ is rectifiable exactly when both x and y have bounded variation.

If a<b and there is a finite partition a=t0<⋯<tm=b such that on each piece [tj,tj+1] the path Γ is differentiable in the interior and its derivative extends continuously to the closed piece, then

LC(γ)=∑j<m∫tjtj+1∥Γj′(t)∥2 dt=∑j<m∫tjtj+1xj′(t)2+yj′(t)2 dt<∞.

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 a<b, the stated finite subdivision.

[F1]

The complex coordinate isometry transports topology and affine segments: Φ is a bijective isometry from dC to d2.

[F2]

Polygonal length and rectifiability of complex paths and Paths in Rn, inscribed polygonal sums, arc length as their supremum, and rectifiability: Both lengths are suprema over the same interval partitions, with singleton length zero.

[F3]

Real and imaginary parts, complex conjugation, and modulus: Re⁡(a+bi)=a and Im⁡(a+bi)=b, so the coordinates of Φ(γ(t)) are x(t),y(t).

[F4]

A path in Rn is rectifiable exactly when every coordinate has bounded variation: A continuous R2 path is rectifiable exactly when both coordinate functions have bounded variation, including the singleton case.

[F5]

A continuous piecewise-C1 path is rectifiable and its length is the sum of the speed integrals over its pieces: A continuous piecewise-C1 Euclidean path has finite length equal to the sum of the speed integrals on the pieces; derivatives need not match at corners.

[F6]

The p-norms ∥x∥p for rational p≥1, and ∥x∥∞: For (u,v)∈R2, ∥(u,v)∥2=u2+v2.

Proof

1.1givenF1F2F3algebra

The path Γ is continuous: for any s,t∈[a,b], [F1] gives d2(Γ(s),Γ(t))=dC(γ(s),γ(t)), so the continuity condition for γ implies that for Γ. By [F3], Γ=(x,y). For each partition point pair, [F1] identifies the chord lengths; summing termwise gives equal polygonal sums by [F2].

2.1F2step 1.1

If a<b, taking the supremum of those equal sums over the identical partition set in [F2] gives LC(γ)=LR2(Γ). If a=b, both lengths are zero by [F2].

3.1F3F4step 2.1

Apply [F4] to the continuous R2 path Γ. The length equality in step 2.1 identifies its rectifiability with that of γ, and [F3] identifies its coordinate functions with x and y. Thus the bounded-variation equivalence holds in both directions.

3.2givenF5F6step 2.1algebra

Under the piecewise-C1 hypothesis with a<b, [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].

4.1givenF2F4∎

If a=b, [F2] gives zero for both lengths, [F4] gives zero coordinate variations, and the speed sum is empty. Hence all stated boundary conventions hold.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Complex path length is invariant under monotone surjective reparametrization

Statement

Let a≤b and c≤d. Suppose γ:[a,b]→C is continuous and φ:[c,d]→[a,b] 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 R, with the dictionary to monotone sequences. Then

LC(γ∘φ)=LC(γ).

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 a=b, φ 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.

[F1]

Polygonal length and rectifiability of complex paths: A complex path must be continuous from the usual real metric to dC, and its length is the extended-real supremum of its partition sums, with singleton length zero.

[F2]

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.

[F3]

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.

Proof

1.1givenF1F5choose

The composite γ∘φ is continuous. Indeed, fix s0∈[c,d] and ε>0. By continuity of γ at φ(s0) choose δ>0 such that u∈[a,b] and ∣u−φ(s0)∣<δ imply dC(γ(u),γ(φ(s0)))<ε. By continuity of φ at s0 choose η>0 such that s∈[c,d] and ∣s−s0∣<η imply ∣φ(s)−φ(s0)∣<δ. The implication in [F5] then proves continuity of the composite at s0.

1.2givenF1

If c=d, surjectivity forces a=b, so both lengths are zero by [F1]. If a=b while c<d, then γ and γ∘φ are constant paths and both lengths are zero by [F1]. Thus the equality covers all singleton cases.

2.1givenF2F3step 1.1

Put Γ=Φ∘γ. By the isometry in [F2], Γ is continuous and Φ∘(γ∘φ)=Γ∘φ. The Euclidean reparametrization theorem [F3] gives LR2(Γ∘φ)=LR2(Γ).

3.1F2step 1.1step 2.1

Apply the complex-to-coordinate length equality [F2] to γ and, using step 1.1, to γ∘φ. Together with step 2.1 this yields LC(γ∘φ)=LC(γ).

4.1givenF4algebra∎

By [F4], the nondecreasing case preserves order and the nonincreasing case reverses it. If a<b, a nondecreasing surjection must attain a at c and b at d; a nonincreasing surjection must attain b at c and a at d. If a=b, the map is constant and there is no nontrivial orientation.

5 · Examples, counterexamples and false statements

None yet.

Sources