Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 (P2(Rd),W2) is complete: every W2-Cauchy sequence converges in W2 to an element of P2(Rd).

Statement references

Facts & Assumptions

Given: AC and a W2-Cauchy sequence (μn)n≥1 in P2(Rd).

[F1]

The function W2 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

[F3]

Scalar Minkowski's inequality holds in L2; for Euclidean-valued U,V, the pointwise triangle inequality gives ∣U+V∣≤∣U∣+∣V∣, so scalar Minkowski applied to ∣U∣,∣V∣ gives ∥U+V∥2≤∥U∥2+∥V∥2. 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: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs Fatou's lemma

[F4]

Integrals of increasing nonnegative functions converge to the integral of their pointwise limit; pushforward integration satisfies ∫f d(T#η)=∫f(T(ω))dη(ω) for nonnegative measurable f. Monotone convergence for the integral Change of variables for expectation Expectation of a nonnegative or integrable random variable

[F6]

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

[F7]

If P is a Borel probability law on a Polish space and F is Borel into a Polish space, define F#P(B)=P(F−1(B)); 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

1.1givenF1construct

For each integer k≥1, the Cauchy property gives a threshold N_k such that W2(μn,μm)<2−k whenever n,m≥Nk. Set n1=N1 and recursively nk+1=max⁡{Nk+1,nk+1}. Then nk<nk+1 and W2(μnk,μnk+1)≤2−k. By AC choose an optimal coupling πk of these consecutive laws for each k using [F1].

1.2def. Polish space

Put S=(Rd){1,2,…}, the set of sequences of Euclidean vectors indexed by positive integers, and equip S with D(x,y)=∑j≥12−jmin⁡(1,∣xj−yj∣). 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.

2.1F1F7step 1.1

Set Q1=π1, the probability on the first two coordinates. For N≥2, assume QN−1 is a probability on coordinates 1,…,N with adjacent pair marginals π1,…,πN−1 and last marginal μnN. Regard it as a law on Rd(N−1)×Rd, and regard πN as a law on Rd×Rd; they have the common second/first marginal μnN. The gluing statement [F1] gives QN on coordinates 1,…,N+1 preserving all earlier adjacent marginals and adding πN. Let IN:(Rd)N+1→S send (x1,…,xN+1) to (x1,…,xN+1,0,0,…); this map is continuous for the product topology. Define ηN=(IN)#QN, that is, ηN(B)=QN(IN−1(B)) for Borel B⊂S. By [F7] it is a Borel probability, and its first N+1 coordinates have law QN while every later coordinate equals zero.

2.2F2F5step 1.2

The jth marginal of any ηN is either μnj (when N+1≥j) or δ0. Each fixed probability μnj is tight by [F2]; AC chooses a compact Kj⊂Rd containing zero with μnj(Kjc)<ε2−j−1. Countable subadditivity gives ηN((∏jKj)c)≤∑j≥1ε2−j−1<ε for every N. The product K=∏jKj is compact in S: 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 (ηN) is tight. By [F2] and Prokhorov, a subsequence converges weakly to a probability η on S.

3.1F2F3F4F6F7step 1.1step 2.2

For fixed k, all sufficiently late ηN have their (k,k+1) coordinate marginal equal to πk. The coordinate projection S→R2d is continuous, so the projected laws of ηN converge weakly to the corresponding marginal of η; because they are eventually exactly πk, uniqueness of weak limits [F6] shows that this marginal is πk. Let Xk(x)=xk be the coordinate maps on (S,η). By [F4] and the pair marginal identity, ∫S∣Xk+1−Xk∣2dη=∫∣x−y∣2dπk=W2(μnk,μnk+1)2≤4−k. Therefore ∫∣Xk+1−Xk∣dη≤2−k by Cauchy–Schwarz. Monotone convergence [F4] shows ∫∑k∣Xk+1−Xk∣dη≤∑k2−k<∞, 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 X∞:S→Rd.

4.1F1F3F4F7step 3.1∎

Minkowski [F3] gives, for m>n, ∥Xm−Xn∥L2(η)≤∑k=nm−1∥Xk+1−Xk∥2≤∑k=nm−12−k. Fatou's lemma [F3] as m→∞ yields ∥X∞−Xn∥2≤∑k=n∞2−k. Since X1 has law μn1∈P2, the same inequality at n=1 and Minkowski imply ∫∣X∞∣2dη<∞. Let μ∞=(X∞)#η, a Borel probability by [F7]. The map x↦(Xn(x),X∞(x)) is Borel, so its pushforward is a Borel probability by [F7]; its marginals are the laws of Xn and X∞, namely μnn and μ∞. Thus μ∞∈P2, and this joint law is a coupling, so W2(μnn,μ∞)≤∥Xn−X∞∥2≤∑k=n∞2−k⟶0. The original Cauchy sequence converges to the same limit: for any ϵ>0, choose n large enough that the displayed tail bound is below ϵ/2 and nn exceeds the Cauchy threshold for ϵ/2; then W2(μm,μnn)<ϵ/2 for all sufficiently large m and apply the triangle inequality [F1].

Depends on

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