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 for masses on two separated points
Example
Let have the two-point metric , so is compact. For , set and . Then , and the supremum over 1-Lipschitz functions normalized by has the same value.
Facts & Assumptions
Given: The finite metric space and probability measures are as in the Example.
In a two-point metric space with , the balls and are open. Thus every subset of and every subset of is Borel, and is compact because any open cover has a subcover of at most two members. Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric Open ball, closed ball and sphere in a metric space 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 The Borel sigma-algebra of a topological space The product set of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space Open cover, subcover, compact metric space, and compact subset of a metric space
The Dirac set functions at and are probability measures; nonnegative finite linear combinations preserve countable additivity, and coefficients summing to one preserve total mass. Thus the displayed convex combinations have the stated atom masses and are probabilities. The Dirac set function at a point A Dirac set function is a probability measure Measures on sigma-algebras Probability measures and probability spaces
is the infimum of the integral of the metric over Borel probability couplings with the prescribed marginals. The coupling definition of the 1-Wasserstein cost on a compact metric space
On a finite measurable space, a nonnegative simple function integrates as the finite sum of its values times the measures of its level sets; signed integrals are defined by positive and negative parts. 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 Integrable real and complex functions, and their integrals
A measure is countably additive on disjoint measurable sets; this implies finite additivity and finite subadditivity. Measures on sigma-algebras
Verification
By [F1], consists of four Borel singletons. Given any admissible Borel coupling , define for . Finite additivity [F5] makes a nonnegative matrix with total sum ; its row and column sums are the masses of the marginals, namely and by [F2]. Thus . By [F4], its cost is , so [F3] gives .
Every real-valued function on the finite discrete set is Borel measurable, and and are nonnegative simple functions. For either or , apply the nonnegative finite-sum formula [F4] separately to and to get . Subtracting these two finite quantities by the signed-integral definition in [F4] proves . Using the atom masses [F2], the objective for a feasible with is therefore . Since , the objective is at most . If , choose ; if , choose . Each choice is feasible and attains , including .
If , the matrix is nonnegative, has the required row sums and column sums , and costs . If , the matrix is nonnegative, has the same required marginals, and costs . Either matrix defines a Borel probability on the four-point set by assigning each singleton its matrix entry; countable additivity follows because only finitely many disjoint subsets can be nonempty, and [F5] gives finite additivity. Its row and column sums give the required marginals, and [F4] gives its stated cost. Thus [F3] yields , and step 1.1 gives equality.
Steps 1.1 and 2.1 give the primal value , and step 1.2 gives the same dual supremum, including and endpoints .
Depends on
- The coupling definition of the 1-Wasserstein cost on a compact metric space
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Open ball, closed ball and sphere in a metric space
- 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
- The Borel sigma-algebra of a topological space
- The product set $\prod_{i \in I} X_i$ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
- The Dirac set function at a point
- A Dirac set function is a probability measure
- Measures on sigma-algebras
- Probability measures and probability spaces
- 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
- Integrable real and complex functions, and their integrals
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
46 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
- Dmitriy Panchenko, Lecture Notes on Probability Theory, §4.4, Theorem 4.14 and proof, pp. 121–124 (standard reference, not scraped)
- Filippo Santambrogio, Introduction to Optimal Transport Theory, §§1.1–1.3, PDF pp. 1–7 (standard reference, not scraped)