A sparse Appell tail has a containing-disk chain bound
ProvedDerivativeChainContinuation.appell_no_return_disk_boundcentroid-returncoefficient-gapcontinuation-20261026derivative-chainssparse-families
Let and . Let and let for outside . Let and , with all roots of in . An actual derivative chain starting at can be chosen with
and with factor when . For , write and . This transports the sparse-prefix estimate to an arbitrary containing-disk center.
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 namespace DerivativeChainContinuation open Polynomial DerivativeChainPrivate end DerivativeChainContinuation
Formal statement
theorem DerivativeChainContinuation.appell_no_return_disk_bound (M h q : ℕ) (hq : 2 ≤ q) (hqM : q ≤ M)
(c : ℕ → ℂ) (hc0 : c 0=1) (hpref : ∀ j ≤ M, j ≠ 0 → j ≠ q → c j=0)
(u a : ℂ) (D : ℝ) (hD : 0 ≤ D)
(hbound : ∀ z : ℂ, (translatedAppell (M+h) c u).eval z=0 → ‖z-a‖ ≤ D) :
∃ 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 (D^2-‖u-a‖^2) ∧
(c q=0 → chainCost z ≤ Real.sqrt h*Real.sqrt (D^2-‖u-a‖^2)) := by sorrySource