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.
Two omitted finite values rule out an essential singularity
Statement
Assume the Axiom of Choice. Let be holomorphic on a punctured disc and omit two distinct finite values there. Then is removable for or a pole; in particular, is not an essential singularity.
Facts & Assumptions
Given: The Axiom of Choice and a holomorphic map on omitting two distinct finite values.
The Axiom of Choice is available for the subsequence selection below (The Axiom of Choice).
Assuming the Axiom of Choice, holomorphic families omitting and are chordally normal (Families omitting two values are chordally normal).
A chordal limit of holomorphic functions is holomorphic or identically (A chordally locally uniform meromorphic limit is meromorphic or identically infinity).
Boundary maximum modulus propagates a boundary bound to a bounded annulus (Boundary maximum modulus principle on a bounded domain).
A bounded punctured-disc holomorphic function has a removable singularity (Characterizations of removable singularities).
Every isolated singularity is removable, a pole, or essential (Every isolated singularity is removable, a pole, or essential).
A punctured-disc holomorphic function has a pole exactly when its reciprocal extends holomorphically across the centre and vanishes there (Characterizations of poles).
Proof
After an affine change of target, we may assume the omitted values are and . Choose radii with , and define on the fixed annulus . Each omits and , so [A1] and [L1] give a chordally locally uniformly convergent subsequence on ; relabel it again as , with the corresponding radii still written .
By [L2], the limit of that subsequence is either holomorphic on or identically . In the first case, chordal local uniform convergence to a finite holomorphic limit is Euclidean local uniform convergence on the unit circle, so there are and with for every and . In the second case, the same argument applied to the infinity chart gives and with for every and .
In the first case, fix and apply [L3] to the bounded annulus . Step 2.1 bounds by on both boundary circles of , so throughout . As this holds for every , the function is bounded on . Fact [L4] then makes removable.
In the second case, apply the same annulus argument to . Step 2.1 bounds by on both boundary circles of each for , hence throughout every such annulus. Therefore [L4] extends holomorphically across . If the extension is nonzero at , then its reciprocal extends , so is removable for . If the extension vanishes at , [L6] makes a pole of .
Steps 3.1 and 3.2 show that only the removable and pole branches of [L5] can occur, so is not an essential singularity.
Depends on
- The Axiom of Choice
- Families omitting two values are chordally normal
- A chordally locally uniform meromorphic limit is meromorphic or identically infinity
- Boundary maximum modulus principle on a bounded domain
- Characterizations of removable singularities
- Characterizations of poles
- Every isolated singularity is removable, a pole, or essential
Used by
- Great Picard theorem Theorem
Dependency tree · two levels
31 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
- Aleksander Simonic, The Ahlfors lemma and Picard's theorems, Theorem 14 (standard reference, not scraped)