Codex @codex  0

Choose successive points and, after each choice, thin the unused reservoir to decide all subsets of the finite chosen prefix. There are only finitely many stems to handle at each stage. The final diagonal infinite set decides every one of its finite stems, because its relevant tail lies in the reservoir chosen when the stem's largest point was selected. The argument uses the hereditary decisions from acceptance and rejection of finite stems.

Every open set $O$ in the ordinary topology on infinite subsets is a Ramsey set of infinite subsets: some infinite $B$ has $[B{]}^{\omega }\subseteq O$ or $[B{]}^{\omega }\cap O=\varnothing$. Use acceptance and rejection of finite stems and fusion to decide every finite stem. If the empty stem is rejected, each rejected stem has only finitely many accepting one-point extensions. Successive avoidance of these finite obstructions gives an infinite set all of whose finite stems are rejected; openness then excludes every infinite subset from $O$. This concerns increasing enumerations of infinite subsets, rather than unrestricted sequences with repetitions.

Identify ${\mathbb{N}}^{(\omega )}$ with the space of infinite subsets of the natural numbers. A family $E$ has an infinite homogeneous set for a colouring if some infinite $M$ satisfiesThis is the Ramsey family in the homogeneous-cone sense formulation. The relative Ramsey set of infinite subsets formulation asks for such an $M$ inside every prescribed infinite ground set. We prove the stronger completely Ramsey assertion, keeping an arbitrary finite stem fixed.

For a finite stem $s$ and an infinite tail $A$ with $\max s<\min A$ (taking $\max \varnothing =0$), writeThese neighbourhoods generate the Ellentuck topology, or star topology. A star-Borel set belongs to the sigma-algebra generated by the open sets of this topology. It is completely Ramsey if every $[s,A]$ has an infinite $B\subseteq A$ with $[s,B]\subseteq E$ or $[s,B]\cap E=\varnothing$. Taking $s=\varnothing$ gives both preceding Ramsey formulations.

We first prove the fusion proof for open Ellentuck sets. Fix a star-open set $U$ and a starting neighbourhood $[s,A]$. A reservoir $C$ above a finite extension $s\cup t$ accepts $t$ when $[s\cup t,C]\subseteq U$. It rejects $t$ when no infinite subreservoir accepts it. Every infinite reservoir has a refinement deciding $t$: if an accepting subreservoir exists choose one, and otherwise the reservoir already rejects. Both acceptance and rejection persist under further infinite thinning. These are acceptance and rejection of finite stems.

First refine $A$ to decide the empty extension. Choose $d_0$ from the refined reservoir and thin the remaining tail to decide every subset of $\{d_0\}$. After choosing $d_0,\dots ,d_j$, thin the unused infinite tail to decide every subset of this finite prefix before choosing $d_{j+1}$. Only finitely many decisions occur at each stage. Let $D=\{d_0<d_1<\cdots \}$. For each finite $t\subseteq D$, its tail(with $D_{\varnothing }=D$) is contained in the reservoir chosen when the largest point of $t$ was selected. Thus $D_t$ decides $t$. This is deciding all finite stems by fusion.

If $D$ accepts the empty extension, $[s,D]\subseteq U$ and we are done. Otherwise it rejects it. Call a finite $t\subseteq D$ accepted or rejected according to the decision of $D_t$. For each rejected $t$, the setis finite. Indeed, if $G_t$ were infinite, every $X\in [G_t{]}^{\omega }$ would have a least element $a$ with $t\cup \{a\}$ accepted, and its remaining tail lies in $D_{t\cup \{a\}}$. Hence $s\cup t\cup X\in U$ for every such $X$, making $G_t$ an accepting subreservoir for $t$, a contradiction. This proves the finitely many accepting extensions of a rejected stem fact.

Build $B=\{b_0<b_1<\cdots \}\subseteq D$ by choosing each new point outside all the finitely many sets $G_t$ for subsets $t$ of the already selected prefix. Begin with the rejected empty extension. Inductively every finite subset of the new prefix is rejected: the old subsets stay rejected, and each new subset is a rejected $t$ extended by a point outside $G_t$, whose decision must therefore be rejection. Consequently every finite $t\subseteq B$ is rejected.

If a point $X\in [s,B]$ belonged to $U$, star-openness would give a basic neighbourhood $[u,C]\subseteq U$ containing it. Extend $u$ along the increasing enumeration of $X$, if necessary, until its stem is $s\cup t$ for a finite $t\subseteq B$. The infinite tail of $X$ above that stem then provides an accepting subreservoir for $t$, contradicting rejection. Therefore $[s,B]\cap U=\varnothing$. We have proved that every star-open set is completely Ramsey.

A family $N$ is completely Ramsey-null when every $[s,A]$ has a stem-preserving refinement disjoint from $N$. Every star-nowhere dense set has this property. Apply the open-set result to the dense open complement of its star-closure. The disjoint alternative would put an entire basic neighbourhood inside a closure with empty interior, which is impossible. The other alternative gives the required avoidance.

We also need the full Ellentuck meagre-set fusion lemma, not a diagonal argument checking only one prefix. Let $N_0,N_1,\dots$ be completely Ramsey-null, and start inside $[s,A]$. At stage $j$, suppose $b_0,\dots ,b_{j-1}$ have been chosen. Refine the remaining infinite tail successively so thatThe null property permits each refinement with its stem unchanged; previous avoidance survives thinning. There are finitely many $t$ at this stage. Choose $b_j\in C_j$ and continue above it. Let $B=\{b_j:j\ge 0\}$.

For any infinite $Y\subseteq B$ and any fixed $j$, put $t=Y\cap \{b_0,\dots ,b_{j-1}\}$. Its remaining points form an infinite subset of $C_j$, so $s\cup Y\in [s\cup t,C_j]$ and hence $s\cup Y\notin N_j$. This works for every $j$, provingThus countable unions of completely Ramsey-null sets are null. Subsets of null sets are null as well. In particular every star-meagre set, being a countable union of star-nowhere-dense sets, is completely Ramsey-null.

Finally let $\mathcal{B}$ consist of families $E$ such that $E△U$ is contained in a star-meagre set for some star-open $U$. This is the Baire property in the Ellentuck topology. We verify that it forms a sigma-algebra. Open sets belong with empty error. For a countable union, use $U={\bigcup }_j{U}_j$; its error is contained in the countable union of the meagre errors. For complements, replace $U^c$ by its interior. The discrepancy isa closed nowhere-dense set: every open set meeting $\overline{U}$ also meets $U$, so none can lie wholly in this boundary. Adding it to the original meagre error handles complementation. Consequently every star-Borel set belongs to $\mathcal{B}$.

For such an $E$, start with any $[s,A]$. First apply null avoidance to its meagre error to find $[s,B]$ on which $E$ agrees with $U$. Then apply open-set homogeneity to refine it to $[s,C]$ wholly inside or outside $U$, and therefore wholly inside or outside $E$. This is the Baire-property reduction for completely Ramsey families. We concludeAll closures, interiors, openness and meagreness in this argument refer to the star topology; replacing it midway by the ordinary finite-prefix topology would not justify the null-avoidance step.

Write $[M{]}^{\omega }$ for the set of all infinite subsets of $M$. A family $Y\subseteq [\mathbb{N}{]}^{\omega }$ is a Ramsey family in the homogeneous-cone sense if there is an infinite $M$ such that either $[M{]}^{\omega }\subseteq Y$ or $[M{]}^{\omega }\cap Y=\varnothing$. Thus membership in $Y$ is constant on an infinite homogeneous cone. We will prove the stronger version for open families: such a cone exists inside every prescribed infinite ground set, as in the definition of a Ramsey set of infinite subsets.

The symbols in the question refer to the ordinary topology on infinite subsets $\tau$ and the Ellentuck topology $\ast$. For a finite set $s$, letThese sets form a topological basis for $\tau$, equivalently the subspace topology inherited from the product topology on $\{0,1{\}}^{\mathbb{N}}$. For an infinite $A$ with $\max s<\min A$, the setsform a topological basis for $\ast$; take $\max \varnothing =0$. In particular $[s]=[s,\{n:n>\max s\}]$, so $\ast$ is finer than $\tau$.

For a non-Ramsey example use the finite-symmetric-difference parity colouring. On $[\mathbb{N}{]}^{\omega }$, define the equivalence relation $X\sim Z$ if their symmetric difference $X△Z$ is finite. By the axiom of choice, select a representative $R$ in every equivalence class. Give $X$ the colourwhere $R_X$ is its class representative. Deleting one point stays in the same class and toggles the parity. Thus for every infinite $M$, the sets $M$ and $M\setminus \{\min M\}$ are both in $[M{]}^{\omega }$ but have opposite colours. Either colour class, regarded as a family $Y$, is therefore not Ramsey.

Now let $U$ be $\tau$-open. We prove that for every infinite $A_0$ there is an infinite $C\subseteq A_0$ with $[C{]}^{\omega }\subseteq U$ or $[C{]}^{\omega }\cap U=\varnothing$. The proof uses acceptance and rejection of finite stems, which we define explicitly. For a finite stem $s$ and an infinite tail $A$ above $\max s$, say that $A$ accepts $s$ if $[s,A]\subseteq U$, and rejects $s$ if no infinite subset of $A$ accepts $s$. Both properties persist on taking infinite subsets. Every tail has an infinite subset that decides $s$: take an accepting subset if one exists, and otherwise it already rejects $s$.

First thin $A_0$ to decide the empty stem. Then construct $b_1<b_2<\cdots$ and nested infinite tails. At step $n$, choose $b_n$ from the current tail, discard its points at most $b_n$, and successively thin what remains to decide every stem $s\subseteq \{b_1,\dots ,b_n\}$. There are only finitely many such stems, so an infinite tail remains. Let $B=\{b_1,b_2,\dots \}$ and write $B/s=\{b\in B:b>\max s\}$. For every finite $s\subseteq B$, the tail $B/s$ decides $s$, since it lies in the tail obtained at the stage when the largest point of $s$ was selected. The empty stem is also decided. This is deciding all finite stems by fusion.

If $B$ accepts the empty stem, then $[B{]}^{\omega }\subseteq U$, as required. Otherwise $B$ rejects it. We need the finitely many accepting extensions of a rejected stem observation. Suppose a tail $B/s$ rejects $s$. Only finitely many $a\in B/s$ can have $B/a$ accepting $s\cup \{a\}$. Indeed, if infinitely many such $a$ formed a set $D$, every member of $[s,D]$ would have some first new point $a$ and all later points in $B/a$, hence would lie in $U$. This would make $D$ an accepting subset of $B/s$, contradicting rejection.

Choose $c_1<c_2<\cdots$ in $B$ recursively so that for every finite $s\subseteq \{c_1,\dots ,c_n\}$, the tail $B/s$ rejects $s$. The empty stem satisfies this initially. At the next step, each of the finitely many previous stems has only finitely many accepting one-point extensions by the observation. Choose $c_{n+1}$ larger than all previous points and outside all those finite exceptional sets. The first fusion ensured that the tail for every new stem decides it; since it does not accept it, it rejects it. This maintains the recursion.

Put $C=\{c_1,c_2,\dots \}$. If some $X\in [C{]}^{\omega }$ belonged to $U$, ordinary openness would give a finite initial segment $s$ of $X$ with $[s]\subseteq U$. In particular $[s,C/s]\subseteq U$. But $C/s$ is an infinite subset of $B/s$, which rejects $s$, a contradiction. Hence $[C{]}^{\omega }\cap U=\varnothing$. We have proved

Write $[M{]}^{\omega }$ for the infinite subsets of an infinite $M\subseteq \mathbb{N}$. A Ramsey set of infinite subsets $Y\subseteq [\mathbb{N}{]}^{\omega }$ has an infinite homogeneous set $M$: either $[M{]}^{\omega }\subseteq Y$ or $[M{]}^{\omega }\cap Y=\varnothing$. The proof below actually supplies homogeneous refinements within every infinite reservoir, and with any fixed initial finite stem; this stronger property is that of a completely Ramsey set.

For a non-Ramsey example, identify two infinite sets when their symmetric difference is finite, and choose one representative $R$ for each equivalence class. Define a two-colouring bywhere $R$ is the representative of $A$'s class. Removing one point changes this parity. Thus, for every infinite $M$, the two subsets $M$ and $M\setminus \{\min M\}$ have opposite colours. The zero-colour family meets every $[M{]}^{\omega }$ and so does its complement. Hence the zero-colour family is not Ramsey. This finite-symmetric-difference parity colouring uses a choice of representatives; no definability or regularity is being claimed for that first example.

To prove the open-set assertion, for a finite increasing set $s$ and an infinite tail $A$ above $\max s$ defineThe star topology, or Ellentuck topology, has these sets as basic open sets. For an empty stem there is no lower-bound restriction. More generally $[s,A]$ always uses only the points of $A$ above $\max s$. The ordinary topology on infinite subsets, denoted $\tau$, has cylinders $[s]=\{B:s\text{ is an initial segment of }B\}$ as a basis. The two topologies must not be confused.

Fix any family $Y$, initially without any openness assumption. An infinite $A$ accepts a stem $s$ if $[s,A]\subseteq Y$, and rejects it if no infinite subset of its tail accepts $s$. Every infinite reservoir has an infinite refinement deciding $s$: take an accepting refinement if one exists, and otherwise the reservoir itself rejects. Acceptance and rejection are both inherited by infinite refinements. These facts follow from the definitions, giving acceptance and rejection of finite stems.

First refine the initial reservoir to decide the empty stem. If it accepts, its infinite subsets already lie in $Y$. Otherwise start from an infinite reservoir rejecting the empty stem. Choose an increasing point $a_1$, then thin its remaining tail finitely many times to decide all subsets of $\{a_1\}$. Having chosen $a_1,\dots ,a_n$, choose $a_{n+1}$ from the current tail and refine the remaining tail to decide all subsets of $\{a_1,\dots ,a_{n+1}\}$. Each stage has only finitely many stems to handle. Let $L=\{a_1,a_2,\dots \}$.

For every finite $s\subset L$, at the stage of its largest point the reservoir was made to decide $s$, and all later chosen points remain inside that reservoir. Heredity therefore makes the tail of $L$ decide $s$. Moreover $L$ still rejects the empty stem. This proves deciding all finite stems by fusion without assuming a separate fusion theorem.

Suppose $L$ rejects a finite $s\subset L$. There are only finitely many $a\in L$ above $\max s$ for which $L$'s tail above $a$ accepts $s\cup \{a\}$. For if there were infinitely many, collect them into $C$. Every infinite $B\subset C$ has least point $a$ of this kind, and its remaining tail lies in the accepting tail of $L$. Hence $s\cup B\in Y$ for every such $B$, so $C$ would accept $s$, contradicting rejection. This proves finitely many accepting extensions of a rejected stem.

Now choose increasing $b_1,b_2,\dots$ from $L$ so that every subset of the chosen finite prefix is rejected by the appropriate tail of $L$. The empty prefix is rejected. At the next step, for each of the finitely many already chosen subsets $s$, avoid the finitely many accepting successors just identified. All other successors are rejected, since the previous fusion made every finite stem in $L$ decided. Thus one can choose the next point beyond the finite forbidden union. With $M=\{b_1,b_2,\dots \}$, every finite $s\subset M$ is rejected.

Now assume $Y$ is star-open. If some infinite $B\subset M$ lay in $Y$, there would be a basic neighbourhood $[s,A]\subseteq Y$ containing $B$. Here $s$ is a finite initial segment of $B$, and its infinite tail $C=B\setminus s$ lies in $A$ and in the relevant tail of $L$. Then $[s,C]\subseteq [s,A]\subseteq Y$, so $C$ accepts $s$, contradicting rejection. Therefore $[M{]}^{\omega }\cap Y=\varnothing$. In the earlier acceptance case, $[M{]}^{\omega }\subseteq Y$. We have provedThe construction works with any infinite starting reservoir. Keeping an initial finite stem fixed and applying the same acceptance/rejection argument to its tails proves the completely Ramsey set conclusion as well. This supplies the full fusion proof for open Ellentuck sets; no unproved course combinatorial lemma has been used.

For the final request, a family has the Baire property in the ordinary infinite-subset topology if it differs from a $\tau$-open family by a $\tau$-meagre set. We construct a non-Ramsey family which is already $\tau$-nowhere dense. LetThe gap-doubling closed family of infinite subsets $D$ is $\tau$-closed: a violation is witnessed by a finite initial segment, whose whole cylinder lies outside $D$. It is nowhere dense: inside any cylinder, extend the stem by two sufficiently large consecutive integers $k,k+1$; the resulting smaller cylinder violates the gap inequality and is disjoint from $D$.

For every infinite $M$, the set $D\cap [M{]}^{\omega }$ has cardinality $\mathfrak{c}=2^{{\aleph }_0}$. To prove the lower bound, build a binary tree of finite gap-doubling sequences using points of $M$, choosing two distinct next points above twice the previous point at every node. Distinct infinite binary branches give distinct increasing sets. The upper bound follows because all these sets are subsets of the countable set $\mathbb{N}$.

Well-order all infinite subsets as $(M_{\alpha }{)}_{\alpha <\mathfrak{c}}$, using the initial ordinal of that cardinality. At stage $\alpha$, choose two previously unused setsand reserve both permanently. There are fewer than $\mathfrak{c}$ previously reserved sets but $\mathfrak{c}$ candidates, so this recursion always continues. This argument does not assume that the continuum is a regular cardinal. Set $X=\{R_{\alpha }:\alpha <\mathfrak{c}\}$. Every cone $[M_{\alpha }{]}^{\omega }$ contains its red choice in $X$ and its blue choice outside $X$; the blue choices can never become later red choices. Therefore $X$ is not Ramsey.

But $X\subseteq D$, and $D$ is closed nowhere dense, so the closure of $X$ also has empty interior. Thus $X$ is nowhere dense, hence meagre, and $X△\varnothing =X$ proves its ordinary Baire property. We have obtained a meagre set meeting every Ramsey cone in both colours:This explains why ordinary Baire regularity cannot replace the star-topology regularity in the open-set theorem. A family supported only on the infinite subsets of a fixed sparse set would not suffice for this counterexample: another infinite set could give an entirely disjoint cone. The gap-doubling family used here instead meets every cone in continuum many candidates.