In the setting of optimal transport with N ≥ 2 marginals, a necessary condition for transport plans to be optimal is that they are c-cyclically monotone. For N = 2 there exist several proofs that in very general settings c-cyclical monotonicity is also sufficient for optimality, while for N ≥ 3 this is only known under strong conditions on c. Here we give a counterexample which shows that c-cylclical monotonicity is in general not sufficient for optimality if N ≥ 3. Comparison with the N = 2 case shows how the main proof strategies valid for the case N = 2 might fail for N ≥ 3. We leave open the question of what is the optimal condition on c under which c-cyclical monotonicity is sufficient for optimality. The new concept of an N-flow seems to be helpful for understanding the counterexample: our construction is based on the absence of finite-support closed N-flows in the set where our counterexample cost c is finite. To follow this idea we formulate a Smirnov-type decomposition for N-flows.
Mots-clés : multimarginal optimal transport, cyclical monotonicity, kirchhoff law, n-graphs, Smirnov decomposition, counterexample
@article{COCV_2020__26_1_A120_0, author = {Petrache, Mircea}, title = {Cyclically monotone non-optimal $N$\protect\emph{}-marginal transport plans and {Smirnov-type} decompositions for $N$\protect\emph{}-flows}, journal = {ESAIM: Control, Optimisation and Calculus of Variations}, publisher = {EDP-Sciences}, volume = {26}, year = {2020}, doi = {10.1051/cocv/2020050}, mrnumber = {4188821}, zbl = {1459.49033}, language = {en}, url = {http://www.numdam.org/articles/10.1051/cocv/2020050/} }
TY - JOUR AU - Petrache, Mircea TI - Cyclically monotone non-optimal $N$-marginal transport plans and Smirnov-type decompositions for $N$-flows JO - ESAIM: Control, Optimisation and Calculus of Variations PY - 2020 VL - 26 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/cocv/2020050/ DO - 10.1051/cocv/2020050 LA - en ID - COCV_2020__26_1_A120_0 ER -
%0 Journal Article %A Petrache, Mircea %T Cyclically monotone non-optimal $N$-marginal transport plans and Smirnov-type decompositions for $N$-flows %J ESAIM: Control, Optimisation and Calculus of Variations %D 2020 %V 26 %I EDP-Sciences %U http://www.numdam.org/articles/10.1051/cocv/2020050/ %R 10.1051/cocv/2020050 %G en %F COCV_2020__26_1_A120_0
Petrache, Mircea. Cyclically monotone non-optimal $N$-marginal transport plans and Smirnov-type decompositions for $N$-flows. ESAIM: Control, Optimisation and Calculus of Variations, Tome 26 (2020), article no. 120. doi : 10.1051/cocv/2020050. http://www.numdam.org/articles/10.1051/cocv/2020050/
[1] Fitzpatrick functions, cyclic monotonicity and Rockafellar’s antiderivative. Nonlinear Anal. Theory Methods Appl. 66 (2007) 1198–1223. | DOI | MR | Zbl
, , , and ,[2] A class of multi-marginal -cyclically monotone sets with explicit -splitting potentials. J. Math. Anal. Appl. 461 (2018) 333–348. | DOI | MR | Zbl
, and ,[3] Cyclical monotonicity and the ergodic theorem. Ergodic Theory Dyn. Syst. 35 (2015) 710–713. | DOI | MR | Zbl
,[4] On optimality of -cyclically monotone transference plans. C. R. Math. Acad. Sci. Paris 348 (2010) 613–618. | DOI | MR | Zbl
and ,[5] A continuous model of transportation revisited. J. Math. Sci. 196 (2014) 119–137. | DOI | MR | Zbl
and ,[6] Optimal transport with Coulomb cost. Approximation and duality. ESAIM: M2AN 49 1643–1657. | DOI | Numdam | MR | Zbl
[7] On -cyclical monotonicity for optimal transport problem with Coulomb cost. Euro. J. Appl. Math. 30 (2019) 1210–1219. | DOI | MR | Zbl
,[8] Breaking the curse of dimension in multi-marginal Kantorovich optimal transport on finite state spaces. SIAM J. Math. Anal. 50 (2018) 3996–4019. | DOI | MR | Zbl
and ,[9] $C$-cyclical monotonicity as a sufficient criterion for optimality in the multimarginal Monge-Kantorovich problem. Proc. AMS 146 (2018) 4735–4740. | DOI | MR | Zbl
,[10] Decomposition of acyclic normal currents in a metric space. J. Funct. Anal. 263 (2012) 3358–3390. | DOI | MR | Zbl
and[11] On the sufficiency of -cyclical monotonicity for the optimality of transport plans. Math. Z. 258 (2008) 667–690. | DOI | MR | Zbl
,[12] Characterization of the subdifferentials of convex functions. Pacific J. Math. 17 (1966) 497–510. | DOI | MR | Zbl
,[13] Characterization of optimal transport plans for the Monge-Kantorovich problem. Proc. Amer. Math. Soc. 137 (2009) 519–529. | DOI | MR | Zbl
and ,[14] Decomposition fo solenoidal vector charges into elementary solenoids and the structure of normal one-dimensional currents. St. Petersburg Math J. 5 (1994) 841–867. | MR | Zbl
,[15] Optimal Transport: Old and New. Springer, Berlin (2019). | MR | Zbl
,Cité par Sources :
The author would like to thank the anonymous referees for their thorough reading and their comments, which helped improve the paper. The author acknowledges support from the FONDECYT Iniciacion en Investigacion 2017 grant N. 11170264.