A quantitative Gauss-Lucas theorem (Q2143066)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A quantitative Gauss-Lucas theorem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A quantitative Gauss-Lucas theorem |
scientific article |
Statements
A quantitative Gauss-Lucas theorem (English)
0 references
30 May 2022
0 references
Let \(K\) be a convex subset of the complex plane and let \(K_{\varepsilon}\) be the \(\varepsilon\)-neighborhood of \(K\). For a degree-\(n\) polynomial \(P_n\), the Gauss-Lucas theorem states that if \(P_n\) has all zeros in \(K\) then the same is true for the zeros of the derivative \(P_n'\). In this paper, the following quantitative version of this classical result is proven: For any \(\varepsilon>0\), there is an \(\alpha_{\varepsilon}<1\) such that if \(P_n\) has \(k\geq\alpha_{\varepsilon}n\) zeros in \(K\) then \(P_n'\) has at least \(k-1\) zeros in \(K_{\varepsilon}\). The second main result consist in quantitative bounds for \(\alpha_{\varepsilon}\) in terms of \(\varepsilon\).
0 references
polynomials
0 references
zeros
0 references
critical points
0 references
Gauss-Lucas theorem
0 references
0.8622184991836548
0 references
0.8497087955474854
0 references
0.8467381000518799
0 references
0.8226389288902283
0 references