SearcharxivSearch

arXiv · 2607.12936

Forcing and Cardinal Invariants of Universally Null Sets

Abstract

We study universally null sets in forcing extensions and the cardinal invariants of their ideal $\mathcal{UN}$. We prove that the Miller model contains a nonmeager universally null set of cardinality $\aleph_2=\mathfrak{c}$, answering a question of Brendle and Larson. The proof uses preservation of universal nullity by countable support iterations of Miller forcing and shows that the set of Miller reals added during the iteration is universally null. We also prove that every universally null set in the $\mathbb{PT}_{f,g}$ model has cardinality at most $\aleph_1$, and give a consistent example of a universally null set that acquires a perfect subset after an $\omega_1$-preserving forcing. For the cardinal invariants, we show that $|X|<\operatorname{cof}(\mathcal{UN})$ for every $X\in\mathcal{UN}$, and that $\operatorname{add}(\mathcal{N})=\mathfrak{c}$ implies $\operatorname{cof}(\mathcal{UN})=\mathfrak{d}_{\mathfrak{c}}$. Finally, we prove the consistency of $\operatorname{add}(\mathcal{UN})<\operatorname{cov}(\mathcal{UN}) <\operatorname{non}(\mathcal{UN})<\operatorname{cof}(\mathcal{UN})$.

Explore related subjects

Keep this discovery

BibTeXRIS

Tatsuya Goto. 2026-07-14. Forcing and Cardinal Invariants of Universally Null Sets. https://arxiv.org/abs/2607.12936

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO