SearcharxivSearch

arXiv · 2601.06269

A characterisation of probabilistic metrizability for approach spaces

Abstract

Characterisations of metrizable topological spaces or metrizable uniform spaces are well known. A natural counterpart to being metrizable for topological spaces can be expressed in terms of probabilistic metrizability for approach spaces. The notion of a probabilistic metrizable approach space is based on a well known concrete functor $\Gamma$, as introduced in [9], from the category of probabilistic metric spaces with respect to a continuous arbitrary t-norm to the category of approach spaces. A characterization of those probabilistic metrizable approach spaces is still missing and in the first part of this paper we solve this problem. A natural counterpart to being metrizable for uniform spaces can be expressed in terms of probabilistic metrizability for uniform gauge spaces. In the second part of the paper we start from another concrete functor $\Lambda$, as described in [7], on the category of probabilistic metric spaces with respect to a continuous t-norm to the category of uniform gauge spaces. In a similar way as for the functor $\Gamma$ we obtain a characterisation of probabilistic metrizability of uniform gauge spaces. The last section of the paper is devoted to an isomorphic description of the category of probabilistic metric spaces. This problem is not new. Previous attempts in providing isomorphic descriptions of the category of probabilistic metric spaces worked with collections of (pseudo)metrics. These attempts were only formulated in restricted cases. Our isomorphic description is in terms of objects that are sets endowed with a collection of distances, where the distances involved do not satisfy the triangle inequality but fulfil a mixed triangle condition instead.

Explore related subjects

Keep this discovery

BibTeXRIS

Eva Colebunders, Robert Lowen. 2026-01-09. A characterisation of probabilistic metrizability for approach spaces. https://arxiv.org/abs/2601.06269

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