Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unit-disk predecessor for an actual polynomial critical point

Proved
DerivativeChain.polynomial_disk_predecessor

by labuka · Oct 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

derivative-chain-baseline-20261017derivative-chain-private

Let P be a complex polynomial of positive degree, let z satisfy P'(z)=0, and assume every zero of P lies in the closed unit disk. Then there is an actual zero w of P with

∣w−z∣2≤1−∣z∣2.|w-z|^2\le1-|z|^2.∣w−z∣2≤1−∣z∣2.

This supplies the polynomial root transition before applying the already accepted abstract complex barycentric predecessor lemma. Repeated roots and a critical point shared with P are included. No full-chain bound is asserted here.

Preamble

import Mathlib.Algebra.Order.BigOperators.Ring.Finset
import Mathlib.Algebra.Polynomial.Derivative
import Mathlib.Algebra.Polynomial.Roots
import Mathlib.Analysis.Complex.Norm
import Mathlib.Analysis.Complex.Polynomial.GaussLucas
import Mathlib.Analysis.Real.Sqrt
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
open scoped BigOperators Polynomial
set_option autoImplicit false
Formal statement
theorem DerivativeChain.polynomial_disk_predecessor {P : ℂ[X]} {z : ℂ}
    (hP : 0 < P.degree) (hz : P.derivative.eval z = 0)
    (hdisk : ∀ w : ℂ, P.eval w = 0 → ‖w‖ ≤ 1) :
    ∃ w : ℂ, P.eval w = 0 ∧ ‖w - z‖ ^ 2 ≤ 1 - ‖z‖ ^ 2 := by sorry
Source
Derivative-zero chains: public formalization reference, R25, DerivativeChain.polynomial_disk_predecessor. https://gist.github.com/Amal-David/d6612109c98595b12561cd638c60edf5/3883c57ddc7bf9d4c0e898c3d6bfd2ca0d7f9c95#file-notes-md
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by labuka · Oct 20, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me