Brenier's theorem

Theorem in optimal transport From Wikipedia, the free encyclopedia

In optimal transport, Brenier's theorem is a theorem about the optimal solution to a transportation problem on Euclidean space. It states that the optimal transportation plan of an absolutely continuous probability measure is the gradient of a convex function.[1][2][3]

More precisely, if and are probability measures on with finite second moments and is absolutely continuous with respect to Lebesgue measure, then there is a unique optimal transport map pushing forward to for the cost . This map has the form

for a convex function , uniquely determined up to changes that do not affect its gradient on the support of .[1][2][3]

The theorem identifies convex gradients as the higher-dimensional analogue of increasing rearrangements on the real line. In one dimension, the optimal way to transport one probability distribution to another for quadratic cost is the monotone rearrangement. In higher dimensions there is no natural total ordering of points, and Brenier's theorem replaces monotonicity by cyclic monotonicity, which is characterized by gradients of convex functions.[2][4]

Brenier's theorem is closely related to the polar factorization theorem, also due to Yann Brenier, which decomposes a suitable vector field as the composition of a measure-preserving map and the gradient of a convex function.[1][5]

Statement

Let denote the set of Borel probability measures on with finite second moment. If , a measurable map is said to push forward to , written

if

for every Borel set . The Monge problem for the quadratic cost is to minimize

among all measurable maps such that .

One form of Brenier's theorem is the following.

Theorem. Let , and suppose that is absolutely continuous with respect to the Lebesgue measure. Then there exists a convex function such that
pushes forward to and solves the quadratic Monge problem. The map is unique -almost everywhere. Equivalently, the optimal transport plan for the corresponding Kantorovich problem is unique and is concentrated on the graph of .[1][2][3]

The function is called a Brenier potential, and the map is called the Brenier map from to .

Inverse map

If both and are absolutely continuous, then the Brenier map from to has an inverse in the almost-everywhere sense. If

is the Brenier map from to , then the Brenier map from back to is given by

where is the convex conjugate of . The maps satisfy

for -almost every ,

and

for -almost every .[2][3]

References

Related Articles

Wikiwand AI