Polar factorization theorem

From testwiki
Jump to navigation Jump to search

Template:Short description

In optimal transport, a branch of mathematics, polar factorization of vector fields is a basic result due to Brenier (1987),[1] with antecedents of Knott-Smith (1984)[2] and Rachev (1985),[3] that generalizes many existing results among which are the polar decomposition of real matrices, and the rearrangement of real-valued functions.

The theorem

Notation. Denote ξ#μ the image measure of μ through the map ξ.

Definition: Measure preserving map. Let (X,μ) and (Y,ν) be some probability spaces and σ:XY a measurable map. Then, σ is said to be measure preserving iff σ#μ=ν, where # is the pushforward measure. Spelled out: for every ν-measurable subset Ω of Y, σ1(Ω) is μ-measurable, and μ(σ1(Ω))=ν(Ω). The latter is equivalent to:

X(fσ)(x)μ(dx)=X(σ*f)(x)μ(dx)=Yf(y)(σ#μ)(dy)=Yf(y)ν(dy)

where f is ν-integrable and fσ is μ-integrable.

Theorem. Consider a map ξ:ΩRd where Ω is a convex subset of Rd, and μ a measure on Ω which is absolutely continuous. Assume that ξ#μ is absolutely continuous. Then there is a convex function φ:ΩR and a map σ:ΩΩ preserving μ such that

ξ=(φ)σ

In addition, φ and σ are uniquely defined almost everywhere.[1][4]

Applications and connections

Dimension 1

In dimension 1, and when μ is the Lebesgue measure over the unit interval, the result specializes to Ryff's theorem.[5] When d=1 and μ is the uniform distribution over [0,1], the polar decomposition boils down to

ξ(t)=FX1(σ(t))

where FX is cumulative distribution function of the random variable ξ(U) and U has a uniform distribution over [0,1]. FX is assumed to be continuous, and σ(t)=FX(ξ(t)) preserves the Lebesgue measure on [0,1].

Polar decomposition of matrices

When ξ is a linear map and μ is the Gaussian normal distribution, the result coincides with the polar decomposition of matrices. Assuming ξ(x)=Mx where M is an invertible d×d matrix and considering μ the 𝒩(0,Id) probability measure, the polar decomposition boils down to

M=SO

where S is a symmetric positive definite matrix, and O an orthogonal matrix. The connection with the polar factorization is φ(x)=xSx/2 which is convex, and σ(x)=Ox which preserves the 𝒩(0,Id) measure.

Helmholtz decomposition

The results also allow to recover Helmholtz decomposition. Letting xV(x) be a smooth vector field it can then be written in a unique way as

V=w+p

where p is a smooth real function defined on Ω, unique up to an additive constant, and w is a smooth divergence free vector field, parallel to the boundary of Ω.

The connection can be seen by assuming μ is the Lebesgue measure on a compact set ΩRn and by writing ξ as a perturbation of the identity map

ξϵ(x)=x+ϵV(x)

where ϵ is small. The polar decomposition of ξϵ is given by ξϵ=(φϵ)σϵ. Then, for any test function f:RnR the following holds:

Ωf(x+ϵV(x))dx=Ωf((φϵ)σϵ(x))dx=Ωf(φϵ(x))dx

where the fact that σϵ was preserving the Lebesgue measure was used in the second equality.

In fact, as φ0(x)=12x2, one can expand φϵ(x)=12x2+ϵp(x)+O(ϵ2), and therefore φϵ(x)=x+ϵp(x)+O(ϵ2). As a result, Ω(V(x)p(x))f(x))dx for any smooth function f, which implies that w(x)=V(x)p(x) is divergence-free.[1][6]

See also

References

Template:Reflist

Template:Convex analysis and variational analysis Template:Measure theory