A Stability Version of the Gauss-Lucas Theorem and Applications
Abstract
Let p:C → C be a polynomial. The Gauss-Lucas theorem states that its critical points, p'(z) = 0, are contained in the convex hull of its roots. We prove a stability version whose simplest form is as follows: suppose p has n+m roots where n are inside the unit disk, 1 ≤ i ≤ n|ai| ≤ 1, and m are outside n+1 ≤ i ≤ n+m |ai| ≥ d > 1 + 2 mn, then p' has n-1 roots inside the unit disk and m roots at distance at least (dn - m)/(n+m) > 1 from the origin and the involved constants are sharp. We also discuss a pairing result: in the setting above, for n sufficiently large each of the m roots has a critical point at distance n-1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.