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 normal-family proof of Great Picard
Example
Let be meromorphic on with an isolated essential singularity at . The exterior three-value extension lemma rules out three sphere values omitted on any punctured neighbourhood of . Consequently every sphere value is attained infinitely often in every punctured neighbourhood, with at most two exceptions. If is holomorphic there, at most one finite value is exceptional.
Facts & Assumptions
Given: Such a punctured-disc meromorphic function .
If a meromorphic function on omits three fixed distinct sphere values on for some , then extends meromorphically across infinity (Three omitted values force exterior extension).
Verification
Suppose three distinct sphere values are omitted on for some . The function is meromorphic on and omits the same three values there. By [F1] with and , it extends meromorphically across infinity; inversion then extends meromorphically across , contrary to essentiality.
If three distinct values each occurred only finitely often in some punctured neighbourhood, take a radius inside all three neighbourhoods and then shrink it below the distance to the finitely many preimages there. If the combined preimage set is empty, any smaller radius works. The three values would all be omitted on the smaller punctured disc, contrary to step 1.1. Hence at most two sphere values are exceptional.
If is holomorphic on the punctured disc, it omits , so step 2.1 leaves at most one exceptional finite value.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
16 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 Simonič, The Ahlfors lemma and Picard's theorems (standard reference, not scraped)