Solutions to multi-marginal optimal transport problems concentrated on several graphs

TL;DR

This paper investigates solutions to multi-marginal optimal transport problems that are concentrated on multiple graphs, providing conditions for their structure, examples including Coulomb cost, and analyzing uniqueness and extremality properties.

Contribution

It introduces new conditions on cost functions that determine whether solutions concentrate on finitely or countably many graphs, and explores their implications for solution uniqueness and extremality.

Findings

Conditions ensuring solutions concentrate on finitely or countably many graphs

Examples including Coulomb cost in one dimension satisfying these conditions

Results on the uniqueness and extremality of optimal measures

Abstract

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.