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 weighted argument principle
Statement
Let be open, let be meromorphic on , let be admissible for the residue theorem in , suppose for every , and let be holomorphic on . Then
and only finitely many terms are nonzero.
Facts & Assumptions
Given: An open set , a meromorphic function on , an admissible cycle with on , and a holomorphic function on .
The logarithmic derivative has residue at a zero of order and residue at a pole of order (The logarithmic derivative has residue equal to local order).
The unweighted argument principle already shows that only finitely many zeros and poles of have nonzero index with respect to (The argument principle for an admissible null-homologous cycle).
The residue theorem sums the indexed residues of an admissible meromorphic function over (The residue theorem for a null-homologous cycle).
Proof
Put . Away from the zeros and poles of , the function is holomorphic, so is holomorphic there as well. At a zero or pole of , the function is holomorphic and therefore admits the expansion near for some holomorphic . Multiplying that by the principal-part decomposition from [L1] shows
Step 1.1 and [L1] therefore give at each zero of , and at each pole of . By [L2], only finitely many such points have nonzero index with respect to .
Applying [L3] to and substituting the residue values from step 2.1 gives the displayed weighted sum formula.
Depends on
Used by
Dependency tree · two levels
17 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
- J. Lebl, Guide to Cultivating Complex Analysis, §5.4 (standard reference, not scraped)
- R. W. Howell and J. H. Mathews, Complex Analysis, §8.7 (standard reference, not scraped)