Complex row endpoint costs are attained by complete histories
ProvedDerivativeChainContinuation.complexRowHistoryCost_attainedcontinuation-20261026derivative-chainsgeometric-budgets
For any complex row family with slots and any endpoint in row , there is one complete row history ending at whose full consecutive-distance cost equals the recursively defined endpoint cost. Repeated slots and the one-point first row are allowed.
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_ComplexHistories import Definitions.Def_DerivativeChainContinuation_UniformRootTower import Definitions.Def_DerivativeChainPrivate_foundations open DerivativeChainPrivate set_option autoImplicit false set_option backward.isDefEq.respectTransparency false open Polynomial Matrix open scoped BigOperators set_option maxHeartbeats 1000000
Formal statement
theorem DerivativeChainContinuation.complexRowHistoryCost_attained (r : ComplexRootRows) (n : ℕ) (v : ℂ)
(hv : ∃ j : Fin (n+1), v=r n j) :
∃ z : Fin (n+1) → ℂ, IsComplexRowHistory r z ∧ z (Fin.last n)=v ∧
chainCost z=complexRowHistoryCost r n v := by sorrySource