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.
Controlled derivative oscillation forces injectivity on a fixed subdisc
Statement
Let be holomorphic on with , , and on . Then is univalent on and
Facts & Assumptions
Given: A holomorphic map with , , and on .
If is holomorphic and , then (Schwarz lemma with the equality cases).
Rouche's theorem preserves zero count under a strict boundary perturbation (Rouche's theorem in the classical strict-inequality form).
Proof
Define . Then is holomorphic on , , and . Hence [L1] gives for every .
If , step 1.1 gives . For , one has , so . Therefore , which shows injectivity on .
On , one has . Fix with . Then on , . Rouche [L2] gives the same zero count for and , so has exactly one solution in .
Step 2.2 shows every lies in , and step 2.1 shows the restriction there is univalent.
Depends on
Used by
- Bloch's theorem Theorem
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, §7.4 (standard reference, not scraped)