Identify with increasing infinite sequences, with the product topology. A Ramsey set of infinite subsets is one such that for every infinite , some infinite satisfies or . We prove this for open .
For a finite increasing stem and an infinite tail above it, say that accepts if every infinite has . Say that rejects if no infinite subset of accepts it. Either a tail has an accepting refinement, or it rejects. Both acceptance and rejection persist under passage to infinite subsets.
Starting with any infinite ground set , use fusion to obtain an infinite deciding every finite subset of : after selecting its first elements, refine the remaining tail successively to decide each of the finitely many subsets of that prefix. Then select the next element from the refined tail. The final tail beyond a decided stem is contained in the tail which decided it, so the decision survives. In particular decides the empty stem.
If accepts the empty stem, it is homogeneous inside . Otherwise it rejects. We thin it further so that every finite subset is rejected. The key observation is that if rejects , there can be only finitely many above for which accepts . If there were infinitely many, call their set . For any infinite , its first element and the accepting tail would imply . Thus would accept , contradicting rejection.
Build inductively. Given a finite prefix whose subsets are all rejected, exclude the finitely many bad next elements for each of those subsets, and choose the next element outside their union. All new stems are decided by the first fusion and are not accepted, hence are rejected. This preserves the induction.
If an infinite belonged to the open set , some finite initial segment of would have every infinite extension above in . Then would accept , contradicting the rejection just arranged. Therefore misses . We have proved
Taking complements gives the same result for closed subsets. The proof also works with any fixed finite stem, yielding the stronger finite-stem version when desired.

Articles by others on the same topic (0)

There are currently no matching articles.