TheoremBase

Mean-Square Stability of the Optimal Map on the Space of Square-Integrable Random Vectors

For a uniquely mapped pair, composing a random vector of the first law with the optimal map gives a square-integrable random vector of the second law, and along any pair of sequences of the two laws whose mean-square distances tend to the Wasserstein distance the composition approaches the second sequence in mean square.

Statement

In the setting of The Wasserstein Space and Its Lift to Square-Integrable Random Vectors: Standing Notation, let μ,ν∈P2(Rd)\mu,\nu\in\mathcal{P}_{2}(\mathbb{R}^{d}), suppose that the ordered pair (μ,ν)(\mu,\nu) is uniquely mapped, and let T:Rd→RdT:\mathbb{R}^{d}\to\mathbb{R}^{d} be an optimal map from μ\mu to ν\nu.

1. (Composition with the optimal map) Let X∈L2(Ω;Rd)X\in L^{2}(\Omega;\mathbb{R}^{d}) with L(X)=μ\mathcal{L}(X)=\mu. For every representative of XX the composition T∘XT\circ X is a random vector, its class in L2(Ω;Rd)L^{2}(\Omega;\mathbb{R}^{d}) does not depend on the representative and is again written T∘XT\circ X, and

∥T∘X∥L22=M2(ν),L(T∘X)=ν,\lVert T\circ X\rVert_{L^{2}}^{2}=M_{2}(\nu),\qquad\mathcal{L}(T\circ X)=\nu,

where M2(ν)M_{2}(\nu) is the second moment of ν\nu.

2. (Mean-square stability) Let (Xn)n∈N(X_{n})_{n\in\mathbb{N}} and (Yn)n∈N(Y_{n})_{n\in\mathbb{N}} be sequences in L2(Ω;Rd)L^{2}(\Omega;\mathbb{R}^{d}) with L(Xn)=μ\mathcal{L}(X_{n})=\mu and L(Yn)=ν\mathcal{L}(Y_{n})=\nu for every n∈Nn\in\mathbb{N}, and suppose that the sequence (∥Xn−Yn∥L2)n∈N(\lVert X_{n}-Y_{n}\rVert_{L^{2}})_{n\in\mathbb{N}} converges to W2(μ,ν)W_{2}(\mu,\nu). Then (∥T∘Xn−Yn∥L2)n∈N(\lVert T\circ X_{n}-Y_{n}\rVert_{L^{2}})_{n\in\mathbb{N}} converges to 00.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…