Abstract
Log-Sobolev inequalities (LSIs) upper-bound entropy via a multiple of the Dirichlet form (i.e. norm of a gradient). In this paper we prove a family of entropy-energy inequalities for the binary hypercube which provide a non-linear comparison between the entropy and the Dirichlet form and improve on the usual LSIs for functions with small support. These non-linear LSIs, in turn, imply a new version of the hypercontractivity for such functions. As another consequence, we derive a sharp form of the uncertainty principle for the hypercube: a function whose energy is concentrated on a set of small size, and whose Fourier energy is concentrated on a small Hamming ball must be zero. The tradeoff between the sizes that we derive is asymptotically optimal. This new uncertainty principle implies a new estimate on the size of Fourier coefficients of sparse Boolean functions. We observe that an analogous (asymptotically optimal) uncertainty principle in the Euclidean space follows from the sharp form of Young's inequality due to Beckner. This hints that non-linear LSIs augment Young's inequality (which itself is sharp for finite groups).
| Original language | English |
|---|---|
| Article number | 108280 |
| Journal | Journal of Functional Analysis |
| Volume | 277 |
| Issue number | 11 |
| DOIs | |
| State | Published - 1 Dec 2019 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2019
Funding
The work of Y.P. was supported (in part) by the National Science Foundation under Grant No CCF-13-18620, and by the Center for Science of Information (CSoI), an NSF Science and Technology Center, under grant agreement CCF-09-39370. The work of A.S. was supported (in part) by grants from the United States-Israel Binational Science Foundation (BSF): grant number 2010451 and from the Israel Science Foundation: grant number 1724/15. The work of Y.P. was supported (in part) by the National Science Foundation under Grant No CCF-13-18620 , and by the Center for Science of Information (CSoI), an NSF Science and Technology Center, under grant agreement CCF-09-39370 . The work of A.S. was supported (in part) by grants from the United States-Israel Binational Science Foundation (BSF): grant number 2010451 and from the Israel Science Foundation : grant number 1724/15 .
| Funders | Funder number |
|---|---|
| Center for Science of Information | |
| NSF Science and Technology Center | CCF-09-39370 |
| National Science Foundation | CCF-13-18620 |
| Bloom's Syndrome Foundation | 2010451 |
| United States-Israel Binational Science Foundation | |
| Israel Science Foundation | 1724/15 |
| Guangxi Experiment Center of Information Science |
Keywords
- Coding theory
- Hamming space
- Hypercontractivity
- Uncertainty principle