SearcharxivSearch

arXiv · 2203.05615

Was Ulam right? II: Small width and general ideals

Abstract

We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular, improving upon Ulam's theorem and its extension by Hajnal, it is proved that if $\kappa$ is a regular uncountable cardinal that is not weakly compact in L, then there is a universal witness for non-weak-saturation of $\kappa$-complete ideals. Specifically, there are $\kappa$-many decompositions of $\kappa$ such that, for every $\kappa$-complete ideal $J$ over $\kappa$, and every $B\in J^+$, one of the decompositions shatters $B$ into $\kappa$-many $J^+$-sets. A second focus here is the feature of narrowness of colourings, one already present in the theorem of Sierpinski. This feature ensures that a colouring suitable for an ideal is also suitable for all superideals possessing the requisite completeness degree. It is proved that unlike successors of regulars, every successor of a singular cardinal admits such a narrow colouring.

Explore related subjects

Keep this discovery

BibTeXRIS

Tanmay Inamdar, Assaf Rinot. 2022-03-10. Was Ulam right? II: Small width and general ideals. https://arxiv.org/abs/2203.05615

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