Asymptotic self-similarity and similarity in the Hausdorff topology
Definitionmcorr_similaritycomplex-dynamicsdynamical-systemsfractalsmetric-geometry
For a set and , the compact truncation is (truncSet). is self-similar about with scale (IsSelfSimilar) if for some . It is asymptotically -self-similar about with limit model (IsAsymptoticallySelfSimilar) if in Hausdorff distance for some ; the standing assumptions (nonempty closed sets, , ) are included. Two sets are asymptotically similar about (IsAsymptoticallySimilar) if as . Xfiber is the fiber .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.