A centered coefficient block yields a complete chain with optional return
ProvedDerivativeChainContinuation.sparse_cluster_chain_boundcentroid-returncoefficient-gapcontinuation-20261026derivative-chainssparse-families
Let be monic of degree , with centroid . Let , and . Among centered modes , assume the coefficient of vanishes outside . If all roots lie in , where and , an actual derivative chain starts at , stays at from index , and satisfies
When the centered coefficient of is zero, replace by . If , the asserted return interval is empty and its indicator cost is zero. 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_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.sparse_cluster_chain_bound (p : Polynomial ℂ) (hp : p.Monic)
(n r h q : ℕ) (hn : p.natDegree=n) (hh : 1 ≤ h)
(hq : 2 ≤ q) (hqr : q ≤ r-h) (hrn : r ≤ n)
(hsupport : ∀ j ≤ n, 2 ≤ j → j ≠ q → (j ≤ r-h ∨ r < j) →
(centeredSource p).coeff (n-j)=0)
(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,by omega⟩=rootCentroid p ∧ (∀ i, r ≤ i.val → z i=rootCentroid p) ∧
chainCost z ≤ ((if r=n then 0 else 1)+Real.sqrt (h+1 : ℕ))*Real.sqrt (D^2-‖rootCentroid p-a‖^2) ∧
((centeredSource p).coeff (n-q)=0 →
chainCost z ≤ ((if r=n then 0 else 1)+Real.sqrt h)*Real.sqrt (D^2-‖rootCentroid p-a‖^2)) := by sorrySource