Iterated lower shadow (${\partial }^j\mathcal{F}$)

Repeatedly take the lower shadow of a uniform set family. After $j$ steps the result consists of all subsets of its members whose size is $j$ smaller. Iterating the Kruskal-Katona theorem shows that colexicographic initial segments minimize every iterated lower shadow.