Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-08-28
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.

Zero and pole counts weighted by multiplicity and winding number

Definition

Let ΩC be open, let f be meromorphic on Ω, and let Γ be admissible for the residue theorem in Ω. Assume also that f is not identically zero on any connected component of Ω and has no zeros on Γ, so every zero has finite positive order and every index n(Γ,a) of Integration over a complex chain and the index of a chain is defined at every zero or pole of f.

Here, and in the argument-principle results that use this definition, meromorphic on an open set means meromorphic on every connected component in the sense of Meromorphic functions on a plane domain. The zero and pole sets are the unions of the corresponding componentwise sets.

Whenever only finitely many zeros and poles of f have nonzero index with respect to Γ, define the weighted zero count

Z(f,Γ):=aZ(f)n(Γ,a)orda(f)

and the weighted pole count

P(f,Γ):=bP(f)n(Γ,b)ordbpole(f),

where orda(f) is the zero order from The order of a zero of a holomorphic function and ordbpole(f) is the positive pole order at b.

Remarks

These are finite sums only after a finiteness argument. Under the argument principle hypotheses, that finiteness comes from applying the residue theorem to the logarithmic derivative.

Depends on

Used by

Dependency tree · two levels

19 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