OpenFrontiers
← Back to the index
OP-12084OpenAnalysis

Sendov radius constant (C69C_{69})

Sendov radius constant: determine C69C_{69} or improve its bounds; the repository records 1 (lower) and 2 (upper).

Editorial MSC2020 classification. Original article codes and source evidence are recorded in the literature directory.

Licensed source statementAs of Repository table at commit 2c1968c (2026-09-26); open while the recorded lower and upper bounds differSource & evidence ↓

Problem statement

Let f:C→Cf:\mathbb{C}\to\mathbb{C} be a polynomial of degree n≥2n\ge 2 whose zeroes all lie in the closed unit disk D(0,1)={z:∣z∣≤1}D(0,1)=\{z:\lvert z\rvert\le 1\}. Sendov's conjecture states that if λ0\lambda_0 is one of these zeroes, then f′f' has at least one zero in D(λ0,1)D(\lambda_0,1).

every zero λ0 of f has a critical point in D(λ0,1).\text{every zero }\lambda_0\text{ of }f\text{ has a critical point in }D(\lambda_0,1).

[Tao2022-sendov-statement]

We define the Sendov radius constant by

C69 := inf⁡{R>0: for all n≥2, all degree-n polynomials f with zeroes in D(0,1),and all zeroes λ0 of f, there exists a zero of f′ in D(λ0,R)}.C_{69}\ :=\ \inf\left\{R>0:\ \begin{array}{l} \text{for all }n\ge 2,\ \text{all degree-}n\text{ polynomials }f\text{ with zeroes in }D(0,1),\\ \text{and all zeroes }\lambda_0\text{ of }f,\ \text{there exists a zero of }f'\text{ in }D(\lambda_0,R) \end{array}\right\}.

With this definition, Sendov's conjecture is equivalent to C69≤1C_{69}\le 1. [Tao2022-sendov-statement]

A standard example gives C69≥1C_{69}\ge 1: take f(z)=zn−1f(z)=z^n-1 and λ0=1\lambda_0=1, for which the zeroes of f′f' are at the origin and lie on ∂D(λ0,1)\partial D(\lambda_0,1). [Tao2022-example-zn1]

A trivial geometric bound gives C69≤2C_{69}\le 2 (all zeroes of ff and f′f' lie in D(0,1)D(0,1)).

Hence the best established range currently is

1 ≤ C69 ≤ 2.1\ \le\ C_{69}\ \le\ 2.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

References (from the repository page)

  • [Tao2022] Tao, Terence. Sendov’s conjecture for sufficiently-high-degree polynomials. Acta Mathematica 229 (2022), no. 2, 347-392 (December 2022). DOI: https://doi.org/10.4310/ACTA.2022.v229.n2.a3. Publisher page: https://projecteuclid.org/journals/acta-mathematica/volume-229/issue-2/Sendovs-conjecture-for-sufficiently-high-degree-polynomials/10.4310/ACTA.2022.v229.n2.a3.full. arXiv PDF: https://arxiv.org/pdf/2012.04125.pdf. Google Scholar

  • [Tao2022-sendov-statement] loc: arXiv PDF p.1, Conjecture 1.1 quote: "Conjecture 1.1 (Sendov’s conjecture). Let f:C→Cf:\mathbb{C}\to\mathbb{C} be a polynomial of degree n≥2n\ge 2 that has all zeroes in the closed unit disk D(0,1)D(0,1). If λ0\lambda_0 is one of these zeroes, then f′f' has at least one zero in D(λ0,1)D(\lambda_0,1)."

  • [Tao2022-surveys] loc: arXiv PDF p.1, Introduction paragraph after Conjecture 1.1 quote: "There is a long history of partial results towards this conjecture; see for instance [17], [23], [24], [20], [25] for some surveys of results."

  • [Tao2022-known-n-less-9] loc: arXiv PDF p.1, Introduction paragraph after Conjecture 1.1 quote: "The conjecture is known for low degrees, and specifically for all n<9n<9 [1]."

  • [Tao2022-high-degree] loc: arXiv PDF p.2, Theorem 1.2 quote: "Sendov’s conjecture is true for all sufficiently large nn. That is, there exists an absolute constant n0n_0 such that Sendov’s conjecture holds for n≥n0n\ge n_0."

  • [Tao2022-example-zn1] loc: arXiv PDF p.3, Example 1.4 quote: "For each n∈Nn\in\mathbb{N}, set f(z):=zn−1f(z):=z^n-1, and a:=1a:=1. Then all the zeroes of ff lie in D(0,1)D(0,1), and f′f' just barely has zeroes in D(a,1)D(a,1) since the zeroes are all at the origin which lies on the boundary circle ∂D(a,1)\partial D(a,1)."

  • [Tao2022-near-unit-circle-history] loc: arXiv PDF p.1, Abstract quote: "for λ0\lambda_0 near the unit circle we refine a previous argument of Miller (and also invoke results of Chijiwa when λ0\lambda_0 is extremely close to the unit circle)"

  • [BrownXiang1999] Brown, J. E.; Xiang, G. Proof of the Sendov conjecture for polynomials of degree at most eight. Journal of Mathematical Analysis and Applications 232 (1999), 272-292. Google Scholar

  • [Miller1993] Miller, M. J. On Sendov's conjecture for roots near the unit circle. Journal of Mathematical Analysis and Applications 175 (1993), no. 2, 632-639. Google Scholar

  • [Chijiwa2011] Chijiwa, T. A quantitative result on Sendov's conjecture for a zero near the unit circle. Hiroshima Mathematical Journal 41 (2011), no. 2, 23-273. DOI: https://doi.org/10.32917/hmj/1314204564. Publisher page: https://projecteuclid.org/journals/hiroshima-mathematical-journal/volume-41/issue-2/A-quantitative-result-on-Sendovs-conjecture-for-a-zero-near/10.32917/hmj/1314204564.full. Google Scholar

Progress & source assessment

Repository table (commit 2c1968c, 26 September 2026): best known lower bound 1; best known upper bound 2. Values marked with an asterisk have minimal verification.

Known upper bounds

Bound Reference Comments
22 Trivial geometric bound since all zeroes of ff and f′f' lie in the closed unit disk.

Known lower bounds

Bound Reference Comments
11 [Tao2022] Example f(z)=zn−1f(z)=z^n-1, λ0=1\lambda_0=1: the critical points are at 00 and lie on ∂D(λ0,1)\partial D(\lambda_0,1). [Tao2022-example-zn1]
References
  1. [1]Davis, Damek; Ivanisvili, Paata; Tao, Terence (maintainers). Optimization Constants in Mathematics, github.com/teorth/optimizationproblems (commit 2c1968c, 26 September 2026). — Sendov radius constant ($C_{69}$) linkApache-2.0 (repository license); constant pages reproduced with attribution; repository references retained.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.