{"schema_version":"claim-reader-v1","record":{"available_versions":[1],"current_version":1,"assessment_summary":"consistent","claim":{"statement":"For every polynomial p of degree n with 2 ≤ n ≤ 8 whose zeros all satisfy |z| ≤ 1, each zero a has a critical point ζ with |ζ − a| ≤ 1.","id":"claim-sendov-low-degree","slug":"sendov-low-degree","version":1,"kind":"theorem","title":"Sendov for degree at most eight","assumptions":["Complex polynomials of degree 2 to 8 with all zeros in the closed unit disk."],"scope":"The low-degree cases, settled before the general proof.","source_entry_ids":["sendov-conjecture:entry:tao-small:v1"],"formal_declarations":[]},"sha256":"adb307b4116e91800ed3a27cf605798ae2dcaa3fbe0e926891eab6a7bb602c47","contexts":[{"assessment_history":[{"report_id":"sendov-conjecture:report:low-degree:v1","source_id":"sendov-tao-large-degree","source_version_id":"sendov-conjecture:source:tao-large:v1","source_title":"Sendov’s conjecture for sufficiently high degree polynomials","source_label":"Known for n < 9","state":"resolved","scope":"Only the exact statement and passage cited here; not an independent OpenMath assessment.","observed_on":"2026-10-21","evidence_url":"https://arxiv.org/abs/2012.04125v2","entry_id":"sendov-conjecture:entry:tao-small:v1"}],"problem_id":"problem-sendov-conjecture","slug":"sendov-conjecture","title":"Sendov’s conjecture","publication_version":8,"relationship":{"claim":{"id":"claim-sendov-low-degree","version":1},"relation":"special_case","relationship_note":"A range of degrees proved before the full statement.","result":"proved","report_ids":["sendov-conjecture:report:low-degree:v1"],"independent_review":"pending"},"assessments":[{"report_id":"sendov-conjecture:report:low-degree:v1","source_id":"sendov-tao-large-degree","source_version_id":"sendov-conjecture:source:tao-large:v1","source_title":"Sendov’s conjecture for sufficiently high degree polynomials","source_label":"Known for n < 9","state":"resolved","scope":"Only the exact statement and passage cited here; not an independent OpenMath assessment.","observed_on":"2026-10-21","evidence_url":"https://arxiv.org/abs/2012.04125v2","entry_id":"sendov-conjecture:entry:tao-small:v1"}],"connections":[],"related_claims":[],"progress":[],"tasks":[],"statements":[{"statement":"For every polynomial p of degree n with 2 ≤ n ≤ 8 whose zeros all satisfy |z| ≤ 1, each zero a has a critical point ζ with |ζ − a| ≤ 1.","id":"claim-sendov-low-degree","slug":"sendov-low-degree","version":1,"kind":"theorem","title":"Sendov for degree at most eight","assumptions":["Complex polynomials of degree 2 to 8 with all zeros in the closed unit disk."],"scope":"The low-degree cases, settled before the general proof.","source_entry_ids":["sendov-conjecture:entry:tao-small:v1"],"formal_declarations":[],"relation":"special_case","relationship_note":"A range of degrees proved before the full statement.","result":"proved","report_ids":["sendov-conjecture:report:low-degree:v1"],"independent_review":"pending","credit":{"name":"Brown & Xiang","year":"1999","entry_id":"sendov-conjecture:entry:tao-small:v1"}}],"entries":[{"id":"sendov-conjecture:entry:tao-small:v1","source_version_id":"sendov-conjecture:source:tao-large:v1","item_id":"introduction-low-degree","url":"https://arxiv.org/abs/2012.04125v2","wording":"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.","wording_kind":"paraphrase","locator":"§1, before Theorem 1.2; reference [1]","supersedes":null}],"sources":[{"work":{"authors":["Terence Tao"],"kind":"research_paper","publication":"published","publication_note":"Acta Mathematica 229 (2022), 347–392, DOI 10.4310/acta.2022.v229.n2.a3 checked against Crossref; arXiv v2 pinned by content hash.","ai_role":"not_reported","ai_note":"No AI contribution is asserted by this source record.","artifacts":[],"published":{"value":"2022"}},"id":"sendov-conjecture:source:tao-large:v1","source_id":"sendov-tao-large-degree","title":"Sendov’s conjecture for sufficiently high degree polynomials","owner":"Terence Tao","url":"https://arxiv.org/abs/2012.04125v2","subject_scope":"Sendov’s conjecture for all sufficiently large degree, with the low-degree history.","revision":"arxiv-2012.04125v2","content_sha256":"d177cb5218a7e06ceea374d5e04fa8e39332c666ca832a4102b2dff2c570687e","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-21","source_updated_on":"2026-08-12","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://arxiv.org/abs/2012.04125v2","attribution":"Terence Tao","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}]}],"assessments":[{"report_id":"sendov-conjecture:report:low-degree:v1","source_id":"sendov-tao-large-degree","source_version_id":"sendov-conjecture:source:tao-large:v1","source_title":"Sendov’s conjecture for sufficiently high degree polynomials","source_label":"Known for n < 9","state":"resolved","scope":"Only the exact statement and passage cited here; not an independent OpenMath assessment.","observed_on":"2026-10-21","evidence_url":"https://arxiv.org/abs/2012.04125v2","entry_id":"sendov-conjecture:entry:tao-small:v1"}],"sources":[{"work":{"authors":["Terence Tao"],"kind":"research_paper","publication":"published","publication_note":"Acta Mathematica 229 (2022), 347–392, DOI 10.4310/acta.2022.v229.n2.a3 checked against Crossref; arXiv v2 pinned by content hash.","ai_role":"not_reported","ai_note":"No AI contribution is asserted by this source record.","artifacts":[],"published":{"value":"2022"}},"id":"sendov-conjecture:source:tao-large:v1","source_id":"sendov-tao-large-degree","title":"Sendov’s conjecture for sufficiently high degree polynomials","owner":"Terence Tao","url":"https://arxiv.org/abs/2012.04125v2","subject_scope":"Sendov’s conjecture for all sufficiently large degree, with the low-degree history.","revision":"arxiv-2012.04125v2","content_sha256":"d177cb5218a7e06ceea374d5e04fa8e39332c666ca832a4102b2dff2c570687e","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-21","source_updated_on":"2026-08-12","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://arxiv.org/abs/2012.04125v2","attribution":"Terence Tao","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}],"entries":[{"id":"sendov-conjecture:entry:tao-small:v1","source_version_id":"sendov-conjecture:source:tao-large:v1","item_id":"introduction-low-degree","url":"https://arxiv.org/abs/2012.04125v2","wording":"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.","wording_kind":"paraphrase","locator":"§1, before Theorem 1.2; reference [1]","supersedes":null}],"formalizations":[],"tasks":[],"assessment_state":"proved","publication":{"version":8,"sha256":"cbab05d697e91642cbd2247551f0cc3717f0aff142f2c9d0dcbd28dd8604069a","published_at":"2026-10-21T09:05:31.711373+00:00","reason":"Reviewed reader correction: preserve assertion history, exact citations and scoped assessments; task evidence names its exact Claim target.","withdrawn":false,"draft":{"reader_guide":{"reading":[{"entry_id":"sendov-conjecture:entry:digestion:v1","role":"introduction","note":"Read the setting and notation before comparing the results."},{"entry_id":"sendov-conjecture:entry:mazur:v1","role":"proof","note":"Read the mathematical argument; inspect its Claim for assessment and scope."},{"entry_id":"sendov-conjecture:entry:lean:v1","role":"formal_source","note":"Inspect the formal statement, assumptions and reported checks."}],"definitions":[{"id":"sendov-conjecture-definition","term":"Critical point","explanation":"A zero of the polynomial’s derivative. Sendov asks for one within distance one of each zero of the original polynomial.","source_entry_ids":["sendov-conjecture:entry:digestion:v1"]}],"proofs":[],"bounds":[],"witnesses":[],"contributors":{"summary":"Original direction and discovery: Lech Mazur with GPT-5.6 Pro. Mathematical digestion: Terence Tao with AI assistance. Second Lean development: Tao directing Claude Opus 5.","source_entry_ids":["sendov-conjecture:entry:mazur:v1","sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"]},"scopes":[{"id":"sendov-distance-one-scope-detail","claim":{"id":"claim-sendov-distance-one","version":2},"label":"A critical point within distance one","source_entry_ids":["sendov-conjecture:entry:mazur:v1","sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"facts":[{"label":"Distance","value":"At most one, for every root"},{"label":"Exceptions","value":"None under the stated polynomial hypotheses"}]},{"id":"sendov-phelps-rodriguez-scope-detail","claim":{"id":"claim-sendov-phelps-rodriguez","version":2},"label":"Strict distance and the equality exception","source_entry_ids":["sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"facts":[{"label":"Distance","value":"Strictly less than one"},{"label":"Exceptions","value":"A boundary root |a| = 1 with p(z) = c(zⁿ − aⁿ), c ≠ 0"}]},{"id":"sendov-sharp-radius-example-scope-detail","claim":{"id":"claim-sendov-sharp-radius-example","version":2},"label":"Why the radius one is sharp","source_entry_ids":["sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"facts":[{"label":"Distance","value":"Exactly one from a = 1 to ζ = 0"},{"label":"Polynomial","value":"p(z) = z³ − 1; p′(z) = 3z²"}]}]},"representations":[{"hash_profile":"rfc8785","schema_version":"visual-representation-v1","id":"sendov-by-degree","version":2,"subject":{"kind":"problem","id":"problem-sendov-conjecture","sha256":"7fdfab8e310d1b1573489456e2ee7efc765b16a0c6286752b9b372507fc51ee2"},"purpose":"setup","title":"Closing the gap in degree","caption":"Low degrees were settled by 1999 and all large degrees by Tao’s 2020 paper, but n₀ was not explicit, so the degrees in between stayed open until the 2026 proof covered every n.","description":"Columns are degrees: 2 to 8, 9 up to n₀, and n₀ onward. Each row is one result and the degrees it covers: Brown–Xiang for n ≤ 8; Tao for n ≥ n₀, with n₀ not explicit; and the 2026 proof for every n ≥ 2.","assumptions":["Complex polynomials of degree n ≥ 2 with all zeros in the closed unit disk.","A blank cell means that result does not cover those degrees."],"limitation":"The middle column is not a fixed range: Tao’s n₀ is not explicit, so before 2026 no finite computation was known to close the gap.","author":"OpenMath curation","authoring_method":"ai_assisted_curation","authored_on":"2026-10-21","independent_review":"pending","source_entry_ids":["sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1","sendov-conjecture:entry:mazur:v1","sendov-conjecture:entry:tao-large:v1","sendov-conjecture:entry:tao-small:v1"],"payload":{"kind":"tracks","column_heading":"Degree n","columns":[{"id":"low","label":"2–8"},{"id":"middle","label":"9 to n₀"},{"id":"high","label":"≥ n₀"}],"tracks":[{"id":"brown-xiang","label":"Brown–Xiang 1999"},{"id":"tao","label":"Tao 2020"},{"id":"full","label":"2026 proof"}],"cells":[{"id":"low","track":"brown-xiang","columns":["low"],"label":"Proved","outcome":"holds","claim":{"id":"claim-sendov-low-degree","version":1}},{"id":"large","track":"tao","columns":["high"],"label":"Proved","outcome":"holds","claim":{"id":"claim-sendov-large-degree","version":1}},{"id":"all","track":"full","columns":["low","middle","high"],"label":"Every degree","outcome":"holds","claim":{"id":"claim-sendov-distance-one","version":2}}]}},{"schema_version":"visual-representation-v1","id":"sendov-conjecture-setup","version":3,"subject":{"kind":"problem","id":"problem-sendov-conjecture","sha256":"7fdfab8e310d1b1573489456e2ee7efc765b16a0c6286752b9b372507fc51ee2"},"purpose":"setup","title":"A boundary example with distance exactly one","caption":"For p(z) = z³ − 1, all three roots lie on the unit circle. The derivative has its only zero at the centre, with multiplicity two.","description":"A unit circle contains the three cube roots of one on its boundary. The distinguished root a = 1 is connected to the centre ζ = 0 by a segment of length one.","assumptions":["Coordinates in the drawing are illustrative unless the caption specifies an exact example."],"limitation":"This exact example illustrates the equality exception. It does not prove the theorem for arbitrary polynomials.","author":"OpenMath source curation","authoring_method":"ai_assisted_curation","authored_on":"2026-10-13","independent_review":"pending","source_entry_ids":["sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1","sendov-conjecture:entry:mazur:v1"],"payload":{"kind":"diagram_schematic","marks":[{"x":230,"y":145,"id":"disk","kind":"circle","end":null,"radius":100,"text":null,"anchor":"middle","dashed":false},{"x":330,"y":145,"id":"root-a","kind":"point","end":null,"radius":null,"text":null,"anchor":"middle","dashed":false},{"x":180,"y":58,"id":"root-b","kind":"point","end":null,"radius":null,"text":null,"anchor":"middle","dashed":false},{"x":180,"y":232,"id":"root-c","kind":"point","end":null,"radius":null,"text":null,"anchor":"middle","dashed":false},{"x":230,"y":145,"id":"critical","kind":"point","end":null,"radius":null,"text":null,"anchor":"middle","dashed":false},{"x":230,"y":145,"id":"radius","kind":"segment","end":{"x":330,"y":145},"radius":null,"text":null,"anchor":"middle","dashed":false},{"x":230,"y":28,"id":"poly","kind":"label","end":null,"radius":null,"text":"p(z) = z³ − 1","anchor":"middle","dashed":false},{"x":366,"y":140,"id":"a","kind":"label","end":null,"radius":null,"text":"a = 1","anchor":"middle","dashed":false},{"x":225,"y":180,"id":"zero","kind":"label","end":null,"radius":null,"text":"ζ = 0","anchor":"middle","dashed":false},{"x":285,"y":138,"id":"distance","kind":"label","end":null,"radius":null,"text":"distance 1","anchor":"middle","dashed":false},{"x":230,"y":283,"id":"unit","kind":"label","end":null,"radius":null,"text":"All three roots: |z| = 1","anchor":"middle","dashed":false}],"features":[{"id":"sharp","label":"Equality only for c(zⁿ − aⁿ) (Phelps–Rodriguez)","claim":{"id":"claim-sendov-phelps-rodriguez","version":2},"binding":"assertion","mark_ids":["disk","root-a","root-b","root-c","critical","radius","poly","a","zero","distance","unit"]},{"id":"question","label":"Sendov’s distance-one statement","claim":{"id":"claim-sendov-distance-one","version":2},"binding":"scope","mark_ids":["disk","radius"]}],"legend":"All three roots lie on the unit circle; the derivative 3z² vanishes only at the centre."}},{"hash_profile":"rfc8785","schema_version":"visual-representation-v1","id":"sendov-zeros-explorer","version":1,"subject":{"kind":"problem","id":"problem-sendov-conjecture","sha256":"7fdfab8e310d1b1573489456e2ee7efc765b16a0c6286752b9b372507fc51ee2"},"purpose":"setup","title":"Move the zeros yourself","caption":"Drag the zeros of a polynomial anywhere in the unit disk. The crosses are the zeros of its derivative; the dashed circle of radius one around the selected zero always reaches one of them.","description":"p(z) is the monic polynomial with the zeros you place, all in the closed unit disk. Its critical points, the zeros of p′, are recomputed as you move a zero. The readout gives the distance from the selected zero to the nearest critical point, which Sendov’s statement says is at most one. The equality case z³ − 1 puts every zero at distance exactly one from the double critical point 0.","assumptions":["Monic polynomials of degree 2 to 8 with every zero in the closed unit disk.","Critical points are computed numerically in the browser (Durand–Kerner iteration)."],"limitation":"An illustration for the polynomial on screen only: it computes, it does not prove, and numerical roots can be inaccurate near repeated zeros. The theorem is the linked statement.","author":"OpenMath curation","authoring_method":"ai_assisted_curation","authored_on":"2026-10-21","independent_review":"pending","source_entry_ids":["sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1","sendov-conjecture:entry:mazur:v1"],"payload":{"kind":"zeros_explorer","zeros":[[0.8,0.3],[-0.4,0.7],[-0.6,-0.5],[0.2,-0.85],[0.1,0.1]],"claim":{"id":"claim-sendov-distance-one","version":2},"example_claim":{"id":"claim-sendov-sharp-radius-example","version":2},"example_zeros":[[1,0],[-0.5,0.866025403784439],[-0.5,-0.866025403784438]]}}],"visuals":[{"representation":{"id":"sendov-by-degree","version":2},"section":"question"},{"representation":{"id":"sendov-conjecture-setup","version":3},"section":"question"},{"representation":{"id":"sendov-zeros-explorer","version":1},"section":"question"}],"claim_relations":[{"claim":{"id":"claim-sendov-distance-one","version":2},"relation":"primary_formulation","relationship_note":"Full Sendov statement, including repeated roots and boundary roots.","result":"proved","report_ids":["sendov-conjecture:report:full:v1","sendov-conjecture:report:formal:v1"],"independent_review":"pending","credit":{"name":"Mazur","year":"2026","entry_id":"sendov-conjecture:entry:digestion:v1"}},{"claim":{"id":"claim-sendov-phelps-rodriguez","version":2},"relation":"related_variant","relationship_note":"The stronger Phelps–Rodriguez conclusion includes its precise exceptional family; it is not a second formulation of the same distance bound.","result":"proved","report_ids":["sendov-conjecture:report:full:v1","sendov-conjecture:report:formal:v1"],"independent_review":"pending","credit":{"name":"Mazur","year":"2026","entry_id":"sendov-conjecture:entry:digestion:v1"}},{"claim":{"id":"claim-sendov-sharp-radius-example","version":2},"relation":"supporting_result","relationship_note":"The boundary example prevents a uniform strict radius-one conclusion without exceptions.","result":"proved","report_ids":["sendov-conjecture:report:full:v1","sendov-conjecture:report:formal:v1"],"independent_review":"pending","reading":{"placement":"background","note":"The boundary example prevents a uniform strict radius-one conclusion without exceptions."}},{"claim":{"id":"claim-sendov-low-degree","version":1},"relation":"special_case","relationship_note":"A range of degrees proved before the full statement.","result":"proved","report_ids":["sendov-conjecture:report:low-degree:v1"],"independent_review":"pending","credit":{"name":"Brown & Xiang","year":"1999","entry_id":"sendov-conjecture:entry:tao-small:v1"}},{"claim":{"id":"claim-sendov-large-degree","version":1},"relation":"special_case","relationship_note":"A range of degrees proved before the full statement.","result":"proved","report_ids":["sendov-conjecture:report:large-degree:v1"],"independent_review":"pending"}],"milestones":[{"id":"sendov-conjecture-boundary","date":{"value":"1968"},"date_basis":"publication","category":"foundation","title":"Boundary case and equality classification","summary":"Rubinstein’s boundary-root theorem supplies the exceptional polynomial family.","limitation":"This historical result is credited in the exposition and is not attributed to the 2026 AI workflow.","claims":[{"id":"claim-sendov-phelps-rodriguez","version":2}],"source_entry_ids":["sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"independent_review":"pending"},{"id":"sendov-conjecture-earlier","date":null,"date_basis":"publication","category":"foundation","title":"Earlier partial results","summary":"The cited exposition records all degrees through eight and all sufficiently large degrees as already established.","limitation":"These results left an intermediate-degree gap; no exact degree threshold is supplied here.","claims":[{"id":"claim-sendov-distance-one","version":2}],"source_entry_ids":["sendov-conjecture:entry:digestion:v1"],"independent_review":"pending"},{"id":"sendov-conjecture-original","date":{"value":"2026-08-05"},"date_basis":"announcement","category":"proposal","title":"Mazur’s AI-assisted all-degree proof","summary":"Lech Mazur directed the original discovery and initial formalization with GPT-5.6 Pro.","limitation":"The original artifact and the later streamlined formalization are separate evidence.","claims":[{"id":"claim-sendov-distance-one","version":2}],"source_entry_ids":["sendov-conjecture:entry:mazur:v1"],"independent_review":"pending"},{"id":"sendov-conjecture-digestion","date":{"value":"2026-08-12"},"date_basis":"publication","category":"assessment","title":"A human-readable proof and sharper conclusion","summary":"Terence Tao’s mathematical digestion also yields the Phelps–Rodriguez equality classification.","limitation":"The argument descends from Mazur’s proof; exposition does not establish a new independent discovery.","claims":[{"id":"claim-sendov-distance-one","version":2},{"id":"claim-sendov-phelps-rodriguez","version":2}],"source_entry_ids":["sendov-conjecture:entry:digestion:v1"],"independent_review":"pending"},{"id":"sendov-conjecture-formal","date":{"value":"2026-08-19"},"date_basis":"formalization","category":"formalization","title":"A second, streamlined Lean formalization","summary":"The pinned teorth/sendov development exposes both full theorem endpoints.","limitation":"This is source-reported proof checking, not an OpenMath execution.","claims":[{"id":"claim-sendov-distance-one","version":2},{"id":"claim-sendov-phelps-rodriguez","version":2}],"source_entry_ids":["sendov-conjecture:entry:lean:v1"],"independent_review":"pending"}],"activities":[{"id":"sendov-conjecture-credits","title":"Discovery, exposition and formalization","kind":"formalization","source_entry_ids":["sendov-conjecture:entry:mazur:v1","sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"summary":"Mazur and GPT-5.6 Pro supplied the original result; Tao digested its mathematics and directed the second formalization, whose project credits Claude Opus 5.","limitation":"Two formalizations of a descended argument do not automatically constitute two independent mathematical proofs.","related_claim_ids":["claim-sendov-distance-one","claim-sendov-phelps-rodriguez"]}],"curation":{"checked_on":"2026-10-13","selection":"The canonical statement, selected results and public proof evidence, with historical and contribution context.","search_scope":"Selected primary manuscripts, theorem declarations and project provenance reviewed on 13 October 2026; this is not an exhaustive literature survey; Tao’s 2020 paper (Acta Math. 2022) for the low- and high-degree cases.","formal_status":"The full Sendov and Phelps–Rodriguez statements have pinned public Lean sources. Completion is reported by the project; OpenMath has not executed their builds.","ai_status":"Original direction and discovery: Lech Mazur with GPT-5.6 Pro. Mathematical digestion: Terence Tao with AI assistance. Second Lean development: Tao directing Claude Opus 5.","independent_review":"pending"},"schema_version":"research-record-v3","claims":[{"statement":"For every p ∈ ℂ[X] of degree n ≥ 2 whose zeros all satisfy |z| ≤ 1, and every a with p(a) = 0, there is ζ ∈ ℂ with p′(ζ) = 0 and |ζ − a| ≤ 1.","statement_notation":{"schema_version":"mathematical-text-v1","segments":[{"kind":"text","text":"For every "},{"kind":"math","text":"p ∈ ℂ[X]","latex":"p\\in\\mathbb C[X]"},{"kind":"text","text":" of degree n ≥ 2 whose zeros all satisfy |z| ≤ 1, and every a with p(a) = 0, there is ζ ∈ ℂ with p′(ζ) = 0 and "},{"kind":"math","text":"|ζ − a| ≤ 1","latex":"|\\zeta-a|\\le1"},{"kind":"text","text":"."}]},"id":"claim-sendov-distance-one","slug":"sendov-distance-one","version":2,"kind":"theorem","title":"A critical point within distance one","assumptions":["Degree at least two.","Every polynomial zero lies in the closed unit disk."],"scope":"Full Sendov statement, including repeated roots and boundary roots.","source_entry_ids":["sendov-conjecture:entry:mazur:v1","sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"formal_declarations":["Sendov.sendov"]},{"statement":"Under Sendov’s assumptions, every zero a has a critical point ζ with |ζ − a| < 1, unless |a| = 1 and p(z) = c(zⁿ − aⁿ) for a nonzero complex constant c.","statement_notation":{"schema_version":"mathematical-text-v1","segments":[{"kind":"text","text":"Under Sendov’s assumptions, every zero a has a critical point ζ with "},{"kind":"math","text":"|ζ − a| < 1","latex":"|\\zeta-a|<1"},{"kind":"text","text":", unless |a| = 1 and "},{"kind":"math","text":"p(z) = c(zⁿ − aⁿ)","latex":"p(z)=c(z^n-a^n)"},{"kind":"text","text":" for a nonzero complex constant c."}]},"id":"claim-sendov-phelps-rodriguez","slug":"sendov-phelps-rodriguez","version":2,"kind":"theorem","title":"Strict distance and the equality exception","assumptions":["Degree n ≥ 2.","All zeros of p are in the closed unit disk."],"scope":"The stronger Phelps–Rodriguez conclusion includes its precise exceptional family; it is not a second formulation of the same distance bound.","source_entry_ids":["sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"formal_declarations":["Sendov.phelps_rodriguez"]},{"statement":"For p(z) = z³ − 1, the root a = 1 has distance exactly one from the only critical point ζ = 0, since p′(z) = 3z².","statement_notation":{"schema_version":"mathematical-text-v1","segments":[{"kind":"text","text":"For "},{"kind":"math","text":"p(z) = z³ − 1","latex":"p(z)=z^3-1"},{"kind":"text","text":", the root a = 1 has distance exactly one from the only critical point ζ = 0, since "},{"kind":"math","text":"p′(z) = 3z²","latex":"p'(z)=3z^2"},{"kind":"text","text":"."}]},"id":"claim-sendov-sharp-radius-example","slug":"sendov-sharp-radius-example","version":2,"kind":"theorem","title":"Why the radius one is sharp","assumptions":["This is the exact cubic example p(z) = z³ − 1."],"scope":"The boundary example prevents a uniform strict radius-one conclusion without exceptions.","source_entry_ids":["sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"formal_declarations":[]},{"statement":"For every polynomial p of degree n with 2 ≤ n ≤ 8 whose zeros all satisfy |z| ≤ 1, each zero a has a critical point ζ with |ζ − a| ≤ 1.","id":"claim-sendov-low-degree","slug":"sendov-low-degree","version":1,"kind":"theorem","title":"Sendov for degree at most eight","assumptions":["Complex polynomials of degree 2 to 8 with all zeros in the closed unit disk."],"scope":"The low-degree cases, settled before the general proof.","source_entry_ids":["sendov-conjecture:entry:tao-small:v1"],"formal_declarations":[]},{"statement":"There is a constant n₀ such that for every polynomial p of degree n ≥ n₀ whose zeros all satisfy |z| ≤ 1, each zero a has a critical point ζ with |ζ − a| ≤ 1.","id":"claim-sendov-large-degree","slug":"sendov-large-degree","version":1,"kind":"theorem","title":"Sendov for all sufficiently large degree","assumptions":["Complex polynomials of degree at least n₀ with all zeros in the closed unit disk.","n₀ is not explicit."],"scope":"Large degree only; the degrees between 9 and n₀ were left open until the 2026 proof.","source_entry_ids":["sendov-conjecture:entry:tao-large:v1"],"formal_declarations":[]}],"problem":{"resolution_scope":{"resolution":"proved","extent":"full_statement","summary":"The cited exposition proves Sendov for every degree n ≥ 2 and gives the sharper Phelps–Rodriguez theorem. Public Lean endpoints cover both conclusions.","report_ids":["sendov-conjecture:report:full:v1"],"progress_claim_ids":[],"remaining":null},"statement_kind":"conjecture","problem_id":"problem-sendov-conjecture","slug":"sendov-conjecture","title":"Sendov’s conjecture","question":"If every zero of a complex polynomial lies in the closed unit disk, must each zero be within distance one of a zero of its derivative?","scope":"A nonzero complex polynomial of degree n ≥ 2, with every root a satisfying |a| ≤ 1. A critical point is a zero of p′, not another zero of p. Roots may repeat.","aliases":["Sendov conjecture","Phelps–Rodriguez conjecture"],"fields":["Complex analysis"],"msc":["30C15"],"topics":[],"background":"graduate","scale":"major conjecture","depth":"maintained","source_entry_ids":["sendov-conjecture:entry:mazur:v1","sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1","sendov-conjecture:entry:tao-large:v1","sendov-conjecture:entry:tao-small:v1"],"status_report_ids":["sendov-conjecture:report:full:v1"],"editorial":{"collection_id":"openmath-pilot","collection_title":"OpenMath pilot collection","reviewer":"OpenMath source curation","state":"known","scope":"Source comparison and page curation only; independent mathematical review is pending.","rationale":"The cited exposition proves Sendov for every degree n ≥ 2 and gives the sharper Phelps–Rodriguez theorem. Public Lean endpoints cover both conclusions.","decided_on":"2026-10-13","review_due_on":"2027-01-13","report_ids":["sendov-conjecture:report:full:v1"],"independent_mathematical_review":"pending"},"literature":[{"title":"Sendov conjecture: original proof","url":"https://www.proofatlas.ai/papers/sendov-conjecture/SENDOV_CONJECTURE_PROOF_AUGUST_5_2026.pdf","note":"Original proof dated 5 August 2026"},{"title":"A digestion of the proof of Sendov’s conjecture","url":"https://terrytao.wordpress.com/2026/08/12/a-digestion-of-the-proof-of-sendovs-conjecture/","note":"Conjectures 1–3 and proof, with provenance remarks"},{"title":"Sendov and Phelps–Rodriguez in Lean","url":"https://github.com/teorth/sendov/tree/1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d","note":"README provenance and trust; Sendov/Conjecture.lean"}],"formalizations":[{"title":"Lean: Sendov for every degree","url":"https://github.com/teorth/sendov/blob/1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d/Sendov/Conjecture.lean","note":"Source-reported complete. The separate Challenge file contains deliberate statement placeholders; the project reports no holes in the proof endpoint.","target":{"id":"claim-sendov-distance-one","version":2},"proof_status":"reported_complete","source_entry_ids":["sendov-conjecture:entry:mazur:v1","sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"declaration":"Sendov.sendov","source_commit":"1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d","alignment":"staff_linked","checked_on":"2026-10-13"},{"title":"Lean: the sharp Phelps–Rodriguez form","url":"https://github.com/teorth/sendov/blob/1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d/Sendov/Conjecture.lean","note":"Source-reported complete, including the equality classification. Independent OpenMath execution and review remain pending.","target":{"id":"claim-sendov-phelps-rodriguez","version":2},"proof_status":"reported_complete","source_entry_ids":["sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"declaration":"Sendov.phelps_rodriguez","source_commit":"1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d","alignment":"staff_linked","checked_on":"2026-10-13"}],"related":[],"tasks":[],"insights":[{"id":"sendov-conjecture-approach","title":"Roots and critical points are linked by identities","summary":"The argument uses polynomial identities, inequalities and exact rational certificates after treating the centre and boundary separately.","review":"pending","kind":"approach","source_entry_ids":["sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"claims":[{"id":"claim-sendov-distance-one","version":2},{"id":"claim-sendov-phelps-rodriguez","version":2}],"limitation":"A plotted collection of roots cannot replace the all-degree argument."},{"id":"sendov-conjecture-impact","title":"The theorem also identifies when equality is unavoidable","summary":"The stronger conclusion explains why the boundary family must be excluded from a strict distance bound; the cubic example makes that limitation visible.","review":"pending","kind":"impact","source_entry_ids":["sendov-conjecture:entry:digestion:v1","sendov-conjecture:entry:lean:v1"],"claims":[{"id":"claim-sendov-sharp-radius-example","version":2}],"scenario":{"id":"claim-sendov-phelps-rodriguez","version":2},"limitation":"No universal radius smaller than one follows."}],"coverage_gaps":["Independent mathematical review and local execution of the cited formal proofs are pending."],"checked_on":"2026-10-21"},"sources":[{"work":{"authors":["Lech Mazur"],"kind":"research_paper","publication":"preprint","publication_note":"Public manuscript or exposition; publication does not imply independent OpenMath review.","ai_role":"self_reported","ai_note":"Lech Mazur directed GPT-5.6 Pro discovery and formal work; mathematical direction, model work and later exposition are distinct contributions.","artifacts":[],"published":{"value":"2026-08-05"}},"id":"sendov-conjecture:source:mazur:v1","source_id":"sendov-conjecture-mazur","title":"Sendov conjecture: original proof","owner":"Lech Mazur","url":"https://www.proofatlas.ai/papers/sendov-conjecture/SENDOV_CONJECTURE_PROOF_AUGUST_5_2026.pdf","subject_scope":"A directed AI workflow reports a proof of Sendov for every degree at least two; the original proof and formalization preceded Tao’s exposition.","revision":"2026-08-05","content_sha256":null,"update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":"2026-08-05","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://www.proofatlas.ai/papers/sendov-conjecture/SENDOV_CONJECTURE_PROOF_AUGUST_5_2026.pdf","attribution":"Lech Mazur","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90},{"work":{"authors":["Terence Tao"],"kind":"research_paper","publication":"project","publication_note":"Public manuscript or exposition; publication does not imply independent OpenMath review.","ai_role":"self_reported","ai_note":"Terence Tao performed mathematical digestion and simplification with substantial AI assistance; this descends from Mazur’s argument and is not an independent discovery route.","artifacts":[],"published":{"value":"2026-08-12"}},"id":"sendov-conjecture:source:digestion:v1","source_id":"sendov-conjecture-digestion","title":"A digestion of the proof of Sendov’s conjecture","owner":"Terence Tao","url":"https://terrytao.wordpress.com/2026/08/12/a-digestion-of-the-proof-of-sendovs-conjecture/","subject_scope":"A streamlined exposition of Mazur’s argument gives Sendov and the sharper Phelps–Rodriguez conclusion, with its boundary equality cases.","revision":"2026-08-12","content_sha256":null,"update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":"2026-08-12","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://terrytao.wordpress.com/2026/08/12/a-digestion-of-the-proof-of-sendovs-conjecture/","attribution":"Terence Tao","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90},{"work":{"authors":["Terence Tao","teorth/sendov project"],"kind":"research_project","publication":"project","publication_note":"Public formal source; build and independent mathematical review are separate checks.","ai_role":"self_reported","ai_note":"The project reports Claude Opus 5 wrote essentially all Lean source under the author’s direction and review; this is a second formalization of the same mathematical argument.","artifacts":[{"kind":"formal_code","title":"Sendov and Phelps–Rodriguez in Lean — pinned source","url":"https://github.com/teorth/sendov/tree/1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d","version":"1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d","assessment":"not_executed","note":"Public source inspected for statement and assumptions; this proof project has not been executed by OpenMath."}],"published":{"value":"2026-08-19"}},"id":"sendov-conjecture:source:lean:v1","source_id":"sendov-conjecture-lean","title":"Sendov and Phelps–Rodriguez in Lean","owner":"Terence Tao, teorth/sendov project","url":"https://github.com/teorth/sendov/tree/1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d","subject_scope":"The pinned public source states full Sendov and Phelps–Rodriguez endpoints and reports only the standard Lean logical axioms for their proofs.","revision":"1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d","content_sha256":"f24582c2d2fe024e762656a7d175e1743e65fb034acce2fb2a43ab2b5cfe3229","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":"2026-08-19","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://github.com/teorth/sendov/tree/1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d","attribution":"Terence Tao, teorth/sendov project","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90},{"work":{"authors":["Terence Tao"],"kind":"research_paper","publication":"published","publication_note":"Acta Mathematica 229 (2022), 347–392, DOI 10.4310/acta.2022.v229.n2.a3 checked against Crossref; arXiv v2 pinned by content hash.","ai_role":"not_reported","ai_note":"No AI contribution is asserted by this source record.","artifacts":[],"published":{"value":"2022"}},"id":"sendov-conjecture:source:tao-large:v1","source_id":"sendov-tao-large-degree","title":"Sendov’s conjecture for sufficiently high degree polynomials","owner":"Terence Tao","url":"https://arxiv.org/abs/2012.04125v2","subject_scope":"Sendov’s conjecture for all sufficiently large degree, with the low-degree history.","revision":"arxiv-2012.04125v2","content_sha256":"d177cb5218a7e06ceea374d5e04fa8e39332c666ca832a4102b2dff2c570687e","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-21","source_updated_on":"2026-08-12","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://arxiv.org/abs/2012.04125v2","attribution":"Terence Tao","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}],"entries":[{"id":"sendov-conjecture:entry:mazur:v1","source_version_id":"sendov-conjecture:source:mazur:v1","item_id":"mazur","url":"https://www.proofatlas.ai/papers/sendov-conjecture/SENDOV_CONJECTURE_PROOF_AUGUST_5_2026.pdf","wording":"A directed AI workflow reports a proof of Sendov for every degree at least two; the original proof and formalization preceded Tao’s exposition.","wording_kind":"paraphrase","locator":"Original proof dated 5 August 2026","supersedes":null},{"id":"sendov-conjecture:entry:digestion:v1","source_version_id":"sendov-conjecture:source:digestion:v1","item_id":"digestion","url":"https://terrytao.wordpress.com/2026/08/12/a-digestion-of-the-proof-of-sendovs-conjecture/","wording":"A streamlined exposition of Mazur’s argument gives Sendov and the sharper Phelps–Rodriguez conclusion, with its boundary equality cases.","wording_kind":"paraphrase","locator":"Conjectures 1–3 and proof, with provenance remarks","supersedes":null},{"id":"sendov-conjecture:entry:lean:v1","source_version_id":"sendov-conjecture:source:lean:v1","item_id":"lean","url":"https://github.com/teorth/sendov/tree/1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d","wording":"The pinned public source states full Sendov and Phelps–Rodriguez endpoints and reports only the standard Lean logical axioms for their proofs.","wording_kind":"paraphrase","locator":"README provenance and trust; Sendov/Conjecture.lean","supersedes":null},{"id":"sendov-conjecture:entry:tao-large:v1","source_version_id":"sendov-conjecture:source:tao-large:v1","item_id":"theorem-1.2","url":"https://arxiv.org/abs/2012.04125v2","wording":"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₀.","wording_kind":"paraphrase","locator":"Abstract; Theorem 1.2","supersedes":null},{"id":"sendov-conjecture:entry:tao-small:v1","source_version_id":"sendov-conjecture:source:tao-large:v1","item_id":"introduction-low-degree","url":"https://arxiv.org/abs/2012.04125v2","wording":"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.","wording_kind":"paraphrase","locator":"§1, before Theorem 1.2; reference [1]","supersedes":null}],"reports":[{"id":"sendov-conjecture:report:full:v1","entry_id":"sendov-conjecture:entry:digestion:v1","state":"resolved","source_label":"Sendov and the sharper form proved in the exposition","scope":"All degrees n ≥ 2 with the stated disk assumption.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://terrytao.wordpress.com/2026/08/12/a-digestion-of-the-proof-of-sendovs-conjecture/","supersedes":null},{"id":"sendov-conjecture:report:formal:v1","entry_id":"sendov-conjecture:entry:lean:v1","state":"resolved","source_label":"Full Lean endpoints reported complete","scope":"Sendov.sendov and Sendov.phelps_rodriguez.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://github.com/teorth/sendov/tree/1ddea92d89f951a0a7cbbffa6c267cf7e6640b1d","supersedes":null},{"id":"sendov-conjecture:report:low-degree:v1","entry_id":"sendov-conjecture:entry:tao-small:v1","state":"resolved","source_label":"Known for n < 9","scope":"Only the exact statement and passage cited here; not an independent OpenMath assessment.","source_date":null,"observed_on":"2026-10-21","evidence_url":"https://arxiv.org/abs/2012.04125v2","supersedes":null},{"id":"sendov-conjecture:report:large-degree:v1","entry_id":"sendov-conjecture:entry:tao-large:v1","state":"resolved","source_label":"Sendov for n ≥ n₀","scope":"Only the exact statement and passage cited here; not an independent OpenMath assessment.","source_date":null,"observed_on":"2026-10-21","evidence_url":"https://arxiv.org/abs/2012.04125v2","supersedes":null}]},"status":{"state":"proved","label":"Proved","extent":"full_statement","summary":"The cited exposition proves Sendov for every degree n ≥ 2 and gives the sharper Phelps–Rodriguez theorem. Public Lean endpoints cover both conclusions.","basis":"editorial","attributed_to":"OpenMath pilot collection · OpenMath source curation","as_of":"2026-10-13","progress_label":null,"progress_claim_ids":[],"remaining":null,"views":["resolved"]}},"selected_context":null}}