Charles Explorer logo
🇬🇧

Complexity of distances: Theory of generalized analytic equivalence relations

Publication at Faculty of Mathematics and Physics |
2023

Abstract

We generalize the notion of analytic/Borel equivalence relations, orbit equivalence relations, and Borel reductions between them to their continuous and quantitative counterparts: analytic/Borel pseudometrics, orbit pseudometrics, and Borel reductions between them. We motivate these concepts on examples and we set some basic general theory.

We illustrate the new notion of reduction by showing that the Gromov-Hausdorff distance maintains the same complexity if it is defined on the class of all Polish metric spaces, spaces bounded from below, from above, and from both below and above. Then we show that E-1 is not reducible to equivalences induced by orbit pseudometrics, generalizing the seminal result of Kechris and Louveau.

We answer in negative a question of Ben Yaacov, Doucha, Nies, and Tsankov on whether balls in the Gromov-Hausdorff and Kadets distances are Borel. In appendix, we provide new methods using games showing that the distance-zero classes in certain pseudometrics are Borel, extending the results of Ben Yaacov, Doucha, Nies, and Tsankov.

There is a complementary paper of the authors where reductions between the most common pseudometrics from functional analysis and metric geometry are provided.