Complexit\'e des bor\'eliens \`a coupes d\'enombrables
Dominique Lecomte (IMJ)

TL;DR
This paper characterizes Borel subsets with countable sections in product Polish spaces, identifying their complexity levels and topological properties related to their classification within the Borel hierarchy.
Contribution
It provides a Hurewicz-like characterization for each complexity level L of certain Borel subsets, linking their topological and descriptive set-theoretic properties.
Findings
Characterization of Borel subsets with countable sections at each complexity level L.
Identification of conditions preventing subsets from becoming simpler through topology changes.
Extension of Hurewicz-like theorems to complex Borel structures.
Abstract
We give, for each level of complexity L, a Hurewicz-like characterization of the Borel subsets with countable sections of a product of two Polish spaces that cannot become in L by changing the two Polish topologies.
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 · Advanced Banach Space Theory · Computability, Logic, AI Algorithms
