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.
Finite-metric transport duality and complementary slackness
Statement
Let be a nonempty finite set, let satisfy if and only if , , and , and let , have nonnegative coordinates with each vector summing to . Let consist of matrices with row sums and column sums , and let
Then
Both extrema are attained. Moreover, for every minimizing coupling and every maximizing vector , implies .
Statement references
Facts & Assumptions
Given: The finite metric space, probability vectors, and coupling set in the Statement.
A metric is real-valued and satisfies separation, symmetry and the triangle inequality (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
Metric values are nonnegative, although this is derived from the metric axioms rather than assumed (Nonnegativity of a metric is a consequence of the other axioms, not an axiom).
The vectors have nonnegative coordinates and total mass one (Finite probability vectors).
consists of nonnegative matrices with row sums and column sums (Couplings of finite probability vectors).
is the minimum coupling cost (The finite-metric 1-Wasserstein transport cost).
The coupling set is nonempty compact and its cost minimum is attained; the normalized 1-Lipschitz potential set is nonempty compact and its linear objective maximum is attained (Finite-metric transport and normalized dual optima are attained).
The nonnegative span of finitely many Euclidean vectors is closed and closed under nonnegative linear combinations (A cone generated by finitely many Euclidean vectors is closed).
If is a nonempty closed convex subset of , , and , there are a nonzero vector and a real such that for all (A point outside a nonempty closed convex set is strictly separated from it).
A nonempty finite list of real numbers has an attained minimum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
On the library's , coordinates are indexed by and the Euclidean pairing is (The Euclidean inner product on ).
A subset of Euclidean space is convex when it contains for every pair of its points and every (A convex subset of contains every line segment between two of its points).
Proof
Given: The finite metric space, probability vectors, and coupling set in the Statement.
For any and any with and , the marginal equations give . The inequality uses and . Thus every feasible dual value is at most every feasible primal cost.
Write , and for let have value at library coordinate and at every other coordinate. For alphabet-indexed tuples and , identify with the vector in whose coordinate is , whose coordinate is , and whose coordinate is . Let be the nonnegative span of for all , together with . By [F7], is closed and closed under nonnegative linear combinations. For and , [F7] gives , so [F11] makes convex; the zero representation gives . Put , which is finite and attained by [F6]. For every , the vector under this identification is outside : if it had a representation with coefficients and , its first two coordinate blocks would make and its last coordinate would give , contradicting minimality.
Apply [F8] to and . It gives a vector and threshold with for all . Since , . By [F7], for every and . If for some , take ; then but , a contradiction. Hence for every , while .
Decompose with and . By [F10], pairing with gives . If , pairing with every gives . Multiplying by and summing yields . When this left-hand side is , contrary to step 2.1. Therefore .
Define and . The generator inequalities and give for all . Dividing the strict point inequality by gives .
Set , whose minimum is attained by [F9]. From we have . For any , the triangle inequality gives ; taking finite minima yields , and symmetry gives . Also , so . Since are nonnegative, . Replacing by preserves all Lipschitz inequalities and the objective because ; the resulting vector is normalized with first coordinate zero.
Let be the attained maximum in [F6]. Step 5.1 shows for every , so ; otherwise contradicts that inequality. Step 1.1 gives . Hence , and both extrema are attained by [F6].
Let be any minimizing coupling and any maximizing normalized potential. By the marginal equations and optimal-value equality, . Each summand is nonnegative by feasibility. A finite sum of nonnegative reals can be zero only if each term is zero: if one term were positive, adding the other nonnegative terms would keep the total positive. Thus if , its factor is zero, proving .
Depends on
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- A convex subset of $\mathbb{R}^m$ contains every line segment between two of its points
- Finite probability vectors
- Couplings of finite probability vectors
- The finite-metric 1-Wasserstein transport cost
- Nonnegativity of a metric is a consequence of the other axioms, not an axiom
- Every nonempty finite set of reals has a maximum and a minimum
- Maximum and minimum of a set
- A cone generated by finitely many Euclidean vectors is closed
- Finite-metric transport and normalized dual optima are attained
- A point outside a nonempty closed convex set is strictly separated from it
Used by
Dependency tree · two levels
51 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
- Gabriel Peyré and Marco Cuturi, Computational Optimal Transport, §§2.1–2.3, 3.1, 3.3 and 6.1 (standard reference, not scraped)
- Filippo Santambrogio, Introduction to Optimal Transport Theory, §§1.1–1.3, PDF pp. 3–6 (standard reference, not scraped)
- Martin Arjovsky, Soumith Chintala and Léon Bottou, Wasserstein GAN, §§2–3, PDF pp. 3–6 (standard reference, not scraped)