Countably perfectly meager sets
Abstract
We study a strengthening of the notion of a perfectly meager set. We say that that a subset A of a perfect Polish space X is countably perfectly meager in X, if for every sequence of perfect subsets \Pn: n ∈ N\ of X, there exists an Fσ-set F in X such that A ⊂eq F and F Pn is meager in Pn for each n. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.