Selective versions of chain condition-type properties (Q519994)

The authors study selective and game-theoretic versions of properties like the countable chain condition, weak Lindelöfness and separability. Here the countable chain condition says that a space does not have an uncountable list of disjoint nonempty open sets. On the other hand, the strictest condition of this type would be that the space has a countable basis of open sets, like for example the space of real numbers with the usual topology generated by open intervals. The authors give various characterisations of them and explore connections between these properties and some classical cardinal invariants of the continuum. First the authors review the notion of Rothberger separability: Here a space is Rothberger separable iff for every sequence \(D_0,D_1,\ldots\) of dense sets there is a sequence \(x_0,x_1,\ldots\) with \(x_n \in D_n\) for all \(n\) such that the set \(\{x_0,x_1,\ldots\}\) is a dense set. The selective countable chain condition says that for every sequence of dense families \({\mathcal U}_n\) of open sets one can pick a set \(U_n \in {\mathcal U}_n\) such that the union of the \(U_n\) is dense. A sample result is the following: The authors consider a set \(PR(X)\) derived from \(X\) where \(PR(X)\) consists of all countable sequences of points in \(X\) together with the Pixley-Roy topology. The authors show that \(PR(X)\) satisfies the selective countable chain condition if and only if every finite power of \(X\) is a Rothberger space. They show various related results in Section 2. In Section 3 they look at game versions of their results. They define a game \(G_o^p(\kappa)\) for an ordinal or cardinal \(\kappa\) as follows: In round (inning) \(\alpha\), the first player picks a point \(x_\alpha\) and then the second player picks an open set \(U_\alpha\) containing \(x_\alpha\). The first player wins iff the union of all \(U_\alpha\) is a dense subset of \(X\). The authors show various results for this and other games, and a sample result is that if the first player has a winning strategy for the game \(G_o^p(\kappa)\) then \(d(X) \leq \chi(X)^{<\kappa}\). This provides a short alternative proof to a result of \textit{A. Bella} and \textit{S. Spadaro} [Houston J. Math. 41, No. 3, 1063--1077 (2015; Zbl 1343.54003)].