Table of Contents
Fetching ...

On the existence of $L^p$-Optimal Transport maps for norms on $\mathbb{R}^N$

Guoxi Liu, Mattia Magnabosco, Yicheng Xia

Abstract

In this paper, we prove existence of $L^p$-optimal transport maps with $p \in (1,\infty)$ in a class of branching metric spaces defined on $\mathbb{R}^N$. In particular, we introduce the notion of cylinder-like convex function and we prove an existence result for the Monge problem with cost functions of the type $c(x, y) = f(g(y - x))$, where $f: [0, \infty) \rightarrow [0, \infty)$ is an increasing strictly convex function and $g: \mathbb{R}^N \rightarrow [0, \infty)$ is a cylinder-like convex function. When specialised to cylinder-like norm, our results shows existence of $L^p$-optimal transport maps for several "branching'" norms, including all norms in $\mathbb{R}^2$ and all crystalline norms.

On the existence of $L^p$-Optimal Transport maps for norms on $\mathbb{R}^N$

Abstract

In this paper, we prove existence of -optimal transport maps with in a class of branching metric spaces defined on . In particular, we introduce the notion of cylinder-like convex function and we prove an existence result for the Monge problem with cost functions of the type , where is an increasing strictly convex function and is a cylinder-like convex function. When specialised to cylinder-like norm, our results shows existence of -optimal transport maps for several "branching'" norms, including all norms in and all crystalline norms.

Paper Structure

This paper contains 5 sections, 9 theorems, 64 equations.

Key Result

Proposition 1.1

Let $c: \mathbb{R}^N \times \mathbb{R}^N \to [0,\infty]$ be a lower semicontinuous cost function. Then, every optimal transport plan $\pi\in \mathop{\mathrm{OptPlans}}\nolimits(\mu,\nu)$ such that $\int c \, \mathrm d \pi<\infty$ is concentrated in a $c$-cyclically monotone set.

Theorems & Definitions (24)

  • Proposition 1.1
  • Definition 2.1
  • Remark 2.2
  • Theorem 2.3
  • Proof
  • Corollary 2.4
  • Proof
  • Corollary 2.5
  • Remark 2.6
  • Definition 3.1
  • ...and 14 more