Recursive history costs and their uniform row mean
DefinitionDerivativeChainContinuation_RealEndpointCostcontinuation-20261026derivative-chainsreal-transport
For a real row family with entries, define the endpoint-history cost recursively by
Its row mean is . These costs implement optimal transport through consecutive root rows.
Definition code
import Mathlib
import Definitions.Def_DerivativeChainContinuation_EndpointCost
import Definitions.Def_DerivativeChainContinuation_RealTower
import Definitions.Def_DerivativeChainPrivate_foundations
set_option autoImplicit false
namespace DerivativeChainContinuation
open scoped BigOperators
noncomputable def realHistoryCost (r : RealRows) : ℕ → ℝ → ℝ
| 0,v => |v-r 0 0|
| k+1,v => finiteEndpointCost (fun i : Fin (k+1) => realHistoryCost r k (r k i))
(fun i => (r k i : ℂ)) (v : ℂ)
noncomputable def meanHistoryCost (r : RealRows) (k : ℕ) : ℝ :=
(∑ i,realHistoryCost r k (r k i))/(k+1 : ℝ)
end DerivativeChainContinuation
Source