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.
Couplings of finite probability vectors
Definition
Let be a finite nonempty set with this fixed ordering, and let and be probability vectors on : their coordinates are nonnegative real numbers and . A coupling of and is a real matrix satisfying
Write for the set of all such matrices. The first index records the source point and the second index records the destination point.
Depends on
Used by
- The finite-metric 1-Wasserstein transport cost Definition
- An attaining coupling and potential on a three-point metric space Example
- Transport on a finite chain Example
- Two-point finite-metric transport Example
- A finite coupling lifts to a Borel coupling with a controlled metric cost Lemma
- Finite-metric transport and normalized dual optima are attained Lemma
- Finite-metric transport duality and complementary slackness Theorem
- Kantorovich–Rubinstein duality on compact metric spaces Theorem
- Kantorovich–Rubinstein duality on compact second-countable metric spaces Theorem
Dependency tree · one level
1 result within one dependency step 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, PDF pp. 3–4 (standard reference, not scraped)