We build on verified interval arithmetic and verified holomorphic dynamics results for verified rendering of the Mandelbrot set and its potential function. For now, all we have is potential function renders such as
The semantics of this render are that the color of each pixel is off by at most one in each coordinate, except for red pixels which can have arbitrary error. And there are only a few of those!
We also use the Koebe quarter theorem for verified upper bounds on the area of
the Mandelbrot set, following Fisher and Hill 1993. With d = 12 we get
in 99 minutes. This is of course very far from SOTA: Fisher and Hill get 1.57012937,
and Thorsten Förstemann
used similar methods to depth 26 to get
- Install
elan(brew install elan-initon Mac) lake build
I'm going to keep a list here, since otherwise I will forget them.
-- Tracing options
set_option trace.aesop true in
-- Print compiler IR, such as to see how well inlining worked:
set_option trace.compiler.ir.result true in
def ...
