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.
Residues of p over q at a simple zero of q
Statement
Let and be holomorphic near , and suppose and . Then
Facts & Assumptions
Given: Holomorphic functions and near , with and .
If a function has a simple pole at , its residue is the limit of (At a simple pole the residue is the limit of (z-a)f(z)).
A function continuous at and holomorphic off is holomorphic at (A continuous function holomorphic off a single point is holomorphic).
Holomorphic functions are continuous, and quotient and reciprocal rules hold where the denominator is nonzero (Complex differentiability at a point implies continuity there, Linearity, product, reciprocal, and quotient rules for complex derivatives).
Proof
Define Because and , the function is continuous at and holomorphic away from ; [L2] therefore makes holomorphic near .
Step 1.1 gives and , so shrinking the neighbourhood if necessary makes nonzero there. Hence is holomorphic near by [L3], and on the punctured neighbourhood one has .
If , define The same argument as in step 1.1, using that is holomorphic and , shows that is holomorphic near . Then step 1.1 gives on the punctured neighbourhood, so is holomorphic at and its residue there is .
If , then , so step 2.1 makes a simple pole at . Applying [L1] gives
Steps 3.1 and 2.2 cover the cases and , so in all cases
Depends on
Used by
Dependency tree · two levels
15 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
- Jean-Baptiste Campesato, MAT334 course page and notes index (standard reference, not scraped)