Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Asymptotic self-similarity and similarity in the Hausdorff topology

Definition
mcorr_similarity

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

complex-dynamicsdynamical-systemsfractalsmetric-geometry

For a set A⊆CA\subseteq\mathbb{C}A⊆C and r>0r>0r>0, the compact truncation is Ar=(A∩D‾r)∪∂DrA_r=(A\cap\overline{\mathbb{D}}_r)\cup\partial\mathbb{D}_rAr​=(A∩Dr​)∪∂Dr​ (truncSet). AAA is self-similar about ccc with scale λ\lambdaλ (IsSelfSimilar) if (λT−cA)r=(T−cA)r(\lambda T_{-c}A)_r=(T_{-c}A)_r(λT−c​A)r​=(T−c​A)r​ for some r>0r>0r>0. It is asymptotically λ\lambdaλ-self-similar about ccc with limit model BBB (IsAsymptoticallySelfSimilar) if (λnT−cA)r→Br(\lambda^n T_{-c}A)_r\to B_r(λnT−c​A)r​→Br​ in Hausdorff distance for some r>0r>0r>0; the standing assumptions (nonempty closed sets, c∈Ac\in Ac∈A, ∣λ∣>1|\lambda|>1∣λ∣>1) are included. Two sets are asymptotically similar about ccc (IsAsymptoticallySimilar) if dH((λT−cA)r,(λT−cB)r)→0d_H((\lambda T_{-c}A)_r,(\lambda T_{-c}B)_r)\to0dH​((λT−c​A)r​,(λT−c​B)r​)→0 as ∣λ∣→∞|\lambda|\to\infty∣λ∣→∞. Xfiber is the fiber X(c)={x:(c,x)∈X}X(c)=\{x:(c,x)\in X\}X(c)={x:(c,x)∈X}.

Definition code
import Mathlib

open Set Filter Topology Finset

namespace MultibrotCorr


/-- The compact truncation A_r = (A intersect closed disk of radius r) union (circle of radius r)
(paper, Section 2.2). -/
def truncSet (A : Set ℂ) (r : ℝ) : Set ℂ :=
  (A ∩ Metric.closedBall (0 : ℂ) r) ∪ Metric.sphere (0 : ℂ) r

/-- A is self-similar about c with scale lam (lam-self-similar): (lam T_{-c} A)_r = (T_{-c} A)_r
for some r > 0 (paper, Section 2.2, eq. (2.4)). -/
def IsSelfSimilar (A : Set ℂ) (c lam : ℂ) : Prop :=
  IsClosed A ∧ A.Nonempty ∧ c ∈ A ∧ 1 < ‖lam‖ ∧
  ∃ r : ℝ, 0 < r ∧
    truncSet ((fun z => lam * z) '' ((fun z => z - c) '' A)) r =
      truncSet ((fun z => z - c) '' A) r

/-- A is asymptotically lam-self-similar about c with limit model B: the sets (lam^n T_{-c} A)_r
converge to B_r in the Hausdorff topology of compact sets, for some r > 0 (paper, Section 2.2). -/
def IsAsymptoticallySelfSimilar (A : Set ℂ) (c lam : ℂ) (B : Set ℂ) : Prop :=
  IsClosed A ∧ A.Nonempty ∧ c ∈ A ∧ 1 < ‖lam‖ ∧ IsClosed B ∧ B.Nonempty ∧
  ∃ r : ℝ, 0 < r ∧
    Filter.Tendsto (fun k : ℕ =>
      Metric.hausdorffDist
        (truncSet ((fun z => lam ^ k * z) '' ((fun z => z - c) '' A)) r)
        (truncSet B r)) Filter.atTop (nhds 0)

/-- A and B are asymptotically similar about c: d_H((lam T_{-c} A)_r, (lam T_{-c} B)_r) tends to 0
as |lam| tends to infinity (paper, Section 2.2, eq. (2.5)). -/
def IsAsymptoticallySimilar (A B : Set ℂ) (c : ℂ) : Prop :=
  IsClosed A ∧ A.Nonempty ∧ IsClosed B ∧ B.Nonempty ∧ c ∈ A ∧ c ∈ B ∧
  ∃ r : ℝ, 0 < r ∧
    Filter.Tendsto (fun lam : ℂ =>
      Metric.hausdorffDist
        (truncSet ((fun z => lam * z) '' ((fun z => z - c) '' A)) r)
        (truncSet ((fun z => lam * z) '' ((fun z => z - c) '' B)) r))
      (Filter.comap (fun lam : ℂ => ‖lam‖) Filter.atTop) (nhds 0)

/-- The fiber X(c) = {x : (c, x) in X} of a subset X of C x C (paper, Theorem 5.1). -/
def Xfiber (X : Set (ℂ × ℂ)) (c : ℂ) : Set ℂ :=
  {x | (c, x) ∈ X}

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, Section 2.2 (eq. 2.4, 2.5); Theorem 5.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