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.
The integral of a continuous derivative over a cycle is zero
Statement
Let be a complex chain which is a cycle, let be open with , and let be a primitive on of a continuous , so that is continuous (A primitive of a complex function on an open set). Then
The hypothesis used is that the boundary function of vanishes, which is weaker than requiring every to be closed.
Facts & Assumptions
Given: A cycle with , an open , and a primitive on of a continuous with continuous.
A complex chain is a finite list of pairs , its trace is the union of the with , its boundary is , and it is a cycle when that function vanishes identically (Complex chains, their traces, and cycles).
If is a primitive of a continuous on an open set containing the trace of a rectifiable contour and is continuous, then (The line integral of a continuous function admitting a primitive is that primitive's endpoint increment along every rectifiable path).
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 , (Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule); sums over finite index sets are well posed and the empty sum is (A finite sum in a commutative monoid indexed by an arbitrary finite set, The cardinality of a finite set).
A primitive of on is a holomorphic with on (A primitive of a complex function on an open set).
Proof
Write and , a finite subset of by [L1]; so is defined at every point of .
For every the trace lies in the open set on which is a primitive of the continuous with continuous , so [L3] gives .
By [L2] and step 1.2, , using [L4] to split the sum.
The index set is the disjoint union over of , so [L5] and [L4] give , and likewise with in place of ; a term with contributes to the boundary sums of [L1], so subtracting gives .
Every vanishes because is a cycle, so the sum of step 3.1 is , whence ; the same conclusion holds for the empty cycle, whose defining sum is empty and therefore by [L5].
Depends on
- Complex chains, their traces, and cycles
- Integration over a complex chain and the index of a chain
- The line integral of a continuous function admitting a primitive is that primitive's endpoint increment along every rectifiable path
- A primitive of a complex function on an open set
- 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)$
- The cardinality $\lvert A\rvert$ of a finite set
Used by
Dependency tree · two levels
48 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)