Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Kantorovich–Rubinstein duality on compact second-countable metric spaces

Statement

Let (X,d) be a nonempty compact metric space whose metric topology has an at-most-countable basis. Let μ,ν be countably additive Borel probability measures on X, and fix x0∈X. Let ΠX(μ,ν) be the Borel probability measures γ on the product-topology space X×X satisfying γ(A×X)=μ(A) and γ(X×A)=ν(A) for every Borel set A⊆X, and define W1X(μ,ν)=inf⁡γ∈ΠX(μ,ν)∫X×Xd(x,y) dγ(x,y). Then ΠX(μ,ν) is nonempty and W1X(μ,ν)=sup⁡{∫Xf dμ−∫Xf dν: f:X→R, f(x0)=0, ∣f(x)−f(y)∣≤d(x,y) for all x,y∈X}.

Facts & Assumptions

Given: The space, measures, base point, and coupling-cost convention in the Statement.

[F1]

For every ε>0, a compact metric space admits a finite ordered net, a Borel partition into nearest-center cells, and a Borel quantization map whose displacement is less than ε. A compact metric space has a finite Borel nearest-center quantization at every positive scale

[F2]

If a finite coupling has rows and columns given by the masses of such Borel cells, it lifts to a Borel coupling of μ,ν with cost at most the finite cost plus 2ε. A finite coupling lifts to a Borel coupling with a controlled metric cost

[F3]

A finite 1-Lipschitz potential extends to the whole metric space by f~(x)=min⁡i(fi+d(x,xi)), preserving its values and 1-Lipschitz bound. The McShane formula extends a 1-Lipschitz function from a finite subset

[F4]

On a finite nonempty metric space, the minimum coupling cost equals the maximum over normalized 1-Lipschitz potentials, and both extrema are attained. Finite-metric transport duality and complementary slackness

[F5]

The finite transport cost is the minimum of ∑i,jd(xi,xj)πij over nonnegative matrices with the prescribed probability-vector marginals. The finite-metric 1-Wasserstein transport cost Couplings of finite probability vectors Finite probability vectors

[F6]

The compact-space cost W1X is the infimum of the Borel coupling costs in the Statement. The coupling definition of the 1-Wasserstein cost on a compact metric space

[F7]

Every nonempty finite set of reals has an attained maximum. Every nonempty finite set of reals has a maximum and a minimum

[F9]

The nonnegative integral is monotone and homogeneous. Monotonicity and nonnegative homogeneity of the nonnegative integral

[F10]

The nonnegative integral is defined as the supremum of simple minorants, and it agrees with the simple integral; a nonnegative simple function integrates as the sum of its values times the measures of its disjoint level sets. The nonnegative Lebesgue integral Nonnegative simple measurable functions The integral of a nonnegative simple function The nonnegative integral agrees with the simple integral on simple functions

[F11]

The nonnegative integral is additive over finite sums of nonnegative measurable functions. Additivity of the nonnegative Lebesgue integral

[F12]

Real integrability and the signed integral are defined using positive and negative parts, and the signed integral is linear on integrable functions. Integrable real and complex functions, and their integrals The Lebesgue integral is linear on L1(μ)

Proof

technique · direct
1.1givenF1F7F8F9F10F12F13choose

Use [F1] at scale 1 to obtain a finite net z1,…,zs. Let M:=2+max⁡k,ℓd(zk,zℓ), whose maximum exists by [F7]. For any x,y∈X, choose net points within 1 of x and y; [F8] gives d(x,y)<M. Hence an anchored feasible f satisfies ∣f(x)∣≤d(x,x0)<M. For every x and r>0, d(x,y)<r implies ∣f(x)−f(y)∣<r, so the metric-topology definition makes f continuous; [F13] then makes it Borel. Also 0≤f+,f−≤M. By [F9] and [F10], each nonnegative integral is at most Mμ(X)=M, so [F12] makes f integrable and both dual integrals are finite. The zero function is feasible, so the dual objective set is nonempty and its supremum DX is a finite real number.

1.2givenF1F4F5

Fix ε>0 and use [F1] to obtain distinct net points x1,…,xm, Borel nearest-center cells C1,…,Cm, and a Borel map Q with Q(x)=xi on Ci and d(x,Q(x))<ε. Set pi=μ(Ci) and qi=ν(Ci). Countable additivity and the finite Borel partition imply pi,qi≥0 and ∑ipi=∑iqi=1. Let cε be the minimum finite transport cost between these vectors on F={x1,…,xm}; [F4] ensures that this finite minimum exists and is attained.

2.1step 1.2F4choose

By [F4], choose a minimizing finite coupling πε and a maximizing normalized finite 1-Lipschitz potential; their common finite primal and dual value is cε.

2.2step 1.2F5F6F8F11algebra

For any γ∈ΠX(μ,ν), set πij:=γ(Ci×Cj). Its row and column sums are pi,qj by the marginal identities and finite additivity, so it is a finite coupling. On Ci×Cj, [F8] gives d(xi,xj)≤d(xi,x)+d(x,y)+d(y,xj)<d(x,y)+2ε. The cells Ci×Cj form a finite Borel partition of X×X. Integrating the pointwise bounds on these cells and using finite additivity of the nonnegative integral [F11] gives ∑i,jπijd(xi,xj)≤∫d(x,y) dγ+2ε, since γ(X×X)=1. Taking the infimum over γ gives cε≤W1X(μ,ν)+2ε.

2.3step 1.1step 1.2F3F4F9F10F12algebra

Let DF be the maximum finite dual value. By [F4], DF=cε. For any feasible finite potential (fi), [F3] gives an extension f~; put h:=f~−f~(x0). This anchors h without changing either probability-difference objective. The function h∘Q is finite-valued Borel simple, so its integrals are ∑ipih(xi) and ∑iqih(xi) by [F10]. Pointwise, ∣h(x)−h(Q(x))∣<ε. For either probability measure ρ∈{μ,ν}, let r=h−h∘Q. It is integrable because both terms are bounded Borel functions. Monotonicity [F9] gives 0≤∫(r+ε) dρ and 0≤∫(ε−r) dρ; [F10] gives ∫ε dρ=ε, and linearity [F12] yields ∣∫r dρ∣≤ε. Hence each finite objective differs from the corresponding compact objective by at most 2ε, so DF≤DX+2ε.

3.1step 1.1step 1.2step 2.3F4F9F10F12algebra

Conversely, let g be any feasible compact potential and restrict it to F, subtracting g(x1) to normalize the first coordinate. The finite objective is unchanged by this shift because both probability vectors sum to one. The functions g∘Q are Borel simple and have the finite sums as their integrals, by [F10]. For each ρ∈{μ,ν}, the integrable difference r=g−g∘Q satisfies −ε≤r≤ε; applying the two monotonicity and linearity inequalities detailed in step 2.3 gives ∣∫r dρ∣≤ε. Thus each compact integral differs from its finite sum by at most ε. By the definition of DF in step 2.3, every restricted finite objective is at most DF, and DX≤DF+2ε.

3.2givenstep 1.1step 2.3F6F8F9F10F12F13

For any γ∈ΠX(μ,ν) and feasible compact f, the Lipschitz constraint gives f(x)−f(y)≤d(x,y). By step 1.1 and [F13], the functions f∘pr1 and f∘pr2 are bounded Borel, and the metric cost is bounded and Borel; hence they are integrable. The first-coordinate pushforward of γ agrees with μ on every Borel set by the marginal condition, and the second-coordinate pushforward agrees with ν. Equal measures integrate indicators, then simple functions, then all nonnegative Borel functions equally by [F10]; positive-negative decomposition and signed-integral linearity [F12] give equality for bounded signed Borel functions. Thus ∫(f(x)−f(y)) dγ=∫f dμ−∫f dν. Since d(x,y)−(f(x)−f(y))≥0, [F9]–[F10] give a nonnegative integral for this difference, so [F12] implies the dual value is at most the cost of γ. Taking the infimum gives DX≤W1X(μ,ν).

3.3step 2.1F2F6

Apply [F2] to the minimizing plan πε of step 2.1. It gives a Borel coupling γε∈ΠX(μ,ν) with cost at most cε+2ε. Hence the coupling set is nonempty and W1X(μ,ν)≤cε+2ε.

4.1step 2.2step 2.3step 3.1step 3.2step 3.3algebra∎

Steps 2.2 and 3.3 give ∣W1X−cε∣≤2ε. Steps 2.3 and 3.1 give ∣DX−DF∣≤2ε, and step 2.3 gives DF=cε. Combining with step 3.2 yields DX≤W1X≤cε+2ε=DF+2ε≤DX+4ε. Since this holds for every ε>0, W1X(μ,ν)=DX.

Depends on

Used by

Dependency tree · two levels

67 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