More about the cofinality and the covering of the ideal of strong measure zero sets
Abstract
We improve the previous work of Yorioka and the first author about the combinatorics of the ideal SN of strong measure zero sets of reals. We refine the notions of dominating systems of the first author and introduce the new combinatorial principle DS(δ) that helps to find simple conditions to deduce d ≤ cof(SN) (where d is the dominating number on ). In addition, we find a new upper bound of cof(SN) by using products of relational systems and cardinal characteristics associated with Yorioka ideals. In addition, we dissect and generalize results from Pawlikowski to force upper bounds of the covering of SN, particularly for finite support iterations of precaliber posets. Finally, as applications of our main theorems, we prove consistency results about the cardinal characteristics associated with SN and the principle DS(δ). For example, we show that cov(SN)<non(SN)=c<cof(SN) holds in Cohen model, and we refine a result (and the proof) of the first author about the consistency of cov(SN)<non(SN)<cof(SN), with c in any desired position with respect to cof(SN), and the improvement that non(SN) can be singular here.
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.