Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Logarithms and nnn-th roots on simply connected regions

Proved
AhlforsComplexAnalysis.exists_log_and_root

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

ahlforscomplex-analysis

Let Ω\OmegaΩ be a simply connected region (complement in the extended plane connected) and let fff be analytic in Ω\OmegaΩ with f(z)≠0f(z)\neq 0f(z)=0 for all z∈Ωz\in\Omegaz∈Ω. Then:

  1. there is an analytic function LLL in Ω\OmegaΩ with eL(z)=f(z)e^{L(z)}=f(z)eL(z)=f(z) for all z∈Ωz\in\Omegaz∈Ω (a single-valued branch of log⁡f\log flogf), and
  2. for every integer n≥1n\ge 1n≥1 there is an analytic function RRR in Ω\OmegaΩ with R(z)n=f(z)R(z)^n=f(z)R(z)n=f(z) for all z∈Ωz\in\Omegaz∈Ω (a single-valued branch of fn\sqrt[n]{f}nf​).
Preamble
import Definitions.Def_AhlforsComplexAnalysis_Defs
import Mathlib

open AhlforsComplexAnalysis
Formal statement
theorem AhlforsComplexAnalysis.exists_log_and_root {Ω : Set ℂ}
    (hΩ : IsSimplyConnectedRegion Ω) {f : ℂ → ℂ} (hf : AnalyticOnNhd ℂ f Ω)
    (hf0 : ∀ z ∈ Ω, f z ≠ 0) :
    (∃ L : ℂ → ℂ, AnalyticOnNhd ℂ L Ω ∧ ∀ z ∈ Ω, Complex.exp (L z) = f z) ∧
    ∀ n : ℕ, 0 < n → ∃ R : ℂ → ℂ, AnalyticOnNhd ℂ R Ω ∧ ∀ z ∈ Ω, R z ^ n = f z := by sorry
Source
L. V. Ahlfors, *Complex Analysis*, 3rd ed., McGraw-Hill, 1979 (ISBN 0-07-000657-1), Ch. 4 §4.4, Corollary 2 of Theorem 15 (p. 142)
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 be a set satisfying 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. Let f:C→Cf:\mathbb C\to\mathbb Cf:C→C be analytic at every point of Ω\OmegaΩ (it has a convergent power series in a neighbourhood of each point of Ω\OmegaΩ), and assume f(z)≠0f(z)\neq0f(z)=0 for every z∈Ωz\in\Omegaz∈Ω. The statement asserts the conjunction of two claims.

(a) There is a function L:C→CL:\mathbb C\to\mathbb CL:C→C, analytic at every point of Ω\OmegaΩ, with

eL(z)=f(z)for all z∈Ω.e^{L(z)}=f(z)\quad\text{for all } z\in\Omega .eL(z)=f(z)for all z∈Ω.

(b) For every natural number nnn with n>0n>0n>0 there is a function R:C→CR:\mathbb C\to\mathbb CR:C→C, analytic at every point of Ω\OmegaΩ, with

R(z)n=f(z)for all z∈Ω.R(z)^n=f(z)\quad\text{for all } z\in\Omega .R(z)n=f(z)for all z∈Ω.

Nothing is required of fff, LLL or RRR outside Ω\OmegaΩ. The case n=0n=0n=0 is excluded (it would demand f≡1f\equiv1f≡1). LLL and RRR are not required to be related to each other or normalized at any point.

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