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 , , be complex chains (Complex chains, their traces, and cycles). Then:
- , and ;
- , and as functions on ; consequently a sum of cycles is a cycle, and the negative and the reversal of a cycle are cycles;
- for continuous on , and for continuous on ,
- for , , and for , ;
- the empty chain is a cycle, its integral of every function is , and its index is at every point of .
Facts & Assumptions
Given: Complex chains , and , and integrands continuous on the traces named in each clause.
A complex chain is a finite list of pairs ; its trace is the union of the with ; its boundary is ; it is a cycle when that vanishes identically; is list concatenation, negates every coefficient, and reverses every contour (Complex chains, their traces, and cycles).
For a rectifiable contour , (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 (Reversal negates and concatenation adds winding numbers).
For continuous on the trace of a rectifiable contour and , (Complex line integrals are linear in the integrand).
Finite sums in the additive commutative monoid of are additive, and complex-field distributivity permits scaling term by term (A finite sum in a commutative monoid indexed by an arbitrary finite set, is a field, every element is uniquely , and every nonzero element has inverse ).
For disjoint finite index sets and in a commutative monoid, (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 (A finite sum in a commutative monoid indexed by an arbitrary finite set).
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).
The reversal of is , 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
The list has as its terms exactly the terms of followed by those of , so the set of indices with nonzero coefficient splits as a disjoint union and [L2] gives . 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.
For each , the two defining sums of run over the disjoint union of the corresponding index sets for and , so [L6] splits each of them and gives . Replacing every by multiplies both sums by by [L5], giving ; and by [L8] the reversal exchanges the roles of the two endpoint sums, giving . Hence if and vanish identically so does , and likewise for and ; this is claim 2.
The empty chain has empty trace, both its boundary sums are empty and therefore by [L6], and its integral is the empty sum, which is by [L1] and [L6]; hence its index is at every , all of which lie off its empty trace. This is claim 5.
Let be continuous on , which by step 1.1 is the trace of , so all three integrals exist by [L1] and [L7]. The defining sum for runs over the disjoint union of the two index sets, so [L6] splits it into .
Let be continuous on . Replacing each by multiplies each summand of [L1] by , so [L5] gives ; and replacing each by negates each by [L3], so as well. Together with step 2.1 this is claim 3.
Applying steps 2.1 and 3.1 to , which is continuous on the traces involved whenever lies off them, and dividing by using [L4] gives claim 4: and .
Depends on
- Integration over a complex chain and the index of a chain
- Complex chains, their traces, and cycles
- Reversal negates and concatenation adds winding numbers
- Complex line integrals change sign under reversal and add under concatenation
- Complex line integrals are linear in the integrand
- Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule
- A finite sum in a commutative monoid indexed by an arbitrary finite set
- $\mathbb C=\mathbb R[x]/(x^2+1)$ is a field, every element is uniquely $a+bi$, and every nonzero element has inverse $(a-bi)/(a^2+b^2)$
- Continuous integrands have complex and absolute line integrals along every rectifiable path
- Rectifiable complex contours, reversal, concatenation, closedness, and orientation
- Arc length is invariant under every continuous surjective monotone reparametrization, including pauses and reversal
Used by
- Holomorphic integrals agree on homologous cycles Corollary
- Null-homologous cycles and homologous cycles in an open set Definition
- A disjoint two-circle cycle has indices +1 and -1 in its two components Example
- Dixon's gluing traced on the boundary cycle of an annulus Example
- Every cycle in a round annulus has one period, that of the central circle Example
- The boundary cycle of a round annulus has index 1 inside the annulus and 0 on either side Example
- The winding numbers of a keyhole contour about the origin and about an excluded point Example
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
- L. V. Ahlfors, Complex Analysis, 3rd ed., Ch. 4 §4.4 (standard reference, not scraped)