A Stability Version of the Gauss-Lucas Theorem and Applications
Stefan Steinerberger

TL;DR
This paper presents a stability version of the Gauss-Lucas theorem, showing how the roots and critical points of a polynomial relate when roots are inside or outside the unit disk, with sharp constants and applications.
Contribution
It introduces a stability version of the Gauss-Lucas theorem with explicit bounds and sharp constants, extending classical results to polynomials with roots outside the unit disk.
Findings
Critical points remain close to roots outside the disk under certain conditions.
The number of roots inside the disk decreases by one for the derivative.
Roots outside the disk are at least a certain distance from the origin.
Abstract
Let be a polynomial. The Gauss-Lucas theorem states that its critical points, , are contained in the convex hull of its roots. We prove a stability version whose simplest form is as follows: suppose has roots where are inside the unit disk, \max_{1 \leq i \leq n}{|a_i|} \leq 1, \quad \mbox{and $m$ are outside} \quad \min_{n+1 \leq i \leq n+m}{ |a_i|} \geq d > 1 + \frac{2 m}{n}, then has roots inside the unit disk and roots at distance at least from the origin and the involved constants are sharp. We also discuss a pairing result: in the setting above, for sufficiently large each of the roots has a critical point at distance .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
