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.
The coupling definition of the 1-Wasserstein distance
Definition
Let . For Borel probability measures on with finite first moments and , let be the set of Borel probability measures on whose first and second marginals are and . Define This definition makes no assertion that the infimum is attained. It applies only to probability measures with finite first moment; it is not a distance assigned here to a general signed measure.
Here is the Euclidean norm from The Euclidean inner product on , and probability measure has the meaning of Probability measures and probability spaces.
Depends on
Used by
- Characteristic solution of a probability mean-field equation Definition
- A dimension-dependent lower bound for empirical W1 error Example
- A mixed-sign vorticity is not a probability for W1 Example
- Same-sign smooth vortex density and probability blob error budget Example
- The coupling infimum is finite for finite-first-moment probabilities Lemma
- Dobrushin stability in 1-Wasserstein distance for mean-field flows Theorem
- Global characteristic flow for a globally Lipschitz mean-field kernel Theorem
- Periodic PIC particle and force errors under a prescribed initial coupling Theorem
- Probability W1 stability under bounded force defects Theorem
- Staged fixed-regularization PIC error budget Theorem
Dependency tree · two levels
17 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
- François Golse, Mean-Field Limits in Statistical Dynamics, Lecture 1 (standard reference, not scraped)