Brenier’s theorem establishes that the optimal transport map for quadratic cost between absolutely continuous measures on is the gradient of a convex function. This is the foundational result connecting optimal transport to convex analysis, and it guarantees that OT paths are straight lines in any dimension.
For with absolutely continuous w.r.t. Lebesgue, the unique optimal coupling for cost (or equivalently ) is deterministic: where for a convex function . The convexity of ensures is a monotone map: .
The proof follows from the Kantorovich duality machinery: for quadratic cost, -convexity reduces to ordinary convexity (Particular Case 5.3 of Villani), so the -subdifferential becomes the ordinary subdifferential of a convex function. By Alexandrov’s theorem, a convex function is differentiable a.e., so is a singleton -a.e. when . Theorem 5.30 then delivers existence and uniqueness.
Key Details
- with convex: the OT map is a monotone operator
- Uniqueness: the optimal coupling is the unique one concentrated on
- The displacement interpolation traces straight lines because each particle follows a constant-velocity path
- The map is injective (gradient of strictly convex function), so paths don’t cross
- This is why the OT solution satisfies the rectified flow straightness condition : with the OT coupling, the conditional expectation is deterministic (no averaging needed)
- On Riemannian manifolds: where is -convex for (McCann 2001)
Textbook References
Optimal Transport Old and New (Villani, 2009)
- Particular Case 5.3 (p. 67): For , -convexity ordinary convexity, -transform Legendre transform
- Theorem 5.10 (pp. 70-71): Kantorovich duality — optimality -cyclical monotonicity concentrated on
- Theorem 5.30 (p. 96): If is a singleton -a.e., the unique optimal coupling is deterministic
- Bibliographical notes (pp. 98-99): For quadratic cost, expand , absorb quadratic terms, reduce to