SearcharxivSearch

arXiv · 2605.13608

Universal homogeneous two-sorted ultrametric spaces

Abstract

We view ultrametric spaces as two-sorted structures consisting of a set of points and of a linearly ordered set of distances. We call the appropriate notion of embeddings distance-carrying (dc for short). Those are obtained by combining isometries and linear order embeddings. We show that the class of all finite two-sorted ultrametric spaces with dc-embeddings is Fra\"iss\'e, and that the limit is the countable rational Urysohn ultrametric space $\mathbb{U}$. The space $\mathbb{U}$ is dc-universal for all countable ultrametric spaces, and its Cauchy completion $\overline{\mathbb{U}}$ is dc-universal for all separable ultrametric spaces, which is in contrast with the situation of classical ultrametric spaces and isometric embeddings, where no such universal space can exist. We study further properties of $\mathbb{U}$, of its variants, and of its automorphism group, which is richer than its group of isometries. In particular, we provide two types of tree representations of the two-sorted ultrametric spaces, discuss connections to valued fields, and characterize the automorphism group of $\mathbb{U}$ as the semidirect product of a group of order preserving bijections and a group of isometries. Furthermore, we show universality of $\operatorname{Aut}(\mathbb{U})$ and identify its universal minimal flow.

Explore related subjects

Keep this discovery

BibTeXRIS

Adam Bartoš, Wiesław Kubiś, Aleksandra Kwiatkowska, Maciej Malicki. 2026-05-13. Universal homogeneous two-sorted ultrametric spaces. https://arxiv.org/abs/2605.13608

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

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO