Reading source record arxiv-2012.04125v2. View default cited record →
Sendov’s conjecture for all sufficiently large degree, with the low-degree history.
Acta Mathematica 229 (2022), 347–392, DOI 10.4310/acta.2022.v229.n2.a3 checked against Crossref; arXiv v2 pinned by content hash.
The exact passages cited in OpenMath. Each passage identifies how its wording was recorded.
Tao proves that there is an absolute constant n₀ such that Sendov’s conjecture holds for every degree n ≥ n₀; the compactness argument gives no explicit n₀.
Passage ID: sendov-conjecture:entry:tao-large:v1
Source item: theorem-1.2
Source record: sendov-conjecture:source:tao-large:v1
The introduction records that the conjecture is known for all n < 9, citing Brown and Xiang’s proof for polynomials of degree at most eight.
Passage ID: sendov-conjecture:entry:tao-small:v1
Source item: introduction-low-degree
Source record: sendov-conjecture:source:tao-large:v1
Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.
Problem publication v8
Source assessment
Proved
Sendov for n ≥ n₀
Only the exact statement and passage cited here; not an independent OpenMath assessment.
Observed Oct 21, 2026
Source assessment
Proved
Known for n < 9
Only the exact statement and passage cited here; not an independent OpenMath assessment.
Observed Oct 21, 2026
Question
Sendov’s conjecture
Recorded authorship
Terence Tao
No AI contribution is asserted by this source record.
OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.
Sendov’s conjecture for sufficiently high degree polynomials
OpenMath supplies original paraphrases and links; no proof text is republished.
Source terms ↗