Search arXivSearch

arXiv · 2510.19744

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

Abstract

For an ideal $\mathcal{I}$ in a $σ$-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(ω)$ of the form $\wp(ω)\langle\mathcal{I}\rangle$ which, when thought of as subsets of the Cantor space $2^ω$, belong to the Borel class $\mathbb{F}_{σδ}$ 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(ω)\langle\mathcal{I}\rangle$ with the Nikodym property but without the Grothendieck property. Extending a result of Hernández-Hernández and Hrušák, we show that for an analytic P-ideal $\mathcal{I}$ on $ω$ the following are equivalent: 1) $\mathcal{I}$ is totally bounded, 2) $\mathcal{I}$ has the Local-to-Global Boundedness Property for submeasures, 3) $\wp(ω)/\mathcal{I}$ contains a countable splitting family, 4) $\mbox{conv}\le_K\mathcal{I}$. Moreover, proving a conjecture of Drewnowski, Florencio, and Paúl, we present examples of analytic P-ideals on $ω$ 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 Łuczak, we also describe a family of $\mathfrak{c}$ many pairwise non-isomorphic ideals on $ω$, 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. 2026-04-30. 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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO