A sparse Appell block admits a complete centroid-return chain
ProvedDerivativeChainContinuation.appell_centroid_return_boundcentroid-returncoefficient-gapcontinuation-20261026derivative-chainssparse-families
Let , with and . Let , let for outside , and let for . Let and , with all roots of in . There is an actual derivative chain starting at and returning permanently to from index , with
If , the factor improves to . For , write and . For a finite complex path , write . An actual derivative chain for a degree- polynomial satisfies for every .
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 namespace DerivativeChainContinuation open Polynomial DerivativeChainPrivate end DerivativeChainContinuation
Formal statement
theorem DerivativeChainContinuation.appell_centroid_return_bound (M h s q : ℕ) (hq : 2 ≤ q) (hqM : q ≤ M)
(hs : 0 < s) (c : ℕ → ℂ) (hc0 : c 0=1)
(hpref : ∀ j ≤ M, j ≠ 0 → j ≠ q → c j=0)
(hreturn : ∀ j, M+h < j → j ≤ M+h+s → c j=0)
(u a : ℂ) (D : ℝ) (hD : 0 ≤ D)
(hbound : ∀ z : ℂ, (translatedAppell (M+h+s) c u).eval z=0 → ‖z-a‖ ≤ D) :
∃ z : Fin (M+h+s) → ℂ,
(∀ i, (derivative^[M+h+s-(i.val+1)] (translatedAppell (M+h+s) c u)).eval (z i)=0) ∧
z ⟨0,by omega⟩=u ∧ (∀ i, M+h ≤ i.val → z i=u) ∧
chainCost z ≤ (1+Real.sqrt (h+1 : ℕ))*Real.sqrt (D^2-‖u-a‖^2) ∧
(c q=0 → chainCost z ≤ (1+Real.sqrt h)*Real.sqrt (D^2-‖u-a‖^2)) := by sorrySource