Papers
Topics
Authors
Recent
Search
2000 character limit reached

Simultaneously vanishing higher derived limits

Published 26 Jul 2019 in math.LO and math.AT | (1907.11744v3)

Abstract: In 1988, Sibe Marde\v{s}i\'{c} and Andrei Prasolov isolated an inverse system A\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<sup>nA\lim<sup>n\mathbf{A} (the n<sup>thn<sup>{\text{th}} derived limit of A\mathbf{A}) vanishes for every $n &gt;0$. Since that time, the question of whether it is consistent with the ZFC\mathsf{ZFC} axioms that lim<sup>n</sup>A=0\lim<sup>n</sup> \mathbf{A}=0 for every $n &gt;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 ZFC\mathsf{ZFC} axioms that lim<sup>n</sup>A=0\lim<sup>n</sup> \mathbf{A}=0 for all $n &gt;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<sup>nA=0\lim<sup>n\mathbf{A}=0 will hold for each $n&gt;0$. This condition is of interest in its own right; namely, it is the triviality of every coherent nn-dimensional family of certain specified sorts of partial functions N<sup>2Z\mathbb{N}<sup>2\to\mathbb{Z} which are indexed in turn by nn-tuples of functions f:NNf:\mathbb{N}\to\mathbb{N}. The triviality and coherence in question here generalize the well-studied case of n=1n=1.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.