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.
Null-homologous cycles and homologous cycles in an open set
Definition
Let be open and let be a complex chain which is a cycle and whose trace lies in (Complex chains, their traces, and cycles).
is null-homologous in when
the index being that of Integration over a complex chain and the index of a chain; the values are defined because , so every lies off the trace, and they are integers by The index of a cycle about a point off its trace is an integer.
Two cycles with traces in are homologous in when is null-homologous in . By Chain integration and the index are additive in the chain, and reverse with it the chain is again a cycle with trace inside , and its index at a point off that union is ; so the condition says exactly that
Remarks
Both notions depend on , not on the cycle alone. The same cycle can be null-homologous in one open set and not in another: enlarging removes points from and so weakens the requirement. Every statement below that uses these words names the open set it uses them in, and is not omitted anywhere.
Null-homologous does not mean equal to the empty chain. It is a condition on the numbers for outside , and a cycle with a large trace can satisfy it. In particular, being homologous is a relation between two cycles and never an assertion that the two lists coincide; chains here are lists and equality of chains is equality of lists.
Taking makes the condition vacuous, since is empty, so every cycle is null-homologous in the plane. The content of the notion appears when omits points, and it is those omitted points that the index has to ignore. When a nonempty connected is wanted it is called a complex domain (A complex domain is a nonempty connected open subset of ).
Depends on
- Complex chains, their traces, and cycles
- Integration over a complex chain and the index of a chain
- Chain integration and the index are additive in the chain, and reverse with it
- The index of a cycle about a point off its trace is an integer
- A complex domain is a nonempty connected open subset of $\mathbb C$
Used by
- Cauchy's theorem for a null-homologous cycle Corollary
- Holomorphic integrals agree on homologous cycles Corollary
- The higher-derivative form of the global Cauchy formula 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
- 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
- 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
- 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
- Equivalent characterisations of a homologically simply connected domain Theorem
- Every holomorphic function on a homologically simply connected domain has a primitive Theorem
Dependency tree · two levels
32 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)
- J. Lebl, Complex Analysis, Ch. 4 §4.3 (standard reference, not scraped)
- M. Weber, Complex Analysis (Indiana University), Ch. 4 §4.1 (standard reference, not scraped)