Complexity of distances: Reductions of distances between metric and Banach spaces
Abstract: We show that all the standard distances from metric geometry and functional analysis, such as Gromov-Hausdorff distance, Banach-Mazur distance, Kadets distance, Lipschitz distance, Net distance, and Hausdorff-Lipschitz distance have all the same complexity and are reducible to each other in a precisely defined way. This is done in terms of descriptive set theory and is a part of a larger research program initiated by the authors in \emph{Complexity of distances: Theory of generalized analytic equivalence relations}. The paper is however targeted also to specialists in metric geometry and geometry of Banach spaces.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.