A coefficient gap with tail length at most fifteen gives a four-bound
ProvedDerivativeChainContinuation.coefficient_gap_four_boundcentroid-returncoefficient-gapcontinuation-20261026derivative-chainssparse-families
Let be monic of degree with centroid . Suppose , , and with and . If every root of lies in the closed unit disk, there is an actual derivative chain starting at satisfying
For a finite complex path , write . An actual derivative chain for a degree- polynomial satisfies for every . The restriction on is part of the theorem.
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_CenteredSource 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.coefficient_gap_four_bound (p : Polynomial ℂ) (hp : p.Monic) (n h k : ℕ)
(hn : p.natDegree=n) (hh : 1 ≤ h) (hh15 : h ≤ 15) (hhk : h ≤ k) (hk : k ≤ n-2)
(A : ℂ) (Q : Polynomial ℂ) (hQ : Q.natDegree < h)
(hgap : centeredSource p=X^n+C A*X^k+Q)
(hbound : ∀ z : ℂ, p.eval z=0 → ‖z‖ ≤ 1) :
∃ z : Fin n → ℂ,
(∀ i, (derivative^[n-(i.val+1)] p).eval (z i)=0) ∧
z ⟨0,by omega⟩=rootCentroid p ∧ chainCost z ≤ 4 := by sorrySource