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.
An extremizer onto a proper subdomain of the disc can be enlarged
Statement
Let be homologically simply connected, let , and let attain the extremal derivative . Then .
Facts & Assumptions
Given: A proper homologically simply connected complex domain , a point , and an extremizer with .
The map is univalent (The extremal limit is univalent).
For each , the Blaschke factor is a disc automorphism (Blaschke factors are automorphisms of the disc).
On a homologically simply connected complex domain, every holomorphic nowhere-zero function has a holomorphic square root (A nonvanishing holomorphic function on such a domain has holomorphic roots of every positive order).
Proof
Assume toward a contradiction that . Choose . Since , one has . Put . Then [L2] makes holomorphic and injective into , with .
By [L3], the nowhere-zero holomorphic function has a holomorphic square root on with . If then , so injectivity of gives . If then again , so and then , impossible because never vanishes. Hence is injective.
Let , so . Define . Then [L2] makes holomorphic and injective from into , with . Thus after multiplying by a unimodular constant if needed, is another competitor in .
Differentiate at to obtain . Since and , one gets because for . This contradicts the extremal definition of .
Therefore the assumption of step 1.1 is false, so .
Depends on
Used by
Dependency tree · two levels
22 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
- Matthias Weber, Complex Analysis, Theorem 5.2.6 (standard reference, not scraped)
- Walter Rudin, Real and Complex Analysis, Theorem 14.9 (standard reference, not scraped)