Search arXivSearch

arXiv · 2606.11498

Generic dc-automorphisms of two-sorted ultrametric spaces

Abstract

We continue to study ultrametric spaces as two-sorted structures consisting of a set of points and of a linearly ordered set of distances, together with the dc-embeddings, which we introduced in our earlier paper "Universal homogeneous two-sorted ultrametric spaces". The class of all finite two-sorted ultrametric spaces with dc-embeddings is Fraïssé whose limit we denote by $\mathbb{U}$. The main result of the article is that $\operatorname{Aut}(\mathbb{U})$ has a comeager conjugacy class. For that we show the cofinal amalgamation property of partial automorphisms and characterize amalgamation bases. In fact we develop a general strategy for showing cofinal amalgamation property for a broad class of categories. Furthermore, we show that there is no generic pair of automorphisms, we provide a detailed description of single orbits under dc-automorphisms, and we prove that any finite partial dc-automorphism, even in the presence of other orbits, can be extended to one that is closed or monotone.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adam Bartoš, Wiesław Kubiś, Aleksandra Kwiatkowska, Maciej Malicki. 2026-06-09. Generic dc-automorphisms of two-sorted ultrametric spaces. https://arxiv.org/abs/2606.11498

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

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO