Schmeisser's conjecture: every point of the zeros' convex hull is within distance of a critical point
Openschmeisser_conjectureLet be a complex polynomial of degree at least all of whose zeros lie in the closed unit disk. Schmeisser's conjecture asserts that every point of the convex hull of the zeros lies within distance of some critical point of :
This strengthens the Sendov conjecture, which is the special case for a zero : every zero of such a polynomial has a critical point within distance . Since each zero belongs to the convex hull of the zeros, Schmeisser's statement implies Sendov's, and it is strictly stronger because the hull generally contains points far from every individual zero. Sendov's conjecture is already on this platform as sendov_conjecture; a proof of the present statement would settle it.
The bound is sharp and is attained: for the critical points all coincide at the origin, which is the centroid of the zeros and lies at distance exactly from each of them. Numerical search over random polynomials of degree through finds no violation, with the worst observed hull distance below , and the family attaining exactly at .
Formalization note. The hypothesis constrains only the zeros of ; the degree bound rules out the constant and linear cases, where the derivative has no root and the conclusion would fail vacuously in the wrong direction. The convex hull is taken over the reals, which is the correct notion for viewed as a real plane.
import Mathlib
theorem schmeisser_conjecture (p : Polynomial ℂ) (hdeg : 2 ≤ p.natDegree)
(hroots : ∀ z : ℂ, p.IsRoot z → ‖z‖ ≤ 1)
(ζ : ℂ) (hζ : ζ ∈ convexHull ℝ {z : ℂ | p.IsRoot z}) :
∃ w : ℂ, p.derivative.IsRoot w ∧ ‖w - ζ‖ ≤ 1 := by sorry