⟵ ARTIFICIAL WASTELAND  /  STRATUM 030  ·  PATTERN

How Big Is the Mandelbrot Set?

AREA = 1.506 591 8849…?  ·  BEST ESTIMATE, NOT A PROOF  ·  EXACT VALUE UNKNOWN

It is the most recognized object in modern mathematics — printed on posters, tattooed on arms, set as a billion screensavers. We can compute it to a trillion points. And we do not know its area.

Take a complex number c. Start at zero and repeat z → z² + c. For some c the numbers stay bounded forever; for others they fly off to infinity. The Mandelbrot set is just the collection of c that stay bounded — a single, connected black island in the plane, ringed by a coastline of infinite, self-similar intricacy.

Everything about it has been studied to exhaustion. Its boundary is the most-rendered curve in history. And yet one of the simplest questions you could ask — what is its area? — has no known answer. Not "we haven't computed enough digits." There is no proven exact value, and no formula. The best number anyone has, from counting pixels on enormous grids, is

A ≈ 1.506 591 8849  ±  0.000 000 0028

— Thorsten Förstemann, 2012, from roughly 88 trillion sample points. But pixel-counting is an estimate, not a theorem. Meanwhile the one method that gives a rigorous answer — a 1914 theorem about areas and a power series — has been pushed to five million terms and can only prove the area is below 1.6829. That bound and that estimate have never met.

This page is three instruments. The first counts the area in your browser and shows it converging. The second shows you the two pieces of the set whose areas we do know, exactly. The third runs the rigorous method and shows you, live, why it stalls. None of the numbers are mine to assert — they recompute in front of you or carry a citation.

I · Count it yourself

The honest way to measure an area is to lay a grid over it and count the cells that fall inside. For each cell we run z → z²+c a few hundred times: if z never escapes, the cell is (probably) inside. Press refine to double the grid and re-run. Two interior regions are short-circuited analytically (the next instrument explains them); everything else is counted by brute iteration, folded across the real axis by symmetry.

INSTRUMENT 01 · the area census, computed livegrid —
inside (orbit bounded) undecided boundary band escaped (outside)
Press refine the grid. The estimate counts every cell whose orbit has not yet escaped — which over-counts the fuzzy boundary, so it descends toward the truth from above as the grid tightens. Watch the blue boundary band: for an ordinary curve it would thin to nothing. Here it doesn't.

As the grid tightens, the estimate falls — 1.513 → 1.509 → 1.507 → — homing in on 1.5066 from above, because every cell that merely touches the set gets counted as inside. For a smooth shape that error would vanish quickly: halve the grid spacing and the boundary cells roughly halve. Here they barely do. That blue band is the whole problem, and Section IV says why.

II · The two pieces we know exactly

Not everything is unknown. The set's two largest features have areas in perfect closed form. The big heart-shaped body is the main cardioid — the parameters where the orbit settles to a single point. Its boundary is the curve c = e/2 − e2iθ/4, and a one-line integral gives its area as exactly 3π/8. The disk bolted to its left, centered at −1 with radius ¼ — the period-2 region — has area exactly π/16.

Together that is 7π/16 ≈ 1.3744 — already 91% of the whole set. Tap a row to light it up.

INSTRUMENT 02 · what is known in closed formof est. 1.50659
The main cardioid (3π/8) and the period-2 disk (π/16) are exact. Every smaller bulb has an area too, but for period ≥ 3 there is no known closed form — they are measured numerically, one by one. Jay Hill summed 430,809 of them (periods 1–16) to get a rigorous lower bound of 1.5063. The last sliver — and whether the lacy boundary contributes any area at all — is open.

III · The bound that won't come down

Here is the rigorous attack. Because the set is connected (Douady & Hubbard, 1982), the region outside it can be mapped conformally from the outside of a unit disk by a single function

Ψ(w) = w + b0 + b1/w + b2/w² + b3/w³ + ⋯

and a 1914 theorem of Gronwall — the area theorem — turns the coefficients of that map directly into the area of what it encloses:

Area(M) = π · ( 1 − Σm≥1 m · bm² )

Every term you add is subtracted, so each partial sum is a guaranteed upper bound that only ever decreases. The coefficients bm are exact dyadic fractions (b1=1/8, b3=15/128, b5=−47/1024…); this page recomputes them and sums the bound live. Drag the slider, and watch the guaranteed ceiling come down — and then refuse to come down fast enough.

INSTRUMENT 03 · the Gronwall area bound, summed liven = 1
terms n 1
bound π(1−Σ m bm²), computed here published, to 5,000,000 terms best estimate 1.50659
At n = 1 the bound is just under π. Drag right and it falls fast at first, then crawls. The amber points are summed in your browser from the exact coefficients; the dim points beyond are the published record — Ewing & Schober reached 240,000 terms (1.7275), and the bound stands at 1.6829 after five million. The green line is where the truth is believed to be. The rigorous ceiling has never touched it.

Five million terms of a convergent series, and the proven answer is still 0.18 too big. The series is honest. It is just unspeakably slow.

IV · Why it's this hard

The two methods fail in mirror-image ways, and both failures trace to a single theorem. In 1991 Mitsuhiro Shishikura proved that the boundary of the Mandelbrot set has Hausdorff dimension 2 — the maximum possible for a curve in the plane. The coastline is so violently crinkled that, by the measure of dimension, it is as big as an area.

That is exactly why the pixel count has a stubborn error bar. For a smooth boundary, the cells straddling the edge are a one-dimensional sliver: refine the grid and their total area falls like the grid spacing. For a dimension-2 boundary, the straddling cells behave almost two-dimensionally — that blue band in Instrument 01 thins agonizingly slowly, and every cell in it is an unresolved ±. And it is why the series crawls: the coefficients bm fall off only about as fast as 1/m — no faster — so the corrections m·bm² are a near-harmonic dribble that takes millions of terms to add up. That slowness is not a coincidence: if the bm decayed quickly the boundary would have to be small, and it isn't. The fat boundary sabotages both attacks at once.

V · The deeper unknown

Dimension 2 is not the same as positive area. A dimension-2 set can still have zero area — and so there is a stranger question hiding under the first one: does the boundary of the Mandelbrot set itself have positive area? Nobody knows. It is consistent with everything proven that the black coastline, taken alone, has measurable thickness — Buff and Chéritat showed in 2012 that the closely-related Julia sets can have positive area, so it is not a wild idea. If the boundary does have positive area, then the very question "what is the area of the set" sharpens into "and how much of that lives in the infinitely-thin-looking edge."

So the honest state of the art is a nested pair of open problems wrapped around a shape on a million T-shirts: we cannot prove its area, and we cannot even decide whether its edge has any area to give. The estimate 1.5065918849 is almost certainly close. Almost is doing real work in that sentence — and closing it is genuine, unfinished mathematics.

There's a coda worth knowing: in 1992 Keith Briggs idly wondered whether the area might be exactly 3/2. It's a pretty guess — and the pixel estimate, 1.5066, sits thousands of error-bars away from 1.5000. If you trust the counting, the area is not 3/2. But counting isn't proof, so even that tidy little conjecture isn't formally dead. That is how thin the ice is here.