Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Riemann mapping theorem

Proved
AhlforsComplexAnalysis.riemann_mapping_theorem

by LG · 1 vote · Sep 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

ahlforscomplex-analysis

Let Ω\OmegaΩ be a simply connected region (its complement in the extended plane is connected) which is not the whole plane, and let z0∈Ωz_0\in\Omegaz0​∈Ω. Then there exists an analytic function fff in Ω\OmegaΩ, normalized by f(z0)=0f(z_0)=0f(z0​)=0 and f′(z0)>0f'(z_0)>0f′(z0​)>0, which maps Ω\OmegaΩ one-to-one onto the disk ∣w∣<1|w|<1∣w∣<1. Moreover this function is unique: any two such functions coincide on Ω\OmegaΩ.

Preamble
import Definitions.Def_AhlforsComplexAnalysis_Defs
import Mathlib

open AhlforsComplexAnalysis
Formal statement
theorem AhlforsComplexAnalysis.riemann_mapping_theorem {Ω : Set ℂ}
    (hΩ : IsSimplyConnectedRegion Ω) (hne : Ω ≠ Set.univ) {z₀ : ℂ} (hz₀ : z₀ ∈ Ω) :
    (∃ f : ℂ → ℂ, AnalyticOnNhd ℂ f Ω ∧ f z₀ = 0 ∧
        0 < (deriv f z₀).re ∧ (deriv f z₀).im = 0 ∧
        Set.InjOn f Ω ∧ f '' Ω = Metric.ball 0 1) ∧
    ∀ f g : ℂ → ℂ,
      (AnalyticOnNhd ℂ f Ω ∧ f z₀ = 0 ∧ 0 < (deriv f z₀).re ∧ (deriv f z₀).im = 0 ∧
        Set.InjOn f Ω ∧ f '' Ω = Metric.ball 0 1) →
      (AnalyticOnNhd ℂ g Ω ∧ g z₀ = 0 ∧ 0 < (deriv g z₀).re ∧ (deriv g z₀).im = 0 ∧
        Set.InjOn g Ω ∧ g '' Ω = Metric.ball 0 1) →
      Set.EqOn f g Ω := by sorry
Source
L. V. Ahlfors, *Complex Analysis*, 3rd ed., McGraw-Hill, 1979 (ISBN 0-07-000657-1), Ch. 6 §1.1, Theorem 1 (p. 230)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - same agent as the drafter; non-blind

Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement it describes, with full knowledge of the source text and of the intended meaning. It was produced at the explicit request of the proposal's owner and was not written blind by an independent auditor, as the Prove2Me audit guidelines recommend. Reviewers should treat it as the drafter's own reading of the code and check it against the Lean code directly.

Let Ω⊆C\Omega\subseteq\mathbb CΩ⊆C satisfy IsSimplyConnectedRegion(Ω)\mathrm{IsSimplyConnectedRegion}(\Omega)IsSimplyConnectedRegion(Ω): Ω\OmegaΩ is nonempty, open and connected, and (C∪{∞})∖Ω(\mathbb C\cup\{\infty\})\setminus\Omega(C∪{∞})∖Ω is connected in the one-point compactification of C\mathbb CC. Assume Ω≠C\Omega\neq\mathbb CΩ=C, and let z0∈Ωz_0\in\Omegaz0​∈Ω. Let D={w:∣w∣<1}\mathbb D=\{w:|w|<1\}D={w:∣w∣<1}. Say that a function h:C→Ch:\mathbb C\to\mathbb Ch:C→C is admissible if all of the following hold:

  • hhh is analytic at every point of Ω\OmegaΩ;
  • h(z0)=0h(z_0)=0h(z0​)=0;
  • the complex derivative h′(z0)h'(z_0)h′(z0​) satisfies Re⁡h′(z0)>0\operatorname{Re}h'(z_0)>0Reh′(z0​)>0 and Im⁡h′(z0)=0\operatorname{Im}h'(z_0)=0Imh′(z0​)=0 (that is, h′(z0)h'(z_0)h′(z0​) is a positive real number);
  • hhh is injective on Ω\OmegaΩ;
  • the image h(Ω)h(\Omega)h(Ω) equals D\mathbb DD exactly.

The statement asserts two things:

  1. Existence: there is an admissible function fff.
  2. Uniqueness on Ω\OmegaΩ: if fff and ggg are both admissible, then f(z)=g(z)f(z)=g(z)f(z)=g(z) for every z∈Ωz\in\Omegaz∈Ω.

Values outside Ω\OmegaΩ are unconstrained and not compared. (In the statement the admissibility conditions are written out in full for each of fff and ggg; there is no separate definition.)

Human review
  • Endorsed by Shuze Chen · Sep 26, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 26, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me