In this paper we study the selection principle of closed discrete selection, first researched by Tkachuk in [13] and strengthened by Clontz, Holshouser in [3], in set-open topologies on the space of continuous real-valued functions. Adapting the techniques involving point-picking games on X and C p (X), the current authors showed similar equivalences in [1] involving the compact subsets of X and C k (X). By pursuing a bitopological setting, we have touched upon a unifying framework which involves three basic techniques: general game duality via reflections (Clontz), general game equivalence via topological connections, and strengthening of strategies (Pawlikowski and Tkachuk). Moreover, we develop a framework which identifies topological notions to match with generalized versions of the point-open game.
Definitions and PreliminariesDefinition 1. Let X be a space and A ⊆ ℘(X). We say that A is an ideal-base if, for A 1 , A 2 ∈ A, there existsDefinition 2. For a topological space X and a collection A ⊆ ℘(X), we let Ā = {cl X (A) : A ∈ A}.Definition 3. Fix a topological space X and a collection A ⊆ ℘(X). Then• we let C p (X) denote the set of all continuous functions X → R endowed with the topology of point-wise convergence; we also let 0 be the function which identically zero.• we let C k (X) denote the set of all continuous functions X → R endowed with the topology of uniform convergence on compact subsets of X; we will write• in general, we let C A (X) denote the set of all continuous functions X → R endowed with the A-open topology; we will writeNotice that, for the sets of the form [f ; A, ε] to be a base for the topology C A (X), then A must be an ideal-base.Definition 4. For a topological space X, we let K(X) denote the family of all non-empty compact subsets of X.Definition 5. Let X be a topological space. We say that A ⊆ X is R-bounded if, for every continuous f :In this paper, we will be concerned with selection principles and related games. For classical results, basic tools, and notation, the authors recommend [10] and [7]. Definition 6. Consider collections A and B and an ordinal α. The corresponding selection principles are defined as follows:• S α fin (A, B) is the assertion that, given any {A ξ : ξ ∈ α} ⊆ A, there exists {F ξ : ξ ∈ α} so that, for each ξ ∈ α, F ξ is a finite subset of A ξ (denoted as F ξ ∈ [A ξ ] <ω hereinafter) and {F ξ : ξ ∈ α} ∈ B, and• S α 1 (A, B) is the assertion that, given any {A ξ : ξ ∈ α} ⊆ A, there exists {x ξ : ξ ∈ α} so that, for each ξ ∈ α, x ξ ∈ A ξ and {x ξ : ξ ∈ α} ∈ B.We suppress the superscript when α = ω; i.e., S 1 (A, B) = S ω 1 (A, B).