Search arXiv⌕ Search

arXiv · 2611.06060

On Wilker-Type Properties

Abstract

Wilker-type properties record how a compact set can be split along a binary open cover, and they are precisely the continuity conditions for the union operation on open lattices, governing the topology of power and function spaces. We give a unified treatment of the four properties $\W$, $\Ww$, $\Wi$ and $\Win$. We prove that $\Wi$ and $\Win$ are hereditary for arbitrary subspaces, whereas $\W$ and $\Ww$ are hereditary only for closed subspaces; all four are preserved by continuous retracts, and $\Ww$, $\Wi$, $\Win$ are finitely additive over topological sums. For KC-spaces $\Ww$ and $\Wi$ coincide, and spaces whose compact subspaces are Hausdorff belong to $\Win$. Using Kovár's compact KC-space $M_0$ and its variant $\QQ^{+}$, we obtain countably infinite compact KC-spaces in $\Wi\setminus\W$, showing $\Wi$ is strictly weaker than $\W$. Conversely, we construct compact $T_1$ spaces whose product fails $\Ww$, proving the classes $\Ww$ and $\Wi$ are not reflective. We further show Vietoris constructions need not preserve $\Wi$, and prove that $\Ok(M_0)\cong \Ck(M_0,\Sier)$ is not sober and fails property~$S$. Open problems are collected at the end.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wu Wang, Jiajun Tang. 2026-11-04. On Wilker-Type Properties. https://arxiv.org/abs/2611.06060

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

KEEP EXPLORING

Related papers

Extending graph metrics to hyperspaces of vertex sets: optimization and reinforcement learning applications

An undirected connected graph can be interpreted as a metric space by considering the path distance between its vertices. Extending this perspective, we explore how walks in the graph, viewed as sequences of subsets of vertices $V$, fit into a more general framework where the path distance emerges as a special case of broader metrics that define hypertopologies on the space of subsets of $V$. In this paper, we propose a general framework to address this issue, motivated by the extension of recent reinforcement learning algorithms on graphs through Lipschitz function extensions. Our approach demonstrates how models for dynamical systems and related machine learning techniques can be adapted to (quasi-pseudo-metric) hyperspaces, offering a novel perspective for the analysis and modeling of dynamical systems. Finally, we illustrate the practical relevance of our theoretical contributions through a concrete graph optimization example, highlighting the utility and effectiveness of our proposed approach.

math.GN↗

Local structure of homogeneous $ANR$-spaces

We investigate to what extend finite-dimensional homogeneous locally compact $ANR$-spaces have common properties with Euclidean manifolds. Specially, the local structure of homogeneous $ANR$-spaces is described. Using that description, we provide a positive solution of the problem whether every finite-dimensional homogeneous metric $ANR$-compactum $X$ is dimensionally full-valued, i.e. $\dim X\times Y=\dim X+\dim Y$ for any metric compactum $Y$.

math.GN↗

Yet another approach to measuring distance in some hyperspaces

In this article, we define a new partial distance on hyperspaces consisting of closed balls, which is a partial metric in the sense of Matthews. We prove that these partial metric spaces are complete if and only if the metric spaces from which the corresponding ball spaces arise are complete. Finally, we compare the topology induced by the new partial distance with that induced by the classical Hausdorff distance.

math.GN↗