Measuring the complexity of characterizing $[0, 1]$, $S^1$, and $\mathbb{R}$ up to homeomorphism
Matthew Harrison-Trainor, Eissa Haydar

TL;DR
This paper studies the descriptive complexity of classifying spaces like [0,1], S^1, and R up to homeomorphism, revealing their positions in the Wadge hierarchy and highlighting the role of local compactness.
Contribution
It establishes the Wadge completeness levels of the sets of homeomorphic copies of key topological spaces, connecting classical characterizations with descriptive set theory.
Findings
The set of homeomorphic copies of [0,1] is $oldsymbol{ ext{Pi}}^0_4$-Wadge-complete.
The set of homeomorphic copies of S^1 is $oldsymbol{ ext{Pi}}^0_4$-Wadge-complete.
The set of homeomorphic copies of R is $oldsymbol{ ext{Pi}}^1_1$-Wadge-complete.
Abstract
In analogy to the study of Scott rank/complexity of countable structures, we initiate the study of the Wadge degrees of the set of homeomorphic copies of topological spaces. One can view our results as saying that the classical characterizations of (e.g., as the unique continuum with exactly two non-cut points, and other similar characterizations), appropriated expressed, are the simplest possible characterizations of . Formally, we show that the set of homeomorphic copies of is -Wadge-complete. We also show that the set of homeomorphic copies of is -Wadge-complete. On the other hand, we show that the set of homeomorphic copies of is -Wadge-complete. It is the local compactness that cannot be expressed in a Borel way; the set of homeomorphic copies of is…
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
TopicsCoding theory and cryptography · Computability, Logic, AI Algorithms · graph theory and CDMA systems
