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 chains, their traces, and cycles
Definition
Let be open. A complex chain in is a finite list
each an integer (The integers as equivalence classes of pairs of naturals) and each a complex contour (Rectifiable complex contours, reversal, concatenation, closedness, and orientation) whose trace lies in . It is written . The list of length is the empty chain.
Its trace is the set
a subset of ; a term with contributes nothing to it.
Its boundary is the function given by
each sum being a finite sum over a subset of (A finite sum in a commutative monoid indexed by an arbitrary finite set, The cardinality of a finite set), and the subtraction is that of the commutative ring (The integers form a commutative ring). The chain is a cycle when for every .
Sum and negation. For chains and in , the sum is the concatenated list, and is the list with every coefficient replaced by and every contour unchanged. Write . The reversal is the list with every coefficient unchanged and every contour replaced by its reversal; the additive inverse is taken in (The integers form a commutative ring).
Remarks
A chain is a list, and equality of chains is equality of lists. No free abelian group on the set of contours is introduced here, and no result on this page asserts that two differently presented chains are equal: every statement below is about a given list, and the operations above produce lists. This is a deliberate departure from the presentations that define a chain as a group element, and it is what removes the obligation to say when two chains coincide.
Which lists are cycles. The empty chain is a cycle, both boundary sums being empty and hence (A finite sum in a commutative monoid indexed by an arbitrary finite set). A list all of whose contours are closed is a cycle: for such a the two endpoint values coincide, so enters the sum at once positively and once negatively and cancels there, and enters neither sum at any other point. In particular a single closed contour, taken as the list of length with , is a cycle. Terms with add to both sums and so never affect .
Cycles are more general than lists of closed contours. The condition is that the endpoints cancel after the coefficients are counted, not that each piece closes up: two contours with the same initial point and the same terminal point, carried with coefficients and , form a cycle although neither is closed. The distinction is what the integral results below actually use: the vanishing of the boundary function is exactly the hypothesis under which the integral of a continuous derivative over is zero.
Ambient set. A chain is a chain in ; the same list is a chain in every open set containing all the , and in particular in . When a nonempty connected is wanted it is called a complex domain (A complex domain is a nonempty connected open subset of ). Finite sums of integers and of complex numbers are finite sums in their additive commutative monoids, as in A finite sum in a commutative monoid indexed by an arbitrary finite set.
Depends on
- Rectifiable complex contours, reversal, concatenation, closedness, and orientation
- Finite sums and finite products, by recursion
- Laws of finite sums and finite products
- A finite sum in a commutative monoid indexed by an arbitrary finite set
- A complex domain is a nonempty connected open subset of $\mathbb C$
- The integers as equivalence classes of pairs of naturals
- The cardinality $\lvert A\rvert$ of a finite set
- The integers form a commutative ring
Used by
- Cauchy's theorem for a null-homologous cycle Corollary
- Holomorphic integrals agree on homologous cycles Corollary
- The index of a cycle is locally constant off its trace and vanishes far from it Corollary
- The integral of a continuous derivative over a cycle is zero Corollary
- A connected plane domain that is not homologically simply connected Counterexample
- A nonvanishing holomorphic function on a domain with no holomorphic logarithm Counterexample
- Homologically simply connected complex domains Definition
- Integration over a complex chain and the index of a chain Definition
- 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
- Every cycle in a connected plane domain is null-homologous in that domain False statement
- Dixon's glued function is entire and vanishes at infinity Lemma
- The Cauchy transform of a cycle is holomorphic off its trace, with the expected derivatives Lemma
- Star-shaped plane domains are homologically simply connected Proposition
- Conventions for chains, cycles and the homological adjective on this page Remark
- Cauchy's integral formula for a null-homologous cycle Theorem
- Chain integration and the index are additive in the chain, and reverse with it Theorem
- Equivalent characterisations of a homologically simply connected domain Theorem
- Every holomorphic function on a homologically simply connected domain has a primitive Theorem
- The index of a cycle about a point off its trace is an integer Theorem
Dependency tree · two levels
47 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)
- M. Weber, Complex Analysis (Indiana University), Ch. 4 §4.1 (standard reference, not scraped)