Mean transport cost across one interlacing step
ProvedDerivativeChainContinuation.mean_cost_transport_stepcontinuation-20261026derivative-chainsreal-transport
Let and let real rows and interlace. Suppose real costs satisfy and for every . Then
where is ordered dispersion. This is the averaging inequality used to telescope row-history costs.
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_FiniteTransport 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.mean_cost_transport_step (m : ℕ) (hm : 0 < m)
(a : Fin (m+1) → ℝ) (b : Fin m → ℝ)
(A : Fin (m+1) → ℝ) (B : Fin m → ℝ)
(hab : ∀ i, a i.castSucc ≤ b i ∧ b i ≤ a i.succ)
(hleft : ∀ i, A i.castSucc ≤ B i+|b i-a i.castSucc|)
(hright : ∀ i, A i.succ ≤ B i+|a i.succ-b i|) :
(∑ j, A j)/(m+1 : ℝ) ≤ (∑ i, B i)/(m : ℝ) +
(orderedDispersion a-orderedDispersion b)/((m : ℝ)*(m+1)) := by sorrySource