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.
Disc functions omitting 0 and 1 admit holomorphic logarithms for f and 1-f
Statement
Let be holomorphic and omit and . Then there exist holomorphic functions such that
Facts & Assumptions
Given: A holomorphic map .
The unit disc is homologically simply connected (Star-shaped plane domains are homologically simply connected).
On a homologically simply connected complex domain, every holomorphic nowhere-zero function has a holomorphic logarithm (A nonvanishing holomorphic function on a homologically simply connected domain has a holomorphic logarithm).
Proof
Both and are holomorphic and nowhere zero on . Fact [L1] makes homologically simply connected.
Applying [L2] first to and then to gives holomorphic logarithms and with and .
Depends on
Used by
- Schottky's theorem Theorem
Dependency tree · two levels
34 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, §6.3 (standard reference, not scraped)