Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1 (Theorem A) — asymptotic self-similarity of KcK_cKc​ near a Misiurewicz point

Open
MultibrotCorr.theorem_4_1

by LG · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

complex-dynamicsdynamical-systemsfractals

Let aaa be a Misiurewicz point. For every parameter ccc in a neighborhood of aaa, the filled Julia set KcK_cKc​ is asymptotically λ(c)\lambda(c)λ(c)-self-similar about each point zj(c)z_j(c)zj​(c) of the perturbed orbit (1.2), with limit model Bj(c)B_j(c)Bj​(c) defined inductively by Bℓ(c)=φc(V‾∩Kc)B_\ell(c)=\varphi_c(\overline V\cap K_c)Bℓ​(c)=φc​(V∩Kc​) and Bj(c)=fj,c′(zj−1(c))⋅Bj−1(c)B_j(c)=f'_{j,c}(z_{j-1}(c))\cdot B_{j-1}(c)Bj​(c)=fj,c′​(zj−1​(c))⋅Bj−1​(c) (eq. 4.2). In particular KaK_aKa​ is asymptotically self-similar about aaa and about every point of the repelling cycle αa\alpha_aαa​. The motion and Kœnigs linearization are those of Lemma 3.2 and Remark 4.1.

Preamble
import Mathlib
import Definitions.Def_mcorr_branches

open Set Filter Topology Finset
Formal statement
namespace MultibrotCorr
theorem theorem_4_1 (e : UnicriticalExponent) (a : ℂ) (ha : IsMisiurewicz e a) :
    ∃ (ℓ n : ℕ) (z : ℕ → ℂ) (φ : ℕ → ℂ → ℂ) (U : ℕ → Set ℂ)
      (W : Set ℂ) (zz : ℕ → ℂ → ℂ) (lam : ℂ → ℂ)
      (φK : ℂ → ℂ → ℂ) (φdom : ℂ → Set ℂ),
      IsMisiurewiczOrbitData e a ℓ n z φ U ∧
      IsMisiurewiczMotion e a ℓ n z φ U W zz lam ∧
      IsKoenigsFamily e ℓ n φ zz lam W φK φdom ∧
      ∀ c ∈ W, ∀ j : ℕ, ∀ V : Set ℂ, IsOpen V → zz ℓ c ∈ V → closure V ⊆ φdom c →
        IsAsymptoticallySelfSimilar (filledJulia e c) (zz j c) (lam c)
          (limitModelB e ℓ zz φK c V j) := 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 4.1 (Theorem A), Section 4; eq. (4.2), Remark 4.1.
Human review
  • Endorsed by Shuze Chen · Nov 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 21, 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