Loomis–Whitney inequality
In mathematics, the Loomis–Whitney inequality is a result in geometry, which in its simplest form, allows one to estimate the "size" of a [math]\displaystyle{ d }[/math]-dimensional set by the sizes of its [math]\displaystyle{ (d-1) }[/math]-dimensional projections. The inequality has applications in incidence geometry, the study of so-called "lattice animals", and other areas.
The result is named after the United States mathematicians Lynn Harold Loomis and Hassler Whitney, and was published in 1949.
Statement of the inequality
Fix a dimension [math]\displaystyle{ d\ge 2 }[/math] and consider the projections
- [math]\displaystyle{ \pi_{j} : \mathbb{R}^{d} \to \mathbb{R}^{d - 1}, }[/math]
- [math]\displaystyle{ \pi_{j} : x = (x_{1}, \dots, x_{d}) \mapsto \hat{x}_{j} = (x_{1}, \dots, x_{j - 1}, x_{j + 1}, \dots, x_{d}). }[/math]
For each 1 ≤ j ≤ d, let
- [math]\displaystyle{ g_{j} : \mathbb{R}^{d - 1} \to [0, + \infty), }[/math]
- [math]\displaystyle{ g_{j} \in L^{d - 1} (\mathbb{R}^{d -1}). }[/math]
Then the Loomis–Whitney inequality holds:
- [math]\displaystyle{ \left\|\prod_{j=1}^d g_j \circ \pi_j\right\|_{L^{1} (\mathbb{R}^{d })} = \int_{\mathbb{R}^{d}} \prod_{j = 1}^{d} g_{j} ( \pi_{j} (x) ) \, \mathrm{d} x \leq \prod_{j = 1}^{d} \| g_{j} \|_{L^{d - 1} (\mathbb{R}^{d - 1})}. }[/math]
Equivalently, taking [math]\displaystyle{ f_{j} (x) = g_{j} (x)^{d - 1}, }[/math] we have
- [math]\displaystyle{ f_{j} : \mathbb{R}^{d - 1} \to [0, + \infty), }[/math]
- [math]\displaystyle{ f_{j} \in L^{1} (\mathbb{R}^{d -1}) }[/math]
implying
- [math]\displaystyle{ \int_{\mathbb{R}^{d}} \prod_{j = 1}^{d} f_{j} ( \pi_{j} (x) )^{1 / (d - 1)} \, \mathrm{d} x \leq \prod_{j = 1}^{d} \left( \int_{\mathbb{R}^{d - 1}} f_{j} (\hat{x}_{j}) \, \mathrm{d} \hat{x}_{j} \right)^{1 / (d - 1)}. }[/math]
A special case
The Loomis–Whitney inequality can be used to relate the Lebesgue measure of a subset of Euclidean space [math]\displaystyle{ \mathbb{R}^{d} }[/math] to its "average widths" in the coordinate directions. This is in fact the original version published by Loomis and Whitney in 1949 (the above is a generalization).[1]
Let E be some measurable subset of [math]\displaystyle{ \mathbb{R}^{d} }[/math] and let
- [math]\displaystyle{ f_{j} = \mathbf{1}_{\pi_{j} (E)} }[/math]
be the indicator function of the projection of E onto the jth coordinate hyperplane. It follows that for any point x in E,
- [math]\displaystyle{ \prod_{j = 1}^{d} f_{j} (\pi_{j} (x))^{1 / (d - 1)} = 1. }[/math]
Hence, by the Loomis–Whitney inequality,
- [math]\displaystyle{ | E | \leq \prod_{j = 1}^{d} | \pi_{j} (E) |^{1 / (d - 1)}, }[/math]
and hence
- [math]\displaystyle{ | E | \geq \prod_{j = 1}^{d} \frac{| E |}{| \pi_{j} (E) |}. }[/math]
The quantity
- [math]\displaystyle{ \frac{| E |}{| \pi_{j} (E) |} }[/math]
can be thought of as the average width of [math]\displaystyle{ E }[/math] in the [math]\displaystyle{ j }[/math]th coordinate direction. This interpretation of the Loomis–Whitney inequality also holds if we consider a finite subset of Euclidean space and replace Lebesgue measure by counting measure.
The following proof is the original one[1]
Overview: We prove it for unions of unit cubes on the integer grid, then take the continuum limit. When [math]\displaystyle{ d=1, 2 }[/math], it is obvious. Now induct on [math]\displaystyle{ d+1 }[/math]. The only trick is to use Hölder's inequality for counting measures.
Enumerate the dimensions of [math]\displaystyle{ \R^{d+1} }[/math] as [math]\displaystyle{ 0, 1, ..., d }[/math].
Given [math]\displaystyle{ N }[/math] unit cubes on the integer grid in [math]\displaystyle{ \R^{d+1} }[/math], with their union being [math]\displaystyle{ T }[/math], we project them to the 0-th coordinate. Each unit cube projects to an integer unit interval on [math]\displaystyle{ \R }[/math]. Now define the following:
- [math]\displaystyle{ I_1, ..., I_k }[/math] enumerate all such integer unit intervals on the 0-th coordinate.
- Let [math]\displaystyle{ T_i }[/math] be the set of all unit cubes that projects to [math]\displaystyle{ I_i }[/math].
- Let [math]\displaystyle{ N_j }[/math] be the area of [math]\displaystyle{ \pi_j(T) }[/math], with [math]\displaystyle{ j = 0, 1, ..., d }[/math].
- Let [math]\displaystyle{ a_i }[/math] be the volume of [math]\displaystyle{ T_i }[/math]. We have [math]\displaystyle{ \sum_i a_i = N }[/math], and [math]\displaystyle{ a_i \leq N_0 }[/math].
- Let [math]\displaystyle{ T_{ij} }[/math] be [math]\displaystyle{ \pi_j(T_i) }[/math] for all [math]\displaystyle{ j = 1, ..., d }[/math].
- Let [math]\displaystyle{ a_{ij} }[/math] be the area of [math]\displaystyle{ T_{ij} }[/math]. We have [math]\displaystyle{ \sum_i a_{ij} = N_j }[/math].
By induction on each slice of [math]\displaystyle{ T_i }[/math], we have [math]\displaystyle{ a_i^{d-1}\leq \prod_{j=1}^d a_{ij} }[/math]
Multiplying by [math]\displaystyle{ a_i \leq N_0 }[/math], we have [math]\displaystyle{ a_i^{d}\leq N_0\prod_{j=1}^d a_{ij} }[/math]
Thus [math]\displaystyle{ N = \sum_i a_i \leq \sum_i N_0^{1/d} \prod_{j=1}^d a_{ij}^{1/d} = N_0^{1/d} \sum_{i=1}^k\prod_{j=1}^d a_{ij}^{1/d} }[/math]
Now, the sum-product can be written as an integral over counting measure, allowing us to perform Holder's inequality: [math]\displaystyle{ \sum_{i=1}^k\prod_{j=1}^d a_{ij}^{1/d} = \int_i \prod_{j=1}^d a_{ij}^{1/d} = \left\|\prod_{j=1}^d a_{\cdot, j}^{1/d}\right\|_1 \leq \prod_j \|a_{\cdot, j}^{1/d}\|_d=\prod_{j=1}^d \left(\sum_{i=1}^k a_{ij}\right)^{1/d} }[/math]
Plugging in [math]\displaystyle{ \sum_i a_{ij} = N_j }[/math], we get [math]\displaystyle{ N^d \leq \prod_{j=0}^d N_j }[/math]
Corollary. Since [math]\displaystyle{ 2 |\pi_j(E)| \leq |\partial E| }[/math], we get a loose isoperimetric inequality:
[math]\displaystyle{ |E|^{d-1}\leq 2^{-d}|\partial E|^d }[/math]Iterating the theorem yields [math]\displaystyle{ | E | \leq \prod_{1 \leq j \lt k \leq d} | \pi_{j}\circ \pi_k (E) |^{\binom{d-1}{2}^{-1}} }[/math] and more generally[2][math]\displaystyle{ | E | \leq \prod_j | \pi_{j} (E) |^{\binom{d-1}{k}^{-1}} }[/math]where [math]\displaystyle{ \pi_j }[/math] enumerates over all projections of [math]\displaystyle{ \R^d }[/math] to its [math]\displaystyle{ d-k }[/math] dimensional subspaces.
Generalizations
The Loomis–Whitney inequality is a special case of the Brascamp–Lieb inequality, in which the projections πj above are replaced by more general linear maps, not necessarily all mapping onto spaces of the same dimension.
References
- ↑ 1.0 1.1 Loomis, L. H.; Whitney, H. (1949). "An inequality related to the isoperimetric inequality" (in en). Bulletin of the American Mathematical Society 55 (10): 961–962. doi:10.1090/S0002-9904-1949-09320-5. ISSN 0273-0979. https://www.ams.org/bull/1949-55-10/S0002-9904-1949-09320-5/.
- ↑ Burago, Yurii D.; Zalgaller, Viktor A. (2013-03-14) (in en). Geometric Inequalities. Springer Science & Business Media. pp. 95. ISBN 978-3-662-07441-1. https://books.google.com/books?id=Gpz6CAAAQBAJ&pg=PA1.
Sources
- Alon, Noga; Spencer, Joel H. (2016). The probabilistic method. Wiley Series in Discrete Mathematics and Optimization (Fourth edition of 1992 original ed.). Hoboken, NJ: John Wiley & Sons, Inc.. ISBN 978-1-119-06195-3.
- Boucheron, Stéphane; Lugosi, Gábor; Massart, Pascal (2013). Concentration inequalities. A nonasymptotic theory of independence. Oxford: Oxford University Press. doi:10.1093/acprof:oso/9780199535255.001.0001. ISBN 978-0-19-953525-5.
- Burago, Yu. D.; Zalgaller, V. A. (1988). Geometric inequalities. Grundlehren der mathematischen Wissenschaften. 285. Berlin: Springer-Verlag. doi:10.1007/978-3-662-07441-1. ISBN 3-540-13615-0.
- Hadwiger, H. (1957). Vorlesungen über Inhalt, Oberfläche und Isoperimetrie. Grundlehren der mathematischen Wissenschaften. 93. Berlin–Göttingen–Heidelberg: Springer-Verlag. doi:10.1007/978-3-642-94702-5. ISBN 3-642-94702-6.
- Loomis, L. H.; Whitney, H. (1949). "An inequality related to the isoperimetric inequality". Bulletin of the American Mathematical Society 55 (10): 961–962. doi:10.1090/S0002-9904-1949-09320-5.
![]() | Original source: https://en.wikipedia.org/wiki/Loomis–Whitney inequality.
Read more |