The decomposition of optimal transportation problems with convex cost (1409.0515v1)
Abstract: Given a positive l.s.c. convex function $\mathtt c : \mathbb Rd \to \mathbb Rd$ and an optimal transference plane $\underline{\pi}$ for the transportation problem \begin{equation*} \int \mathtt c(x'-x) \pi(dxdx'), \end{equation*} we show how the results of \cite{biadan} on the existence of a \emph{Sudakov decomposition} for norm cost $\mathtt c= |\cdot|$ can be extended to this case. More precisely, we prove that there exists a partition of $\mathbb Rd$ into a family of disjoint sets ${Sh_\mathfrak a}{h,\mathfrak a}$ together with the projection ${Oh\mathfrak a}{h,\mathfrak a}$ on $\mathbb Rd$ of proper extremal faces of $\mathrm{epi}\, \mathtt c$, $h = 0,\dots,d$ and $\mathfrak a \in \mathfrak Ah \subset \mathbb R{d-h}$, such that - $Sh\mathfrak a$ is relatively open in its affine span, and has affine dimension $h$; \item $Oh_\mathfrak a$ has affine dimension $h$ and is parallel to $Sh_\mathfrak a$; - $\mathcal Ld(\mathbb Rd \setminus \cup_{h,\mathfrak a} Sh_\mathfrak a) = 0$, and the disintegration of $\mathcal Ld$, $\mathcal Ld = \sum_h \int \xih_\mathfrak a \etah(d\mathfrak a)$, w.r.t. $Sh_\mathfrak a$ has conditional probabilities $\xih_\mathfrak a \ll \mathcal Hh \llcorner_{Sh_\mathfrak a}$; - the sets $Sh_\mathfrak a$ are essentially cyclically connected and cannot be further decomposed. \end{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) \in [0,\infty] \times \mathbb Rd$ with an $1$-homogeneous norm $\bar{\mathtt c}(t,x) := t \mathtt c(- \frac{x}{t})$ and to extend the regularity estimates of \cite{biadan} to this case.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.