Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Entropy (information theory)
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Loomis–Whitney inequality=== A simple example of this is an alternative proof of the [[Loomis–Whitney inequality]]: for every subset {{math|''A'' ⊆ '''Z'''<sup>''d''</sup>}}, we have <math display="block"> |A|^{d-1}\leq \prod_{i=1}^{d} |P_{i}(A)|</math> where {{math|''P''<sub>''i''</sub>}} is the [[orthogonal projection]] in the {{math|''i''}}th coordinate: <math display="block"> P_{i}(A)=\{(x_{1}, \ldots, x_{i-1}, x_{i+1}, \ldots, x_{d}) : (x_{1}, \ldots, x_{d})\in A\}.</math> The proof follows as a simple corollary of [[Shearer's inequality]]: if {{math|''X''<sub>1</sub>, ..., ''X''<sub>''d''</sub>}} are random variables and {{math|''S''<sub>1</sub>, ..., ''S''<sub>''n''</sub>}} are subsets of {{math|{1, ..., ''d''}}} such that every integer between 1 and {{math|''d''}} lies in exactly {{math|''r''}} of these subsets, then <math display="block"> \Eta[(X_{1}, \ldots ,X_{d})]\leq \frac{1}{r}\sum_{i=1}^{n}\Eta[(X_{j})_{j\in S_{i}}]</math> where <math> (X_{j})_{j\in S_{i}}</math> is the Cartesian product of random variables {{math|''X''<sub>''j''</sub>}} with indexes {{math|''j''}} in {{math|''S''<sub>''i''</sub>}} (so the dimension of this vector is equal to the size of {{math|''S''<sub>''i''</sub>}}). We sketch how Loomis–Whitney follows from this: Indeed, let {{math|''X''}} be a uniformly distributed random variable with values in {{math|''A''}} and so that each point in {{math|''A''}} occurs with equal probability. Then (by the further properties of entropy mentioned above) {{math|Η(''X'') {{=}} log{{abs|''A''}}}}, where {{math|{{abs|''A''}}}} denotes the cardinality of {{math|''A''}}. Let {{math|''S''<sub>''i''</sub> {{=}} {1, 2, ..., ''i''−1, ''i''+1, ..., ''d''}}}. The range of <math>(X_{j})_{j\in S_{i}}</math> is contained in {{math|''P''<sub>''i''</sub>(''A'')}} and hence <math> \Eta[(X_{j})_{j\in S_{i}}]\leq \log |P_{i}(A)|</math>. Now use this to bound the right side of Shearer's inequality and exponentiate the opposite sides of the resulting inequality you obtain.
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Entropy (information theory)
(section)
Add topic