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 slit-plane root branch biholomorphically parametrizes a sector
Statement
Let be an integer, let
and define
Then is a biholomorphism from onto , and its inverse is the power map on .
Facts & Assumptions
Given: The integer , the slit plane , and the map above.
The principal logarithm is holomorphic on and satisfies (The principal logarithm is the normalised holomorphic branch on the slit plane).
Branch powers are defined by (Complex powers defined from a holomorphic logarithm branch).
For integer exponents, branch powers agree with ordinary powers (Branch-defined complex powers agree with integer powers).
A map is biholomorphic when it is bijective, holomorphic, and has holomorphic inverse (Biholomorphic maps between complex domains).
Proof
Since is holomorphic on by [F1], the map is holomorphic on ; if with , then , so .
If , write with and . Then lies in because , and the principal logarithm of is Therefore
For , [F2] with [F3] gives by [F1], so the inverse of on is . Therefore [F4] makes biholomorphic.
Depends on
- Complex powers defined from a holomorphic logarithm branch
- The principal logarithm is the normalised holomorphic branch on the slit plane
- Branch-defined complex powers agree with integer powers
- The complex exponential is entire and its complex derivative is itself
- Biholomorphic maps between complex domains
Used by
Dependency tree · two levels
35 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
- Lars V. Ahlfors, Complex Analysis, 3rd ed., Ch. 3 §4.2 (standard reference, not scraped)