Complete row histories and recursive endpoint costs
DefinitionDerivativeChainContinuation_ComplexHistoriescontinuation-20261026derivative-chainsgeometric-budgets
A history chooses one root slot in each row. Its recursive endpoint cost starts with the distance to the unique first-row point and then minimizes previous cost plus the next Euclidean edge. At actual row endpoints this cost is attained by a complete history.
Definition code
import Mathlib
import Definitions.Def_DerivativeChainContinuation_EndpointCost
import Definitions.Def_DerivativeChainContinuation_UniformRootTower
import Definitions.Def_DerivativeChainPrivate_foundations
set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false
namespace DerivativeChainContinuation
open Polynomial DerivativeChainPrivate
open scoped BigOperators
noncomputable def complexRowHistoryCost (r : ComplexRootRows) : ℕ → ℂ → ℝ
| 0,v => ‖v-r 0 0‖
| k+1,v => finiteEndpointCost (fun i => complexRowHistoryCost r k (r k i)) (r k) v
def IsComplexRowHistory (r : ComplexRootRows) {n : ℕ} (z : Fin (n+1) → ℂ) : Prop :=
∀ i, ∃ j : Fin (i.val+1), z i=r i.val j
end DerivativeChainContinuation
Source