Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1 (Tan Lei), stated for the closure of MuM_uMu​

Open
MultibrotCorr.theorem_5_1_closure

by Shuze Chen · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

complex-dynamicsdynamical-systemsfractals

Tan Lei's transfer theorem, as stated (simplified) in the paper. Let u,λu,\lambdau,λ be holomorphic on a neighborhood UUU of aaa with u′(a)≠0u'(a)\ne0u′(a)=0, u(a)=0u(a)=0u(a)=0, ∣λ(a)∣>1|\lambda(a)|>1∣λ(a)∣>1. Let XXX be a closed subset of U×CU\times\mathbb{C}U×C such that (i) for every ccc near aaa, 0∈X(c)0\in X(c)0∈X(c) and X(c)X(c)X(c) is λ(c)\lambda(c)λ(c)-self-similar about 000 with a common radius rrr; and (ii) there is a dense subset X′(a)⊂X(a)X'(a)\subset X(a)X′(a)⊂X(a) each of whose points extends to a holomorphic section ζx(c)∈X(c)\zeta_x(c)\in X(c)ζx​(c)∈X(c) near aaa. Then Mu={c∈U:u(c)∈X(c)}M_u=\{c\in U:u(c)\in X(c)\}Mu​={c∈U:u(c)∈X(c)} is asymptotically λ(a)\lambda(a)λ(a)-self-similar about aaa with limit model u′(a)−1⋅X(a)u'(a)^{-1}\cdot X(a)u′(a)−1⋅X(a).

Formalization Note The set Mu={c∈U:u(c)∈X(c)}M_u=\{c\in U:u(c)\in X(c)\}Mu​={c∈U:u(c)∈X(c)} is closed in UUU but need not be closed in C\mathbb{C}C, while IsAsymptoticallySelfSimilar asks for a closed subset of C\mathbb{C}C. The conclusion is therefore stated for the closure of MuM_uMu​ in C\mathbb{C}C. This changes nothing near aaa: the closure and MuM_uMu​ agree on every closed disk about aaa contained in UUU, and asymptotic self-similarity about aaa only depends on the set near aaa. The closed subset XXX of U×CU\times\mathbb{C}U×C is given as the trace on U×CU\times\mathbb{C}U×C of a closed subset of C2\mathbb{C}^2C2.

Preamble
import Mathlib
import Definitions.Def_mcorr_branches

open Set Filter Topology Finset
Formal statement
namespace MultibrotCorr
theorem theorem_5_1_closure (U : Set ℂ) (a : ℂ) (u lam : ℂ → ℂ) (X : Set (ℂ × ℂ))
    (hU : IsOpen U) (haU : a ∈ U)
    (hu : DifferentiableOn ℂ u U) (hlam : DifferentiableOn ℂ lam U)
    (hu' : deriv u a ≠ 0) (hu0 : u a = 0) (hlam1 : 1 < ‖lam a‖)
    (hX : ∃ C : Set (ℂ × ℂ), IsClosed C ∧ X = C ∩ (U ×ˢ Set.univ))
    (hself : ∃ (r : ℝ) (V : Set ℂ), 0 < r ∧ IsOpen V ∧ a ∈ V ∧ V ⊆ U ∧
      ∀ c ∈ V, (0 : ℂ) ∈ Xfiber X c ∧
        truncSet ((fun z => lam c * z) '' Xfiber X c) r = truncSet (Xfiber X c) r)
    (hdense : ∃ X' : Set ℂ, X' ⊆ Xfiber X a ∧ Xfiber X a ⊆ closure X' ∧
      ∀ x ∈ X', ∃ (Vx : Set ℂ) (ζ : ℂ → ℂ), IsOpen Vx ∧ a ∈ Vx ∧ Vx ⊆ U ∧
        DifferentiableOn ℂ ζ Vx ∧ ζ a = x ∧ ∀ c ∈ Vx, ζ c ∈ Xfiber X c) :
    IsAsymptoticallySelfSimilar (closure {c ∈ U | u c ∈ Xfiber X c}) a (lam a)
      ((fun z => (deriv u a)⁻¹ * z) '' Xfiber X a) := by sorry
end MultibrotCorr
Source
C. Siqueira, Similarity between the Multibrot set and the Julia set of correspondences at Misiurewicz points, https://arxiv.org/abs/2509.07266, Theorem 5.1, Section 5; citing Tan Lei, Similarity between the Mandelbrot set and Julia sets, Comm. Math. Phys. 134 (1990), Proposition 4.1, p. 601.

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