2000 character limit reached
Monotonicity of the ultrafilter number function
Published 24 Jan 2025 in math.LO | (2501.14988v3)
Abstract: We investigate whether the ultrafilter number function $\kappa \mapsto \mathfrak{u}(\kappa)$ on the cardinals is monotone, that is, $\mathfrak{u}(\lambda) \le \mathfrak{u}(\kappa)$ holds for all cardinals $\lambda < \kappa$ or not. We show that monotonicity can fail, but the failure has a large cardinal strength. On the other hand, we prove that there are many restrictions of the failure of monotonicity. For instance, if $\kappa$ is a singular cardinal with countable cofinality or a strong limit singular cardinal, then $\mathfrak{u}(\kappa) \le \mathfrak{u}(\kappa+)$ holds.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.