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

Local Connectivity of the Mandelbrot Set

TheoremDB P9102 · 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

Let the Mandelbrot set be the set of all complex parameters c∈Cc \in \mathbb{C} for which the orbit of 00 under iteration of the quadratic polynomial z↦z2+cz \mapsto z^2 + c does not escape to infinity; equivalently, it is the set of all c∈Cc \in \mathbb{C} such that for every non-negative integer kk, the kk-fold iterate satisfies ∥(z↦z2+c)[k](0)∥≤2\|(z \mapsto z^2 + c)^{[k]}(0)\| \leq 2, where ∥⋅∥\|\cdot\| denotes the complex modulus. A subset of a topological space is locally connected if every point has a neighborhood base consisting of connected open sets. Prove that the Mandelbrot set, equipped with the subspace topology from C\mathbb{C}, is locally connected.

Lean 4

No Lean submitted

Formal statement

Lean 4
theorem MLC : LocallyConnectedSpace mandelbrotSet

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 P9102 link
  2. [2]Source formal statement (not locally verified) link
  3. [3]Wikipedia contributors — Local connectivity of the Mandelbrot set, mathematics problem list (inspected 2026-09-09) 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.