Search arXivSearch

arXiv · 2501.15643

$F_\sigma$-ideals, colorings, and representation in Banach spaces

Abstract

In recent works by L. Drewnowski and I. Labuda and J. Mart\'inez et al., non-pathological analytic \( P \)-ideals and non-pathological \( F_\sigma \)-ideals have been characterized and studied in terms of their representations by a sequence \( (x_n)_n \) in a Banach space, as \( \mathcal{C}((x_n)_n) \) and \( \mathcal{B}((x_n)_n) \). The ideal \( \mathcal{C}((x_n)_n) \) consists of sets where the series \( \sum_{n \in A} x_n \) is unconditionally convergent, while \( \mathcal{B}((x_n)_n) \) involves weak unconditional convergence. In this paper, we further study these representations and provide effective descriptions of \( \mathcal{B} \)- and \( \mathcal{C} \)-ideals in the universal spaces \( C([0,1]) \) and \( C(2^{\mathbb{N}}) \), addressing a question posed by Borodulin-Nadzieja et al. A key aspect of our study is the role of the space \( c_0 \) in these representations. We focus particularly on \( \mathcal{B} \)-representations in spaces containing many copies of \( c_0 \), such as \( c_0 \)-saturated spaces of continuous functions. A central tool in our analysis is the concept of \( c \)-coloring ideals, which arise from homogeneous sets of continuous colorings. These ideals, generated by homogeneous sets of 2-colorings, exhibit a rich combinatorial structure. Among our results, we prove that for \( d \geq 3 \), the random \( d \)-homogeneous ideal is pathological, we construct hereditarily non-pathological universal \( c \)-coloring ideals, and we show that every \( \mathcal{B} \)-ideal represented in \( C(K) \), for \( K \) countable, contains a \( c \)-coloring ideal. Furthermore, by leveraging \( c \)-coloring ideals, we provide examples of \( \mathcal{B} \)-ideals that are not \( \mathcal{B} \)-representable in \( c_0 \). These findings highlight the interplay between combinatorial properties of ideals and their representations in Banach spaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Jordi Lopez-Abad, Víctor Olmos-Prieto, Carlos Uzcátegui-Aylwin. 2025-01-26. $F_\sigma$-ideals, colorings, and representation in Banach spaces. https://arxiv.org/abs/2501.15643

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