Interval-certified bounds on the area of the Mandelbrot set

Interval-certified bounds on the area of the Mandelbrot set: $1.5064820 \le \mu(M) \le 1.5643498$. The lower bound sums certified lower bounds on the areas of 3,352,592 hyperbolic components (Krawczyk-isolated centres, exact periods, the first three terms of the area formula for the inverse multiplier map). The upper bound is a depth-17 dyadic quadtree minus cells certified exterior by escape or a Koebe-type distance estimate with explicit truncation bounds. All arithmetic is Arb ball arithmetic, and both certificates were audited in full by independently written checkers. The lower bound exceeds every published lower bound we know of; the upper bound improves on Fisher and Hill (1993) and on every certified upper bound we found, but not on Förstemann's uncertified 1.53121. Version 1: an independent review of the mathematics is pending.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-10
DOI
https://doi.org/10.5281/zenodo.24116750
Primary Topic
Mathematical Dynamics and Fractals
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Interval-certified bounds on the area of the Mandelbrot set

Björn Lindheim
Zenodo (CERN European Organization for Nuclear Research)
Mathematical Dynamics and Fractals
preprint

Interval-certified bounds on the area of the Mandelbrot set

Björn Lindheim
preprint en

Abstract

Interval-certified bounds on the area of the Mandelbrot set: $1.5064820 \le \mu(M) \le 1.5643498$. The lower bound sums certified lower bounds on the areas of 3,352,592 hyperbolic components (Krawczyk-isolated centres, exact periods, the first three terms of the area formula for the inverse multiplier map). The upper bound is a depth-17 dyadic quadtree minus cells certified exterior by escape or a Koebe-type distance estimate with explicit truncation bounds. All arithmetic is Arb ball arithmetic, and both certificates were audited in full by independently written checkers. The lower bound exceeds every published lower bound we know of; the upper bound improves on Fisher and Hill (1993) and on every certified upper bound we found, but not on Förstemann's uncertified 1.53121. Version 1: an independent review of the mathematics is pending.

Zenodo (CERN European Organization for Nuclear Research)
Mathematical Dynamics and Fractals
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon