Solutions to multi-marginal optimal transport problems concentrated on several graphs∗
1 School of Mathematics and Statistics, Carleton University, Ottawa, Ontario, Canada K1S 5B6.
2 Department of Mathematical and Statistical Sciences, 632 CAB, University of Alberta, Edmonton, Alberta, Canada, T6G 2G1.
Received: 21 July 2015
Revised: 25 December 2015
Accepted: 28 December 2015
We study solutions to the multi-marginal Monge–Kantorovich problem which are concentrated on several graphs over the first marginal. We first present two general conditions on the cost function which ensure, respectively, that any solution must concentrate on either finitely many or countably many graphs. We show that local differential conditions on the cost, known to imply local d-rectifiability of the solution, are sufficient to imply a local version of the first of our conditions. We exhibit two examples of cost functions satisfying our conditions, including the Coulomb cost from density functional theory in one dimension. We also prove a number of results relating to the uniqueness and extremality of optimal measures. These include a sufficient condition on a collection of graphs for any competitor in the Monge–Kantorovich problem concentrated on them to be extremal, and a general negative result, which shows that when the problem is symmetric with respect to permutations of the variables, uniqueness cannot occur except under very special circumstances.
Mathematics Subject Classification: 49K20 / 49K30
Key words: Multi-marginal optimal transport / Moge–Kantorovich problem / extremal points of convex sets / m-twist / c-splitting set
B.P. is pleased to acknowledge the support of a University of Alberta start-up grant and National Sciences and Engineering Research Council of Canada Discovery Grant number 412779-2012. A. M. greatly acknowledges the support of a grant from the Natural Sciences and Engineering Research Council of Canada (417885-2013).
© EDP Sciences, SMAI 2017