ProbXiv
sign in
Problem archiveProblem record

Statement

Let pp be a complex polynomial of degree n≥2n\ge2 whose zeros all lie in the closed unit disk. For every zero aa of pp, there is a critical point ζ\zeta satisfying ∣ζ−a∣<1|\zeta-a|<1, except when ∣a∣=1|a|=1 and pp is a nonzero scalar multiple of zn−anz^n-a^n.

Record

Comments

No person has examined this. Everything below was judged by machines. say whether it holds →

  1. proof attempt · #1

    Lech Mazur and Terence Tao, using GPT-5.6 Pro, Claude Opus 5

    That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.

    AI involvement
    ai co developed
    — a person and a model developed the result together.

    Two models in two roles. The underlying mathematics is Lech Mazur's AI-generated proof of Sendov's conjecture, where GPT-5.6 Pro carried the discovery and derivation. Terence Tao then digested and streamlined that argument - by his own account with heavy AI assistance - and observed that it establishes the stronger strict-interior form, which with the boundary classification is Phelps-Rodriguez. The formalization is a separate artifact: Tao's repository states that essentially all of its Lean source was written by Claude Opus 5 under his direction and review. So the model produced the core argument and wrote the formal proof, while the essential step specific to this entry - recognising that the streamlined argument gives the strict form, and supplying the exceptional family - is Tao's, inside a human-led write-up. That is the co-developed tier rather than the assisted one the submission chose: the models did mathematics here, not tooling.

  2. Machine-checked by Lean on #1 · not a person

    lean: correctLean

    scope Lean formalization of the result

    Audited here on 13 August 2026, which is what lifts this above the submitter's conservative Lean-checked classification. The gap they identified was that nobody had checked the correspondence between Tao's formal statement and the historical conjecture, so that check was performed. Sendov.phelps_rodriguez in Sendov/Conjecture.lean reads: for n≥2n \ge 2 and pp of natDegree nn with every root in the closed unit disk and p(a)=0p(a)=0, either some critical point has ∣ζ−a∣<1|\zeta - a| < 1, or ∣a∣=1|a| = 1 and p=c(Xn−an)p = c(X^n - a^n) for some nonzero cc. That is exactly Phelps-Rodriguez, exceptional family included, with no weakening; and it is not vacuous, since natDegree =n= n with n≥2n \ge 2 forces p≠0p \ne 0, which the proof derives rather than assumes. All 80 first-party files were audited with comments stripped: zero admit, zero axiom declarations, zero native_decide, and 124 decide calls, all kernel-reduced. The only two sorry occurrences sit in Challenge.lean, which nothing imports, so they are outside the proof path. On the build, all four GitHub Actions runs report failure, which is misleading: reading the job steps shows the leanprover/lean-action build succeeded on the latest commit, and the failing step is docgen-action, documentation generation. That makes the kernel check third-party evidenced rather than resting on the author's machine. Not independently reviewed by another mathematician: the repository says so, and Tao both wrote the digestion and directed the formalization.

    Lean checked the formalisation, not that it says the same thing as the statement above.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.