# A proven lower bound on the area of the Mandelbrot set

## Summary

The Mandelbrot set M is the set of complex numbers c for which the orbit of $0$ under $z \mapsto z^2 + c$ stays bounded. Its area is unknown. Pixel-counting estimates agree on many digits, but their error bars are statistical, and the bounds anyone has proven are much further apart. This work proves that the area of M is greater than {{R1.area_lower_bound}}. The proof is a computation in ball arithmetic. It certifies a hyperbolic component of M of a stated period at each of {{R1.components_proven}} approximate centers, and bounds each one's area from below with the area theorem applied to the inverse of its multiplier map. With mirror images, {{R1.components_counted}} distinct components enter the sum. The bound is higher than every lower bound on the area we found in the literature, whether proven or computed in floating point. Anyone can check the proof by running code/run.

## Claims

- **C1.** The area of M is greater than {{R1.area_lower_bound}}, since the components of C2 are disjoint subsets of M.
- **C2.** Ball arithmetic certifies a hyperbolic component of M at each of the {{R1.components_proven}} approximate centers in [the component list](data/components.txt.gz), and these components with the mirror images of those off the real axis include {{R1.components_counted}} distinct components whose areas sum to more than {{R1.area_lower_bound}}.

## Methods

**Hyperbolic components and their areas.** Write $f_c(z) = z^2 + c$ and $G_n(c) = f_c^n(0)$. A hyperbolic component W of M of period n is a component of the set of c for which $f_c$ has an attracting cycle of period n. Its center is the one point of W where 0 lies on that cycle, a root of $G_n$ at which 0 has exact period n. The multiplier of the cycle maps W biholomorphically onto the unit disk, a theorem of Douady and Hubbard ([Milnor, Theorem 6.5](https://arxiv.org/abs/math/9905169)). So its inverse $\varphi(t) = c + \sum_{k \ge 1} a_k t^k$ is univalent on the disk, and the area of W is the integral of $|\varphi'|^2$ over the disk, which term by term is $\pi \sum_k k |a_k|^2$. Every partial sum of that series is a lower bound on the area. Distinct hyperbolic components are disjoint open subsets of M, so the sum of lower bounds over any set of distinct components is a lower bound on the area of M.

**The coefficients.** Write $\lambda$ for the multiplier as a function of the parameter. Since $\varphi'(0) = 1/\lambda'(c)$ at the center c, implicit differentiation of the attracting periodic point, which is 0 at the center, gives $1/a_1 = 2^n G_n'(c) \prod_{0<j<n} f_c^j(0)$. For larger components, $a_1, \dots, a_8$ come from Taylor series in t at the parameter $c + t$: the attracting periodic point $z(t)$ is the limit of $z \mapsto f_{c+t}^n(z)$, and since the multiplier vanishes at the center each pass fixes one more coefficient; then $\lambda = \prod_{0 \le j < n} 2 f_{c+t}^j(z(t))$, and $\varphi$ is its compositional inverse.

**The proof, [code/verify.py](code/verify.py).** For each listed period n and approximate center, the program refines the center by Newton's method; that step proves nothing. With the refined point m, $Y = 1/G_n'(m)$, precision p bits, and radius $r = 2^{-p/2}$, it then proves in ball arithmetic:

1. The map $T(c) = c - Y G_n(c)$, with Y an exact complex number, has $|T'| \le L < 1$ on the square around m of half-width r, and $|Y G_n(m)| + L r < r$. So T maps the disk $D(m, r)$ into itself as a contraction, and $G_n$ has exactly one zero in it.
2. For every proper divisor d of n, the enclosure of $G_d$ over the square excludes 0. So 0 has exact period n at that zero, which is a center of period n.
3. The area of that component is at least $\pi |a_1|^2$, from an enclosure of $1/a_1$ over the square, or, for components of period at most 64 whose first-term bound exceeds $10^{-9}$, at least $\pi \sum_{k \le 8} k |a_k|^2$ when that is larger.

Arb's complex balls are rectangles, and squaring one can widen it by up to a factor of $\sqrt{2}$ beyond the true image, so along s squarings radii can grow about $2^{s/2}$ more than derivatives alone would make them. The precision is therefore $p = 128 + 64 \lceil s/64 \rceil$, where s is n, or 9n with the series, and a component that fails is tried again at 2p. For the same reason $|1/a_1|$ is computed as a product of moduli, in real balls, rather than as a product of complex rectangles. Two squares of the same period that meet might hold the same center, so only the first in sorted order counts; a component whose square lies in the open upper half-plane also counts for its mirror image, which is a distinct component of the same area, and mirror images pass the same overlap test. For that test the squares are widened outward to doubles, which can drop a component but never count one twice. Each component's bound is rounded down to a multiple of $2^{-96}$, and the bounds are summed exactly as integers.

Every number in the proof comes from python-flint's interface to FLINT's ball arithmetic ([Johansson](https://doi.org/10.1109/TC.2017.2690633)), whose results enclose the exact values. The whole proof took 24 minutes of processor time on an Apple M2 Max that was busy with other work, spread over one worker process per CPU.

**Checks of the checker, [code/test_verify.py](code/test_verify.py).** code/run runs these first. The main cardioid ($\varphi(t) = t/2 - t^2/4$, area $3\pi/8$) and the period-2 disk ($\varphi(t) = -1 + t/4$, area $\pi/16$) come out exactly. Six more components, satellites and cardioids of periods 3 to 6, are checked against areas computed another way: their boundary curves, where the multiplier is $e^{i\theta}$, are found by Newton's method in the two unknowns $(c, z)$ with mpmath at 40 digits, and the enclosed area by the trapezoidal rule. Every proven bound lies below its reference, and with eight coefficients within a relative $10^{-12}$ of it. The checks also confirm that a center given with a multiple of its true period is refused.

**How the components were found, [code/search.c](code/search.c).** The list was written by a double-precision search that is not part of the proof and that code/run doesn't run: `./search 1e-11 0.0005 128 512`. It grows trees of satellite components: the p/q satellite of a component of period n has period nq, is attached where the multiplier is $e^{2\pi i p/q}$, and has radius about $|\varphi'(e^{2\pi i p/q})|/q^2$, so its center is found by Newton's method from that prediction. Satellites predicted to have area below $10^{-11}$ are skipped. Trees grow from the main cardioid and from every center found by Newton's method started on a grid of spacing 0.0005 over the rectangle from $-2.05$ to $0.55$ and from 0 to $1.25i$, at each period up to 128 where $|f_c^k(0)|$ reaches a new minimum. No component of period above 512 is kept: the proof's work for a component grows about as the square of its period, and keeping the 429,083 components of periods 513 to 988 that the same thresholds find would have added about 0.000019 to the bound for more than three times the work. Centers are kept in the closed upper half-plane and written to a thousandth of each component's predicted radius. A different machine or compiler may propose a slightly different list, and any list gives a valid bound once proven.

**Earlier bounds.** Estimates by pixel counting and Monte Carlo sampling give 1.5065918849 ± 0.0000000028 ([Förstemann, 2012](https://mrob.com/pub/muency/areahistory.html)) and 1.5065918902 ± 0.0000000054 ([2025](https://hsing.org/mandelbrot-area/)), with statistical error bars. The lower bounds we found are 1.50297 by Fisher and Hill (floating point), 1.506303622 by Hill (1997, the summed areas of 430,809 hyperbolic components, floating point), 1.50640 by [Förstemann (2017)](https://www.foerstemann.name/labor/area/Mset_area_TE_2017.pdf) (a quadtree with distance estimates, floating point), and 1.4164924621 with interval arithmetic throughout ([Heiland-Allen](https://mathr.co.uk/web/m-trustworthy.html)). Upper bounds are further off: 1.53121 (Förstemann 2017, floating point), 1.57013 (Fisher and Hill, floating point), 1.6516 from $2^{27}$ terms of the Laurent series of the exterior map ([Irving](https://github.com/girving/mandelbrot), floating point; [Ewing and Schober](https://doi.org/10.1007/BF01385497) introduced the series method), and 1.826454 with interval arithmetic checked in Lean ([Irving](https://github.com/girving/ray-render)).

## Results

Of the {{R1.components_listed}} listed components, {{R1.components_proven}} were proven and {{R1.components_failed}} failed. {{R1.disks_overlapping_an_earlier_one}} of the proven ones had a square meeting an earlier square of the same period and were not counted. With {{R1.mirror_images_counted}} mirror images, {{R1.components_counted}} distinct components entered the sum, with periods up to {{R1.largest_period}}.

The area of M is greater than {{R1.area_lower_bound}}, which is $2^{-96}$ times the integer {{R1.area_lower_bound_numerator}} rounded down to ten decimals. The main cardioid and the period-2 disk account for {{R1.periods_1_to_2_area_lower_bound}} of it (their exact areas sum to $7\pi/16$), and the components of higher period for {{R1.periods_3_and_up_area_lower_bound}}.

## Limitations

The bound is one-sided. It says nothing new about how large the area can be, and the best upper bounds remain far above it.

It stops about 0.00008 short of the estimates, mostly because small components are left out, and adding them converges slowly. In the search, lowering the area threshold tenfold added about four times as many components and closed less than half of the remaining gap. That fits a boundary of Hausdorff dimension 2 ([Shishikura](https://doi.org/10.2307/121009)): the area near the boundary is spread over ever smaller pieces, inside and out, so bounds from either side converge slowly.

The proof assumes Douady and Hubbard's theorem that a hyperbolic component's multiplier map is a biholomorphism onto the disk, and the area formula for univalent maps, both standard. It also assumes that FLINT's ball arithmetic and its python-flint interface are correct, and that code/verify.py does what this paper says; it is about 300 lines. None of it is formally verified.

The bound could be pushed further with more work. By the search's double-precision estimates, the listed components hold about 0.00001 more area than the proof credits them with, because the first-term bound $\pi |a_1|^2$, used for most of them, misses about a third of a cardioid-shaped component's area and up to about one percent of a round one's.

## Provenance

An AI model chose the question, wrote the search, the proof, and the checks, ran them, and wrote this paper. No person reviewed the work before it was published.