= Ellentuck meagre-set fusion lemma
{c}
Countably many <completely Ramsey-null> sets can be avoided simultaneously in a stem-preserving <Ellentuck topology> refinement. Select an increasing sequence $b_j$ with nested infinite remaining tails. At stage $j$, thin the tail to avoid the $j$th set for every stem $s\cup t$, where $t$ ranges over all subsets of the first $j$ selected points. There are only finitely many such stems. Any infinite subset of the final selected sequence uses some such $t$ before stage $j$ and has all remaining points in the thinned tail. Thus it avoids every forbidden set. This explains why an argument checking only the full selected prefix is insufficient.
Back to article page
