Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Two centered modes in the unit disk give a one-plus-root-two bound

Proved
DerivativeChainContinuation.at_most_two_centered_modes_unit_disk

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

centroid-returncoefficient-gapcontinuation-20261026derivative-chainssparse-families

Let p∈C[X]p\in\mathbb C[X]p∈C[X] be monic of positive degree nnn. Suppose all roots lie in the closed unit disk and at most two centered modes indexed by 2≤j≤n2\le j\le n2≤j≤n are nonzero. There is an actual derivative chain starting at the root centroid with

L(z)≤1+2.L(z)\le1+\sqrt2.L(z)≤1+2​.

A centered mode indexed by jjj is the coefficient of Xn−jX^{n-j}Xn−j after translation by the centroid. For a finite complex path z0,…,zN−1z_0,\ldots,z_{N-1}z0​,…,zN−1​, write L(z)=∑i=0N−2∣zi+1−zi∣L(z)=\sum_{i=0}^{N-2}|z_{i+1}-z_i|L(z)=∑i=0N−2​∣zi+1​−zi​∣. An actual derivative chain for a degree-NNN polynomial ppp satisfies p(N−i−1)(zi)=0p^{(N-i-1)}(z_i)=0p(N−i−1)(zi​)=0 for every 0≤i<N0\le i<N0≤i<N.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainContinuation_CenteredSource
import Definitions.Def_DerivativeChainContinuation_TwoModeChain
import Definitions.Def_DerivativeChainPrivate_foundations
import Definitions.Def_DerivativeChain_root_probability
open DerivativeChain DerivativeChainPrivate
open Polynomial
open scoped BigOperators
set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false

set_option autoImplicit false
namespace DerivativeChainContinuation
open Polynomial DerivativeChainPrivate







end DerivativeChainContinuation

Formal statement
theorem DerivativeChainContinuation.at_most_two_centered_modes_unit_disk (p : Polynomial ℂ) (hp : p.Monic)
    (n : ℕ) (hn : p.natDegree=n) (hnpos : 0 < n)
    (hmodes : (centeredModeSupport p).card ≤ 2)
    (hbound : ∀ z : ℂ, p.eval z=0 → ‖z‖ ≤ 1) :
    ∃ z : Fin n → ℂ,
      (∀ i, (derivative^[n-(i.val+1)] p).eval (z i)=0) ∧
      z ⟨0,hnpos⟩=rootCentroid p ∧ chainCost z ≤ 1+Real.sqrt 2 := by sorry
Source
https://github.com/Amal-David/derivative-chain-prize/blob/21d2a2ac5cd4b4e6263cbc715dd5f925427fc976/continuation_formal/Source/SparseCorollaries.lean#L36-L49

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