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.
The quadratic Wasserstein space is complete
Statement
Assume the Axiom of Choice. The metric space is complete: every -Cauchy sequence converges in to an element of .
Statement references
The Euclidean quadratic Wasserstein space
The quadratic Wasserstein distance is a metric
Gluing two Euclidean couplings
Optimal quadratic couplings exist and their cost is weakly lower semicontinuous
Prokhorov tightness theorem on polish spaces
Minkowski's integral inequality
Monotone convergence for the integral
Weakly convergent sequences are tight
Tight family of probability measures
Polish spaces are separable completely metrizable spaces
A complete, totally bounded metric space is compact, proved from countable choice used exactly once
AC implies DC implies countable choice
The Axiom of Countable Choice ()
Change of variables for expectation
Expectation of a nonnegative or integrable random variable
Santambrogio, Optimal Transport for Applied Mathematicians, Chapter 5
Facts & Assumptions
Given: AC and a -Cauchy sequence in .
The function is a metric under AC; any two consecutive laws have an optimal coupling, and two couplings with a common marginal can be glued under AC. The quadratic Wasserstein distance is a metric Optimal quadratic couplings exist and their cost is weakly lower semicontinuous Gluing two Euclidean couplings
Borel probabilities on Polish spaces are tight; Prokhorov's theorem extracts a weakly convergent subsequence from a tight sequence under AC. Weakly convergent sequences are tight Tight family of probability measures Prokhorov tightness theorem on polish spaces Polish spaces are separable completely metrizable spaces The Axiom of Choice AC implies DC implies countable choice The Axiom of Countable Choice () The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Scalar Minkowski's inequality holds in ; for Euclidean-valued , the pointwise triangle inequality gives , so scalar Minkowski applied to gives . Cauchy--Schwarz bounds first moments by second moments on a probability space, and Fatou's lemma holds for nonnegative measurable functions. Minkowski's integral inequality Cauchy–Schwarz: , with equality exactly for dependent pairs Fatou's lemma
Integrals of increasing nonnegative functions converge to the integral of their pointwise limit; pushforward integration satisfies for nonnegative measurable . Monotone convergence for the integral Change of variables for expectation Expectation of a nonnegative or integrable random variable
A complete totally bounded metric space is compact under Countable Choice; AC supplies Countable Choice. A complete, totally bounded metric space is compact, proved from countable choice used exactly once The Axiom of Choice AC implies DC implies countable choice The Axiom of Countable Choice ()
Weak convergence is convergence against bounded continuous tests; continuous coordinate projections preserve it by composition of tests, and a probability law has a unique weak limit. Weak convergence of borel probability measures Weak limits are unique
If is a Borel probability law on a Polish space and is Borel into a Polish space, define ; preimages show this is a Borel probability law and that coordinate marginals compose with the corresponding coordinate maps. Borel probability law on a polish space Measures on sigma-algebras
Proof
For each integer , the Cauchy property gives a threshold N_k such that whenever . Set and recursively . Then and . By AC choose an optimal coupling of these consecutive laws for each k using [F1].
Put , the set of sequences of Euclidean vectors indexed by positive integers, and equip with . This metric induces the product topology: each coordinate projection is continuous from the bound on its summand, and a product neighborhood restricting finitely many coordinates contains a sufficiently small D-ball. Conversely, given a D-ball radius, make the geometric tail less than half that radius and restrict the finitely many remaining coordinates so their summands total less than the other half; this gives a product neighborhood inside the D-ball. A D-Cauchy sequence is Cauchy in each coordinate, so coordinate completeness gives a limit in S; bounding the first finitely many coordinate terms and then the geometric tail proves convergence in D. Sequences of rational vectors which are zero after finitely many coordinates form a countable dense subset, since the tail is arbitrarily small and each of finitely many coordinates can be approximated by rationals. Thus S is complete and separable, hence Polish by definition.
Set , the probability on the first two coordinates. For , assume is a probability on coordinates with adjacent pair marginals and last marginal . Regard it as a law on , and regard as a law on ; they have the common second/first marginal . The gluing statement [F1] gives on coordinates preserving all earlier adjacent marginals and adding . Let send to ; this map is continuous for the product topology. Define , that is, for Borel . By [F7] it is a Borel probability, and its first coordinates have law while every later coordinate equals zero.
The th marginal of any is either (when ) or . Each fixed probability is tight by [F2]; AC chooses a compact containing zero with . Countable subadditivity gives for every . The product is compact in : it is closed and complete, and it is totally bounded because for any radius one first makes the metric tail small and then takes finite nets in the finitely many compact coordinates; [F5] applies. Hence is tight. By [F2] and Prokhorov, a subsequence converges weakly to a probability on .
For fixed , all sufficiently late have their coordinate marginal equal to . The coordinate projection is continuous, so the projected laws of converge weakly to the corresponding marginal of ; because they are eventually exactly , uniqueness of weak limits [F6] shows that this marginal is . Let be the coordinate maps on . By [F4] and the pair marginal identity, Therefore by Cauchy–Schwarz. Monotone convergence [F4] shows , so this sum is finite almost everywhere. The convergence set is Borel; its pointwise limit there, extended by zero on the complement, is a Borel map .
Minkowski [F3] gives, for , . Fatou's lemma [F3] as yields . Since has law , the same inequality at and Minkowski imply . Let , a Borel probability by [F7]. The map is Borel, so its pushforward is a Borel probability by [F7]; its marginals are the laws of and , namely and . Thus , and this joint law is a coupling, so The original Cauchy sequence converges to the same limit: for any , choose n large enough that the displayed tail bound is below and exceeds the Cauchy threshold for ; then for all sufficiently large m and apply the triangle inequality [F1].
Depends on
- The Euclidean quadratic Wasserstein space
- The quadratic Wasserstein distance is a metric
- Gluing two Euclidean couplings
- Optimal quadratic couplings exist and their cost is weakly lower semicontinuous
- Prokhorov tightness theorem on polish spaces
- Minkowski's integral inequality
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Fatou's lemma
- Monotone convergence for the integral
- Weakly convergent sequences are tight
- Tight family of probability measures
- Polish spaces are separable completely metrizable spaces
- A complete, totally bounded metric space is compact, proved from countable choice used exactly once
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Complete metric space: every Cauchy sequence converges in the space
- Finite $\varepsilon$-net and totally bounded metric space
- The Axiom of Choice
- AC implies DC implies countable choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Weak convergence of borel probability measures
- Weak limits are unique
- Change of variables for expectation
- Expectation of a nonnegative or integrable random variable
- Borel probability law on a polish space
- Measures on sigma-algebras
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
115 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)