Finite minimum for extending a chain to an endpoint
DefinitionDerivativeChainContinuation_EndpointCostcontinuation-20261026derivative-chainsreal-transport
For a finite nonempty index set , real prefix costs , complex previous endpoints , and a new endpoint , define
This is the least cost of appending to one of the available prefixes.
Definition code
import Mathlib
import Definitions.Def_DerivativeChainPrivate_foundations
set_option autoImplicit false
namespace DerivativeChainContinuation
noncomputable def finiteEndpointCost {ι : Type*} [Fintype ι] [Nonempty ι]
(prefixCost : ι → ℝ) (lastPoint : ι → ℂ) (v : ℂ) : ℝ :=
⨅ i, prefixCost i + ‖lastPoint i-v‖
end DerivativeChainContinuation
Source