Mandelbrot Set

Premier
lean4-proofinteractivevisualizationfractal-geometry
zn+1=zn2+cz_{n+1} = z_n^2 + c

Definition

The Mandelbrot set M\mathcal{M} is the set of complex numbers cc for which the orbit of 00 under iteration of fc(z)=z2+cf_c(z) = z^2 + c remains bounded:

M={cC:supnfcn(0)<}\mathcal{M} = \{ c \in \mathbb{C} : \sup_{n} |f_c^n(0)| < \infty \}

Equivalently, cMc \in \mathcal{M} if and only if zn2|z_n| \leq 2 for all nn, where z0=0z_0 = 0 and zn+1=zn2+cz_{n+1} = z_n^2 + c.

Key Properties

  • Connectedness: The Mandelbrot set is connected (Douady and Hubbard, 1982). This deep result means it is a single "piece" despite its intricate boundary.
  • Self-similarity: Miniature copies of the entire set appear at every scale along the boundary — the same self-referential structure formalised by Iterated Function SystemsIterated Function SystemsA=i=1Nfi(A)A = \bigcup_{i=1}^{N} f_i(A)Constructing fractals via contractive affine transformationsRead more →.
  • Boundary complexity: The boundary of M\mathcal{M} has Hausdorff dimensionHausdorff Dimensiond=logNlog(1/r)d = \frac{\log N}{\log (1/r)}Measuring the fractional dimension of self-similar setsRead more → 2 (Shishikura, 1998).

Escape-Time Algorithm

For each pixel (corresponding to a value of cc), iterate zn+1=zn2+cz_{n+1} = z_n^2 + c starting from z0=0z_0 = 0. If zn>2|z_n| > 2 for some nn, the point escapes and is colored by nn. Otherwise, color it black (assumed to be in M\mathcal{M}).

Connections

The boundary of the Mandelbrot set has Hausdorff DimensionHausdorff Dimensiond=logNlog(1/r)d = \frac{\log N}{\log (1/r)}Measuring the fractional dimension of self-similar setsRead more → equal to 2. The filled Julia sets for each cc can be viewed as attractors of Iterated Function SystemsIterated Function SystemsA=i=1Nfi(A)A = \bigcup_{i=1}^{N} f_i(A)Constructing fractals via contractive affine transformationsRead more →.