SearcharxivSearch

arXiv · 2102.06699

Simutaneously vanishing higher derived limits without large cardinals

Abstract

A question dating to Sibe Marde\v{s}i\'{c} and Andrei Prasolov's 1988 work Strong homology is not additive, and motivating a considerable amount of set theoretic work in the ensuing years, is that of whether it is consistent with the ZFC axioms for the higher derived limits $\mathrm{lim}^n$ $(n>0)$ of a certain inverse system $\mathbf{A}$ indexed by ${^\omega}\omega$ to simultaneously vanish. An equivalent formulation of this question is that of whether it is consistent for all $n$-coherent families of functions indexed by ${^\omega}\omega$ to be trivial. In this paper, we prove that, in any forcing extension given by adjoining $\beth_\omega$-many Cohen reals, $\mathrm{lim}^n \mathbf{A}$ vanishes for all $n > 0$. Our proof involves a detailed combinatorial analysis of the forcing extension and repeated applications of higher dimensional $\Delta$-system lemmas. This work removes all large cardinal hypotheses from the main result of arXiv:1907.11744 and substantially reduces the least value of the continuum known to be compatible with the simultaneous vanishing of $\mathrm{lim}^n \mathbf{A}$ for all $n > 0$.

Explore related subjects

Keep this discovery

BibTeXRIS

Jeffrey Bergfalk, Michael Hrušák, Chris Lambie-Hanson. 2021-02-12. Simutaneously vanishing higher derived limits without large cardinals. https://arxiv.org/abs/2102.06699

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