Appending a constant return adds exactly one closing edge
ProvedDerivativeChainContinuation.closeAt_costcentroid-returncoefficient-gapcontinuation-20261026derivative-chainssparse-families
Let satisfy and , let , and let . Form a path of length by taking and then repeating . Its cost is
The later repeated entries contribute no additional edges.
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_ReturnPath 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 DerivativeChainPrivate open scoped BigOperators end DerivativeChainContinuation
Formal statement
theorem DerivativeChainContinuation.closeAt_cost (r s : ℕ) (hr : 1 ≤ r) (hs : 0 < s) (f : ℕ → ℂ) (u : ℂ) :
chainCost (fun i : Fin (r+s) => closeAt r f u i) =
chainCost (fun i : Fin r => f i)+‖u-f (r-1)‖ := by sorrySource