Search arXiv⌕ Search

arXiv · math/0004091

Universal metric spaces according to W. Holsztynski

Abstract

We show, following W. Holsztynski, that there exists a continuous metric d on the set of real numbers R such that any finite metric space is isometrically embeddable into (R,d).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. Ovchinnikov. 2000-04-13. Universal metric spaces according to W. Holsztynski. https://arxiv.org/abs/math/0004091

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

KEEP EXPLORING

Related papers

A study for well-filtered spaces

In this paper, we focus on well-filtered spaces. By using the Rudin sets and WD sets, we obtain the following results: (1) The product of arbitrarily many Scott well-filtered dcpos is still well-filtered with respect to the Scott topology. Thus we give positive answers for two questions proposed by Xu and Zhao; (2) Let $P$ be a dcpo with $ΣK(P)$ being well-filtered and $Q$ an RB-domain. Then $ΣK(P\times Q)$ is well-filtered if $K(P\times Q)$ is a dcpo; (3) An intrinsic characterization of the $WD$ sets is given in terms of Scott open filters.

math.GN↗

Homogeneous linearly ordered spaces

Every compact subspace $K$ of a homogeneous generalized ordered (GO) space $X$ satisfies $χ(K)\leqω_1$ and $|K|\leq 2^{ω_1}$. If $χ(K)>ω$ for some such $K$, then $χ(X)=ω_1$ and $πχ(X)=ω$. We construct a homogeneous $σ$-compact linearly ordered topological space (LOTS) $\mathbf{H}$ with a compact subspace $K$ such that $χ(x,K)=ω_1$ for every $x\in K$ and $c(K)=w(K)=|K|=2^{ω_1}$, where $c(K)$ denotes cellularity. Thus both bounds are attained by the same compact space. Every semitopological group that is a GO space is hereditarily paracompact and has metrizable compact subspaces. If it is not a $P$-space, it is also first countable and submetrizable. A semitopological group that is a LOTS, or a topological group that is a GO space, is either metrizable or is a $P$-space. We also show that in an order-homogeneous LOTS every compact subset is first countable.

math.GN↗

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↗