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 , letThese sets form a topological basis for , equivalently the subspace topology inherited from the product topology on . For an infinite with , the setsform 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 colourwhere 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
Articles by others on the same topic
There are currently no matching articles.