Complete real-line transport theorem with attained endpoint costs
ProvedDerivativeChainContinuation.full_real_transport_theoremcontinuation-20261026derivative-chainsreal-transport
Let and let lie on a common complex affine line. Put and , and suppose . Let be the infimum of lengths of sequences with and . Every source endpoint has a chain attaining , and
This combines existence of minimizing chains with a degree-independent upper bound on their aggregate squared lengths. Repeated roots and arbitrary endpoint order are allowed.
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_CollinearTransport import Definitions.Def_DerivativeChainContinuation_RealTransportComplete 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.full_real_transport_theorem {n : ℕ} (a : Fin (n+1) → ℂ)
(hline : OnComplexLine a)
(hvariance : 0 < ∑ i,‖a i-complexCentroid a‖^2) :
(∀ j,∃ z : Fin (n+1) → ℂ,IsChain a z ∧ z (Fin.last n)=a j ∧
chainCost z=complexEndpointCost a (a j)) ∧
uniformComplexTransportRatio a ≤ (28/3 : ℝ) := by sorrySource