Alphabeta Math
Pipeline-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.

Kantorovich–Rubinstein duality on compact metric spaces

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The coupling definition of the 1-Wasserstein cost on a compact metric space

Definition

Let (X,d) be a compact metric space. Write B(X) for the sigma-algebra generated by the open sets of its metric topology. A Borel probability measure on X is a countably additive measure on B(X) with total mass one. For Borel probability measures μ,ν on X, let ΠX(μ,ν) be the set of Borel probability measures γ on X×X, with its product topology and Borel sigma-algebra, such that for every A∈B(X), γ(A×X)=μ(A),γ(X×A)=ν(A). Define W1X(μ,ν):=inf⁡γ∈ΠX(μ,ν)∫X×Xd(x,y) dγ(x,y)∈[0,+∞], where the infimum is taken in the extended real line and inf⁡∅=+∞. The integrand is nonnegative and Borel: the triangle inequality and symmetry give ∣d(x,y)−d(x′,y′)∣≤d(x,x′)+d(y,y′), so (x,y)↦d(x,y) is continuous for the product topology; nonnegativity follows from the metric axioms.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A compact metric space has a finite Borel nearest-center quantization at every positive scale

Statement

Let (X,d) be a nonempty compact metric space and let ε>0. Then there are an integer m≥1, distinct points x1,…,xm∈X, a Borel partition C1,…,Cm of X, and a Borel map Q:X→F:={x1,…,xm} such that Q(x)=xi for x∈Ci and d(x,Q(x))<ε for every x∈X. The partition assigns each point to a nearest point of F, and ties are assigned to the least index.

Facts & Assumptions

Given: A nonempty compact metric space (X,d) and ε>0.

[F1]

Every open cover of a compact metric space has a finite subcover. Open cover, subcover, compact metric space, and compact subset of a metric space

[F3]

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

[F4]

The Borel sigma-algebra contains every open and closed set and is closed under finite unions and intersections. The Borel sigma-algebra of a topological space

Proof

technique · direct
1.1givenF1F2

For any x∈X, the ball B(x,ε) is open: if y∈B(x,ε), set δ=ε−d(x,y)>0; whenever d(y,z)<δ, [F2] gives d(x,z)≤d(x,y)+d(y,z)<ε, so B(y,δ)⊆B(x,ε). Also x∈B(x,ε), so {B(x,ε):x∈X} is an open cover.

2.1step 1.1F1construct

By [F1], finitely many members of that cover still cover X. Each selected member is a ball with at least one center; since the list is finite, finite induction selects a center for every selected member without any choice axiom. Removing repeated centers and preserving their first-occurrence order leaves a finite nonempty distinct list x1,…,xm whose ε-balls cover X.

3.1step 2.1F2algebra

For i<j, the function hij(x)=d(x,xi)−d(x,xj) satisfies ∣hij(x)−hij(y)∣≤2d(x,y) by applying the triangle inequality in both directions to each distance. If hij(x)<0, then the ball of radius −hij(x)/4 around x lies in {hij<0}; if hij(x)>0, then the ball of radius hij(x)/4 around x lies in {hij>0}. Hence {hij<0} is open and {hij≤0} is closed.

4.1step 2.1step 3.1F3F4

Define Ci:=⋂j<i{x:d(x,xi)<d(x,xj)}∩⋂j>i{x:d(x,xi)≤d(x,xj)}. These are Borel sets by [F4] and step 3.1. For each x, [F3] gives a least index minimizing the finite list d(x,x1),…,d(x,xm), so x belongs to the corresponding Ci. If i<j, membership in Ci gives d(x,xi)≤d(x,xj) while membership in Cj gives d(x,xj)<d(x,xi); therefore the cells are disjoint and form a partition.

5.1step 2.1step 4.1F4∎

Define Q(x)=xi on Ci. For every subset A⊆F, Q−1(A)=⋃i:xi∈ACi is a finite union of Borel sets, so Q is Borel. The net points from step 2.1 have ε-balls covering X; hence a nearest center is at distance less than ε from every point. Thus d(x,Q(x))<ε for all x.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The McShane formula extends a 1-Lipschitz function from a finite subset

Statement

Let (X,d) be a metric space, let F={x1,…,xm}⊆X be finite and nonempty with distinct ordered points, and let f1,…,fm∈R satisfy ∣fi−fj∣≤d(xi,xj) for every i,j. Define f~(x):=min⁡1≤i≤m(fi+d(x,xi))(x∈X). Then f~ is 1-Lipschitz on X and f~(xi)=fi for every i.

Facts & Assumptions

Given: The metric space, finite set, and real values in the Statement.

[F2]

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

Proof

technique · direct
1.1givenF1F2

For each k, every term in the defining minimum at xk satisfies fi+d(xk,xi)≥fk, because fk−fi≤d(xk,xi) by [F1] and the hypothesis. The term i=k equals fk, so f~(xk)=fk.

2.1givenF1F2algebra∎

For any x,y∈X and every i, [F1] gives d(x,xi)≤d(x,y)+d(y,xi). Thus fi+d(x,xi)≤d(x,y)+fi+d(y,xi) for every i; taking finite minima yields f~(x)≤d(x,y)+f~(y). Interchanging x,y and using symmetry gives f~(y)≤d(x,y)+f~(x), hence ∣f~(x)−f~(y)∣≤d(x,y).

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A compact metric space is second-countable under countable choice

Statement

Assume the Axiom of Countable Choice. If (X,d) is a compact metric space, then its metric topology has an at-most-countable basis; equivalently, X is second-countable.

Facts & Assumptions

Given: The Axiom of Countable Choice and a compact metric space (X,d).

[A1]

The Axiom of Countable Choice selects one member from each member of a countable family of nonempty sets. The Axiom of Countable Choice (ACω)

[F1]

Under the Axiom of Countable Choice, every compact metric space has an at-most-countable dense subset. A compact metric space has a countable dense subset, by countable choice

[F2]

A product of two at-most-countable sets is at most countable. A product of two at most countable sets is at most countable

[F3]

For every r>0 there is an integer n≥1 with 1/n<r. For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε

[F4]

A metric-open set contains a positive-radius ball around each of its points, and B(a,r)={x:d(x,a)<r}. The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement Open ball, closed ball and sphere in a metric space

[F5]

A topological space is second-countable when it has an at-most-countable basis. Second countability: an at most countable basis for the topology

Proof

technique · direct
1.1A1F1F2construct

By [F1], choose an at-most-countable dense set D⊆X. If X=∅, the empty family is a countable basis. Otherwise set U:={B(a,1/n):a∈D, n∈N, n≥1}. By [F2], the index set D×{n∈N:n≥1} and therefore U are at most countable.

2.1F1F3F4step 1.1choose

To check that U is a basis, let O be open and x∈O. By [F4], choose r>0 with B(x,r)⊆O. Apply [F3] to r/2 to choose n≥1 with 2/n<r. Density of D gives a∈D with d(x,a)<1/n. Then x∈B(a,1/n), and every y∈B(a,1/n) satisfies d(x,y)≤d(x,a)+d(a,y)<2/n<r. Hence x∈B(a,1/n)⊆O.

3.1step 2.1F5∎

By [F5], the at-most-countable basis U makes X second-countable.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A finite coupling lifts to a Borel coupling with a controlled metric cost

Statement

Let (X,d) be a metric space that is compact or second-countable. Let x1,…,xm be distinct points, let C1,…,Cm be a Borel partition of X, and let ε>0 satisfy d(x,xi)<ε for every x∈Ci. Let μ,ν be Borel probability measures on X, set pi=μ(Ci) and qj=ν(Cj), and let π=(πij) be a finite coupling of the probability vectors p,q. Then there is a Borel probability measure γ on X×X with marginals μ,ν such that ∫X×Xd(x,y) dγ(x,y)≤∑i,j=1mπijd(xi,xj)+2ε.

Facts & Assumptions

Given: The space, partition, measures, and finite coupling in the Statement.

[F1]

For second-countable spaces with product topology, the Borel sigma-algebra on X×X equals B(X)⊗B(X). Borel sigma-algebra of a product of second-countable spaces

[F2]

For sigma-finite factors the product measure exists on the product sigma-algebra and has the product rectangle values. For Borel probabilities on compact metric spaces, the section construction gives a probability on the full product-topology Borel sigma-algebra with the same rectangle values, without second countability. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique Borel product probabilities on compact metric spaces by sections Open cover, subcover, compact metric space, and compact subset of a metric space

[F3]

A finite coupling has nonnegative entries and the prescribed row and column sums. Couplings of finite probability vectors

[F4]

A probability vector has nonnegative coordinates summing to one. Finite probability vectors

[F5]

The nonnegative integral is monotone and homogeneous, and is additive on nonnegative measurable functions. Monotonicity and nonnegative homogeneity of the nonnegative integral Additivity of the nonnegative Lebesgue integral

[F8]

A nonnegative function constant on each member of a finite measurable partition is simple, and its nonnegative integral is the finite sum of its values times the corresponding cell measures. Nonnegative simple measurable functions The integral of a nonnegative simple function The nonnegative integral agrees with the simple integral on simple functions

Proof

technique · direct
1.1F3F4givenalgebra

If pi=0, [F3] and nonnegativity imply πij=0 for every j; similarly, if qj=0, then πij=0 for every i. For pi>0 define μi(A)=μ(A∩Ci)/pi for Borel A⊆X, and for qj>0 define νj(A)=ν(A∩Cj)/qj. Countable additivity of μ,ν is preserved by restriction to Ci,Cj and multiplication by 1/pi,1/qj; each restricted measure has total mass one after normalization. Hence these are Borel probability measures concentrated on Ci,Cj.

2.1F1F2F3F4step 1.1construct

Each conditional probability measure in step 1.1 is sigma-finite because X has mass one. If X is compact, the Borel section-product construction in [F2] applied to the probabilities μi,νj on the full compact space X gives a Borel product probability for each active pair; the cells themselves need not be compact. If X is second-countable, [F1] and the ordinary product construction in [F2] give the same conclusion. Denote the chosen construction in either case by μi×νj. Define γ:=∑i,j:pi,qj>0πij(μi×νj). Since zero rows and columns contribute zero by step 1.1, its total mass is ∑i,jπij=∑ipi=1. Thus γ is a Borel probability measure.

3.1F2F3F4step 2.1algebra

For Borel A⊆X, the rectangle formula [F2] and row sums give γ(A×X)=∑i:pi>0∑j:qj>0πijμi(A)=∑i:pi>0piμi(A)=∑iμ(A∩Ci)=μ(A). The same calculation using column sums gives γ(X×A)=ν(A), so γ has the required marginals.

4.1step 1.1step 2.1F2F5F6F7F8algebra∎

The cost d(x,y) is nonnegative Borel by [F7]. For each active pair with pi,qj>0, [F2] gives (μi×νj)(Ci×Cj)=1. For every other active pair (k,ℓ)≠(i,j), disjointness of the partition forces μk(Ci)=0 or νℓ(Cj)=0, so [F2] gives its product measure zero on Ci×Cj. Consequently the finite measure sum of step 2.1 gives γ(Ci×Cj)=πij. On zero rows or columns both sides are zero by step 1.1. On each active block, [F6] gives d(x,y)≤d(x,xi)+d(xi,xj)+d(xj,y)<d(xi,xj)+2ε. The finite Borel step function s(x,y):=∑i,j(d(xi,xj)+2ε)1Ci×Cj(x,y) majorizes d(x,y) on all blocks, including zero-mass ones. Monotonicity [F5], the block masses just computed and the simple-integral formula [F8] give ∫d dγ≤∫s dγ=∑i,j(d(xi,xj)+2ε)πij=∑i,jπijd(xi,xj)+2ε.

Diagram

For a Borel quantization map Q:X→F, both paths in the square send (x,y) to Q(x); the second-coordinate square is analogous. The diagram records coordinate compatibility only; the proof of the coupling and cost estimates above is independent of it.

X£XF£FXFQ£Qpr1pr1Q
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Kantorovich–Rubinstein duality on compact metric spaces under countable choice

Statement

Assume the Axiom of Countable Choice. Let (X,d) be a nonempty compact metric space, let μ,ν be countably additive Borel probability measures on X, and fix x0∈X. Define ΠX(μ,ν) to 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 Axiom of Countable Choice and the compact metric space and measures in the Statement.

[A1]

The Axiom of Countable Choice selects a member from each set in a countable family of nonempty sets. The Axiom of Countable Choice (ACω)

[F1]

Under the Axiom of Countable Choice, every compact metric space is second-countable. A compact metric space is second-countable under countable choice

[F2]

On a nonempty compact second-countable metric space, the Borel coupling set is nonempty and the 1-Wasserstein cost equals the supremum over basepoint-normalized 1-Lipschitz functions. Kantorovich–Rubinstein duality on compact second-countable metric spaces

Proof

technique · direct
1.1givenA1F1F2

By [A1] and [F1], the metric topology of X has an at-most-countable basis, so the hypotheses of [F2] hold. The countable-choice use is exactly the one recorded in [F1]; no other selection is needed.

2.1step 1.1F2∎

Apply [F2] to X,μ,ν and the fixed point x0. It gives ΠX(μ,ν)≠∅ and the displayed Kantorovich–Rubinstein equality.

LemmaStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Borel product probabilities on compact metric spaces by sections

Statement

Let X,Y be nonempty compact metric spaces, let μ,ν be countably additive Borel probability measures on X,Y, and give X×Y its product topology. For every Borel set E⊆X×Y, its section Ex:={y∈Y:(x,y)∈E} is Borel in Y, and x↦ν(Ex) is Borel measurable. The formula λ(E):=∫Xν(Ex) dμ(x) defines a Borel probability measure on X×Y satisfying λ(A×B)=μ(A)ν(B) for every Borel A⊆X and B⊆Y. In particular its coordinate marginals are μ,ν.

Facts & Assumptions

Given: The compact metric spaces, probabilities, and product topology in the Statement.

[F2]

If an open set in Y×X contains K×{x} for compact K⊆Y, the tube lemma gives an open neighborhood V of x with K×V contained in that set. It uses an indexed family of all admissible pairs of neighborhoods and one finite subcover, without choice. Tube lemma: if K is a compact subset of a metric space X, Z is a topological space and N is open in X×Z with K×{z0}⊆N, then K×W⊆N for some open W∋z0

[F3]

Measures are continuous from below on increasing measurable sequences. Continuity from below for measures

[F4]

A lambda-system containing a pi-system contains its generated sigma-algebra. Dynkin's pi-lambda theorem

[F7]

Finite sums and real scalar multiples of real Borel measurable functions are Borel measurable, as are increasing pointwise limits of nonnegative Borel functions. Closure properties of measurable functions used by the integral

[F8]

A measure takes nonnegative values and is countably additive on disjoint measurable sets. Measures on sigma-algebras

Proof

technique · direct
1.1givenF1F3F6construct

For an open set G⊆Y with G≠Y, put Kn:={y:d(y,Y∖G)≥1/n} for integers n≥1. By [F1] these sets are closed and compact. They increase, lie in G, and exhaust G: if y∈G, some ball B(y,r) lies in G, so d(y,Y∖G)≥r>0 and y∈Kn for some n. If G=Y, use Kn=Y. Thus [F3] gives ν(G)=sup⁡nν(Kn) for a specified compact exhaustion of each open G, including G=∅.

2.1step 1.1F2F6F8choose

Let U⊆X×Y be open. The map y↦(x,y) is continuous for fixed x, so each Ux is open. Put hU(x)=ν(Ux). If hU(x)>a for a≥0, step 1.1 provides one compact K⊆Ux with ν(K)>a. The coordinate interchange S:Y×X→X×Y, S(y,z)=(z,y), is a homeomorphism: it and its inverse take basic open rectangles to basic open rectangles by [F6]. Thus S−1(U) is open and contains K×{x}. Apply [F2] in Y×X to obtain an open neighborhood V of x with K×V⊆S−1(U), or equivalently V×K⊆U. For every z∈V, K⊆Uz and hU(z)=ν(Uz). The set K is one of the closed sets in the exhaustion from step 1.1, and Uz is open, so K and Uz∖K are Borel by [F6]. Their disjoint union is Uz; apply countable additivity to the disjoint sequence K,Uz∖K,∅,… [F8]. Nonnegativity of ν [F8] then gives hU(z)=ν(K)+ν(Uz∖K)≥ν(K)>a. Consequently {hU>a} is open for every real a (for a<0 it is all of X). Hence hU is lower semicontinuous and Borel: the inverse images of real rays (a,+∞) are open, and these rays generate the real Borel sigma-algebra, as their rational subfamily generates all open intervals by countable unions and complements.

3.1step 2.1F4F6F7construct

Every Borel E⊆X×Y has Borel sections because the continuous map y↦(x,y) has inverse image Ex. Let D be the family of Borel E for which hE(x):=ν(Ex) is Borel. It contains X×Y, with h=1. If E∈D, then hEc=1−hE is Borel by [F7]. For disjoint En∈D, countable additivity of ν gives h⋃nEn=∑nhEn, an increasing limit of Borel partial sums and therefore Borel by [F7]. Thus D is a lambda-system. All open sets belong to it by step 2.1; the open sets form a pi-system generating B(X×Y). By [F4], D=B(X×Y).

4.1step 3.1F5construct

Define λ(E)=∫hE dμ, which is meaningful and lies in [0,1] by step 3.1 and [F5]. It has λ(∅)=0 and λ(X×Y)=1. For disjoint Borel En, step 3.1 gives h⋃nEn=lim⁡N∑n=1NhEn increasingly. Finite additivity and monotone convergence [F5] yield λ(⋃nEn)=lim⁡N∑n=1Nλ(En)=∑nλ(En). Hence λ is a countably additive Borel probability.

5.1step 4.1F5F6∎

For Borel A⊆X,B⊆Y, the rectangle A×B is Borel as the intersection of the two coordinate inverse images. Its section measure is hA×B(x)=1A(x)ν(B). The simple-integral formula [F5] gives λ(A×B)=μ(A)ν(B). Taking B=Y or A=X proves the marginal identities.

Remarks

This construction works on the full Borel sigma-algebra of the product topology. It neither asserts nor uses equality with the sigma-algebra generated by Borel rectangles. It requires no simultaneous selection of finite nets. The integral convergence is over specified sequences, and the compact exhaustion in step 1.1 is given by a formula. A general optimal-coupling attainment theorem is not part of this lemma.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Kantorovich–Rubinstein duality on compact metric spaces

Statement

Let (X,d) be a nonempty compact metric space. 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.

Remarks

The coupling cost is an infimum; neither compact primal attainment nor compact dual attainment is asserted here. Finite primal and dual attainment at a single fixed scale are supplied by the finite theorem. The inequalities hold for every positive real scale without choosing a family of scale-dependent objects.

4 · Examples, counterexamples and false statements

None yet.

Sources