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.
Small perturbations preserve the total local zero multiplicity
Statement
Let be holomorphic on a neighbourhood of the closed disc , and suppose has no zero on the circle . Let be the total multiplicity of the zeros of in . If is holomorphic on a neighbourhood of and
then has exactly zeros in , counted with multiplicity.
In particular, if is an isolated zero of of order and the disc is chosen so that is the only zero of in , then every such perturbation has exactly zeros in counted with multiplicity.
Facts & Assumptions
Given: A holomorphic function on a neighbourhood of , a holomorphic function on the same neighbourhood, and on .
Rouché's theorem gives equal zero counts inside a closed contour when the strict boundary inequality holds (Rouche's theorem in the classical strict-inequality form).
Proof
Let for . The hypothesis says on , and has no zero there.
Applying [L1] to the contour shows that and have the same weighted zero count inside . Because both are holomorphic, there is no pole term, so that weighted count is exactly the total multiplicity of the interior zeros. Hence has as many zeros in the disc, counted with multiplicity, as does.
The isolated-zero specialization is the case where that total multiplicity for is the single local order at .
Depends on
Used by
Dependency tree · two levels
9 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
- J. Lebl, Guide to Cultivating Complex Analysis, §5.4 (standard reference, not scraped)
- R. W. Howell and J. H. Mathews, Complex Analysis, §8.7 (standard reference, not scraped)