Sendov's conjecture
Let be an integer and let
be a monic polynomial all of whose roots lie in the closed unit disk, i.e. for every . Since , the derivative has at least one zero in .
Then for every there exists with
that is, for each root of the closed disk contains a critical point of .
Equivalent formulations
In mathematics, Sendov's conjecture, sometimes also called Ilieff's conjecture, concerns the relationship between the locations of roots and critical points of a polynomial function of a complex variable. It is named after Blagovest Sendov.
source: Wikipedia
Let
where for all . Sendov's conjecture. For every root of , there is a root of such that
The source says this conjecture has been open since 1959 and also calls it Ilyeff's conjecture; it gives no resolution.
source: K. M. R. Audenaert and F. Kittaneh, “Problems and Conjectures in Matrix and Operator Inequalities”, arXiv:1201.5232 (2012).
Let be a circulant matrix with , let be an eigenvalue of , and let be the principal submatrix obtained by deleting the first row and first column. Circulant formulation of Sendov's conjecture. The matrix has an eigenvalue in the closed unit disk. This is presented as a third formulation of Sendov's conjecture, whose original polynomial statement is described as open in the source.
source: K. M. R. Audenaert and F. Kittaneh, “Problems and Conjectures in Matrix and Operator Inequalities”, arXiv:1201.5232 (2012).
Let belong to the closed unit disk, let , and let and be respectively the identity matrix and the all-ones matrix of order . D-companion formulation of Sendov's conjecture. The matrix
has an eigenvalue in the closed unit disk. This is presented as a reformulation of Sendov's conjecture; the source gives no resolution beyond stating Sendov's problem as open.
source: K. M. R. Audenaert and F. Kittaneh, “Problems and Conjectures in Matrix and Operator Inequalities”, arXiv:1201.5232 (2012).
Let be a polynomial of degree . Let be the zeros of satisfying , and let be a tuple representation of . For each , let denote the identity element used in the expansivity construction. Sendov's conjecture. For each , there exists some such that
This is the expansivity formulation of the classical assertion that every zero in the unit disk lies within unit distance of a zero of the derivative. The paper reports partial variants and known degree-specific and asymptotic results, but the conjecture itself is presented as the central problem.
source: Theophilus Agama, “Expansivity theory and Sendov's conjecture”, arXiv:1907.12825 (2026).
References
- B. Sendov, in Research Problems in Function Theory (W. K. Hayman, ed.), Athlone Press (1967), problem 4.5.
- T. Tao, "Sendov's conjecture for sufficiently high degree polynomials," Acta Mathematica 229 (2022), 347-392.
- G. Schmeisser, "The conjectures of Sendov and Smale," in Approximation Theory, DARBA (2002), 353-369.
- Wikipedia, Sendov's conjecture, the article this problem comes from.
Source: Wikipedia
Progress summary
A machine-checked proof now appears to settle the conjecture in every degree, although the underlying argument has not yet been independently published.
Sendov’s conjecture asserts that every zero of a polynomial whose zeros lie in the unit disk has a zero of its derivative within distance one.
Known results
- Degree : proved by Brown and Xiang, with Xiang’s result dated 1999.
- Arbitrary degree with at most eight distinct zeros: proved by Brown.
- Sufficiently large degree: proved by Tao; the bound is effective but not the exact threshold .
- Further special cases include all-real zeros and zeros on the unit circle.
On August 12, 2026, Tao reported that Lech Mazur’s AI-assisted argument resolves the conjecture for all .
Solutions 0
No solutions have been posted yet.