SearcharxivSearch

arXiv · 2212.05185

Lebesgue measure zero modulo ideals on the natural numbers

Abstract

We propose a reformulation of the ideal $\mathcal{N}$ of Lebesgue measure zero sets of reals modulo an ideal $J$ on $\omega$, which we denote by $\mathcal{N}_J$. In the same way, we reformulate the ideal $\mathcal{E}$ generated by $F_\sigma$ measure zero sets of reals modulo $J$, which we denote by $\mathcal{N}^*_J$. We show that these are $\sigma$-ideals and that $\mathcal{N}_J=\mathcal{N}$ iff $J$ has the Baire property, which in turn is equivalent to $\mathcal{N}^*_J=\mathcal{E}$. Moreover, we prove that $\mathcal{N}_J$ does not contain co-meager sets and $\mathcal{N}^*_J$ contains non-meager sets when $J$ does not have the Baire property. We also prove a deep connection between these ideals modulo $J$ and the notion of nearly coherence of filters (or ideals). We also study the cardinal characteristics associated with $\mathcal{N}_J$ and $\mathcal{N}^*_J$. We show their position with respect to Cicho\'n's diagram and prove consistency results in connection with other very classical cardinal characteristics of the continuum, leaving just very few open questions. To achieve this, we discovered a new characterization of $\mathrm{add}(\mathcal{N})$ and $\mathrm{cof}(\mathcal{N})$. We also show that, in Cohen model, we can obtain many different values to the cardinal characteristics associated with our new ideals.

Explore related subjects

Keep this discovery

BibTeXRIS

Viera Gavalová, Diego Alejandro Mejía. 2022-12-10. Lebesgue measure zero modulo ideals on the natural numbers. https://doi.org/10.1017/jsl.2023.97

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