At most two centered modes give a uniform complete-chain bound
ProvedDerivativeChainContinuation.at_most_two_centered_modes_chaincentroid-returncoefficient-gapcontinuation-20261026derivative-chainssparse-families
Let be monic of positive degree , with centroid . Suppose at most two of its centered coefficients indexed by are nonzero. If all roots lie in for and , an actual derivative chain starting at satisfies
The centered coefficient indexed by is the coefficient of in . For a finite complex path , write . An actual derivative chain for a degree- polynomial satisfies for every .
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 set_option backward.isDefEq.respectTransparency false set_option maxHeartbeats 1000000 namespace DerivativeChainContinuation open Polynomial DerivativeChainPrivate end DerivativeChainContinuation
Formal statement
theorem DerivativeChainContinuation.at_most_two_centered_modes_chain (p : Polynomial ℂ) (hp : p.Monic)
(n : ℕ) (hn : p.natDegree=n) (hnpos : 0 < n)
(hmodes : (centeredModeSupport p).card ≤ 2)
(a : ℂ) (D : ℝ) (hD : 0 ≤ D) (hbound : ∀ z : ℂ, p.eval z=0 → ‖z-a‖ ≤ D) :
∃ 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)*Real.sqrt (D^2-‖rootCentroid p-a‖^2) := by sorrySource