Brenier's theorem

From testwiki
Jump to navigation Jump to search

Template:Short description 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.Template:SfnTemplate:SfnTemplate:Sfn

More precisely, if μ and ν are probability measures on ℝn with finite second moments and μ is absolutely continuous with respect to Lebesgue measure, then there is a unique optimal transport map T pushing μ forward to ν for the cost |x−y|2. This map has the form

T(x)=∇φ(x)

for a convex function φ:ℝn→(−∞,+∞], uniquely determined up to changes that do not affect its gradient on the support of μ.Template:SfnTemplate:SfnTemplate:Sfn

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.Template:SfnTemplate:Sfn

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.Template:SfnTemplate:Sfn

Statement

Let 𝒫2(ℝn) denote the set of Borel probability measures on ℝn with finite second moment. If μ,ν∈𝒫2(ℝn), a measurable map T:ℝn→ℝn is said to push μ forward to ν, written

T#μ=ν,

if

ν(B)=μ(T−1(B))

for every Borel set B⊆ℝn. The Monge problem for the quadratic cost is to minimize

∫ℝn|x−T(x)|2dμ(x)

among all measurable maps T such that T#μ=ν.

One form of Brenier's theorem is the following.

Theorem. Let μ,ν∈𝒫2(ℝn), and suppose that μ is absolutely continuous with respect to the Lebesgue measure. Then there exists a convex function φ:ℝn→(−∞,+∞] such that
T=∇φ
pushes μ forward to ν and solves the quadratic Monge problem. The map T is unique μ-almost everywhere. Equivalently, the optimal transport plan for the corresponding Kantorovich problem is unique and is concentrated on the graph of ∇φ.Template:SfnTemplate:SfnTemplate:Sfn

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

T=∇φ

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

S=∇φ∗,

where φ∗ is the convex conjugate of φ. The maps satisfy

S(T(x))=x for μ-almost every x,

and

T(S(y))=y for ν-almost every y.Template:SfnTemplate:Sfn

References

Template:Reflist

Template:Convex analysis and variational analysis