Papers
Topics
Authors
Recent
Search
2000 character limit reached

Complexity of distances: Reductions of distances between metric and Banach spaces

Published 21 Apr 2020 in math.FA, math.LO, and math.MG | (2004.11752v2)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.