Isomorphism of locally compact Polish metric structures
Maciej Malicki

TL;DR
This paper investigates the complexity of isomorphism relations in locally compact Polish metric structures, showing they are classifiable by countable structures and relating isometry to graph isomorphism, with implications for Borel reducibility.
Contribution
It proves that isomorphism on locally compact Polish metric structures is always classifiable by countable structures, linking it to graph isomorphism and analyzing Borel reducibility.
Findings
Isomorphism on such classes is classifiable by countable structures.
Isometry of locally compact Polish metric spaces reduces to graph isomorphism.
Borel reducibility of certain isomorphism relations to equality on hereditarily countable sets.
Abstract
We study the isomorphism relation on Borel classes of locally compact Polish metric structures. We prove that isomorphism on such classes is always classifiable by countable structures (equivalently: Borel reducible to graph isomorphism), which implies, in particular, that isometry of locally compact Polish metric spaces is Borel reducible to graph isomorphism. We show that potentially isomorphism relations are Borel reducible to equality on hereditarily countable sets of rank , . We also study approximations of the Hjorth-isomorphism game, and formulate a condition ruling out classifiability by countable structures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms
