Alphabeta Math
PropositionStatement: 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.

Optimal quadratic couplings exist and their cost is weakly lower semicontinuous

Statement

Assume the Axiom of Choice. For every pair μ,ν∈P2(Rd), the infimum of ∫∣x−y∣2dπ(x,y) over couplings π of μ and ν is finite and is attained. If μn,νn,μ,ν∈P2(Rd), μn converges narrowly to μ, and νn converges narrowly to ν, then W2(μ,ν)2≤lim inf⁡n→∞W2(μn,νn)2.

Statement references

Facts & Assumptions

Given: AC; for the attainment claim, μ,ν∈P2(Rd); for the lower-semicontinuity claim, μn,νn,μ,ν∈P2(Rd) with narrowly convergent sequences μn⇒μ and νn⇒ν.

[F2]

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 (ACω)

[F3]

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

[F4]

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

[F5]

The product coupling has finite quadratic cost because ∣x−y∣2≤2∣x∣2+2∣y∣2 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

1.1givenF1F5

The product probability μ⊗ν is a coupling by [F1]. The inequality in [F5] gives its cost at most 2∫∣x∣2dμ+2∫∣y∣2dν<∞. Thus the coupling set is nonempty and its cost infimum c is finite and nonnegative.

2.1givenF1F2F3step 1.1

For each integer n≥1, by AC choose a coupling πn with ∫∣x−y∣2dπn≤c+1/n. Their marginals are the fixed probabilities μ,ν. For any ε>0, tightness of each marginal supplies compact sets K1,K2 with μ(K1c)<ε/2 and ν(K2c)<ε/2. Then πn((K1×K2)c)≤μ(K1c)+ν(K2c)<ε for every n. Hence (πn) is tight on the Polish space R2d; [F2] gives a subsequence πnj⇒π. By [F3] its marginals are μ,ν.

3.1F1F3F4step 2.1

For N≥1, the function cN(x,y)=min⁡{∣x−y∣2,N} is bounded and continuous. Weak convergence therefore gives ∫cNdπ=lim⁡j∫cNdπnj≤lim inf⁡j∫∣x−y∣2dπnj≤c. Letting N↑∞ and using [F4] yields ∫∣x−y∣2dπ≤c. Since π is a coupling and c is the infimum, equality holds; the infimum is attained.

4.1givenF1F2F3F4step 2.1∎

Put L=lim inf⁡nW2(μn,νn)2. If L=+∞, the asserted inequality is immediate. Otherwise choose a subsequence indexed by integers j≥1, denoted nj, along which the costs converge to L, and choose by AC couplings σj with costs at most W2(μnj,νnj)2+1/j. 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 (σj) is tight on R2d. A further subsequence converges weakly to a probability σ, whose marginals are μ,ν by [F3]. For every N, bounded continuity of cN gives ∫cNdσ≤L. Monotone convergence [F4] then gives ∫∣x−y∣2dσ≤L. The definition of W2 and the coupling property imply W2(μ,ν)2≤L.

Depends on

Used by

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