A finite derivative tail admits a telescoping square-cost bound
ProvedDerivativeChainContinuation.finite_tail_energycentroid-returncoefficient-gapcontinuation-20261026derivative-chainssparse-families
Let and let be indexed by . For , suppose has positive degree and each root of is a root of . From any root of , one can choose roots of for with
No disk or simple-root hypothesis is imposed. This is the finite energy tail used after a sparse prefix.
Preamble
import Mathlib 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 open scoped BigOperators end DerivativeChainContinuation
Formal statement
theorem DerivativeChainContinuation.finite_tail_energy (P : ℕ → Polynomial ℂ) (h : ℕ)
(hdegree : ∀ j < h, 0 < (P (j+1)).degree)
(hstep : ∀ j < h, ∀ w : ℂ, (P j).eval w=0 → (P (j+1)).derivative.eval w=0)
(b : ℂ) (hb : (P 0).eval b=0) :
∃ z : ℕ → ℂ, z 0=b ∧ (∀ j ≤ h, (P j).eval (z j)=0) ∧
(∑ j ∈ Finset.range h, ‖z (j+1)-z j‖^2) ≤ ‖z h‖^2-‖b‖^2 := by sorrySource