Dvoretzky's theorem
In mathematics, Dvoretzky's theorem is an important structural theorem about normed vector spaces proved by Aryeh Dvoretzky in the early 1960s,[1] answering a question of Alexander Grothendieck. In essence, it says that every sufficiently high-dimensional normed vector space will have low-dimensional subspaces that are approximately Euclidean. Equivalently, every high-dimensional bounded symmetric convex set has low-dimensional sections that are approximately ellipsoids.
A new proof found by Vitali Milman in the 1970s[2] was one of the starting points for the development of asymptotic geometric analysis (also called asymptotic functional analysis or the local theory of Banach spaces).[3]
Original formulations
For every natural number k ∈ N and every ε > 0 there exists a natural number N(k, ε) ∈ N such that if (X, ‖·‖) is any normed space of dimension N(k, ε), there exists a subspace E ⊂ X of dimension k and a positive definite quadratic form Q on E such that the corresponding Euclidean norm
on E satisfies:
In terms of the multiplicative Banach-Mazur distance d the theorem's conclusion can be formulated as:
where denotes the standard k-dimensional Euclidean space.
Since the unit ball of every normed vector space is a bounded, symmetric, convex set and the unit ball of every Euclidean space is an ellipsoid, the theorem may also be formulated as a statement about ellipsoid sections of convex sets.
Further developments
In 1971, Vitali Milman gave a new proof of Dvoretzky's theorem, making use of the concentration of measure on the sphere to show that a random k-dimensional subspace satisfies the above inequality with probability very close to 1. The proof gives the sharp dependence on k:
where the constant C(ε) only depends on ε.
We can thus state: for every ε > 0 there exists a constant C(ε) > 0 such that for every normed space (X, ‖·‖) of dimension N, there exists a subspace E ⊂ X of dimension k ≥ C(ε) log N and a Euclidean norm |⋅| on E such that
More precisely, let SN − 1 denote the unit sphere with respect to some Euclidean structure Q on X, and let σ be the invariant probability measure on SN − 1. Then:
- there exists such a subspace E with
- For any X one may choose Q so that the term in the brackets will be at most
Here c1 is a universal constant. For given X and ε, the largest possible k is denoted k*(X) and called the Dvoretzky dimension of X.
The dependence on ε was studied by Yehoram Gordon,[4][5] who showed that k*(X) ≥ c2 ε2 log N. Another proof of this result was given by Gideon Schechtman.[6]
Noga Alon and Vitali Milman showed that the logarithmic bound on the dimension of the subspace in Dvoretzky's theorem can be significantly improved, if one is willing to accept a subspace that is close either to a Euclidean space or to a Chebyshev space. Specifically, for some constant c, every n-dimensional space has a subspace of dimension k ≥ exp(c√log N) that is close either to ℓk
2 or to ℓk
∞.[7]
Important related results were proved by Tadeusz Figiel, Joram Lindenstrauss and Milman.[8]
References
- ^ Dvoretzky, A. (1961). "Some results on convex bodies and Banach spaces". Proc. Internat. Sympos. Linear Spaces (Jerusalem, 1960). Jerusalem: Jerusalem Academic Press. pp. 123–160.
- ^ Milman, V. D. (1971). "A new proof of A. Dvoretzky's theorem on cross-sections of convex bodies". Funkcional. Anal. I Prilozhen. (in Russian). 5 (4): 28–37.
- ^ Gowers, W. T. (2000). "The two cultures of mathematics". Mathematics: frontiers and perspectives. Providence, RI: Amer. Math. Soc. pp. 65–78. ISBN 978-0-8218-2070-4.
The full significance of measure concentration was first realized by Vitali Milman in his revolutionary proof [Mil1971] of the theorem of Dvoretzky ... Dvoretzky's theorem, especially as proved by Milman, is a milestone in the local (that is, finite-dimensional) theory of Banach spaces. While I feel sorry for a mathematician who cannot see its intrinsic appeal, this appeal on its own does not explain the enormous influence that the proof has had, well beyond Banach space theory, as a result of planting the idea of measure concentration in the minds of many mathematicians. Huge numbers of papers have now been published exploiting this idea or giving new techniques for showing that it holds.
- ^ Gordon, Y. (1985). "Some inequalities for Gaussian processes and applications". Israel Journal of Mathematics. 50 (4): 265–289. doi:10.1007/bf02759761.
- ^ Gordon, Y. (1988). "Gaussian processes and almost spherical sections of convex bodies". Annals of Probability. 16 (1): 180–188. doi:10.1214/aop/1176991893.
- ^ Schechtman, G. (1989). "A remark concerning the dependence on ε in Dvoretzky's theorem". Geometric aspects of functional analysis (1987–88). Lecture Notes in Math. Vol. 1376. Berlin: Springer. pp. 274–277. ISBN 978-0-387-51303-4.
- ^ Alon, N.; Milman, V. D. (1983), "Embedding of in finite-dimensional Banach spaces", Israel Journal of Mathematics, 45 (4): 265–280, doi:10.1007/BF02804012, MR 0720303.
- ^ Figiel, T.; Lindenstrauss, J.; Milman, V. D. (1976). "The dimension of almost spherical sections of convex bodies". Bull. Amer. Math. Soc. 82 (4): 575–578. doi:10.1090/s0002-9904-1976-14108-0., expanded in "The dimension of almost spherical sections of convex bodies", Acta Math. 139 (1977), 53–94.
Further reading
- Vershynin, Roman (2018). "Dvoretzky–Milman Theorem". High-Dimensional Probability : An Introduction with Applications in Data Science. Cambridge University Press. pp. 254–264. doi:10.1017/9781108231596.014.