Labeled trees generating complete, compact, and discrete ultrametric spaces

From MaRDI portal
Publication:2674368



Abstract: We investigate the interrelations between labeled trees and ultrametric spaces generated by these trees. The labeled trees, which generate complete ultrametrics, totally bounded ultrametrics, and discrete ones, are characterized up to isomorphism. As corollary, we obtain a characterization of labeled trees generating compact ultrametrics, and discrete totally bounded ultrametrics. It is also shown that every ultrametric space generated by labeled tree contains a dense discrete subspace.


A metric on a set $X$ is a function $d:X\times X\to R+$ such that for all $x,y,z\in X$ (i) $d(x,y)=d(y,x)$, (ii) $(d(x,y)=0) \Leftrightarrow (x=y)$, (iii) $d(x,y)\leq d(x,z)+d(z,y)$. A metric space $(X,d)$ is ultrametric if the strong triangle inequality $d(x,y)\leq\max\{d(x,z),d(z,y)\}$ holds for all $x,y,z\in X$. In this case, the function \(d\) is called an ultrametric on $X$. In this paper, the authors find the interrelations between labeled trees and ultrametric spaces generated by these trees. Also, they prove that the labeled trees, which generate complete ultrametrics, totally bounded ultrametrics, and discrete ones, are characterized up to isomorphism. As a corollary, they study a characterization of labeled trees generating compact ultrametrics and discrete totally bounded ultrametrics. Further, they show that every ultrametric space generated by a labeled tree contains a dense discrete subspace.



Cites work









This page was built for publication: Labeled trees generating complete, compact, and discrete ultrametric spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674368)