Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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.

Chain integration and the index are additive in the chain, and reverse with it

Statement

Let Γ, Γ1, Γ2 be complex chains (Complex chains, their traces, and cycles). Then:

  1. (Γ1+Γ2)=Γ1Γ2, (Γ)=Γ and (Γ)=Γ;
  2. (Γ1+Γ2)=Γ1+Γ2, (Γ)=Γ and (Γ)=Γ as functions on C; consequently a sum of cycles is a cycle, and the negative and the reversal of a cycle are cycles;
  3. for f continuous on Γ1Γ2, Γ1+Γ2fdz=Γ1fdz+Γ2fdz, and for f continuous on Γ, Γfdz=Γfdz,Γfdz=Γfdz;
  4. for pΓ1Γ2, n(Γ1+Γ2,p)=n(Γ1,p)+n(Γ2,p), and for pΓ, n(Γ,p)=n(Γ,p)=n(Γ,p);
  5. the empty chain is a cycle, its integral of every function is 0, and its index is 0 at every point of C.

Facts & Assumptions

Given: Complex chains Γ=k<rmkγk, Γ1=k<r1mk1γk1 and Γ2=k<r2mk2γk2, and integrands continuous on the traces named in each clause.

[L1]

Γfdz=k<r,mk0mkγkfdz and, for pΓ, n(Γ,p)=(2πi)1Γdz/(zp) (Integration over a complex chain and the index of a chain).

[L2]

A complex chain is a finite list of pairs (mk,γk); its trace is the union of the γk with mk0; its boundary is Γ(q)={mk:γk(bk)=q}{mk:γk(ak)=q}; it is a cycle when that vanishes identically; Γ1+Γ2 is list concatenation, Γ negates every coefficient, and Γ reverses every contour (Complex chains, their traces, and cycles).

[L3]

For a rectifiable contour γ, γfdz=γfdz (Complex line integrals change sign under reversal and add under concatenation); the reversal of a closed contour is a closed contour with the same trace and n(γ,p)=n(γ,p) (Reversal negates and concatenation adds winding numbers).

[L4]

For continuous f,g on the trace of a rectifiable contour and α,βC, γ(αf+βg)dz=αγfdz+βγgdz (Complex line integrals are linear in the integrand).

[L6]

For disjoint finite index sets S,T and a:STM in a commutative monoid, uSTau=sSas+tTat (Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule); a sum over a finite index set is well posed and the sum over the empty set is 0 (A finite sum in a commutative monoid indexed by an arbitrary finite set).

[L7]

For a rectifiable contour and a continuous integrand on its trace, the complex line integral exists (Continuous integrands have complex and absolute line integrals along every rectifiable path).

[L8]

The reversal of γ:[a,b]C is γ(t)=γ(a+bt), so its endpoints are exchanged (Rectifiable complex contours, reversal, concatenation, closedness, and orientation), and arc length is unchanged by a monotone reparametrization (Arc length is invariant under every continuous surjective monotone reparametrization, including pauses and reversal).

Proof

technique · direct
1.1

The list Γ1+Γ2 has as its terms exactly the terms of Γ1 followed by those of Γ2, so the set of indices with nonzero coefficient splits as a disjoint union and [L2] gives (Γ1+Γ2)=Γ1Γ2. Negating a coefficient does not change whether it is zero, and reversing a contour does not change its trace by [L8], so (Γ)=(Γ)=Γ. This is claim 1.

givenL2L8
1.2

For each q, the two defining sums of (Γ1+Γ2)(q) run over the disjoint union of the corresponding index sets for Γ1 and Γ2, so [L6] splits each of them and gives (Γ1+Γ2)(q)=Γ1(q)+Γ2(q). Replacing every mk by mk multiplies both sums by 1 by [L5], giving (Γ)=Γ; and by [L8] the reversal exchanges the roles of the two endpoint sums, giving (Γ)=Γ. Hence if Γ1 and Γ2 vanish identically so does (Γ1+Γ2), and likewise for Γ and Γ; this is claim 2.

givenL2L5L6L8
1.3

The empty chain has empty trace, both its boundary sums are empty and therefore 0 by [L6], and its integral is the empty sum, which is 0 by [L1] and [L6]; hence its index is 0 at every pC, all of which lie off its empty trace. This is claim 5.

L1L2L6
2.1

Let f be continuous on Γ1Γ2, which by step 1.1 is the trace of Γ1+Γ2, so all three integrals exist by [L1] and [L7]. The defining sum for Γ1+Γ2fdz runs over the disjoint union of the two index sets, so [L6] splits it into Γ1fdz+Γ2fdz.

step 1.1L1L6L7
3.1

Let f be continuous on Γ. Replacing each mk by mk multiplies each summand of [L1] by 1, so [L5] gives Γfdz=Γfdz; and replacing each γk by γk negates each γkfdz by [L3], so Γfdz=Γfdz as well. Together with step 2.1 this is claim 3.

step 1.1step 2.1L1L3L5
4.1

Applying steps 2.1 and 3.1 to f(z)=1/(zp), which is continuous on the traces involved whenever p lies off them, and dividing by 2πi using [L4] gives claim 4: n(Γ1+Γ2,p)=n(Γ1,p)+n(Γ2,p) and n(Γ,p)=n(Γ,p)=n(Γ,p).

step 1.3step 2.1step 3.1L1L3L4

Depends on

Used by

Dependency tree · two levels

46 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