Combinatorial characterization of pseudometrics

DOI10.1007/S10474-020-01020-XMaRDI QIDQ2204104zbMATH OpenOpenAlexFDO

Authors Aleksey A. Dovgoshey, Jouni Luukkainen

Publication date 2 October 2020

Published in Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.07411, http://hdl.handle.net/10138/317289

zbMATH Keywords

equivalence relationpseudometricsemigroup of binary relationsstrongly rigid metric

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Metric spaces, metrizability (54E35)

Abstract: Let $X$, $Y$ be sets and let $Phi$, $Psi$ be mappings with the domains $X^2$ and $Y^2$ respectively. We say that $Phi$ is combinatorially similar to $Psi$ if there are bijections $fcolonPhi(X^2)oPsi(Y^2)$ and $gcolonYoX$ such that $Psi(x,y)=f(Phi(g(x),g(y)))$ for all $x$, $yinY$. It is shown that the semigroups of binary relations generated by sets $Ph{i}^{-1}(a)colonainPhi(X^2)$ and $Ps{i}^{-1}(b)colonbinPsi(Y^2)$ are isomorphic for combinatorially similar $Phi$ and $Psi$. The necessary and sufficient conditions under which a given mapping is combinatorially similar to a pseudometric, or strongly rigid pseudometric, or discrete pseudometric are found. The algebraic structure of semigroups generated by $d^{-1}(r)colonrind(X^2)$ is completely described for nondiscrete, strongly rigid pseudometrics and, also, for discrete pseudometrics $dcolon{X}^{2}omathbbR$.

Review text

Recall that a mapping \(f\) from a metric (or pseudometric) space \((X,d)\) to a metric (or pseudometric) space \((Y,\rho)\) is \textit{isometric} if \(\rho(f(x), f(y))=d(x,y)\) for all \(x,y\in X\). This classic concept has numerous generalizations. In this paper, the authors introduce \textit{similarity}, \textit{weak similarity}, and \textit{combinatorial similarity}. Furthermore, they expand the concept of combinatorially similar pseudometrics to the concept of combinatorially similar functions of two variables, as follows. For sets \(X\) and \(Y\), let \(\Phi\) and \(\Psi\) be mappings with the domains \(X^2\) and \(Y^2\), respectively. The mapping \(\Phi\) is \textit{combinatorially similar} to \(\Psi\) if there are bijections \(f:\Phi(X^2)\to\Psi(Y^2)\) and \(g:Y\to X\) such that \(\Psi(x,y)=f(\Phi(g(x), g(y)))\) for all \(x,y\in Y\).\par The authors give a characterizations of mappings which are combinatorially similar to pseudometrics, strongly rigid pseudometrics or discrete pseudometrics. For instance, in Section 3 they prove the following: Let \(X\) be a nonempty set. The following conditions are equivalent for every mapping \(\Phi\) with the domain \(X^2\): (i) \(\Phi\) is combinatorially similar to a pseudometric, (ii) \(\Phi\) is symmetric, there is \(a_0\in\Phi(X^2)\) such that \(\Phi\) is \(a_0\)-coherent, and the inequality \(\vert \Phi(X^2)\vert \leq\mathfrak{c}\) holds, where \(\mathfrak{c}\) is the cardinality of the continuum.

Recommendations

• Combinatorial properties of ultrametrics and generalized ultrametrics
• Similarity, topology, and uniformity
• Weak similarities of metric and semimetric spaces
• Pseudometrics from three-positive semidefinite similarities
• Weak similarities of finite ultrametric and semimetric spaces

Cites work

• A Metric Characterization of Zero-Dimensional Spaces
• A Remark on M. M. Day's Characterization of Inner-Product Spaces and a Conjecture of L. M. Blumenthal
• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3479763 (Why is no real title available?)
• scientific article; zbMATH DE number 3552814 (Why is no real title available?)
• scientific article; zbMATH DE number 1222942 (Why is no real title available?)
• scientific article; zbMATH DE number 2165490 (Why is no real title available?)
• scientific article; zbMATH DE number 3080144 (Why is no real title available?)
• Semigroups generated by partitions
• Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
• Strongly Rigid Metrics and Zero Dimensionality
• Weak similarities of metric and semimetric spaces

Cited in

(11)

• Combinatorial properties of ultrametrics and generalized ultrametrics
• Ultrametric preserving functions and weak similarities of ultrametric spaces
• Uniqueness of best proximity pairs and rigidity of semimetric spaces
• Completeness, closedness and metric reflections of pseudometric spaces
• When all permutations are combinatorial similarities
• Pseudometric spaces: from minimality to maximality in the groups of combinatorial self-similarities
• Symmetric linear functionals on the Banach space generated by pseudometrics
• On the closure of one point sets in T₀-spaces
• Forbidden four cycle, star graphs and isometric embeddings
• Hausdorff distance between ultrametric balls
• Pseudometrics from three-positive semidefinite similarities

This page was built for publication: Combinatorial characterization of pseudometrics

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