SearcharxivSearch

arXiv · 2012.06668

Selection Games on Hyperspaces

Abstract

In this paper we connect selection principles on a topological space to corresponding selection principles on one of its hyperspaces. We unify techniques and generalize theorems from the known results about selection principles for common hyperspace constructions. This includes results of Lj.D.R. Ko\v{c}inac, Z. Li, and others. We use selection games to generalize selection principles and we work with strategies of various strengths for these games. The selection games we work with are primarily abstract versions of the selection principles of Rothberger, Menger, and Hurewicz type, as well as games of countable fan tightness and selective separability. The hyperspace constructions that we work with are the Vietoris and Fell topologies, both upper and full, generated by ideals of closed sets. Using a new technique we are able to extend straightforward connections between topological constructs to connections between selection games related to those constructs. This extension process works regardless of the length of the game, the kind of selection being performed, or the strength of the strategy being considered.

Explore related subjects

Keep this discovery

BibTeXRIS

Christopher Caruvana, Jared Holshouser. 2020-12-11. Selection Games on Hyperspaces. https://doi.org/10.1016/j.topol.2021.107771

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN