Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Borel complexity up to the equivalence (1812.00484v2)

Published 2 Dec 2018 in math.GN

Abstract: We say that two classes of topological spaces are equivalent if each member of one class has a homeomorphic copy in the other class and vice versa. Usually when the Borel complexity of a class of metrizable compacta is considered, the class is realized as the subset of the hyperspace $\mathcal{K}([0, 1]{\omega})$ containing all homeomorphic copies of members of the given class. We are rather interested in the lowest possible complexity among all equivalent realizations of the given class in the hyperspace. We recall that to every analytic subset of $\mathcal{K}([0, 1]{\omega})$ there exist an equivalent $G_{\delta}$ subset. Then we show that up to the equivalence open subsets of the hyperspace $\mathcal{K}([0, 1]{\omega})$ correspond to countably many classes of metrizable compacta. Finally we use the structure of open subsets up to equivalence to prove that to every $F_{\sigma}$ subset of $\mathcal{K}([0, 1]{\omega})$ there exists an equivalent closed subset.

Summary

We haven't generated a summary for this paper yet.