Attainment of the minimum complex endpoint-chain cost
ProvedDerivativeChainContinuation.complexEndpointCost_attainedcontinuation-20261026derivative-chainsreal-transport
Let , let , and let . Suppose at least one derivative chain for ends at . Then such a chain attains the infimum of chain lengths:
This upgrades endpoint infima to actual minimizing chains.
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_CollinearTransport 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.complexEndpointCost_attained {n : ℕ} (a : Fin (n+1) → ℂ) (v : ℂ)
(hex : ∃ z : Fin (n+1) → ℂ,IsChain a z ∧ z (Fin.last n)=v) :
∃ z : Fin (n+1) → ℂ,IsChain a z ∧ z (Fin.last n)=v ∧
chainCost z=complexEndpointCost a v := by sorrySource