Hostname: page-component-76d6cb85b7-92wsb Total loading time: 0 Render date: 2026-07-18T00:10:49.402Z Has data issue: false hasContentIssue false

UNIFORMITY NUMBERS OF THE NULL-ADDITIVE AND MEAGER-ADDITIVE IDEALS

Part of: Set theory

Published online by Cambridge University Press:  07 August 2025

MIGUEL ANTONIO CARDONA
Affiliation:
EINSTEIN INSTITUTE OF MATHEMATICS EDMOND J. SAFRA CAMPUS, GIVAT RAM THE HEBREW UNIVERSITY OF JERUSALEM JERUSALEM, 91904, ISRAEL E-mail: miguel.cardona@mail.huji.ac.il URL: https://sites.google.com/view/miacardonamo
DIEGO ALEJANDRO MEJÍA*
Affiliation:
GRADUATE SCHOOL OF SYSTEM INFORMATICS, KOBE UNIVERSITY 1-1 ROKKODAI-CHO, NADA-KU, KOBE, HYOGO 657-8501 JAPAN URL: https://researchmap.jp/mejia?lang=en
ISMAEL RIVERA-MADRID
Affiliation:
FACULTY OF ENGINEERING INSTITUCIÓN UNIVERSITARIA PASCUAL BRAVO CALLE 73 NO. 73A-226, MEDELLÍN, COLOMBIA E-mail: ismael.rivera@pascualbravo.edu.co

Abstract

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

Information

Type
Article
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable