Using the axiom of choice, enumerate all infinite subsets of the positive integers in order type . By transfinite recursion, choose two previously unused infinite subsets of each . This is possible because each has cardinality and fewer choices have been made at stage . The set is not a Ramsey set of infinite subsets, since every meets both it and its complement.
A set is completely Ramsey if every basic Ellentuck topology neighborhood admits an infinite with or . Keeping the finite stem makes this stronger than being a Ramsey set of infinite subsets.
Every open set in the Ellentuck topology is a completely Ramsey set. Fix a finite stem . An infinite tail accepts a finite extension if its entire basic neighborhood lies in the open set; it rejects if no infinite subtail accepts it. Decisions persist under thinning. A fusion chooses an infinite set deciding every finite extension. For any rejected extension, only finitely many possible next elements can yield accepted extensions, since infinitely many would themselves provide an accepting tail. A second thinning therefore makes all finite extensions rejected. Openness then rules out any point of the set in the resulting neighborhood.
Articles by others on the same topic
There are currently no matching articles.