SearcharxivSearch

arXiv · 2604.25836

Strongly quasi-pseudometric aggregation functions

Abstract

Metric-preserving functions (here, metric aggregation functions) offer a natural method for constructing metrics on Cartesian products of metric spaces or for aggregating multiple metrics defined on a common set. Strongly metric-preserving functions represent a more specialized subset of these functions, ensuring that the new metric aligns with the product topology, in the Cartesian product case. However, these strong functions have not been previously explored for quasi-pseudometrics. Furthermore, in the case where all metrics are defined on the same set, the problem has not been addressed previously. In this paper, we investigate the class of strongly (quasi-)(pseudo)metric aggregation functions, extending the classical concept. We begin by examining the case where the aggregation function produces (quasi-)(pseudo)metrics on Cartesian products, characterizing these functions through continuity at zero and a minimal zero preimage condition. In addition, we will examine the scenario where the aggregation function produces a (quasi-)(pseudo)metric defined on a fixed set. Within this context, we will demonstrate that the appropriate topology to consider is the supremum topology. We will also provide both necessary and sufficient conditions for an (quasi-)(pseudo)metric aggregation function on sets to qualify as a strongly one, thereby addressing a gap in the existing literature.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alejandro Fructuoso-Bonet, Jesús Rodríguez-López. 2026-04-28. Strongly quasi-pseudometric aggregation functions. https://arxiv.org/abs/2604.25836

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