Labeled trees generating complete, compact, and discrete ultrametric spaces (Q2674368): Difference between revisions

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.