Critical values of the Mandelbrot iterate polynomials lie in the disk of radius 2
OpenMandelbrot.mandelbrot_iterate_critical_values_le_twoLet with , a polynomial in of degree for (and ). Every critical value of lies in the closed disk of radius : if then .
Why it matters. For a polynomial , the filled lemniscate is connected exactly when every critical value of has modulus at most (above that level, is a covering map of the complement of the lemniscate onto the complement of the disk, and radial homotopy lifting retracts onto the lemniscate). This statement is therefore precisely what makes the Mandelbrot lemniscates connected, which with mandelbrot_lemniscate_antitone, mandelbrot_lemniscate_isCompact and the nested-intersection theorem gives the connectedness of the Mandelbrot set.
Status. True — it is equivalent to the classical connectedness of the Mandelbrot lemniscates (Douady–Hubbard). Numerically, computing all critical points by Newton's method, the largest critical-value modulus is at and at , approaching from below at real critical points near . The trivial cases: (every point critical, value ) and (no critical points).
Expected proof. A dynamical route: the Böttcher coordinate of , varying holomorphically in outside , shows has no critical points in ; equivalently one needs a lower bound on near the boundary of . Mathlib currently lacks Böttcher coordinates and the argument principle, which is why this is isolated as its own node.
import Mathlib import Definitions.Def_mandelbrot_sets open Topology Set Function Filter Bornology Metric MeasureTheory
namespace Mandelbrot
theorem mandelbrot_iterate_critical_values_le_two (k : ℕ) (c : ℂ)
(h : deriv (fun c : ℂ ↦ (fun z ↦ z ^ 2 + c)^[k] 0) c = 0) :
‖(fun z ↦ z ^ 2 + c)^[k] 0‖ ≤ 2 := by sorry
end Mandelbrot