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.
Casorati-Weierstrass theorem
Statement
Let have an essential singularity at . Then for every with in the domain of , the image is dense in .
Equivalently, for every and every , some point with satisfies .
Facts & Assumptions
Given: An essential singularity of at and a radius with holomorphic on .
Essential means neither removable nor a pole (Every isolated singularity is removable, a pole, or essential).
A bounded holomorphic function on a punctured disc has a removable singularity (Characterizations of removable singularities).
A function on a punctured disc has a pole exactly when its modulus tends to infinity there (Characterizations of poles).
Reciprocal and sum rules preserve holomorphy wherever the denominators stay nonzero (Linearity, product, reciprocal, and quotient rules for complex derivatives).
Proof
Suppose, for contradiction, that is not dense in . Then some and some satisfy for every with .
The function is therefore holomorphic on by [L4] and bounded there by .
By [L2], the bounded function extends holomorphically across . If the extension satisfies , then is holomorphic near and is removable there by [L4]. If instead , then has a pole at by [L3], so has a pole there as well.
Either outcome in step 3.1 contradicts [L1], because an essential singularity is neither removable nor a pole. Therefore the assumption of step 1.1 is false, and every punctured neighbourhood image is dense in .
Depends on
Used by
Dependency tree · two levels
14 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
- David Greenfield, Rutgers Math 403 diary (standard reference, not scraped)
- Jean-Baptiste Campesato, MAT334 course page and notes index (standard reference, not scraped)