A sparse Appell prefix and arbitrary tail give a square-root chain bound
ProvedDerivativeChainContinuation.sparse_appell_chain_boundcentroid-returncoefficient-gapcontinuation-20261026derivative-chainssparse-families
Let with , let , and suppose for outside . Let and . If every root of has modulus at most , there is an actual derivative chain starting at with
For , write and . For a finite complex path , write . An actual derivative chain for a degree- polynomial satisfies for every . Coefficients after the sparse prefix are unrestricted.
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_AppellTranslation 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 open scoped BigOperators end DerivativeChainContinuation
Formal statement
theorem DerivativeChainContinuation.sparse_appell_chain_bound (M h q : ℕ) (hq : 2 ≤ q) (hqM : q ≤ M)
(c : ℕ → ℂ) (hc0 : c 0=1)
(hs : ∀ j ≤ M, j ≠ 0 → j ≠ q → c j=0)
(u : ℂ) (R : ℝ) (hR : 0 ≤ R)
(hbound : ∀ z : ℂ, (translatedAppell (M+h) c u).eval z=0 → ‖z‖ ≤ R) :
∃ z : Fin (M+h) → ℂ,
(∀ i, (derivative^[M+h-(i.val+1)] (translatedAppell (M+h) c u)).eval (z i)=0) ∧
z ⟨0,by omega⟩=u ∧ chainCost z ≤ Real.sqrt (h+1)*Real.sqrt (R^2-‖u‖^2) ∧
(c q=0 → chainCost z ≤ Real.sqrt h*Real.sqrt (R^2-‖u‖^2)) := by sorrySource