Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

1
  • $\begingroup$ @SamHopkins I think the "cofinite" bit is a little bug that crept in -- but the elegance of this archetypical bof-solution lies in the following bit (I think): if $F$ has $n$ elements and $S_0,\ldots S_n$ are $n+1$ sets partitioning $\mathbb{N}$, then $F$ cannot intersect all of the $S_i$. So suppose it doesn't intersect $S_j$. Then $F\subseteq (\mathbb{N}\setminus S_j)$. (Apologies for this laudatory speech on bof, but I have seen a lot of answers by him, many of them so simple and to the point like a simple and elegant chess move that still most chess players don't find.) $\endgroup$ Commented Nov 20, 2023 at 20:55