Uniformity numbers of the null-additive and meager-additive ideals

Abstract

Denote by NA and MA the ideals of null-additive and meager-additive subsets of~2ω, respectively. We prove in ZFC that add(NA)=non(NA) and introduce a new (Polish) relational system to reformulate Bartoszy\'nski's and Judah's characterization of the uniformity of MA, which is helpful to understand the combinatorics of MA and to prove consistency results. As for the latter, we prove that cov(MA)<c (even cov(MA)<non(N)) is consistent with ZFC, as well as several constellations of Cicho\'n's diagram with non(NA), non(MA) and add(SN), which include non(NA)<b< non(MA) and b< add(SN)<cov(M)<d=c.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…