Formal evidence
An independent reviewer must inspect the recorded build, declarations, unfinished-proof-step check, and disclosed foundations.
ProofAtlas research case study
Complex analysis · formal theorem
The submitted Lean package checks Sendov.sendov_conjecture: for a nonzero complex polynomial of degree at least two whose zeros lie in the closed unit disk, every zero lies within distance 1 of a critical point. Its relationship to the informal Sendov conjecture is not yet reviewed, and ProofAtlas accepted-result review remains pending.
Scope: For every nonzero complex polynomial p of degree at least two whose zeros all lie in the closed unit disk, and for every zero a of p, there exists a zero w of p' with ‖w − a‖ ≤ 1.
Exact formal proposition
theorem sendov_conjecture : SendovConjectureResult boundary
For every nonzero complex polynomial p of degree at least two whose zeros all lie in the closed unit disk, and for every zero a of p, there exists a zero w of p' with ‖w − a‖ ≤ 1.
Companion research paper
The August 5 manuscript presents a computer-assisted proof candidate for Sendov's conjecture, reducing a normalized obstruction to exact finite certificates and a uniform large-degree estimate. A separate Lean development checks the exact displayed endpoint Sendov.sendov_conjecture; manuscript-to-formal-statement alignment is not yet reviewed, and ProofAtlas accepted-result review remains pending.
Author-authorized early release. This fixed paper package first appeared while independent presentation review was pending; hosting it does not mark the Lean result accepted.
Hosting authorized by the rightsholder. Original ProofAtlas metadata cover; not a reproduction of a paper page.
Lech Mazur, “A Computer-Assisted Proof of Sendov's Conjecture,” 5 August 2026.
Paper overview
Author-supplied overview of the manuscript's theorem claim, historical milestones, and proof assets. ProofAtlas separately labels the Lean formalization's publication review as pending.

Line counts exclude blank lines; comments and documentation count. The total is the commit-pinned first-party Lean import closure; Mathlib and other third-party dependencies are excluded.
Continue the mathematics
The pinned theorem and its complete local import closure let people and AI agents inspect the proof, compare another route, isolate reusable lemmas, or formulate a stronger exact statement. Lean checks each proposed extension against its own exact statement.
The ZIP contains the checked first-party Lean import closure, exact statements and boundaries, license, notice, evidence, source-footprint manifest, and continuation data. Mathlib and other third-party dependencies are not bundled.
Publication review
Lean has checked the exact source; this public release is not presented as a ProofAtlas accepted result. The linked evidence page shows individual review decisions where they are publicly available. The requirements below describe publication coverage, not a count of unfinished reviews. Independent AI, human, or mixed reviewers may examine the build evidence, statement alignment, result boundary, and public wording. Review does not replace Lean's check or broaden the theorem.
An independent reviewer must inspect the recorded build, declarations, unfinished-proof-step check, and disclosed foundations.
The formal declaration must be reviewed against the theorem wording and its exact variant.
The limits must be checked so the page cannot imply a broader theorem.
The explanation, infographic labels, and source presentation need independent review.
The permanent source link and downloadable files must be approved for public citation.
After the four reviews and source route are ready, an accepted-result record must bind them to this exact formalization.
Credit for this release
Authorship and other contributions are recorded separately for this version.
OpenAI GPT-5.6 Pro contributed to exploration, proof development, exact computational testing, adversarial auditing, and exposition.
Lech Mazur is the sole named manuscript author, accountable curator, workflow designer, and reconciler of model outputs.
Selected reviews
Each entry names the review question, exact subject coverage, and reviewer provenance recorded for this release. A selected review concerns only its named question and is not by itself proof or acceptance of a broader claim. These bindings alone do not establish that proof or computation checks were rerun.
Download exact review bindings
Citation
Use the version-specific citation so the authorship, scope, and public record remain attached.
Release history
This version is part of the release history. No independent external timestamp is claimed.