Optimal transport
Printed p. 9 · PDF p. 15 · source map and reuse audit; not a Lean closure.
Sinho Chewi · Jonathan Niles-Weed · Philippe Rigollet. Eight chapters and two appendices in the shared Samplinglib reader.
Search Samplinglib, Mathlib and compatible formal upstreams first. Recover omitted details from Villani, Santambrogio and Ambrosio–Gigli–Savaré without silently changing the source theorem.
Printed p. 9 · PDF p. 15 · source map and reuse audit; not a Lean closure.
Printed p. 47 · PDF p. 53 · source map and reuse audit; not a Lean closure.
Printed p. 89 · PDF p. 95 · source map and reuse audit; not a Lean closure.
Printed p. 109 · PDF p. 115 · source map and reuse audit; not a Lean closure.
Printed p. 135 · PDF p. 141 · source map and reuse audit; not a Lean closure.
Printed p. 167 · PDF p. 173 · source map and reuse audit; not a Lean closure.
Printed p. 205 · PDF p. 211 · source map and reuse audit; not a Lean closure.
Printed p. 229 · PDF p. 235 · source map and reuse audit; not a Lean closure.
Printed p. 247 · PDF p. 253 · source map and reuse audit; not a Lean closure.
Printed p. 255 · PDF p. 261 · source map and reuse audit; not a Lean closure.
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.