01
Optimal transport
Printed p. 9 · PDF p. 15 · source map and reuse audit; not a Lean closure.
Statistical Optimal Transport Library
Statistical Optimal Transport
Sinho Chewi · Jonathan Niles-Weed · Philippe Rigollet. Eight chapters and two appendices in the shared Samplinglib reader.
Research resources: guides, formal libraries and papers
Formalization contract
Map first, reuse first, prove only real gaps.
Search Samplinglib, Mathlib and compatible formal upstreams first. Recover omitted details from Villani, Santambrogio and Ambrosio–Gigli–Savaré without silently changing the source theorem.
reuseadaptmissingout of scope
Book contents
Chapter scaffolds
02
Estimation of Wasserstein distances
Printed p. 47 · PDF p. 53 · source map and reuse audit; not a Lean closure.
03
Estimation of transport maps
Printed p. 89 · PDF p. 95 · source map and reuse audit; not a Lean closure.
04
Entropic optimal transport
Printed p. 109 · PDF p. 115 · source map and reuse audit; not a Lean closure.
05
Wasserstein gradient flows: theory
Printed p. 135 · PDF p. 141 · source map and reuse audit; not a Lean closure.
06
Wasserstein gradient flows: applications
Printed p. 167 · PDF p. 173 · source map and reuse audit; not a Lean closure.
07
Metric geometry of the Wasserstein space
Printed p. 205 · PDF p. 211 · source map and reuse audit; not a Lean closure.
08
Wasserstein barycenters
Printed p. 229 · PDF p. 235 · source map and reuse audit; not a Lean closure.
A
Convex analysis
Printed p. 247 · PDF p. 253 · source map and reuse audit; not a Lean closure.
B
Probability
Printed p. 255 · PDF p. 261 · source map and reuse audit; not a Lean closure.
Dependency-first, not cover-to-cover.
Chapter 1 unlocks Chapters 2, 3, 4, 5 and 7; then 5 → 6 and 7 → 8. The book separates prerequisites from cross-references in Figure 0.1. Appendices A/B are shared-entry material, not a second convex/probability library.
Statistical Optimal Transport Route · Functor Hypergraph
Pagination audited on 5 September 2026. The public PDF is mutable; every claimed theorem must pin its edition and exact statement independently.
Pinned external proof memory
OpenAI Math extension shelf
11 audited upstream routes are placed beside this library's real chapters or named Samplinglib extensions. External verification is shown separately from ASTIS compilation.