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.
The extremal derivatives are positive and have a finite supremum
Statement
Let be homologically simply connected and let . Then the set
is a nonempty subset of with finite supremum.
Facts & Assumptions
Given: A proper homologically simply connected complex domain and .
The extremal family is nonempty (A proper homologically simply connected plane domain has a bounded univalent competitor).
Every satisfies and (The extremal family of disc-valued univalent maps fixing a basepoint).
Cauchy estimates bound derivatives from a modulus bound on a larger concentric circle (Cauchy estimates on a smaller concentric disc).
Proof
Fact [L1] gives at least one map in , so the derivative set is nonempty. Fact [L2] makes every element of strictly positive.
Choose with . If , then on because , so [L3] gives . Since [L2] makes positive real, this is the same as .
Therefore , so has a finite supremum.
Depends on
Used by
Dependency tree · two levels
13 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, §5.2 (standard reference, not scraped)
- Walter Rudin, Real and Complex Analysis, Theorem 14.9 (standard reference, not scraped)