SearcharxivSearch

arXiv · 2403.07484

The Nikodym property and filters on $\omega$

Abstract

For a free filter $F$ on $\omega$, let $N_F=\omega\cup\{p_F\}$, where $p_F\not\in\omega$, be equipped with the following topology: every element of $\omega$ is isolated whereas all open neighborhoods of $p_F$ are of the form $A\cup\{p_F\}$ for $A\in F$. The aim of this paper is to study spaces of the form $N_F$ in the context of the Nikodym property of Boolean algebras. By $\mathcal{AN}$ we denote the class of all those ideals $\mathcal{I}$ on $\omega$ such that for the dual filter $\mathcal{I}^*$ the space $N_{\mathcal{I}^*}$ carries a sequence $\langle\mu_n\colon n\in\omega\rangle$ of finitely supported signed measures such that $\|\mu_n\|\rightarrow\infty$ and $\mu_n(A)\rightarrow 0$ for every clopen subset $A\subseteq N_{\mathcal{I}^*}$. We prove that $\mathcal{I}\in\mathcal{AN}$ if and only if there exists a density submeasure $\varphi$ on $\omega$ such that $\varphi(\omega)=\infty$ and $\mathcal{I}$ is contained in the exhaustive ideal $\mbox{Exh}(\varphi)$. Consequently, we get that if $\mathcal{I}\subseteq\mbox{Exh}(\varphi)$ for some density submeasure $\varphi$ on $\omega$ such that $\varphi(\omega)=\infty$ and $N_{\mathcal{I}^*}$ is homeomorphic to a subspace of the Stone space $St(\mathcal{A})$ of a given Boolean algebra $\mathcal{A}$, then $\mathcal{A}$ does not have the Nikodym property. We observe that each $\mathcal{I}\in\mathcal{AN}$ is Kat\v{e}tov below the asymptotic density zero ideal $\mathcal{Z}$, and prove that the class $\mathcal{AN}$ has a subset of size $\mathfrak{d}$ which is dominating with respect to the Kat\v{e}tov order $\leq_K$, but $\mathcal{AN}$ has no $\leq_K$-maximal element. We show that for a density ideal $\mathcal{I}$ it holds $\mathcal{I}\not\in\mathcal{AN}$ if and only if $\mathcal{I}$ is totally bounded if and only if the Boolean algebra $\mathcal{P}(\omega)/\mathcal{I}$ contains a countable splitting family.

Explore related subjects

Keep this discovery

BibTeXRIS

Tomasz Żuchowski. 2024-03-12. The Nikodym property and filters on $\omega$. https://arxiv.org/abs/2403.07484

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