Finite real row histories attain their endpoint cost
ProvedDerivativeChainContinuation.realHistoryCost_attainedcontinuation-20261026derivative-chainsreal-transport
Let be a triangular family of real rows, with entries in row . For every and every entry of row , there is a history selecting one entry of each row, ending at , whose length attains the recursively defined minimum :
This supplies actual minimizing histories for the subsequent derivative-chain construction.
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_RealEndpointCost import Definitions.Def_DerivativeChainContinuation_RealHistories import Definitions.Def_DerivativeChainContinuation_RealTower import Definitions.Def_DerivativeChainPrivate_foundations open DerivativeChainPrivate set_option autoImplicit false set_option backward.isDefEq.respectTransparency false open Polynomial open scoped BigOperators
Formal statement
theorem DerivativeChainContinuation.realHistoryCost_attained (r : RealRows) (n : ℕ) (v : ℝ)
(hv : ∃ j : Fin (n+1), v=r n j) :
∃ z : Fin (n+1) → ℝ, IsRowHistory r z ∧ z (Fin.last n)=v ∧
realChainCost z=realHistoryCost r n v := by sorrySource