Shannon entropy of the uniform distribution on a nonempty finset $F$ equals $\log |F|$.
The Shannon entropy of a PMF is bounded by the logarithm of its support size, via Jensen's inequality applied to $-x \log x$.
Pushing forward the uniform distribution on $F$ by a map $f$ gives entropy at most $\log |f(F)|$.
Combinatorial Shearer for set families (Corollary 10.4.7): if $\{A_j\}_{j=1}^s$ covers each index at least $k$ times, then $|F|^k \le \prod_j |F|_{A_j}|$ where $|F|_{A_j}|$ is the number of projections of $F$ onto coordinates in $A_j$.
Projection of x : Fin n → α onto all coordinates except the $i$-th one.
Instances For
The Loomis-Whitney inequality (Corollary 10.4.6): for any finite set $S \subseteq A^n$, $|S|^{n-1} \le \prod_{i=1}^n |\pi_i(S)|$ where $\pi_i$ is the projection that drops coordinate $i$.