On minimal non-potentially closed subsets of the plane
From MaRDI portal
Publication:857052
Abstract: We study the Borel subsets of the plane that can be made closed by refining the Polish topology on the real line. These sets are called potentially closed. We first compare Borel subsets of the plane using products of continuous functions. We show the existence of a perfect antichain made of minimal sets among non-potentially closed sets. We apply this result to graphs, quasi-orders and partial orders. We also give a non-potentially closed set minimum for another notion of comparison. Finally, we show that we cannot have injectivity in the Kechris-Solecki-Todorcevic dichotomy about analytic graphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 3833949 (Why is no real title available?)
- scientific article; zbMATH DE number 1192200 (Why is no real title available?)
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- scientific article; zbMATH DE number 1548926 (Why is no real title available?)
- A Glimm-Effros Dichotomy for Borel Equivalence Relations
- A Separation Theorem for ∑ 1 1 Sets
- Basis theorems for non-potentially closed sets and graphs of uncountable Borel chromatic number
- Borel Classes and Closed Games: Wadge-Type and Hurewicz-Type Results
- Borel chromatic numbers
- Classes de Wadge potentielles et théorèmes d'uniformisation partielle
- Descriptive set theory
- La structure borélienne d'Effros est-elle standard?
- Uniformisations Partielles et Criteres a la Hurewicz Dans Le Plan
Cited in
(13)- On finitely generated closures in the theory of cutting planes
- Potential Wadge classes
- Basis theorems for continuous \(n\)-colorings
- Borel chromatic numbers of graphs of commuting functions
- Injective tests of low complexity in the plane
- Baire-class colorings: the first three levels
- Acyclicity and reduction
- Two examples of minimal Cheeger sets in the plane
- How can we recognize potentially \(\boldsymbol\Pi^0_\xi\) subsets of the plane?
- Separation of analytic sets by rectangles of low complexity
- Basis theorems for non-potentially closed sets and graphs of uncountable Borel chromatic number
- Borel chromatic number of closed graphs
- A separation result for countable unions of Borel rectangles
This page was built for publication: On minimal non-potentially closed subsets of the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857052)