How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Optimal quadratic couplings exist and their cost is weakly lower semicontinuous
Statement
Assume the Axiom of Choice. For every pair , the infimum of over couplings of and is finite and is attained. If , converges narrowly to , and converges narrowly to , then
Statement references
The Euclidean quadratic Wasserstein space
Weak convergence of borel probability measures
Polish spaces are separable completely metrizable spaces
Prokhorov tightness theorem on polish spaces
Weakly convergent sequences are tight
Monotone convergence for the integral
AC implies DC implies countable choice
The Axiom of Countable Choice ()
Tight family of probability measures
The product measure of two sigma-finite measure spaces
Expectation of a nonnegative or integrable random variable
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Santambrogio, Optimal Transport for Applied Mathematicians, Chapter 5
Facts & Assumptions
Given: AC; for the attainment claim, ; for the lower-semicontinuity claim, with narrowly convergent sequences and .
A product of two Borel probabilities is a Borel probability with the specified marginals; is Polish. The product measure of two sigma-finite measure spaces For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique Polish spaces are separable completely metrizable spaces
A narrowly convergent sequence of Borel probabilities on a Polish space is tight. A tight sequence on a Polish space has a weakly convergent subsequence under AC. Weakly convergent sequences are tight Tight family of probability measures Prokhorov tightness theorem on polish spaces The Axiom of Choice AC implies DC implies countable choice The Axiom of Countable Choice ()
Coordinate projections are continuous, so weak convergence of joint laws implies weak convergence of their coordinate marginals; a probability law is determined by its values on measurable rectangles. Weak convergence of borel probability measures Weak limits are unique
For a nonnegative measurable function, integrals of an increasing sequence converge to the integral of its pointwise limit. Monotone convergence for the integral Expectation of a nonnegative or integrable random variable
The product coupling has finite quadratic cost because and both marginals have finite second moment. The corresponding iterated integrals are justified by Tonelli. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Proof
The product probability is a coupling by [F1]. The inequality in [F5] gives its cost at most . Thus the coupling set is nonempty and its cost infimum is finite and nonnegative.
For each integer , by AC choose a coupling with . Their marginals are the fixed probabilities . For any , tightness of each marginal supplies compact sets with and . Then for every . Hence is tight on the Polish space ; [F2] gives a subsequence . By [F3] its marginals are .
For , the function is bounded and continuous. Weak convergence therefore gives . Letting and using [F4] yields . Since is a coupling and is the infimum, equality holds; the infimum is attained.
Put . If , the asserted inequality is immediate. Otherwise choose a subsequence indexed by integers , denoted , along which the costs converge to , and choose by AC couplings with costs at most . The marginal sequences are tight by [F2]; choosing compact sets for each coordinate and applying the same union bound as in step 2.1 proves is tight on . A further subsequence converges weakly to a probability , whose marginals are by [F3]. For every , bounded continuity of gives . Monotone convergence [F4] then gives . The definition of and the coupling property imply .
Depends on
- The Euclidean quadratic Wasserstein space
- Weak convergence of borel probability measures
- Polish spaces are separable completely metrizable spaces
- Prokhorov tightness theorem on polish spaces
- Weakly convergent sequences are tight
- Monotone convergence for the integral
- The Axiom of Choice
- AC implies DC implies countable choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Tight family of probability measures
- Weak limits are unique
- The product measure of two sigma-finite measure spaces
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
- Expectation of a nonnegative or integrable random variable
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Used by
- Generalized W2 geodesics and strong Wasserstein subgradients Definition
- Derivative of squared W2 distance along a finite-action continuity equation Lemma
- The localized feature energy is semiconvex along generalized geodesics Lemma
- W2 convergence implies weak convergence of homogeneous projections Lemma
- AC2 curves admit a unique minimum-action velocity field Theorem
- Finite-particle flows converge to the measure-valued flow in W2 Theorem
- The quadratic Wasserstein distance is a metric Theorem
- The quadratic Wasserstein space is complete Theorem
- The topology of W2 is narrow convergence plus uniform second-moment tails Theorem
Dependency tree · two levels
64 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Filippo Santambrogio, Optimal Transport for Applied Mathematicians, Chapter 5, §§5.1–5.3 (standard reference, not scraped)
- Lénaïc Chizat and Francis Bach, On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport, Appendix A.1, PDF pp. 12–13 (standard reference, not scraped)