Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-30
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.

Residue theorem on a compact Riemann surface

Statement

Let X be a compact Riemann surface (Riemann surfaces and holomorphic atlases) and let ω be a meromorphic differential on X (Meromorphic differentials, orders and residues). Then Res⁡p(ω)≠0 for only finitely many p∈X, and ∑p∈XRes⁡p(ω)=0. For the zero differential all residues are zero. The proof below applies the one-variable residue theorem inside charts and cancels the integrals along the paired subedges of a finite chart cellulation; it uses no choice principle, no de Rham theorem and no Stokes theorem.

Facts & Assumptions

Given: A compact Riemann surface X and a meromorphic differential ω on X, with pole set S.

[F1]

A chart of X maps homeomorphically onto an open subset of C, and every point lies in a chart with connected domain; a chart expression of ω is a meromorphic function on a plane domain, and the transition law hψ(w)=hφ(z(w))z′(w) holds on overlaps; charts are holomorphic, hence orientation-preserving (Riemann surfaces and holomorphic atlases, Meromorphic differentials, orders and residues).

[F2]

A meromorphic function on a plane domain has only isolated poles: its pole set is a closed discrete subset of the domain (Meromorphic functions on a plane domain, Isolated singularities: removable, poles, and essential singularities); a holomorphic function on a domain vanishing on a set with an accumulation point in the domain vanishes identically (Identity theorem for holomorphic functions).

[F3]

If X is compact and F⊆X is finite, there is an oriented chart cellulation subordinate to F: finitely many closed topological triangle cells Δ1,…,Δm covering X, each inside a holomorphic chart (φi,Ui), pairwise interior-disjoint, with piecewise Puiseux-analytic rectifiable boundary arcs. Their boundaries have a finite common subdivision into subedges, each traversed by exactly two cells with opposite induced orientations, and F lies in cell interiors (Finite chartwise triangulation of a compact Riemann surface).

[F4]

Every cell of [F3] is, in its chart plane, the image under an orientation-preserving similarity of a graph-bounded region {w≤y≤w′, α(y)≤x≤β(y)} with α≤β continuous, real-analytic on the open interval and with Puiseux-analytic-arc graphs; the boundary contour of the region is positively oriented (Slab triangulation of a compact plane region bounded by finitely many piecewise real-analytic curves).

[F5]

For a graph-bounded region T as in [F4] with positively oriented boundary contour γ: γ is a closed complex contour, n(γ,q)=1 for q∈T∘ and n(γ,q)=0 for q∉T, and γ is null-homologous in every open Ω⊇T; the same holds for the image of T under an orientation-preserving similarity (Index of the boundary of a graph-bounded plane region).

[F6]

Admissible cycles and the plane residue theorem: if Ω⊆C is open, h meromorphic on Ω with pole set P, and Γ is a complex cycle with Γ∗⊆Ω∖P and n(Γ,p)=0 for every p∉Ω, then ∫Γh dz=2πi∑a∈Pn(Γ,a)Res⁡(h,a), where Res⁡(h,a) is the z−1 Laurent coefficient; only finitely many terms are nonzero (Admissible cycles for the residue theorem, The residue theorem for a null-homologous cycle).

[F7]

For a piecewise C1 contour the Riemann–Stieltjes contour integral equals the parametrized integral ∑j∫f(γ)γ′ dt (For piecewise-C1 contours the Riemann–Stieltjes integral agrees with the parametric complex integral and the published real line integrals); the chain rule holds for complex derivatives (The chain rule for complex derivatives); complex line integrals are additive over concatenations and change sign under reversal (Complex line integrals change sign under reversal and add under concatenation).

Proof

technique · direct
1.1F1F2F8given

(The pole set is closed and discrete, hence finite.) Suppose ω≠0. The pole set S is discrete: each p∈S has a chart neighbourhood off which the local expression of ω is holomorphic except at p, by [F1] and [F2]. It is also closed: if x∈X∖S and h is a chart expression of ω near φ(x), then h is holomorphic at φ(x) because x is not a pole, and by [F2] the poles of h are isolated, so a neighbourhood of φ(x) contains none of them, whence a neighbourhood of x is disjoint from S. As a closed subset of the compact surface, S is compact by [F8]; a discrete compact space is finite, because the family of singletons is an open cover admitting a finite subcover only when the space is finite. Hence S={p1,…,pN} is finite.

1.2F1F3F7

(The integral of ω along a path is chart-independent.) For a piecewise C1 path λ in X whose trace lies in a chart (U,φ) define ∫λω:=∫φ∘λh dz with h the chart expression. If another chart (U′,φ′) contains the trace, put τ=φ∘(φ′)−1 on φ′(U∩U′) and w=φ′∘λ; by [F1] the transition law gives hφ(τ(w))τ′(w)=hφ′(w), and by [F7] and the chain rule the parametrized integrals of hφ over φ∘λ=τ∘w and of hφ′ over w agree; so the definition is independent of the chart used. The integral is additive over concatenations and changes sign under reversal. The face edges used below admit piecewise C1 parametrizations: each Puiseux endpoint germ becomes C1 after the parameter substitution t=sm supplied in the planar lemma, and holomorphic chart changes preserve piecewise C1 regularity.

2.1F3step 1.1

(Chart cellulation subordinate to the poles.) Apply [F3] with F=S: the cells Δ1,…,Δm cover X, each lies in a chart (φi,Ui), the interiors are pairwise disjoint, each pole lies in the interior of exactly one cell, and the cell boundaries have the finite common subedge system of [F3].

3.1F3F4step 2.1

(Each cell is graph-bounded in its chart.) Fix i. By [F4] there is an orientation-preserving similarity σi of the chart plane and a graph-bounded region Ti with φi(Δi)=σi(Ti); write γi for the positively oriented boundary contour of φi(Δi), i.e. the image under σi of the boundary contour of Ti. The induced orientation of Δi is the complex orientation of X, and φi is holomorphic hence orientation-preserving. The finite common boundary subdivision of [F3] splits γi into contour contributions from subedges, each of which occurs on precisely two cells with opposite orientations.

4.1F1F2step 2.1step 3.1

(A chart domain in which the only poles are the interior ones.) Fix i, put Ri:=φi(Δi)=σi(Ti), and let hi be the chart expression of ω on the chart domain of φi, with pole set Pi; by [F2] and [F1], Pi is closed and discrete in the chart domain. The compact set γi∗=∂Ri is disjoint from Pi, because the poles of ω lie in face interiors and φi maps the boundary of Δi onto γi∗; hence the distance from γi∗ to Pi is positive (read as +∞ if Pi is empty). Since the compact set Ri lies in the open chart image Di:=φi(Ui), its distance from C∖Di is also positive. Choose δi>0 smaller than half of both distances and put Ωi:={q:dist⁡(q,Ri)<δi}; it is open, contains Ri and lies in Di, so hi is defined throughout Ωi. Every pole in Ωi lies in Ri∘: if a pole q were outside the closed set Ri, then dist⁡(q,γi∗)=dist⁡(q,Ri)<δi, contradicting dist⁡(q,γi∗)≥dist⁡(γi∗,Pi)>2δi, and q∈∂Ri is impossible because γi∗∩Pi=∅.

4.2step 2.1step 3.1step 1.2

(Summing over the cells.) By step 3.1 each of the finitely many subedges occurs in the boundary of exactly two cells, traversed with opposite orientations; split each γi at the subedge vertices and use additivity, chart independence and reversal from step 1.2. Every subedge contribution occurs twice with opposite signs, so ∑i=1m∫γihi dz=0.

5.1F5F6step 4.1

(Plane residue theorem on each face.) Fix i. The contour γi has trace in Ωi∖Pi, and it is null-homologous in Ωi: for q∉Ωi we have q∉σi(Ti), so [F5] gives n(γi,q)=0. Applying [F6] to hi on Ωi and Γ=γi, whose only poles in Ωi are the images of the poles of ω lying in Δi∘, gives ∫γihi dz=2πi ⁣ ⁣∑p∈S∩Δi∘ ⁣ ⁣Res⁡p(ω), because the index of γi at each of those poles is 1 by [F5].

6.1step 5.1step 4.2step 1.1∎

(Conclusion.) Summing the identities of step 5.1 over i and using step 4.2 gives 0=∑i=1m∫γihi dz=2πi∑p∈SRes⁡p(ω), since each pole lies in exactly one cell interior by step 2.1; dividing by 2πi≠0 gives ∑p∈XRes⁡p(ω)=0, and the residues vanish off the finite set S. For ω=0 the assertion is the convention recorded in the statement. All choices made were finite, so no choice principle was used.

Remarks

The proof is a finite bookkeeping argument: each pole contributes exactly once, through the face whose interior contains it, and every interior edge contributes twice with opposite signs, so the total is zero. Two points deserve emphasis. First, the index one of a face boundary at an interior point is supplied by Index of the boundary of a graph-bounded plane region through explicit deformations (the graph sides are straightened to distant vertical lines and the resulting rectangle is deformed onto a circle), not by the general Jordan curve theorem, which this library deliberately does not assume. Second, the chart cellulation of Finite chartwise triangulation of a compact Riemann surface supplies finitely many chart-contained rectifiable cells and paired subedges, so the boundary contributions cancel as finite sums of well-defined path integrals. The residue theorem for the sphere Orders and residues under inversion on the sphere ↗ checks the statement in the simplest compact case.

Depends on

Used by

Dependency tree · two levels

74 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