Countably perfectly meager sets
Roman Pol, Piotr Zakrzewski

TL;DR
The paper introduces and explores the concept of countably perfectly meager sets in perfect Polish spaces, providing characterizations, examples, and correcting previous assumptions about their relationship with universally meager sets.
Contribution
It defines countably perfectly meager sets, offers characterizations and examples, and clarifies their distinction from universally meager sets, correcting earlier misconceptions.
Findings
Not all universally meager sets are countably perfectly meager.
Provides new characterizations of countably perfectly meager sets.
Corrects previous results regarding the relationship between these classes.
Abstract
We study a strengthening of the notion of a perfectly meager set. We say that that a subset of a perfect Polish space is countably perfectly meager in , if for every sequence of perfect subsets of , there exists an -set in such that and is meager in for each . We give various characterizations and examples of countably perfectly meager sets. We prove that not every universally meager set is countably perfectly meager correcting an earlier result of Bartoszy\'nski.
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.
