SearcharxivSearch

arXiv · 2510.19744

The Nikodym and Grothendieck properties of Boolean algebras and rings related to ideals

Abstract

For an ideal $\mathcal{I}$ in a $\sigma$-complete Boolean algebra $\mathcal{A}$, we show that if the Boolean algebra $\mathcal{A}\langle\mathcal{I}\rangle$ generated by $\mathcal{I}$ does not have the Nikodym property, then it does not have the Grothendieck property either. The converse however does not hold -- we construct a family of $\mathfrak{c}$ many pairwise non-isomorphic Boolean subalgebras of the power set $\wp(\omega)$ of the form $\wp(\omega)\langle\mathcal{I}\rangle$ which, when thought of as subsets of the Cantor space $2^\omega$, belong to the Borel class $\mathbb{F}_{\sigma\delta}$ and have the Nikodym property but not the Grothendieck property, and a family of $2^\mathfrak{c}$ many pairwise non-isomorphic non-analytic Boolean algebras of the form $\wp(\omega)\langle\mathcal{I}\rangle$ with the Nikodym property but without the Grothendieck property. Extending a result of Hern\'{a}ndez-Hern\'{a}ndez and Hru\v{s}\'{a}k, we show that for an analytic P-ideal $\mathcal{I}$ on $\omega$ the following are equivalent: 1) $\mathcal{I}$ is totally bounded, 2) $\mathcal{I}$ has the Local-to-Global Boundedness Property for submeasures, 3) $\wp(\omega)/\mathcal{I}$ contains a countable splitting family, 4) $\mbox{conv}\le_K\mathcal{I}$. Moreover, proving a conjecture of Drewnowski, Florencio, and Pa\'ul, we present examples of analytic P-ideals on $\omega$ with the Nikodym property but without the Local-to-Global Boundedness Property for submeasures (and so not totally bounded). Exploiting a construction of Alon, Drewnowski, and {\L}uczak, we also describe a family of $\mathfrak{c}$ many pairwise non-isomorphic ideals on $\omega$, induced by sequences of Kneser hypergraphs, which all have the Nikodym property but not the Nested Partition Property -- this answers a question of Stuart. Finally, Tukey reducibility of a class of ideals without the Nikodym property is studied.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Damian Sobota, Tomasz Żuchowski. 2025-10-22. The Nikodym and Grothendieck properties of Boolean algebras and rings related to ideals. https://arxiv.org/abs/2510.19744

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