Countably perfectly meager sets
Logic
2021-06-08 v3 General Topology
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.
Keywords
Cite
@article{arxiv.2010.08812,
title = {Countably perfectly meager sets},
author = {Roman Pol and Piotr Zakrzewski},
journal= {arXiv preprint arXiv:2010.08812},
year = {2021}
}
Comments
16 pages