Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30
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.

Every proper homologically simply connected plane domain is conformally equivalent to the unit disc

Statement

Assume the Axiom of Choice. Let Ω⊊C be a homologically simply connected complex domain and let z0∈Ω. Then there is a biholomorphic map f:Ω→D such that

f(z0)=0,f′(z0)>0.

Facts & Assumptions

Given: The Axiom of Choice, a proper homologically simply connected complex domain Ω⊊C, and a point z0∈Ω.

[A1]

The Axiom of Choice is used by the extremal-attainment lemma (The Axiom of Choice).

[L1]

Under the Axiom of Choice, the extremal family is nonempty and the supremal derivative is attained by a holomorphic map f:Ω→D (A proper homologically simply connected plane domain has a bounded univalent competitor, A maximizing sequence has a locally uniform limit with extremal derivative).

[L3]

An injective holomorphic map on a complex domain is biholomorphic onto its open image (An injective holomorphic map has no critical point and is biholomorphic onto its image).

Proof

technique · direct
1.1A1L1givenchoose

By [A1] and [L1], choose a holomorphic map f:Ω→D with f(z0)=0 and extremal derivative f′(z0)>0.

2.1L2L3step 1.1

Fact [L2] makes this map injective and gives f(Ω)=D. Since Ω is a complex domain by the given data, [L3] makes f biholomorphic onto its image, which is exactly D.

3.1step 1.1step 2.1∎

The map of step 2.1 has the required normalization, so it is the desired conformal equivalence.

Depends on

Used by

Dependency tree · two levels

25 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