TheoremBase

λ\lambda-Displacement Convexity of a Penalty Pair on the Wasserstein Space

A penalty pair is lambda-displacement convex if, along every optimal coupling from a measure of the score domain to a measure of the penalty domain, the penalty lies above its first-order expansion given by the displacement pairing of the score, plus lambda/2 times the transport cost; it is displacement convex when lambda is zero. Stated along couplings, without a probability space.

Statement

In the setting of The Intrinsic Calculus on the Wasserstein Space: Standing Notation, let (D,DΣ,E,Σ)(\mathcal{D},\mathcal{D}_{\Sigma},\mathcal{E},\Sigma) be a penalty pair on P2(Rd)\mathcal{P}_{2}(\mathbb{R}^{d}) and let λ∈R\lambda\in\mathbb{R}. For μ∈DΣ\mu\in\mathcal{D}_{\Sigma} one has μ∈D\mu\in\mathcal{D}, so that E(μ)\mathcal{E}(\mu) is a real number, and the score Σ(μ)\Sigma(\mu) lies in TμT_{\mu}, hence in L2(μ;Rd)L^{2}(\mu;\mathbb{R}^{d}), both by Penalty Pairs on the Wasserstein Space: the Penalty, Its Score, and Their Domains (i); so for ν∈P2(Rd)\nu\in\mathcal{P}_{2}(\mathbb{R}^{d}) and π∈Π(μ,ν)\pi\in\Pi(\mu,\nu) the displacement pairing J(Σ(μ),π)\mathcal{J}(\Sigma(\mu),\pi) and the cost I(π)I(\pi) are the real numbers fixed there. Optimal couplings are those of Wasserstein Spaces, Random Vectors, Vector Fields and Symmetric Matrices in Every Dimension: Standing Notation (i), and λ2\tfrac{\lambda}{2} is the product of λ\lambda with the multiplicative inverse of 22, which exists by claim 8 of Elementary Order Arithmetic in an Ordered Field.

(λ\lambda-displacement convexity) The penalty pair (D,DΣ,E,Σ)(\mathcal{D},\mathcal{D}_{\Sigma},\mathcal{E},\Sigma) is λ\lambda-displacement convex if

E(μ)+J(Σ(μ),π)+λ2 I(π) ≤ E(ν)\mathcal{E}(\mu)+\mathcal{J}(\Sigma(\mu),\pi)+\tfrac{\lambda}{2}\,I(\pi)\ \le\ \mathcal{E}(\nu)

for every μ∈DΣ\mu\in\mathcal{D}_{\Sigma}, every ν∈D\nu\in\mathcal{D} and every optimal coupling π∈Π(μ,ν)\pi\in\Pi(\mu,\nu). It is displacement convex if it is 00-displacement convex.

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…