Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An extremal function maps onto the unit disk

Proved
AhlforsComplexAnalysis.rmt_extremal_onto

by moona3k · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

ahlforscomplex-analysisconformal-mapping

Let Ω\OmegaΩ be a region on which every nowhere vanishing analytic function has an analytic square root, and let z0∈Ωz_0\in\Omegaz0​∈Ω. Let f:Ω→Df:\Omega\to\mathbb Df:Ω→D be analytic and injective with f(z0)=0f(z_0)=0f(z0​)=0 and f′(z0)≠0f'(z_0)\ne0f′(z0​)=0, and suppose ∣h′(z0)∣≤∣f′(z0)∣|h'(z_0)|\le|f'(z_0)|∣h′(z0​)∣≤∣f′(z0​)∣ for every injective analytic h:Ω→Dh:\Omega\to\mathbb Dh:Ω→D with h(z0)=0h(z_0)=0h(z0​)=0. Then fff maps Ω\OmegaΩ onto the unit disk:

f(Ω)=D.f(\Omega)=\mathbb D .f(Ω)=D.

This is the surjectivity step in Ahlfors' proof of the Riemann mapping theorem: a function that maximises the derivative at z0z_0z0​ among injective maps into the disk cannot omit any point of the disk.

Formalization Note. IsRegion is the notion of region from the mission Ahlfors Complex Analysis I; Metric.ball 0 1 is the open unit disk D\mathbb DD.

Preamble
import Mathlib
import Definitions.Def_AhlforsComplexAnalysis_Defs

open AhlforsComplexAnalysis
Formal statement
namespace AhlforsComplexAnalysis

theorem rmt_extremal_onto {Ω : Set ℂ} (hΩ : IsRegion Ω)
    (hroot : ∀ u : ℂ → ℂ, AnalyticOnNhd ℂ u Ω → (∀ z ∈ Ω, u z ≠ 0) →
      ∃ r : ℂ → ℂ, AnalyticOnNhd ℂ r Ω ∧ ∀ z ∈ Ω, r z ^ 2 = u z)
    {z₀ : ℂ} (hz₀ : z₀ ∈ Ω) {f : ℂ → ℂ} (hf : AnalyticOnNhd ℂ f Ω) (hfmap : ∀ z ∈ Ω, ‖f z‖ < 1)
    (hf0 : f z₀ = 0) (hfinj : Set.InjOn f Ω) (hfd : deriv f z₀ ≠ 0)
    (hmax : ∀ h : ℂ → ℂ, AnalyticOnNhd ℂ h Ω → (∀ z ∈ Ω, ‖h z‖ < 1) → h z₀ = 0 → Set.InjOn h Ω →
      ‖deriv h z₀‖ ≤ ‖deriv f z₀‖) :
    f '' Ω = Metric.ball 0 1 := by sorry

end AhlforsComplexAnalysis
Source
L. V. Ahlfors, Complex Analysis, 3rd ed., McGraw-Hill, 1979, Ch. 6 section 1.1 (proof of the Riemann mapping theorem, Theorem 1)

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