Source authenticated

Sendov's Conjecture

Sendov's conjecture is resolved for every degree n >= 2, closing a gap that had stood since 1959: degrees up to eight were settled piecemeal between 1969 and 1999, and Tao's 2020 result covered all sufficiently large degrees without ever specifying the threshold, leaving the middle range open. Tao's digestion establishes the stronger interior form of the statement, which resolves the Phelps-Rodriguez conjecture in full generality as a consequence - a second conjecture falling out of the same argument, and one that likely merits its own entry. Two independent Lean developments now exist: Mazur's original at roughly 90,000 lines and Tao's streamlined version at about 15,000.

Exact FrontierDelta

proved→proved

Scope and record

Occurred: Oct 29, 2026

Delta type: REGISTRY REVISION

Assumptions: VibeMathed verification: lean-verified. Publication: preprint. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: Sendov's Conjecture · Sendov's Conj.

Confidence: Not scored

Registry verification: lean verified · preprint · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

GPT-5.6 Pro
model · ai model contributor · OpenAI

Lech Mazur
human · human collaborator

Evidence vector

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Named evidence

VibeMathed record: Sendov's Conjecture

specialist registry · passed

Independently verified twice over, and this site audited the formal artifact itself on 13 August 2026. The decisive external check is Terence Tao's post of 12 August 2026, "A digestion of the proof of Sendov's conjecture": he writes that "Lech Mazur was able to use an AI tool to resolve Sendov's conjecture for all $n \ge 2$ ", reports formalizing the whole argument in Lean himself at about 15,000 lines against the original's roughly 90,000, and concludes that it resolves both the Sendov and Phelps-Rodriguez conjectures in full generality. Tao proved the large-degree case in 2020, so this is expert verification by the person best placed to give it, and it carries the tier. Separately, this site audited Mazur's Lean package. SendovConjecture in Sendov/Statement.lean is exactly the conjecture, correctly quantified and shadowed nowhere. Across all 1,160 first-party files there are zero sorry, zero admit, zero custom axiom declarations and - the one that matters for an autonomous prover - zero native_decide; the 1,117 decide calls are kernel-checked, and the axiom profile is exactly propext, Classical.choice and Quot.sound. All 1,160 file hashes match the published evidence record byte for byte. What could not be checked is the build: the bundle ships no lakefile or manifest and excludes Mathlib, so it cannot be recompiled as distributed, a gap ProofAtlas's own evidence file is candid about. This entry rests not on that internal status but on Tao's independent digestion.

Source ↗

Mazur's original proof of Sendov's conjecture, the underlying argument

independent reproduction · passed

lean-proof link supplied by the VibeMathed registry.

Source ↗

Phelps–Rodriguez Conjecture

witness · pending

independent link supplied by the VibeMathed registry.

Source ↗

Sendov's Conjecture

preprint · pending

Primary source named by the VibeMathed record. Presence in this import is not an independent mathematical verification.