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 argument principle for an admissible null-homologous cycle
Statement
Let be open, let be meromorphic on , and let be admissible for the residue theorem in . Suppose in addition that is not identically zero on any connected component of and that for every . Then
where the weighted zero and pole counts are those of Zero and pole counts weighted by multiplicity and winding number.
Only finitely many terms in those weighted counts are nonzero.
As in Zero and pole counts weighted by multiplicity and winding number, meromorphicity on the possibly disconnected open set is understood componentwise.
Facts & Assumptions
Given: An open set , a meromorphic function on that is not identically zero on any connected component, and an admissible cycle in such that has no zero on .
Away from the zeros and poles of , the logarithmic derivative is holomorphic (The logarithmic derivative of a meromorphic function).
At a zero of order , the logarithmic derivative has residue , and at a pole of order it has residue (The logarithmic derivative has residue equal to local order).
A meromorphic function admissible for a cycle has only finitely many poles with nonzero index (Only finitely many singularities contribute to the residue sum of an admissible cycle).
The residue theorem for an admissible null-homologous cycle reads with only finitely many nonzero terms (The residue theorem for a null-homologous cycle).
Proof
By [L1], the function is holomorphic away from the zeros and poles of . By [L2], every zero or pole of becomes a simple pole of . Because has neither zeros nor poles on , the cycle is admissible for as well.
Applying [L3] to shows that only finitely many zeros or poles of have nonzero index with respect to . Therefore the sums defining and are finite.
By [L4] applied to , where ranges over the poles of . Splitting those poles into zeros and poles of and then using [L2] turns the right-hand side into .
Depends on
- The logarithmic derivative of a meromorphic function
- Zero and pole counts weighted by multiplicity and winding number
- The logarithmic derivative has residue equal to local order
- Only finitely many singularities contribute to the residue sum of an admissible cycle
- The residue theorem for a null-homologous cycle
Used by
- The argument principle counts preimages of a target value Corollary
- The function e^(1/z) shows that essential singularities lie outside the argument principle Counterexample
- FALSE: the argument principle ignores multiplicity False statement
- The argument-principle integral is the winding number of the image cycle Theorem
- The weighted argument principle Theorem
Dependency tree · two levels
18 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
- R. W. Howell and J. H. Mathews, Complex Analysis, §8.7, Theorem 8.7.2 (standard reference, not scraped)
- J. Lebl, Guide to Cultivating Complex Analysis, §5.4, Theorem 5.4.1 (standard reference, not scraped)