Proof of A -Displacement Convex Penalty Pair Has a -Monotone Score Along Optimal Couplings
lemmalem:displacement-convex-pair-monotone-2026dThe swap of an optimal coupling is optimal, so the convexity inequality holds along the coupling from each measure to the other; adding the two cancels the penalties and leaves the monotonicity. At uniquely mapped pairs the optimal coupling is induced by the optimal map, its swap by the reverse optimal map, and the displacement pairings become inner products with the optimal displacements.
Each result cited is universally quantified over the data in its own statement. Write .
Step 1 (the swap of an optimal coupling is optimal). Let be optimal, so by Optimal Coupling of Two Probability Measures with Finite Second Moment §optimal. By Couplings on Euclidean Space: Product Coupling, Swap, Finiteness of the Cost, Push-Forward Couplings, Modifying One Marginal, Quantisation, Gluing over a Finitely Supported Measure, and the Lipschitz Bound §swap, and , and by The Quadratic Wasserstein Distance is a Metric on the Wasserstein Space §symmetry. Hence is an optimal coupling of and , again by Optimal Coupling of Two Probability Measures with Finite Second Moment §optimal.
Step 2 (claim 1). Let be as in Step 1. Since by Penalty Pairs on the Wasserstein Space: the Penalty, Its Score, and Their Domains §pair, the -displacement convexity of -Displacement Convexity of a Penalty Pair on the Wasserstein Space §convex applies to the measure , the measure and the optimal coupling , and also, by Step 1, to the measure , the measure and the optimal coupling :
By claim 3 of Elementary Arithmetic in an Ordered Field the differences of the right and left sides are nonnegative, so their sum is nonnegative by claim 2 there. In that sum and cancel, and because times the multiplicative inverse of is ; so
and claim 3 of Elementary Arithmetic in an Ordered Field turns this into claim 1.
Step 3 (claim 2). Let and be as in claim 2. The coupling belongs to and is optimal, and belongs to and is optimal, both by Optimal Transport Maps and Uniquely Mapped Pairs of Probability Measures §map. By Step 1, is an optimal coupling of and . Since is uniquely mapped, there is an optimal map from to such that every optimal coupling of and equals (Optimal Transport Maps and Uniquely Mapped Pairs of Probability Measures §uniquely-mapped); applying this to both optimal couplings just named,
Next, by The Optimal Map as a Square-Integrable Vector Field: Integrability, Transport Cost and Uniqueness of the Class §cost, and for every by claim 5 of Elementary Properties of the Euclidean Norm on (with the scalar ), so . Hence The Displacement Pairing of a Square-Integrable Vector Field Along a Coupling §displacement applies to and gives . The class is , the pointwise relation passing to classes by Square-Integrable Random Vectors: Coordinates, Operations, Almost Sure Equality and the Mean-Square Form §vector-space; by linearity of the inner product of in its second argument,
The same argument with , and in place of , and gives . Claim 1, applied to the optimal coupling with , now reads
which is claim 2.
Loading…
Prerequisites
d9413f1e-a343-463c-aff4-5c27273cdd5e