OpenFrontiers
← Back to the index
OP-3997Status unassessedDynamical systems

Density of hyperbolicity for Multibrot sets

TheoremDB P8660 · Candidate awaiting source review

Inferred from the community field; finer classification has not been reviewed.

Source candidate · not reviewedAs of 2026-09-08Source & evidence ↓

Problem statement

For an integer n≥2n \geq 2, the Multibrot set of power nn, denoted Mn\mathcal{M}_n, is the set of all complex parameters cc for which the orbit of 00 under iteration of the map fc(z)=zn+cf_c(z) = z^n + c does not escape to infinity. Equivalently, Mn\mathcal{M}_n is the set of all c∈Cc \in \mathbb{C} such that ∥fc[k](0)∥≤2(n−1)−1\|f_c^{[k]}(0)\| \leq 2^{(n-1)^{-1}} for all k≥0k \geq 0, where fc[k]f_c^{[k]} denotes the kk-fold iterate of fcf_c.

A point z∈Cz \in \mathbb{C} is said to be part of an attracting cycle of period mm for a holomorphic map f:C→Cf: \mathbb{C} \to \mathbb{C} if m>0m > 0, f[m](z)=zf^{[m]}(z) = z, the iterate f[m]f^{[m]} is differentiable at zz, and ∥deriv⁡(f[m])(z)∥<1\|\operatorname{deriv}(f^{[m]})(z)\| < 1.

Prove that the set of parameters c∈Cc \in \mathbb{C} for which fc(z)=zn+cf_c(z) = z^n + c has an attracting cycle is dense in Mn\mathcal{M}_n. That is, prove that

Mn⊆{c∈C:∃ m≥1, ∃ z∈C,  z is part of an attracting cycle of period m for fc}‾.\mathcal{M}_n \subseteq \overline{\{c \in \mathbb{C} : \exists\, m \geq 1,\, \exists\, z \in \mathbb{C},\; z \text{ is part of an attracting cycle of period } m \text{ for } f_c\}}.

.

Lean 4

No Lean submitted

Formal statement

Lean 4
theorem density_of_hyperbolicity_general_exponent {n : ℕ} (hn : 2 ≤ n) :
    multibrotSet n ⊆ closure {c | ∃ m z, IsAttractingCycle (fun z ↦ z ^ n + c) m z}

On-site verification needs an executable Lean target. None is attached yet.

A source attachment or link is not a verified proof. The statement’s correspondence with the original question needs human review.

Proofs & verification

No Lean has been submitted for this problem yet. A Lean file can be attached to a submission for review, though with no target here it cannot be machine-checked.

Progress & source assessment

Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.

Open. No signed Lean verification is attached to this problem or its selected resolution.

This record is in the source backlog; its novelty and unresolved status have not passed source review.

References
  1. [1]TheoremDB P8660 link
  2. [2]Source formal statement (not locally verified) link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.