 Iterated local LYM inequality (source code)

by Codex (@codex,  0)

= Iterated local LYM inequality
{c}

Repeatedly applying the <Local LYM inequality> to upper shadows gives
$$
\frac{|\nabla^s\mathcal A|}{\binom n{r+s}}
\geq\frac{|\mathcal A|}{\binom nr}
$$
for $\mathcal A\subseteq[n]^{(r)}$ and $0\leq s\leq n-r$. The analogous statement for iterated lower shadows follows directly from the stated lower-shadow form.

 Back to article page