Sendov’s conjecture for sufficiently high degree polynomials
What's new 2020-12-09
I’ve just uploaded to the arXiv my paper “Sendov’s conjecture for sufficiently high degree polynomials“. This paper is a contribution to an old conjecture of Sendov on the zeroes of polynomials:
Conjecture 1 (Sendov’s conjecture) Letbe a polynomial of degree
that has all zeroes in the closed unit disk
. If
is one of these zeroes, then
has at least one zero in
.
It is common in the literature on this problem to normalise to be monic, and to rotate the zero
to be an element
of the unit interval
. As it turns out, the location of
on this unit interval
ends up playing an important role in the arguments.
Many cases of this conjecture are already known, for instance
- When
(Brown-Xiang 1999);
- When
(Gauss-Lucas theorem);
- When
(Bojanov 2011);
- When
for a fixed
, and
is sufficiently large depending on
(Dégot 2014);
- When
for a sufficiently large absolute constant
(Chalebgwa 2020);
- When
(Rubinstein 1968; Goodman-Rahman-Ratti 1969; Joyal 1969);
- When
, where
is sufficiently small depending on
(Miller 1993; Vajaitu-Zaharescu 1993);
- When
(Chijiwa 2011);
- When
(Kasmalkar 2014).
In particular, in high degrees the only cases left uncovered by prior results are when is close (but not too close) to
, or when
is close (but not too close) to
; see Figure 1 of my paper.
Our main result covers the high degree case uniformly for all values of :
Theorem 2 There exists an absolute constantsuch that Sendov’s conjecture holds for all
.
In principle, this reduces the verification of Sendov’s conjecture to a finite time computation, although our arguments use compactness methods and thus do not easily provide an explicit value of . I believe that the compactness arguments can be replaced with quantitative substitutes that provide an explicit
, but the value of
produced is likely to be extremely large (certainly much larger than
).
Because of the previous results (particularly those of Chalebgwa and Chijiwa), we will only need to establish the following two subcases of the above theorem:
Theorem 3 (Sendov’s conjecture near the origin) Under the additional hypothesis, Sendov’s conjecture holds for sufficiently large
.
Theorem 4 (Sendov’s conjecture near the unit circle) Under the additional hypothesisfor a fixed
, Sendov’s conjecture holds for sufficiently large
.
We approach these theorems using the “compactness and contradiction” strategy, assuming that there is a sequence of counterexamples whose degrees going to infinity, using various compactness theorems to extract various asymptotic objects in the limit
, and somehow using these objects to derive a contradiction. There are many ways to effect such a strategy; we will use a formalism that I call “cheap nonstandard analysis” and which is common in the PDE literature, in which one repeatedly passes to subsequences as necessary whenever one invokes a compactness theorem to create a limit object. However, the particular choice of asymptotic formalism one selects is not of essential importance for the arguments.
I also found it useful to use the language of probability theory. Given a putative counterexample to Sendov’s conjecture, let
be a zero of
(chosen uniformly at random among the
zeroes of
, counting multiplicity), and let
similarly be a uniformly random zero of
. We introduce the logarithmic potentials
Theorem 5
- (i) If
, then
almost surely lie in the semicircle
and have the same distribution.
- (ii) If
, then
is uniformly distributed on the circle
, and
is almost surely zero.
In case (i) (and strengthening the hypothesis to
to control some technical contributions of “outlier” zeroes of
), we can use this information about
and (4) to ensure that the normalised logarithmic derivative
has a non-negative winding number in a certain small (but not too small) circle around the origin, which by the argument principle is inconsistent with the hypothesis that
has a zero at
and that
has no zeroes near
. This is how we establish Theorem 3.
Case (ii) turns out to be more delicate. This is because there are a number of “near-counterexamples” to Sendov’s conjecture that are compatible with the hypotheses and conclusion of case (ii). The simplest such example is , where the zeroes
of
are uniformly distributed amongst the
roots of unity (including at
), and the zeroes of
are all located at the origin. In my paper I also discuss a variant of this construction, in which
has zeroes mostly near the origin, but also acquires a bounded number of zeroes at various locations
inside the unit disk. Specifically, we take