Isoperimetric inequality and OMT: Difference between revisions
No edit summary |
No edit summary |
||
Line 3: | Line 3: | ||
A very interesting application of optimal transport is a proof of the isoperimetric inequality. The first proof with an OMT argument is due to Gromov and the main tool is the Knothe's map. <ref>V.D. Milman, G. Schechtman, Asymptotic Theory of Finite-Dimensional Normed Spaces, with an appendix by M. Gromov, Lecture notes in Mathematics, vol. 1200 (Springer, Berlin, 1986)</ref>. This proof is based on an idea by Knothe <ref>Herbert Knothe. "Contributions to the theory of convex bodies.." Michigan Math. J. 4 (1) 39 - 52, 1957</ref>. The classic isoperimetric inequality in <math> \mathbb{R}^n </math> states that the round ball has the minimal (n-1)-dimensional volume of the boundary among all the domains with a given fixed volume. This is equivalent to say that every set <math> E </math> has a larger perimeter than the ball <math> B </math> with the same volume. I will present this proof following the exposition given in chapter two in <ref> F. Santambrogio. Optimal Transport for Applied Mathematicians. Calculus of Variations, PDEs and Modeling (2015) </ref>. The usually way to state this is the following: | A very interesting application of optimal transport is a proof of the isoperimetric inequality. The first proof with an OMT argument is due to Gromov and the main tool is the Knothe's map. <ref>V.D. Milman, G. Schechtman, Asymptotic Theory of Finite-Dimensional Normed Spaces, with an appendix by M. Gromov, Lecture notes in Mathematics, vol. 1200 (Springer, Berlin, 1986)</ref>. This proof is based on an idea by Knothe <ref>Herbert Knothe. "Contributions to the theory of convex bodies.." Michigan Math. J. 4 (1) 39 - 52, 1957</ref>. The classic isoperimetric inequality in <math> \mathbb{R}^n </math> states that the round ball has the minimal (n-1)-dimensional volume of the boundary among all the domains with a given fixed volume. This is equivalent to say that every set <math> E </math> has a larger perimeter than the ball <math> B </math> with the same volume. I will present this proof following the exposition given in chapter two in <ref> F. Santambrogio. Optimal Transport for Applied Mathematicians. Calculus of Variations, PDEs and Modeling (2015) </ref>. The usually way to state this is the following: | ||
:<math> Per(E) \geq | :<math> Per(E) \geq n \omega_n^{1/n}|E|^{1-1/n}. </math> | ||
Here <math> \omega_n </math> is the volume of the unit ball in <math> \mathbb{R}^n </math>. The idea of the proof is to construct a map T called Knothe transport and use it between the two densities: <math> \mu=\mathcal{L}_B </math>, the inequality will follow from some symmetries and consideration on the Jacobian determinant of this map. | Here <math> \omega_n </math> is the volume of the unit ball in <math> \mathbb{R}^n </math>. The idea of the proof is to construct a map T called Knothe transport and use it between the two densities: <math> \mu=\mathcal{L}_B </math>, the inequality will follow from some symmetries and consideration on the Jacobian determinant of this map. | ||
Line 23: | Line 23: | ||
:<math>T(x_1,x_2)=(T_1(x_1),T_2(x_1,x_2))</math>. | :<math>T(x_1,x_2)=(T_1(x_1),T_2(x_1,x_2))</math>. | ||
It is not hard to check that thismap indeed transports <math>\mu</math> to <math>\nu </math> (Theorem 1.4.13 of <ref> A. Figalli, F. Glaudo An Invitation to Optimal Transport, Wasserstein Distances, and Gradient Flows pag. 13 </ref>). By monotonicity of the monotone rearrangement, assuming that the map T is differentiable we can say that: | It is not hard to check that thismap indeed transports <math>\mu</math> to <math>\nu </math> (Theorem 1.4.13 of <ref> A. Figalli, F. Glaudo An Invitation to Optimal Transport, Wasserstein Distances, and Gradient Flows pag. 13 </ref>). By monotonicity of the monotone rearrangement, assuming that the map T is differentiable, we can say that: | ||
:<math> T | :<math> \nabla T= | ||
\left[ {\begin{array}{cc} | \left[ {\begin{array}{cc} | ||
\partial_1T_1\geq 0 & \star \\ | |||
0 & \partial_1T_1\geq 0 \\ | |||
\end{array} } \right]</math>. | \end{array} } \right]</math>. | ||
We can iterate the same construction and obtain a Knothe map on <math> \mathbb{R}^n</math> |
Revision as of 01:54, 13 February 2022
The classic isoperimetric inequality
A very interesting application of optimal transport is a proof of the isoperimetric inequality. The first proof with an OMT argument is due to Gromov and the main tool is the Knothe's map. [1]. This proof is based on an idea by Knothe [2]. The classic isoperimetric inequality in states that the round ball has the minimal (n-1)-dimensional volume of the boundary among all the domains with a given fixed volume. This is equivalent to say that every set has a larger perimeter than the ball with the same volume. I will present this proof following the exposition given in chapter two in [3]. The usually way to state this is the following:
Here is the volume of the unit ball in . The idea of the proof is to construct a map T called Knothe transport and use it between the two densities: , the inequality will follow from some symmetries and consideration on the Jacobian determinant of this map.
The Knothe's transport
For this part I will follow the first chapter in [4]. In some sense, it can be seen as a multidimension generalization of monotone rearrangement. Take any two measures and define
- ,
This maps may not be well defined, since at some points the measures may have a delta. For the purpose of this exposition we will assume that those functions are well defined, for the precise definition and convention to include the mass of the deltas in the integral we refer again to the first chapter of[5]. It follow easily from the definition that those maps are not decreasing. We now define . We are now ready to define the following monotone rearrangement map :
- .
Note that this map is also not decreasing. In the case that our first density has no deltas then it can be shown that T is indeed a transport map (Theorem 1.4.7 [6]). We now move to the two dimensional case: the key ingredient to the Knothe transport map is what is known as the disintegration theorem (1.4.10 in[7].): Given and let where is the projection on the first component of : , Then there exist an uncountable family of probability measures such that for any continuous and bounded we have that:
- . The disintegration of the measure is often also denoted as . Now we are ready to construct the Knothe map.
Fix any two absolutely continuous measures in : and , define and . Note that using these notation we can write:
- and . Applying the monotone rearrangement we get a map that satisfies , We want to send the disintegration of at to the disintegration of $\nu$ at the point , in symbols let .
The Knothe map is now defined as:
- .
It is not hard to check that thismap indeed transports to (Theorem 1.4.13 of [8]). By monotonicity of the monotone rearrangement, assuming that the map T is differentiable, we can say that:
- .
We can iterate the same construction and obtain a Knothe map on
- ↑ V.D. Milman, G. Schechtman, Asymptotic Theory of Finite-Dimensional Normed Spaces, with an appendix by M. Gromov, Lecture notes in Mathematics, vol. 1200 (Springer, Berlin, 1986)
- ↑ Herbert Knothe. "Contributions to the theory of convex bodies.." Michigan Math. J. 4 (1) 39 - 52, 1957
- ↑ F. Santambrogio. Optimal Transport for Applied Mathematicians. Calculus of Variations, PDEs and Modeling (2015)
- ↑ A. Figalli, F. Glaudo An Invitation to Optimal Transport, Wasserstein Distances, and Gradient Flows
- ↑ A. Figalli, F. Glaudo An Invitation to Optimal Transport, Wasserstein Distances, and Gradient Flows
- ↑ A. Figalli, F. Glaudo An Invitation to Optimal Transport, Wasserstein Distances, and Gradient Flows
- ↑ A. Figalli, F. Glaudo An Invitation to Optimal Transport, Wasserstein Distances, and Gradient Flows
- ↑ A. Figalli, F. Glaudo An Invitation to Optimal Transport, Wasserstein Distances, and Gradient Flows pag. 13