Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unicritical correspondence family: orbits, filled Julia and Multibrot sets

Definition
mcorr_family

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

complex-dynamicsdynamical-systemsfractals

Fix integers p>q>0p>q>0p>q>0 (the structure UnicriticalExponent, with the special case (p,q)=(4,2)(p,q)=(4,2)(p,q)=(4,2)). The unicritical algebraic correspondence fc(z)=zp/q+c\mathbf{f}_c(z)=z^{p/q}+cfc​(z)=zp/q+c is represented as the set of images {w:(w−c)q=zp}\{w:(w-c)^q=z^p\}{w:(w−c)q=zp}. A forward orbit of z0z_0z0​ is a sequence zzz with z(0)=z0z(0)=z_0z(0)=z0​ and z(i+1)∈fc(z(i))z(i+1)\in\mathbf{f}_c(z(i))z(i+1)∈fc​(z(i)). The filled Julia set KcK_cKc​ (filledJulia) is the set of points admitting at least one bounded forward orbit; the Multibrot set Mp,qM_{p,q}Mp,q​ (multibrot) is {c:0∈Kc}\{c:0\in K_c\}{c:0∈Kc​}. Also defined: the orbit of the critical point 000 written from the orbit of aaa (zeroOrbit), the backward images fa−n(0)\mathbf{f}_a^{-n}(0)fa−n​(0) (backwardOrbitSet), and univalent branches (IsUnivalentBranch), i.e. holomorphic injective local selections of the correspondence.

Definition code
import Mathlib

open Set Filter Topology Finset

namespace MultibrotCorr


/-- Exponent data of the unicritical family: a rational exponent r = p/q > 1 represented by
natural numbers p > q > 0 (paper, Section 1.3, eq. (1.1)). -/
structure UnicriticalExponent where
  p : ℕ
  q : ℕ
  hq : 0 < q
  hpq : q < p

/-- The exponent (p,q) = (4,2): the semigroup correspondence generated by z^2+c and -z^2+c
(paper, Theorem 3.1 and Corollary 5.1). -/
def quadCorrExponent : UnicriticalExponent := ⟨4, 2, by decide, by decide⟩

/-- The unicritical algebraic correspondence f_c(z) = z^(p/q) + c, as the (p:q) correspondence
(w - c)^q = z^p (paper, eq. (1.1)); its value at z is the set of images w. -/
def unicriticalCorr (p q : ℕ) (c z : ℂ) : Set ℂ :=
  {w | (w - c) ^ q = z ^ p}

/-- The forward orbit of the critical point 0 written in terms of the orbit z of a = f_c(0):
the sequence 0, a = z 0, z 1, z 2, ... (paper, Sections 1.4 and 6.2). -/
def zeroOrbit (z : ℕ → ℂ) : ℕ → ℂ
  | 0 => 0
  | (j + 1) => z j

/-- A forward orbit of the correspondence starting at z0 (paper, Section 1.4). -/
def IsForwardOrbit (e : UnicriticalExponent) (c z0 : ℂ) (z : ℕ → ℂ) : Prop :=
  z 0 = z0 ∧ ∀ i, z (i + 1) ∈ unicriticalCorr e.p e.q c (z i)

/-- The filled Julia set K_c: points with at least one bounded forward orbit
(paper, Section 1.4 and Section 2, eq. (2.3)). -/
def filledJulia (e : UnicriticalExponent) (c : ℂ) : Set ℂ :=
  {z0 | ∃ z, IsForwardOrbit e c z0 z ∧ ∃ R, ∀ i, ‖z i‖ ≤ R}

/-- The Multibrot set M_(p,q): parameters c for which 0 lies in K_c
(paper, Definition 1.1 and Definition 5.1). -/
def multibrot (e : UnicriticalExponent) : Set ℂ :=
  {c | (0 : ℂ) ∈ filledJulia e c}

/-- The n-th backward image of 0 under f_a, i.e. f_a^(-n)(0): points admitting a forward orbit
of length n ending at 0 (used in Theorem D of arXiv:2509.05682). -/
def backwardOrbitSet (e : UnicriticalExponent) (a : ℂ) (n : ℕ) : Set ℂ :=
  {z | ∃ w : ℕ → ℂ, w 0 = z ∧ w n = 0 ∧
    ∀ i < n, w (i + 1) ∈ unicriticalCorr e.p e.q a (w i)}

/-- A univalent branch of f_c on an open set U: a holomorphic injective map f with
(f z - c)^q = z^p for all z in U (paper, Section 2.1). -/
def IsUnivalentBranch (e : UnicriticalExponent) (c : ℂ) (U : Set ℂ) (f : ℂ → ℂ) : Prop :=
  IsOpen U ∧ DifferentiableOn ℂ f U ∧ Set.InjOn f U ∧
  ∀ z ∈ U, (f z - c) ^ e.q = z ^ e.p

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 1.3 (eq. 1.1), Section 1.4, Definition 1.1, Section 2 (eq. 2.3), Section 2.1, Definition 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