Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

A finite coordinate path and a bounded nonrectifiable path

Example

Let Φ(a+bi)=(a,b), take z=1+2i, w=3−i, r=−2, and t=1/3. On [0,3], define the continuous path

γ(s)={s,0≤s≤1,1+i(s−1),1≤s≤2,1+i,2≤s≤3.

It travels one unit horizontally, one unit vertically, then pauses. Compare its length with its coordinate path under both a decreasing reversal and a nondecreasing reparametrization with a pause. Also compare the coordinates of rz and (1−t)z+tw, the distance between z,w, the image of the ball BC(1+i,2), and the real total derivative of conjugation f(ζ)=ζ‾.

For the bounded-trace caveat, define a second real-valued complex path η:[0,1]→C. For n≥1 let an=1/(2n), bn=1/(2n−1), mn=(an+bn)/2, and In=[an,bn]. Put η(0)=0, and for t∈In set

η(t)={t−anmn−an1n,an≤t≤mn,bn−tbn−mn1n,mn≤t≤bn.

For t>0 outside all In, put η(t)=0. Each real value is read as its canonical image in C.

Facts & Assumptions

Given: The displayed complex numbers, real parameters, functions, and intervals, including the path η defined in the example.

[F1]

The complex coordinate map preserves real scalar multiplication: Φ(rz)=rΦ(z) and Φ preserves real affine combinations.

[F2]

The complex coordinate isometry transports topology and affine segments: Φ preserves all distances and maps metric balls to the corresponding Euclidean balls.

[F3]

Real total derivatives transport through the complex coordinate isometry: A real-linear first-order approximation in complex coordinates transports to the Euclidean total derivative by conjugating with Φ.

[F4]

Polygonal length and rectifiability of complex paths: A path is continuous from the usual real metric to dC; singleton paths have length zero.

[F5]

Complex path length equals coordinate length and piecewise speed integral: Complex path length equals coordinate length, rectifiability is equivalent to coordinate bounded variation, and piecewise-C1 length is the sum of Euclidean speed integrals.

[F6]

Complex path length is invariant under monotone surjective reparametrization: Continuous surjective monotone reparametrizations preserve complex length, including pauses, reversal, and singleton intervals.

[F7]

Real and imaginary parts, complex conjugation, and modulus: If ζ=x+iy, then ζ‾=x−iy and ∣ζ∣=x2+y2.

[F11]

The natural numbers N (von Neumann), Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order, and Every complete ordered field is Archimedean: Natural indices have positive real images, reciprocals of positive reals reverse order, and N can be chosen so 1/N is arbitrarily small.

[F12]

Finite sums and finite products, by recursion and Laws of finite sums and finite products: Prefix sums satisfy ∑j<0cj=0 and ∑j<d+1cj=∑j<dcj+cd; they are additive, obey constant-sum scaling, and are monotone under termwise inequalities.

[F13]

Addition of natural numbers, Order on the natural numbers, Order is compatible with addition, Left identity for addition, ≤ is a linear order on N, The recursion theorem, and The principle of mathematical induction: Natural addition and order are compatible, 0+q=q, the natural order is transitive and total, recursion supplies the sequence below, and induction verifies properties of all its terms.

Verification

1.1givenF1F2algebra

The coordinates are Φ(z)=(1,2) and Φ(w)=(3,−1). Since rz=−2−4i, Φ(rz)=(−2,−4)=−2(1,2)=rΦ(z) by [F1]. Also (1−t)z+tw=23(1+2i)+13(3−i)=53+i, whose coordinates are (53,1)=23(1,2)+13(3,−1) by [F1] and [F2].

1.2givenF2F7F8algebra

We have w−z=2−3i, so ∣w−z∣=22+(−3)2=13. The Euclidean distance between (1,2) and (3,−1) is the same 13, and [F2] gives Φ[BC(1+i,2)]=B2((1,1),2).

1.3givenF1F3F7F8algebra

The domain U=C is open by [F8]. For ζ=x+iy, conjugation has coordinates fR(x,y)=(x,−y), the matrix map diag⁡(1,−1). If hj=uj+ivj and r∈R, then h1+h2‾=(u1+u2)−i(v1+v2)=h1‾+h2‾ and rh1‾=ru1−irv1=rh1‾, so L(h)=h‾ is real-linear. For any h=u+iv, [F1] and [F7] give f(ζ+h)−f(ζ)=h‾, so its remainder is zero. The quotient ∣r(h)∣/∣h∣ is therefore zero for every h≠0, and [F3] gives DfR(Φ(ζ))=(100−1).

1.4givenF4F7F9F10construct

The formulas agree at s=1 and s=2. On the first and second pieces the distance between values at s and s0 equals ∣s−s0∣, because their differences are respectively real and purely imaginary and the modulus formulas in [F7] and [F10] give this equality; on the constant third piece it is zero. Thus each restriction is continuous. At either breakpoint s0∈{1,2}, take δ=min⁡(ε,1/2). Then every s∈[0,3] with ∣s−s0∣<δ lies in the adjacent pieces, where dC(γ(s),γ(s0))=∣s−s0∣ on a moving piece and is zero on the constant piece; hence the distance is less than ε. At 0 and 3 continuity follows from the corresponding endpoint of the continuous first and last restrictions. Thus γ is continuous by [F9]. Its coordinate functions are x(s)=s on [0,1] and 1 on [1,3], and y(s)=0 on [0,1], s−1 on [1,2], and 1 on [2,3].

1.5givenF4F6

Let σ:[5,5]→C send 5 to 2−i. By [F4], LC(σ)=0 and σ is rectifiable. The constant surjection θ:[7,7]→[5,5] also satisfies [F6], and both sides of its length equality are zero.

1.6givenF11algebraconstruct

For every n≥1, 0<an<mn<bn≤1, and bn+1=1/(2n+1)<1/(2n)=an by [F11]. Thus the intervals In are disjoint, the two formulas for η agree at mn, and their endpoint values are zero. Each interpolation factor lies in [0,1], so 0≤η(t)≤1/n≤1 on In; outside them η=0. Hence η is well-defined and its trace is contained in [0,1].

1.7givenF9F10F11choosealgebra

Fix t0>0 and choose N with 1/N<t0/2 by [F11]. For n≥N, bn=1/(2n−1)≤1/n≤1/N<t0/2, so those intervals lie below t0/2; only finitely many intervals meet (t0/2,3t0/2). There η is zero or one of finitely many affine pieces; the formulas agree at each midpoint and vanish at the interval endpoints, so their one-sided limits agree at every join. Thus η is continuous at t0. At 0, given ε>0 choose N with 2/N<ε. If 0<t<1/N lies in In, then 1/(2n)=an≤t<1/N, so n>N/2 and ∣η(t)∣≤1/n<2/N<ε; outside the intervals η(t)=0. These real-distance bounds are also the dC bounds under the canonical embedding by [F10]. Hence η is continuous as a complex path at 0 and at every positive t0.

1.8givenF10F11F12F13constructalgebra

For N≥1, the increasing list PN=(0,aN,mN,bN,aN−1,mN−1,bN−1,…,a1,m1,b1) is a partition of [0,1], since bn<an−1 for n≥2. On each In, the path values at an,mn,bn are 0,1/n,0, so its two chord lengths sum to 2/n by [F10]; across each gap the chord length is zero. Define HN:=∑j<N1/(j+1), also for N=0. By the prefix recursion, H0=0 and HN+1=HN+1/(N+1). Adding the spike contributions gives ℓPN(η)=2HN: this holds at N=1, and inserting the next spike adds 2/(N+1), proving it by induction.

1.9F13algebraconstruct

By recursion [F13], define natural numbers q0=1 and qk+1=qk+qk. For every natural qk, the definition of natural order with witness qk, together with 0+qk=qk [F13], gives 0≤qk; compatibility of order with addition then gives qk=0+qk≤qk+qk=qk+1. The base is q0=1. If 1≤qk, transitivity with qk≤qk+1 gives 1≤qk+1, so induction [F13] yields qk≥1 for every k.

2.1givenF5step 1.4algebra

Both coordinates are nondecreasing, with endpoint increments x(3)−x(0)=1 and y(3)−y(0)=1. For any partition, each absolute coordinate increment equals the nonnegative increment, and the finite sum telescopes to the endpoint increment; the endpoint partition attains 1. Thus each coordinate has variation exactly 1. On the three pieces the coordinate velocities are (1,0), (0,1), and (0,0), so the speed integrals are 1, 1, and 0. Therefore the coordinate path has length 2, and [F5] gives LC(γ)=2 and rectifiability.

2.2F11F12F13step 1.9algebra

For each k, put q=qk and Bk:=∑j<q1/(q+j+1). For j<q, the positive denominator satisfies q+j+1≤q+q=qk+1 in the canonical real images by [F11, F13]. Thus each summand is at least 1/(q+q). Monotonicity and constant-sum scaling in [F12] give Bk≥q/(q+q)=1/2, since q≥1 by step 1.9.

3.1givenF6step 2.1construct

Step 2.1 gives LC(γ)=2. The map φ(s)=3−s on [0,3] is a continuous decreasing surjection, so [F6] gives LC(γ∘φ)=2. Define ψ:[0,4]→[0,3] by ψ(s)=s on [0,1], ψ(s)=1 on [1,2], and ψ(s)=s−1 on [2,4]. Its pieces agree at their endpoints; it is continuous and nondecreasing, and its range is [0,1]∪{1}∪[1,3]=[0,3]. Thus it is a surjection with a pause, and [F6] gives LC(γ∘ψ)=2.

3.2F11F12F13step 1.8step 1.9step 2.2algebra

Fix a natural q≥1. The prefix recursions in [F12] and step 1.8 give Hq+d=Hq+∑j<d1/(q+j+1) by induction on d: at d=0 both sides equal Hq, and the successor adds 1/(q+d+1) to both sides. Taking q=d=qK gives HqK+1=HqK+BK with no natural subtraction or lower-index sum. Since Hq0=H1=1, step 2.2 and induction give HqK≥1+K/2 for all K. The Archimedean property [F11] makes these lower bounds unbounded, so the harmonic partial sums are unbounded.

4.1F4step 1.6step 1.8step 3.2∎

The partition sums ℓPN(η)=2HN are unbounded by steps 1.8 and 3.2. Hence the partition sums of η have no real upper bound, so η is not rectifiable by [F4], although its trace is bounded by step 1.6.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

89 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.