SearcharxivSearch

arXiv · 2401.01648

On the companion of spaces having dense, relatively countable compact subspaces

Abstract

The notion of "pseudocompactness" was introduced by Hewitt. The concept of relatively countably compact subspaces were explored by Marjanovic to show that a $\Psi$-space is pseudocompact. A topological space is said to be DRC (DRS) iff it possesses a dense, relatively countably compact (or relatively sequentially compact, respectively) subspace. The concept of selectively pseudocompact game Sp(X) and the selectively sequentially pseudocompact game Ssp(X) were introduced by Dorantes-Aldama and Shakhmatov. They explored the relationship between the existence of a winning strategy and a stationary winning strategy for player P in these games. In particular, they observed that there exists a stationary winning strategy in the game Sp(X) (Ssp(X)) for Player P iff $X$ is DRC (or DRS, respectively). In this paper we introduce natural weakening of the properties DRC and DRS: a space $X$ is DRCo ( DRSo) iff there is a sequence $(D_n:n \in { \omega})$ of dense subsets of $X$ such that every sequence $(d_n:n \in { \omega} )$ with $d_n \in D_n$ has an accumulation point (or contains a convergent subsequence, respectively). These properties are also equivalent to the existence of some limited knowledge winning strategy on the corresponding games $Sp(X)$ and $Ssp(X)$. Clearly, DRS implies DRC and DRSo, DRC or DRSo imply DRCo. The main part of this paper is devoted to prove that apart from these trivial implications, consistently there are no other implications between these properties.

Explore related subjects

Keep this discovery

BibTeXRIS

István Juhász, Lajos Soukup, Zoltán Szentmiklóssy. 2024-01-03. On the companion of spaces having dense, relatively countable compact subspaces. https://arxiv.org/abs/2401.01648

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