TheoremBase

Law invariance cancels U and V against any other pair with the same laws, leaving the mean-square distance of the maximising pair as a lower bound of all realised distances; on a rich space their infimum is the Wasserstein distance, and the cost identity for pairs identifies the law of the pair as an optimal coupling.

Proof

Each result cited is universally quantified over the data in its own statement. Put μ=L(X0)\mu=\mathcal{L}(X_{0}) and ν=L(Y0)\nu=\mathcal{L}(Y_{0}), both in P2(Rd)\mathcal{P}_{2}(\mathbb{R}^{d}) by The Wasserstein Space and Its Lift to Square-Integrable Random Vectors: Standing Notation (v), and let D(μ,ν)={∥X−Y∥L2:X∼μ, Y∼ν}D(\mu,\nu)=\{\lVert X-Y\rVert_{L^{2}}:X\sim\mu,\ Y\sim\nu\} be the set of The Wasserstein Distance and the Mean-Square Distance of Random Vectors (iv), which is in force through The Wasserstein Space and Its Lift to Square-Integrable Random Vectors: Standing Notation (v); since (Ω,F,P)(\Omega,\mathcal{F},P) is rich, that clause gives that D(μ,ν)D(\mu,\nu) is nonempty, bounded below, and has greatest lower bound inf⁡D(μ,ν)=W2(μ,ν)\inf D(\mu,\nu)=W_{2}(\mu,\nu). Norms in L2(Ω;Rd)L^{2}(\Omega;\mathbb{R}^{d}) are nonnegative by Real Inner Product Spaces (ii).

Claim 1. Put r0=∥X0−Y0∥L2r_{0}=\lVert X_{0}-Y_{0}\rVert_{L^{2}}; then r0∈D(μ,ν)r_{0}\in D(\mu,\nu). Let s∈D(μ,ν)s\in D(\mu,\nu), say s=∥X−Y∥L2s=\lVert X-Y\rVert_{L^{2}} with L(X)=μ\mathcal{L}(X)=\mu and L(Y)=ν\mathcal{L}(Y)=\nu. By Law-Invariant Function on the Space of Square-Integrable Random Vectors (i), U(X)=U(X0)U(X)=U(X_{0}) and V(Y)=V(Y0)V(Y)=V(Y_{0}), so the hypothesis of the lemma for this pair reads

U(X0)−V(Y0)−α s2≤U(X0)−V(Y0)−α r02.U(X_{0})-V(Y_{0})-\alpha\,s^{2}\le U(X_{0})-V(Y_{0})-\alpha\,r_{0}^{2}.

By claim 3 of Elementary Arithmetic in an Ordered Field this is equivalent to 0≤α s2−α r020\le\alpha\,s^{2}-\alpha\,r_{0}^{2}, that is, to α r02≤α s2\alpha\,r_{0}^{2}\le\alpha\,s^{2} by the same claim. Since α\alpha is positive, α−1\alpha^{-1} exists and 0≤α−10\le\alpha^{-1} by claim 4 of Elementary Arithmetic in an Ordered Field, and multiplying by α−1\alpha^{-1} (claim 5 there) gives r02≤s2r_{0}^{2}\le s^{2}. As 0≤r00\le r_{0} and 0≤s0\le s, claim 2 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field yields r0≤sr_{0}\le s. Thus r0r_{0} is a lower bound of D(μ,ν)D(\mu,\nu), so r0≤inf⁡D(μ,ν)r_{0}\le\inf D(\mu,\nu) by Lower Bound and Greatest Lower Bound; and inf⁡D(μ,ν)≤r0\inf D(\mu,\nu)\le r_{0} because r0∈D(μ,ν)r_{0}\in D(\mu,\nu) and the infimum is a lower bound. By antisymmetry of the order of R\mathbb{R} (Real Hilbert Spaces: Standing Notation and Background (i)), r0=inf⁡D(μ,ν)=W2(μ,ν)r_{0}=\inf D(\mu,\nu)=W_{2}(\mu,\nu).

Claim 2. Fix representatives of X0X_{0} and Y0Y_{0}, again written X0,Y0X_{0},Y_{0}, and let π\pi be the law of their pairing (X0,Y0)(X_{0},Y_{0}). By Random Vectors: Coordinates, Functions, Pairs and Almost-Sure Equality (v), π\pi is a coupling of the laws of the two representatives, which are μ\mu and ν\nu by The Space of Square-Integrable Random Vectors (iv), with quadratic cost I(π)=E[∥X0−Y0∥2]I(\pi)=\mathbb{E}[\lVert X_{0}-Y_{0}\rVert^{2}]. The class X0−Y0X_{0}-Y_{0} has the pointwise difference of the chosen representatives as a representative, the additive inverse of the class of Y0Y_{0} being the class of (−1)Y0(-1)Y_{0} by Square-Integrable Random Vectors: Coordinates, Operations, Almost Sure Equality and the Mean-Square Form (v) and sums of classes being classes of pointwise sums by The Space of Square-Integrable Random Vectors (ii), so by The Space of Square-Integrable Random Vectors (iii) the norm ∥X0−Y0∥L2\lVert X_{0}-Y_{0}\rVert_{L^{2}} is the nonnegative square root of E[∥X0−Y0∥2]\mathbb{E}[\lVert X_{0}-Y_{0}\rVert^{2}], whence ∥X0−Y0∥L22=E[∥X0−Y0∥2]\lVert X_{0}-Y_{0}\rVert_{L^{2}}^{2}=\mathbb{E}[\lVert X_{0}-Y_{0}\rVert^{2}] by Existence and Uniqueness of the Nonnegative Square Root. Together with claim 1,

I(π)=∥X0−Y0∥L22=W2(μ,ν)2,I(\pi)=\lVert X_{0}-Y_{0}\rVert_{L^{2}}^{2}=W_{2}(\mu,\nu)^{2},

which is the defining identity of an optimal coupling, Optimal Coupling of Two Probability Measures with Finite Second Moment (i).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…