The decomposition of optimal transportation problems with convex cost
Abstract
Given a positive l.s.c. convex function c : Rd Rd and an optimal transference plane π for the transportation problem equation* ∫ c(x'-x) π(dxdx'), equation* we show how the results of biadan on the existence of a Sudakov decomposition for norm cost c= |·| can be extended to this case. More precisely, we prove that there exists a partition of Rd into a family of disjoint sets \Sh a\h, a together with the projection \Oh a\h, a on Rd of proper extremal faces of epi\, c, h = 0,…,d and a ∈ Ah ⊂ Rd-h, such that - Sh a is relatively open in its affine span, and has affine dimension h; Oh a has affine dimension h and is parallel to Sh a; - Ld( Rd h, a Sh a) = 0, and the disintegration of Ld, Ld = Σh ∫ h a ηh(d a), w.r.t. Sh a has conditional probabilities h a Hh Sh a; - the sets Sh a are essentially cyclically connected and cannot be further decomposed. list The last point is used to prove the existence of an optimal transport map. The main idea is to recast the problem in (t,x) ∈ [0,∞] × Rd with an 1-homogeneous norm c(t,x) := t c(- xt) and to extend the regularity estimates of biadan to this case.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.