Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1, holomorphic motion of a repelling cycle, with holomorphy near (b,zj)(b,z_j)(b,zj​)

Open
MultibrotCorr.lemma_3_1_local

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

complex-dynamicsdynamical-systemsfractals

Let (zi)0n(z_i)_0^n(zi​)0n​ be a repelling cycle of period nnn of fb\mathbf{f}_bfb​ with univalent branches fif_ifi​ sending zi−1z_{i-1}zi−1​ to ziz_izi​, extended nnn-periodically. The return map hj=fn+j∘⋯∘fj+1h_j=f_{n+j}\circ\cdots\circ f_{j+1}hj​=fn+j​∘⋯∘fj+1​ has a repelling fixed point at zjz_jzj​. For each j∈[0,n]j\in[0,n]j∈[0,n]: (i) (c,z)↦hj,c(z)(c,z)\mapsto h_{j,c}(z)(c,z)↦hj,c​(z) is holomorphic near (b,zj)(b,z_j)(b,zj​); (ii) there is a unique holomorphic function z~j\tilde z_jz~j​ near bbb with z~j(b)=zj\tilde z_j(b)=z_jz~j​(b)=zj​ and hj,c(z~j(c))=z~j(c)h_{j,c}(\tilde z_j(c))=\tilde z_j(c)hj,c​(z~j​(c))=z~j​(c); (iii) the perturbed branch fj,cf_{j,c}fj,c​ sends z~j−1(c)\tilde z_{j-1}(c)z~j−1​(c) to z~j(c)\tilde z_j(c)z~j​(c), and the resulting cycle is repelling. Uniqueness in (ii) is germ uniqueness (any other holomorphic fixed-point selection agrees near bbb).

Formalization Note Part (i) is stated on a product V1×V2V_1\times V_2V1​×V2​ of open sets with b∈V1b\in V_1b∈V1​ and zj∈V2z_j\in V_2zj​∈V2​, that is on a neighborhood of (b,zj)(b,z_j)(b,zj​) as in the source. The branches φ i are total functions that are only constrained on the open sets U i, so nothing can be said about the composition near (b,b)(b,b)(b,b).

Preamble
import Mathlib
import Definitions.Def_mcorr_branches

open Set Filter Topology Finset
Formal statement
namespace MultibrotCorr
theorem lemma_3_1_local (e : UnicriticalExponent) (b : ℂ) (n : ℕ)
    (z : ℕ → ℂ) (φ : ℕ → ℂ → ℂ) (U : ℕ → Set ℂ)
    (hn : 0 < n)
    (hzper : ∀ i, z (i + n) = z i)
    (hφper : ∀ i, φ (i + n) = φ i)
    (hbranch : ∀ i, IsOpen (U i) ∧ z i ∈ U i ∧ IsUnivalentBranch e 0 (U i) (φ i) ∧
      φ i (z i) + b = z (i + 1))
    (hrep : IsRepellingCycle e b n z) :
    ∃ (W : Set ℂ) (zz : ℕ → ℂ → ℂ),
      IsOpen W ∧ b ∈ W ∧
      (∀ j, DifferentiableOn ℂ (zz j) W ∧ zz j b = z j) ∧
      (∀ j, zz (j + n) = zz j) ∧
      (∀ c ∈ W, ∀ j, perturbedComp e φ j n c (zz j c) = zz j c) ∧
      (∀ c ∈ W, ∀ j, zz (j + 1) c = φ j (zz j c) + c) ∧
      (∀ c ∈ W, IsRepellingCycle e c n (fun j => zz j c)) ∧
      (∀ j, ∃ V₁ V₂ : Set ℂ, IsOpen V₁ ∧ b ∈ V₁ ∧ IsOpen V₂ ∧ z j ∈ V₂ ∧
        DifferentiableOn ℂ (fun p : ℂ × ℂ => perturbedComp e φ j n p.1 p.2) (V₁ ×ˢ V₂)) ∧
      (∀ j, ∀ (w : ℂ → ℂ) (Vw : Set ℂ), IsOpen Vw → b ∈ Vw →
        DifferentiableOn ℂ w Vw → w b = z j →
        (∀ c ∈ Vw, perturbedComp e φ j n c (w c) = w c) →
        ∃ V' : Set ℂ, IsOpen V' ∧ b ∈ V' ∧ V' ⊆ Vw ∧ V' ⊆ W ∧ ∀ c ∈ V', w c = zz j c) := 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, Lemma 3.1, Section 3; eq. (3.1), (3.2), (3.3).

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