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 and normalized dual optima are attained
Statement
Let be a nonempty finite metric space, and let be probability vectors on . The coupling set is nonempty and compact in , so the finite-metric transport cost attains its minimum. The normalized 1-Lipschitz potential set
is also nonempty and compact, so the linear functional attains a maximum on it.
Statement references
Facts & Assumptions
Given: A nonempty finite set with metric , and probability vectors on .
A probability vector has nonnegative coordinates with total sum one (Finite probability vectors).
A coupling is a nonnegative matrix whose row sums are and column sums are (Couplings of finite probability vectors).
A metric has real values, vanishes exactly on equal points, is symmetric, and satisfies the triangle inequality (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
Every metric is nonnegative, although nonnegativity is not listed as a separate metric axiom (Nonnegativity of a metric is a consequence of the other axioms, not an axiom).
On for , is a metric ( as the set of functions , and , , are metrics on it). Closedness and openness refer to its metric topology; a set is closed when its complement is open, and open sets contain a ball around each of their points (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).
A subset of , , is compact exactly when it is closed and bounded (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
Every lower semicontinuous real function on a nonempty compact Euclidean set attains a minimum, and every upper semicontinuous one attains a maximum (Semicontinuous extreme value theorem on compact Euclidean sets).
The real line has metric (The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded), and continuity at means that for each some makes imply (Continuity of a map between metric spaces, at a point and globally, in the - form).
A continuous real function on a Euclidean subset is both lower and upper semicontinuous (Upper and lower semicontinuity on subsets of ).
The finite-metric transport cost is (The finite-metric 1-Wasserstein transport cost).
Every nonzero real has positive square and ; finite sums of nonnegative terms dominate each term, termwise inequalities may be summed, and finite sums scale by a common scalar; for nonnegative reals, comparison of squares is equivalent to comparison of the reals; square roots are nonnegative and square to their radicands; absolute values are nonnegative and satisfy , , , and ; multiplication by a nonnegative real preserves nonstrict inequalities (Squares of nonzero elements are positive, Integer powers , Multiplication by zero: , Laws of finite sums and finite products, Squaring is monotone on the nonnegatives, Square roots exist: a unique with ; the positives are , Absolute value in an ordered field, Basic properties of the absolute value, The triangle inequality, Sign rules for products and monotonicity of multiplication).
A property holding at and passing from to holds for every natural (The principle of mathematical induction).
Proof
Define . These entries are nonnegative by [F1], and their row sums are while their column sums are . Thus and the coupling set is nonempty.
Flatten a matrix into in row-major order, assigning entry to library coordinate ; likewise potential coordinate corresponds to library coordinate . In any dimension , for and , [F11] gives ; by [F5,F11], , and both and are nonnegative, so [F11] gives . By induction on , every finite list satisfies : the empty case is equality and the successor step follows from in [F11]. Thus for every finite linear form , this bound, , the coordinate estimate, multiplication by nonnegative coefficients, finite-sum monotonicity and scaling in [F11] give . The same estimate holds for every affine form , since the constant cancels in . The set is defined by finitely many affine equalities and weak inequalities. Each row or column equality, after moving its marginal to one side, has coefficients equal to ; each entrywise nonnegativity constraint has one coefficient equal to , so the coefficient sum is positive for every constraint. If an affine equality fails at , then for the estimate gives , so . If an affine inequality fails at , then for the estimate gives . Thus every point outside has a ball in its complement, so [F5,F6] make closed. Also by [F1,F2], so the set is bounded. Since , [F6] makes compact.
For a matrix difference , the objective changes by at most , where is finite; the coordinate bound is the same as in step 1.2. For any , taking shows that inputs within have output difference less than , so the objective is continuous by [F8] and lower semicontinuous by [F9]. It is real-valued because all distances are finite reals; by [F4] and [F1] its values are nonnegative. The nonempty compact set from steps 1.1–1.2 and [F7] therefore give a finite attained minimum, which is by [F10].
The set contains the zero vector. It is closed because its constraints are finitely many linear equalities and weak inequalities: has one nonzero coefficient, and writing each as and gives two nonzero coefficients in each inequality when ; when the constraint is the identity . Thus every violated constraint has positive coefficient sum and the strict-violation ball argument in step 1.2 applies using [F5,F6,F11]. Since and , every satisfies by [F3,F4]; thus the set is bounded. Since , [F6] makes it compact.
The objective changes by at most , where ; taking for each proves continuity by [F8] and upper semicontinuity by [F9]. The nonempty compact set from step 2.2 and [F7] give an attained maximum.
Depends on
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- 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
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
- 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 absolute value makes $\mathbb{R}$ a metric space: $d(x,y) = |x-y|$ is a metric, its open balls are the intervals $(x-r, x+r)$, and it is unbounded
- Continuity of a map between metric spaces, at a point and globally, in the $\varepsilon$-$\delta$ form
- Upper and lower semicontinuity on subsets of $\mathbb R^n$
- Semicontinuous extreme value theorem on compact Euclidean sets
- Laws of finite sums and finite products
- Squares of nonzero elements are positive
- Squaring is monotone on the nonnegatives
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Absolute value in an ordered field
- Basic properties of the absolute value
- The triangle inequality
- Sign rules for products and monotonicity of multiplication
- Integer powers $a^m$
- Multiplication by zero: $0 \cdot a = 0$
- The principle of mathematical induction
Used by
Cited to discharge well-definedness by The finite-metric 1-Wasserstein transport cost.
Dependency tree · two levels
74 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 and 3.1 (standard reference, not scraped)
- Filippo Santambrogio, Introduction to Optimal Transport Theory, §§1.1–1.2, PDF pp. 3–5 (standard reference, not scraped)