Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Anchored complete derivative-chain baseline

Proved
DerivativeChainPrivate.exists_chain_cost_le

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

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

Let n>0 and let all n complex root slots a_i lie in the closed unit disk. For every root u of their degree-one derivative row, a complete actual derivative-root chain z exists, starting at u, whose Euclidean length satisfies

ℓ≤(n−1)(1−∣u∣2).\ell\le\sqrt{(n-1)(1-|u|^2)}.ℓ≤(n−1)(1−∣u∣2)​.

Every nonconstant derivative row is retained. Repeated roots and n=1 are allowed. The starting point is specified as a row-one root; no separately assumed centroid formula or one-step transition hypothesis is used. The bound depends on degree and does not settle either unrestricted prize question.

Preamble
import Definitions.Def_DerivativeChainPrivate_foundations
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
namespace DerivativeChainPrivate
end DerivativeChainPrivate
open DerivativeChainPrivate
Formal statement
theorem DerivativeChainPrivate.exists_chain_cost_le {n : ℕ} (hn : 0 < n) (a : Fin n → ℂ)
    (ha : ∀ i, ‖a i‖ ≤ 1) (u : ℂ) (hu : (row a 1).eval u = 0) :
    ∃ z : Fin n → ℂ, IsChain a z ∧ z ⟨0, hn⟩ = u ∧
      chainCost z ≤ Real.sqrt (((n - 1 : ℕ) : ℝ) * (1 - ‖u‖ ^ 2)) := by sorry
Source
Derivative-zero chains: public formalization reference, R15, DerivativeChainPrivate.exists_chain_cost_le. 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