Borel complexity of sets of ideal limit points
Rafal Filipow, Adam Kwela, Paolo Leonetti

TL;DR
This paper investigates the topological complexity of sets of ideal limit points in Polish spaces, linking ideal properties with Borel class classifications and providing characterizations and examples of possible complexities.
Contribution
It offers combinatorial characterizations of ideals for the complexity of their limit point families and classifies these families within the Borel hierarchy.
Findings
If $ ext{I}$ is a $oldsymbol{ ext{Pi}}^0_4$ ideal, then $ extbf{L}( ext{I})$ is either $oldsymbol{ ext{Pi}}^0_1$, $oldsymbol{ ext{Sigma}}^0_2$, or $oldsymbol{ extSigma}^1_1$.
An explicit example of a coanalytic ideal with $ extbf{L}( ext{I})=oldsymbol{ extSigma}^1_1$ is provided.
There are no ideals with $ extbf{L}( ext{I})$ equal to $oldsymbol{ extPi}^0_2$ or $oldsymbol{ extSigma}^0_3$.
Abstract
Let be an uncountable Polish space and let be an ideal on . A point is an -limit point of a sequence taking values in if there exists a subsequence convergent to such that the set of indexes . Denote by the family of subsets such that is the set of -limit points of some sequence taking values in or is empty. In this paper, we study the relationships between the topological complexity of ideals , their combinatorial properties, and the families of sets which can be attained. On the positive side, we provide several purely combinatorial (not dependind on the space ) characterizations of ideals for the inclusions and the equalities between…
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 Numerical Analysis Techniques
