Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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.

The argument principle for an admissible null-homologous cycle

Statement

Let ΩC be open, let f be meromorphic on Ω, and let Γ be admissible for the residue theorem in Ω. Suppose in addition that f is not identically zero on any connected component of Ω and that f(z)0 for every zΓ. Then

12πiΓf(z)f(z)dz=Z(f,Γ)P(f,Γ),

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 f on Ω that is not identically zero on any connected component, and an admissible cycle Γ in Ω such that f has no zero on Γ.

[L1]

Away from the zeros and poles of f, the logarithmic derivative f/f is holomorphic (The logarithmic derivative of a meromorphic function).

[L2]

At a zero of order m, the logarithmic derivative has residue m, and at a pole of order m it has residue m (The logarithmic derivative has residue equal to local order).

[L3]

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).

[L4]

The residue theorem for an admissible null-homologous cycle reads Γg(z)dz=2πicn(Γ,c)Res(g,c) with only finitely many nonzero terms (The residue theorem for a null-homologous cycle).

Proof

technique · direct
1.1

By [L1], the function g:=f/f is holomorphic away from the zeros and poles of f. By [L2], every zero or pole of f becomes a simple pole of g. Because f has neither zeros nor poles on Γ, the cycle Γ is admissible for g as well.

givenL1L2
2.1

Applying [L3] to g shows that only finitely many zeros or poles of f have nonzero index with respect to Γ. Therefore the sums defining Z(f,Γ) and P(f,Γ) are finite.

step 1.1L3
3.1

By [L4] applied to g, 12πiΓf(z)f(z)dz=cn(Γ,c)Res ⁣(ff,c), where c ranges over the poles of g. Splitting those poles into zeros and poles of f and then using [L2] turns the right-hand side into Z(f,Γ)P(f,Γ).

step 1.1step 2.1L2L4

Depends on

Used by

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