COMBINATORICS OF OPEN COVERS VI: SELECTORS FOR SEQUENCES OF DENSE SETS (Q3836237)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1374966
Language Label Description Also known as
default for all languages
No label defined
    English
    COMBINATORICS OF OPEN COVERS VI: SELECTORS FOR SEQUENCES OF DENSE SETS
    scientific article; zbMATH DE number 1374966

      Statements

      COMBINATORICS OF OPEN COVERS VI: SELECTORS FOR SEQUENCES OF DENSE SETS (English)
      0 references
      0 references
      12 November 2001
      0 references
      point-picking topological games
      0 references
      As the title says, this is part six of a broad research program [for Part V, cf. Topology Appl. 102, No. 1, 13-31 (2000; Zbl 0960.91018)]. The part under consideration connects selection principles on a separable metric space \(X\), and on the space \(C_p(X)\) of continuous real-valued functions on \(X\) equipped with the pointwise convergence topology, to certain two-person repeated games played on \(C_p(X)\). A connection of these games to the Baire category theorem is also given. Let \(\mathcal A\) and \(\mathcal B\) be families of subsets of an infinite space (e.g.\ the family \(\mathcal D\) of its dense subsets); the selection principle \(S({\mathcal A}, {\mathcal B})\) says that for each sequence of sets \(A_n\in{\mathcal A}\) there is a sequence of points \(a_n\in A_n\) such that the set \(\{a_n\}\) is in \(\mathcal B\). In the related game \(G({\mathcal A}, {\mathcal B})\) player ONE selects an \(A_n\in{\mathcal A}\) and player TWO selects an \(a_n\in A_n\) for each \(n\), and TWO wins iff the set \(\{a_n\}\) is in \(\mathcal B\). Analogous principles and games are considered where points in the above are replaced by finite sets. A class of covers \(\Omega\) of \(X\) is defined, and the principle \(S(\Omega, \Omega)\) on \(X\) (on \(2^X\) in fact) is shown to hold iff \(S({\mathcal D}, {\mathcal D})\) holds on \(C_p(X)\); and that this in turn holds iff player ONE has no winning strategy in \(G({\mathcal D}, {\mathcal D})\) on \(C_p(X)\). An example shows that the hypothesis of separability and metrizability of \(X\) are tight. The main result, together with Martin's Axiom for countable partially ordered sets, is exploited to show that if \(X\) is an uncountable set of reals, neither player has a winning strategy in \(G({\mathcal D}, {\mathcal D})\) on \(C_p(X)\). The result is also shown to yield a new proof of the following connection with Baire's theorem: let \(X\) be a regular space in which any dense set has a countable dense subset, and let \(\pi(X)\) be the least cardinal of a base for the topology of \(X\). Then ONE can win in \(G({\mathcal D}, {\mathcal D})\) on \(X\) iff \(\pi(X)\) is so large that \(\Re\) can be covered by a family of \(\pi(X)\) first-category sets.
      0 references

      Identifiers