CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 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.

A positively oriented circle integral is the sum of the enclosed residues

Statement

Let $C (a, r)$ be a positively oriented circle, and let $f$ be meromorphic on a neighbourhood of the closed disc $\overline{D (a, r)}$ with no pole on the circle. Then

$\int_{C (a, r)} f (z) d z = 2 π i \sum_{∣ b - a ∣ < r} Res (f, b),$

the sum being over the poles of $f$ inside the circle.

Facts & Assumptions

Given: A positively oriented circle $C (a, r)$ and a meromorphic $f$ on a neighbourhood of $\overline{D (a, r)}$ with no pole on the circle.

[L1]

The residue theorem holds for an admissible cycle (The residue theorem for a null-homologous cycle).

[L2]

A positively oriented circle has index $1$ at interior points and $0$ at exterior points (A circle traversed $k$ times has winding number $k$ inside and $0$ outside).

Proof

technique · direct

1.1

The circle $C (a, r)$ is null-homologous in any open set containing the closed [given, L1] disc it bounds, so applies to it.

2.1

By [L2], every pole $b$ with $∣ b - a ∣ < r$ contributes the factor [step 1.1, L2] ∎ $n (C (a, r), b) = 1$ , while every pole outside the circle contributes the factor $0$ . Substituting those indices into gives the formula.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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

E. Stein and R. Shakarchi, Complex Analysis, Ch. 3, Corollary 2.3 (standard reference, not scraped)