Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-27
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.

Only finitely many singularities contribute to the residue sum of an admissible cycle

Statement

Let f be meromorphic on an open set Ω, let S⊆Ω be its pole set, and let Γ be admissible for the residue theorem in Ω. Then

{a∈S:n(Γ,a)≠0}

is a finite set.

Facts & Assumptions

Given: A meromorphic f on an open set Ω, its pole set S, and an admissible cycle Γ in Ω.

[L1]

The index of a cycle is locally constant off its trace and vanishes sufficiently far from the trace (The index of a cycle is locally constant off its trace and vanishes far from it).

[L2]

The pole set of a meromorphic function is closed and discrete in the ambient open set (Poles of a meromorphic function form a closed discrete set and are at most countable).

Proof

technique · direct
1.1L1

Let U:={z∈C∖Γ∗:n(Γ,z)≠0}. By the local constancy part of [L1], U is open in C∖Γ∗. The same local constancy also shows that if z∉Γ∗∪U, then a whole neighbourhood of z lies outside U, so every limit point of U outside the trace already lies in U. Therefore U‾⊆U∪Γ∗.

2.1step 1.1L1

By the far-from-the-trace clause of [L1], the set U is bounded. Since the trace Γ∗ is compact, step 1.1 makes U‾ a bounded closed subset of C, hence compact.

3.1L2

Because Γ is admissible, its trace avoids the pole set. Thus [given, step 2.1, L2] ∎ S∩U‾=S∩U={a∈S:n(Γ,a)≠0}. The right-hand set is a closed discrete subset of the compact set U‾ by, and every closed discrete subset of a compact metric space is finite. So only finitely many poles have nonzero index.

Depends on

Used by

Dependency tree · two levels

38 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