Uniqueness of optimal plans for multi-marginal mass transport problems via a reduction argument
Abstract
For a family of probability spaces \(Xk,BXk,μk)\k=1N and a cost function c: X1×·s× XN R we consider the Monge-Kantorovich problem align*MKMONKANT ∈fλ∈(μ1,…,μN)∫Πk=1N Xkc\,dλ. align* Then for each ordered subset P=\i1,…,ip\⊂neq\1,...,N\ with p≥ 2 we create a new cost function cP corresponding to the original cost function c defined on Πk=1p Xik. This new cost function cP enjoys many of the features of the original cost c while it has the property that any optimal plan λ of MONKANT restricted to Πk=1p Xik is also an optimal plan to the problem align*RMKREDMONKANT ∈fτ∈(μi1,…μip)∫Πk=1p XikcP\,dτ. align* Our main contribution in this paper is to show that, for appropriate choices of index set P, one can recover the optimal plans of MONKANT from REDMONKANT. In particular, we study situations in which the problem MONKANT admits a unique solution depending on the uniqueness of the solution for the lower marginal problems of the form REDMONKANT. This allows us to prove many uniqueness results for multi-marginal problems when the unique optimal plan is not necessarily induced by a map. To this end, we extensively benefit from disintegration theorems and the c-extremality notions. Moreover, by employing this argument, besides recovering many standard results on the subject including the pioneering work of Gangbo-\'Swi ech, several new applications will be demonstrated to evince the applicability of this argument.
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.