Back to Problems

sendov_conjecture.variants.le_nine

Specification

**Sendov's conjecture** states that for a polynomial $$f(z)=(z-r_{1})\cdots (z-r_{n}),\qquad (n\geq 2)$$ with all roots $r_1, ..., r_n$ inside the closed unit disk $|z| ≤ 1$, each of the $n$ roots is at a distance no more than $1$ from at least one critical point. It has been shown that Sendov's conjecture holds when the degree of $n$ is at most $9$.

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement
theorem sendov_conjecture.variants.le_nine (n : ℕ) (hn : n ∈ Set.Icc 2 9) :
    n.SatisfiesSendovConjecture
ID: Wikipedia__Sendov__sendov_conjecture.variants.le_nine
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.