Updated March 29, 2026
- The Mandelbrot set arises from iterating z² + c, yet its boundary remains unclassified.
- The MLC conjecture, open for 40+ years, would fully decode the set's structure.
- Renormalization breakthroughs have narrowed the unsolved cases to the hardest parameters.
Take a number, square it, add a constant, and repeat. The Mandelbrot set, generated by this rule, fits on a napkin: f(z) = z² + c. Yet for more than 40 years, the fractal it produces has resisted one of the most stubborn conjectures in mathematics.
The set became famous as a screensaver, an icon of 1980s chaos theory that seemed to promise infinite complexity for free. Scientific American put it on its cover in August 1985. Posters appeared in dorm rooms.
The image traveled so far from its origins that most people forgot it was an open mathematical problem.
The problem remains open.
How the Mandelbrot Set Equation Maps Infinity
The set works like a cartographer's index. Each point on the complex plane represents a different value of c. Plug that c into f(z) = z² + c, start from zero, and iterate. If the sequence stays bounded, the point belongs to the set. If it escapes to infinity, the point lies outside.
The boundary between those two fates is extraordinarily complicated. Mitsuhiro Shishikura, a mathematician at Kyoto University, proved in 1998 that it has Hausdorff dimension 2. That makes it as complicated as a filled region, despite being a curve.
The Mandelbrot set also serves as an atlas of Julia sets, the related fractals generated by fixing c and varying the starting value. Points inside correspond to connected Julia sets. Points outside produce disconnected clouds of dust.
What is the MLC conjecture?
The Mandelbrot Locally Connected (MLC) conjecture proposes that every point on the set's boundary has arbitrarily small connected neighborhoods within the set. If true, it would give mathematicians a complete combinatorial model of the set's structure, despite the boundary's visual extravagance.
A Century-Long Siege
The story begins long before computers. Pierre Fatou and Gaston Julia, two French mathematicians, began studying iterated functions in the 1910s. A prize from the French Academy, announced in 1915 and worth 3,000 francs, catalyzed their early work on complex dynamics.
The first rough computer image appeared in a 1978 paper by Robert Brooks and J. Peter Matelski. Benoit Mandelbrot at IBM, with access to far greater computing power, independently produced high-resolution images and brought the set to public attention.
James Gleick captured the cultural moment in Chaos, his 1987 bestseller. The set, he wrote, "held a universe of ideas...a way of bringing complex systems before a large public."
By the mid-1980s, a conjecture had crystallized. If the Mandelbrot set is locally connected, its boundary, however visually wild, is fully classifiable. Proving MLC became the central open problem in complex dynamics.
Key figure
40+ years
How long the MLC conjecture has been open
Bounty Hunters at the Boundary
Jean-Christophe Yoccoz, the French Fields Medalist, proved the conjecture holds for all finitely renormalizable parameters. These are points where the set's self-similar copies appear in limited, countable layers.
That was a major advance. The remaining territory is harder.
At infinitely renormalizable points, such as the Feigenbaum point, miniature copies of the entire set nest inside each other at every scale. It is an endless recursion that defies the techniques Yoccoz used.
A small group of mathematicians has spent decades on exactly this problem. Misha Lyubich at Stony Brook University, widely regarded as the foremost expert on the set, has collaborated with Dzmitry Dudko, also at Stony Brook, and Jeremy Kahn at Brown University.
Their renormalization methods have resolved previously inaccessible classes of parameters.
Caroline Davis, a mathematician at Indiana University, described the pursuit with characteristic directness. "Misha and Dima and Jeremy and Alex are like bounty hunters," she said, "trying to track down these last ones."
"Misha and Dima and Jeremy and Alex are like bounty hunters, trying to track down these last ones."
Caroline Davis, Indiana University
The Last Locked Door
In October 2023, roughly twenty mathematicians gathered at a workshop in Denmark to take stock of MLC progress. Among them were Sabyasachi Mukherjee from the Tata Institute, Arnaud Cheritat from the University of Toulouse, and Carsten Petersen from Roskilde University.
The mood, by accounts from participants, was cautiously optimistic. Many parameter classes once thought intractable now satisfy local connectivity, thanks to renormalization advances.
The remaining gap is narrow but fiercely resistant.
More Mathematics
SAT Solvers Turn Math Problems Into Puzzles Machines Can Crack
A computer scientist uses simple true-false logic to solve problems that stumped mathematicians for decades.
→In December 2025, Dudko published a survey paper scheduled for the Proceedings of the International Congress of Mathematicians 2026. An ICM invitation suggests the broader mathematical community considers MLC progress significant enough to warrant a global stage.
Whether current methods can reach the finish line remains genuinely uncertain. The Feigenbaum-type parameters are the hardest case. No one has claimed to have solved them.
John Hubbard, the Cornell mathematician who was among the first to study the set in depth, saw stakes beyond pure mathematics. "It is therefore a real message of hope," he said in 1989, "that possibly biology can really be understood in the same way."
The equation is still z² + c. The question is whether that simple rule, iterated, can ever be fully tamed. A handful of mathematicians believe they are close.
The boundary, as always, is where the interesting things happen.
Sources
- Primary Research:
- Decoding Math's Famed Fractal: The Mandelbrot Set (Quanta Magazine, YouTube)
- The Quest to Decode the Mandelbrot Set, Math's Famed Fractal (Quanta Magazine, 2024)
- Additional Context:
- On the MLC Conjecture and the Renormalization Theory in Complex Dynamics (Dudko, arXiv, 2025)
- Mandelbrot set (Wikipedia)
Fact Check: Claim-by-Claim Verification Verified
All 18 claims verified. Key facts confirmed: Shishikura's 1998 Hausdorff dimension proof, Brooks-Matelski 1978 first computer image, Yoccoz's finitely renormalizable result, and Dudko's ICM 2026 survey paper. MLC explainer box was corrected during check for precision on local connectivity vs global connectedness.
Sources used for verification
- Shishikura 1998 - annals.math.princeton.edu
- Dudko 2025, ICM survey - arxiv.org
- Quanta Magazine 2024 - quantamagazine.org
- Mandelbrot set - wikipedia.org
- Brooks-Matelski 1978 - math.harvard.edu
