SearcharxivSearch

arXiv · 1907.11744

Simultaneously vanishing higher derived limits

Abstract

In 1988, Sibe Marde\v{s}i\'{c} and Andrei Prasolov isolated an inverse system $\mathbf{A}$ with the property that the additivity of strong homology on any class of spaces which includes the closed subsets of Euclidean space would entail that $\lim^n\mathbf{A}$ (the $n^{\text{th}}$ derived limit of $\mathbf{A}$) vanishes for every $n >0$. Since that time, the question of whether it is consistent with the $\mathsf{ZFC}$ axioms that $\lim^n \mathbf{A}=0$ for every $n >0$ has remained open. It remains possible as well that this condition in fact implies that strong homology is additive on the category of metric spaces. We show that, assuming the existence of a weakly compact cardinal, it is indeed consistent with the $\mathsf{ZFC}$ axioms that $\lim^n \mathbf{A}=0$ for all $n >0$. We show this via a finite support iteration of Hechler forcings which is of weakly compact length. More precisely, we show that in any forcing extension by this iteration a condition equivalent to $\lim^n\mathbf{A}=0$ will hold for each $n>0$. This condition is of interest in its own right; namely, it is the triviality of every coherent $n$-dimensional family of certain specified sorts of partial functions $\mathbb{N}^2\to\mathbb{Z}$ which are indexed in turn by $n$-tuples of functions $f:\mathbb{N}\to\mathbb{N}$. The triviality and coherence in question here generalize the well-studied case of $n=1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Jeffrey Bergfalk, Chris Lambie-Hanson. 2019-07-26. Simultaneously vanishing higher derived limits. https://doi.org/10.1017/fmp.2021.4

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