Riemann mapping theorem
ProvedAhlforsComplexAnalysis.riemann_mapping_theoremLet be a simply connected region (its complement in the extended plane is connected) which is not the whole plane, and let . Then there exists an analytic function in , normalized by and , which maps one-to-one onto the disk . Moreover this function is unique: any two such functions coincide on .
import Definitions.Def_AhlforsComplexAnalysis_Defs import Mathlib open AhlforsComplexAnalysis
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
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 satisfy : is nonempty, open and connected, and is connected in the one-point compactification of . Assume , and let . Let . Say that a function is admissible if all of the following hold:
- is analytic at every point of ;
- ;
- the complex derivative satisfies and (that is, is a positive real number);
- is injective on ;
- the image equals exactly.
The statement asserts two things:
- Existence: there is an admissible function .
- Uniqueness on : if and are both admissible, then for every .
Values outside are unconstrained and not compared. (In the statement the admissibility conditions are written out in full for each of and ; there is no separate definition.)
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.