The cone on the even integers is nonempty and Ellentuck topology open, while it is closed and nowhere dense in the ordinary topology on infinite subsets. Choose a finite-symmetric-difference parity colouring on that cone and take one colour class. The class is still ordinarily nowhere dense because its closure lies in the cone, but every stem-free refinement inside the cone meets both colours. Hence it is not completely Ramsey.
Write for the space of infinite subsets of the natural numbers, with each subset identified with its increasing enumeration. In the homogeneous-cone convention, a family is a Ramsey family in the homogeneous-cone sense when some infinite satisfies
The stronger Ramsey set of infinite subsets convention asks for such an infinite inside every given infinite ground set . We will prove the open-set assertion in this stronger form, and our Ramsey-but-not-completely-Ramsey example will satisfy it as well. Thus the distinction in conventions does not affect any of the conclusions below.
For a non-Ramsey example, declare if their symmetric difference is finite, and choose a representative from each equivalence class using the axiom of choice. Set
for the representative of the class of . Removing one point reverses this colour, because its symmetric difference with changes by exactly one point. Consequently every cone contains the oppositely coloured sets and . Either colour class of this finite-symmetric-difference parity colouring is not a Ramsey family in the homogeneous-cone sense. No definability is claimed for the representative selection.
The ordinary topology on infinite subsets, denoted , has basic cylinders , where is a finite stem of the increasing enumeration. Let be a -open family and fix an arbitrary infinite ground set . We give a complete fusion proof of a homogeneous cone inside .
Use the convention . For finite and an infinite reservoir above , say that accepts if , where
Say that rejects if no infinite subset of accepts . There is always a refinement deciding : choose an accepting subreservoir if one exists, and otherwise retain , which rejects. Both decisions persist under further thinning.
A first fusion produces an infinite deciding every finite on its tail . First decide the empty stem. Choose the first point, and thin the remaining reservoir successively to decide every subset of the selected prefix. Repeat after choosing each new point. There are finitely many subsets to decide at each stage. The diagonal sequence of chosen points has the required property, since its tail after the largest point of any stem lies in the reservoir where that stem was decided. The empty-stem decision persists too. This is deciding all finite stems by fusion.
If accepts the empty stem, and we are done. Suppose it rejects. For a rejected finite , only finitely many can have accepting . Otherwise let be their infinite set. Every infinite starts with some such , and its remaining tail lies in , so . Then accepts , contradicting rejection. This proves finitely many accepting extensions of a rejected stem.
A second fusion constructs whose every finite subset is rejected. If a finite prefix of chosen points has been selected, all its subsets are rejected by induction. Avoid the union of their finitely many accepting successor sets when choosing the next point. The first fusion already decides every successor, so every new subset is rejected. An infinite reservoir remains after each finite exclusion.
If some belonged to , openness would give an initial segment with . Its reservoir would then accept , contradicting the second fusion. Therefore . In either case we have a homogeneous cone inside the arbitrary ground set . Every -open family is a Ramsey set of infinite subsets, under both conventions.
A completely Ramsey set requires more: for every finite and infinite reservoir above , there is an infinite such that
The finite stem must be kept fixed. These are the basic neighbourhoods of the Ellentuck topology, also called the star topology.
Let be the even positive integers, and construct the finite-symmetric-difference parity colouring on . Define
For any infinite ground set , the set is still infinite and its whole cone misses . Thus is a Ramsey set of infinite subsets even in the stronger convention. But inside , every infinite refinement gives the two sets and of opposite colours. Hence no such refinement is homogeneous. The family is Ramsey but not completely Ramsey. The stem-supported Ramsey family need not be completely Ramsey construction explains this example: forgetting the stem is precisely what loses the obstruction.
Finally take . It is nonempty and star-open, since it equals . It is -closed: if an infinite set contains an odd integer, an initial segment witnessing that integer has a cylinder disjoint from . Its -interior is empty: after any finite stem of even integers, append an arbitrarily large odd integer and then infinitely many further points. Thus
This is the cone on an infinite coinfinite ground set. Choose its subset . Since , is also -nowhere dense. Nevertheless every with infinite contains both and , of opposite colours. Hence is not completely Ramsey. We have proved explicitly that ordinarily nowhere-dense sets need not be completely Ramsey; the topology in the nowhere-dense hypothesis cannot be silently changed to the star topology.
Identify the space of infinite subsets of the natural numbers with their increasing enumerations, with the ordinary topology on infinite subsets inherited from the discrete product . This is the sequence convention in the Open Ramsey theorem. For a general infinite ground set, first choose a countably infinite subset and use its enumeration. The theorem cannot mean unrestricted sequences with repetitions: the clopen partition according as the first two entries agree or differ has both colours over every infinite ground set.
For a finite finite stem and an infinite tail above , write
where the enumeration of precedes the tail. Let be open. The tail accepts if ; it rejects if no infinite subtail accepts it. Both properties persist on infinite subtails, and any stem can be decided by thinning: choose an accepting subtail if one exists; otherwise the current tail already rejects it.
Use deciding all finite stems by fusion. At stage , choose a new element from the current tail, then thin the remaining tail to decide each of the finitely many subsets of . First decide the empty stem as well. The final selected set decides every finite stem from , because all subsequent selections lie in the tail that decided that stem. If accepts the empty stem, and we are done.
Otherwise the empty stem is rejected. If a stem is rejected, only finitely many above can have the tail accepting . Indeed, if infinitely many such formed , then every starts with one of them and has its remaining tail in . It follows that , contradicting rejection of . All other one-point extensions are rejected, since the first fusion has already decided them.
Build an infinite recursively. Maintain that every subset of the finite selected prefix is rejected. To select its next element, avoid the finite union of the finitely many accepting-extension obstructions for these rejected stems. Such an element exists, and all the new stems remain rejected. Hence every finite stem from is rejected. If some were in , openness would supply a finite initial segment of whose entire ordinary cylinder is contained in . The tail would accept , a contradiction. Thus
In particular every open payoff has an infinite homogeneous set. A finite partition into open colour classes can be handled by successive application of this two-colour assertion.
For an arbitrary partition use finite-symmetric-difference parity colouring. On the infinite subsets of the ground set, declare when is finite, and choose a representative from each equivalence class. Colour by
For any infinite , removing one member gives an infinite in the same class and reverses the parity. Thus and have opposite colours, so neither colour contains all infinite subsets of any infinite ground set. This two-colouring has no infinite homogeneous set. Representative selection uses choice; the construction is deliberately unrestricted by topological regularity.
Write for the set of all infinite subsets of . A family is a Ramsey family in the homogeneous-cone sense if there is an infinite such that either or . Thus membership in 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 and the Ellentuck topology . For a finite set , let
These sets form a topological basis for , equivalently the subspace topology inherited from the product topology on . For an infinite with , the sets
form a topological basis for ; take . In particular , so is finer than .
For a non-Ramsey example use the finite-symmetric-difference parity colouring. On , define the equivalence relation if their symmetric difference is finite. By the axiom of choice, select a representative in every equivalence class. Give the colour
where is its class representative. Deleting one point stays in the same class and toggles the parity. Thus for every infinite , the sets and are both in but have opposite colours. Either colour class, regarded as a family , is therefore not Ramsey.
Now let be -open. We prove that for every infinite there is an infinite with or . The proof uses acceptance and rejection of finite stems, which we define explicitly. For a finite stem and an infinite tail above , say that accepts if , and rejects if no infinite subset of accepts . Both properties persist on taking infinite subsets. Every tail has an infinite subset that decides : take an accepting subset if one exists, and otherwise it already rejects .
First thin to decide the empty stem. Then construct and nested infinite tails. At step , choose from the current tail, discard its points at most , and successively thin what remains to decide every stem . There are only finitely many such stems, so an infinite tail remains. Let and write . For every finite , the tail decides , since it lies in the tail obtained at the stage when the largest point of was selected. The empty stem is also decided. This is deciding all finite stems by fusion.
If accepts the empty stem, then , as required. Otherwise rejects it. We need the finitely many accepting extensions of a rejected stem observation. Suppose a tail rejects . Only finitely many can have accepting . Indeed, if infinitely many such formed a set , every member of would have some first new point and all later points in , hence would lie in . This would make an accepting subset of , contradicting rejection.
Choose in recursively so that for every finite , the tail rejects . 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 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 . If some belonged to , ordinary openness would give a finite initial segment of with . In particular . But is an infinite subset of , which rejects , a contradiction. Hence . We have proved
Write for the space of infinite subsets of the natural numbers, and for all infinite subsets of an infinite . A family is a Ramsey set of infinite subsets if for every infinite there is an infinite with either or .
A non-Ramsey set of infinite subsets is obtained by finite-symmetric-difference parity colouring. Declare when their symmetric difference is finite, and use the axiom of choice to select a representative for each equivalence class. Put
For every infinite , both and belong to and have the same representative. Toggling one element changes the parity of the finite symmetric difference, so these two sets have opposite colors. Thus no is homogeneous, and is not a Ramsey set of infinite subsets. Only finite differences are counted; no parity is being assigned to an infinite cardinal.
We use the Ellentuck topology for the star notation. Its basic neighborhoods are
where is a finite stem (the initial segment of each member of the neighborhood) and every element of the infinite reservoir exceeds ; the empty stem is allowed. A star-nowhere dense set has star-closure with empty star-interior; a star-meagre set is a countable union of star-nowhere dense sets.
We need the following stem-preserving open-set conclusion: a star-open set has, in every , an infinite such that or . Here is the fusion proof for open Ellentuck sets, so that the precise form being used is explicit. A reservoir accepts a finite extension of when , and rejects it when no infinite subreservoir accepts it. Every reservoir can be thinned to decide a prescribed stem: take an accepting subreservoir if one exists, and otherwise it already rejects. Acceptance and rejection are hereditary under further infinite thinning.
First thin to decide . If it accepts, we have finished. Otherwise, choose successive points , thinning the unused tail after each selection to decide every stem with a subset of the finitely many points already selected. Each stage requires only finitely many decisions. The final set therefore decides every such finite extension, using the tail above its largest point. It rejects .
For any rejected stem , only finitely many possible next points of have accepting tails for . Otherwise collect infinitely many such points into . Every member of starts with some such , and its remaining points lie in the accepting tail above . Hence , contradicting rejection. A second selection now gives all of whose finite extensions of are rejected: at each stage avoid the finitely many forbidden next points for each subset of the chosen prefix. Previous rejections persist on thinning. If , star-openness gives an initial stem of and an infinite tail of whose entire neighborhood lies in . This is an accepting subreservoir for a stem we made rejected, a contradiction. Thus , proving the needed open-set conclusion.
Apply this conclusion to when is star-nowhere dense. This is star-open and star-dense. The alternative would give a nonempty star-open set inside , contradicting empty interior. Consequently every star-nowhere dense set can be avoided without extending the finite stem.
Now let , each star-nowhere dense, and fix . Construct with nested infinite unused reservoirs. At stage , let . For every , in turn, thin the current reservoir using the preceding avoidance property until
There are only finitely many such , and subsequent thinning preserves all previous avoidances. Choose and retain the part of above for the next stage. Put . For any and any , the finite part is one of the stems tested at stage , and the rest of lies in . Hence and . This proves .
The final is star-open and disjoint from , so it is also disjoint from the star-closure of . Every basic neighborhood therefore has a nonempty open refinement missing that closure. This Ellentuck meagre-set fusion lemma proves
Indeed, we obtained the stronger completely Ramsey-null property. Testing all subsets of the selected prefix was essential; testing just the entire prefix would not cover every infinite subset of .
Write for the infinite subsets of an infinite . A Ramsey set of infinite subsets has an infinite homogeneous set : either or . 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 for each equivalence class. Define a two-colouring by
where is the representative of 's class. Removing one point changes this parity. Thus, for every infinite , the two subsets and have opposite colours. The zero-colour family meets every 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 and an infinite tail above define
The star topology, or Ellentuck topology, has these sets as basic open sets. For an empty stem there is no lower-bound restriction. More generally always uses only the points of above . The ordinary topology on infinite subsets, denoted , has cylinders as a basis. The two topologies must not be confused.
Fix any family , initially without any openness assumption. An infinite accepts a stem if , and rejects it if no infinite subset of its tail accepts . Every infinite reservoir has an infinite refinement deciding : 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 . Otherwise start from an infinite reservoir rejecting the empty stem. Choose an increasing point , then thin its remaining tail finitely many times to decide all subsets of . Having chosen , choose from the current tail and refine the remaining tail to decide all subsets of . Each stage has only finitely many stems to handle. Let .
For every finite , at the stage of its largest point the reservoir was made to decide , and all later chosen points remain inside that reservoir. Heredity therefore makes the tail of decide . Moreover still rejects the empty stem. This proves deciding all finite stems by fusion without assuming a separate fusion theorem.
Suppose rejects a finite . There are only finitely many above for which 's tail above accepts . For if there were infinitely many, collect them into . Every infinite has least point of this kind, and its remaining tail lies in the accepting tail of . Hence for every such , so would accept , contradicting rejection. This proves finitely many accepting extensions of a rejected stem.
Now choose increasing from so that every subset of the chosen finite prefix is rejected by the appropriate tail of . The empty prefix is rejected. At the next step, for each of the finitely many already chosen subsets , avoid the finitely many accepting successors just identified. All other successors are rejected, since the previous fusion made every finite stem in decided. Thus one can choose the next point beyond the finite forbidden union. With , every finite is rejected.
Now assume is star-open. If some infinite lay in , there would be a basic neighbourhood containing . Here is a finite initial segment of , and its infinite tail lies in and in the relevant tail of . Then , so accepts , contradicting rejection. Therefore . In the earlier acceptance case, . We have proved
The 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 -open family by a -meagre set. We construct a non-Ramsey family which is already -nowhere dense. Let
The gap-doubling closed family of infinite subsets is -closed: a violation is witnessed by a finite initial segment, whose whole cylinder lies outside . It is nowhere dense: inside any cylinder, extend the stem by two sufficiently large consecutive integers ; the resulting smaller cylinder violates the gap inequality and is disjoint from .
For every infinite , the set has cardinality . To prove the lower bound, build a binary tree of finite gap-doubling sequences using points of , 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 .
Well-order all infinite subsets as , using the initial ordinal of that cardinality. At stage , choose two previously unused sets
and reserve both permanently. There are fewer than previously reserved sets but candidates, so this recursion always continues. This argument does not assume that the continuum is a regular cardinal. Set . Every cone contains its red choice in and its blue choice outside ; the blue choices can never become later red choices. Therefore is not Ramsey.
But , and is closed nowhere dense, so the closure of also has empty interior. Thus is nowhere dense, hence meagre, and 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.
A family is Ramsey in the homogeneous-cone sense if there is an infinite such that either or . This is the existence of one infinite homogeneous cone. Requiring such a refinement inside every infinite initial ground set gives the stronger definition used for a Ramsey set of infinite subsets; requiring a homogeneous refinement in every finite-stem neighbourhood gives a completely Ramsey set.
These quantifiers should be distinguished. For example, the existence of a homogeneous cone on the even numbers does not constrain a family's restriction to the odd numbers. If is the finite-symmetric-difference parity colouring class on the odd numbers, the family consisting of alone has a homogeneous cone disjoint from it on the even numbers, but no homogeneous cone on the odd numbers. Every open set in the ordinary topology on infinite subsets has homogeneous cones inside all infinite ground sets, as follows by deciding finite stems through fusion.
Let E be the even positive integers, and take a finite-symmetric-difference parity colouring of . The family is Ramsey even under the every-ground-set convention, since every infinite ground set can be thinned to omit 1. It is not completely Ramsey: inside , every infinite tail has two subfamilies of opposite parity. Its supporting neighbourhood is closed and nowhere dense in the ordinary topology on infinite subsets, but open in the Ellentuck topology.