Simultaneously vanishing higher derived limits
Jeffrey Bergfalk, Chris Lambie-Hanson

TL;DR
This paper demonstrates, assuming a weakly compact cardinal, that it is consistent with ZFC that all higher derived limits of a specific inverse system vanish, impacting the understanding of strong homology's additivity.
Contribution
It proves the consistency of the vanishing of all higher derived limits of a particular inverse system under ZFC, using a finite support iteration of Hechler forcings.
Findings
Under certain set-theoretic assumptions, all higher derived limits vanish.
The result is achieved via a specific forcing extension with Hechler forcings.
The triviality of certain coherent families of functions is established.
Abstract
In 1988, Sibe Marde\v{s}i\'{c} and Andrei Prasolov isolated an inverse system 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 (the derived limit of ) vanishes for every . Since that time, the question of whether it is consistent with the axioms that for every 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 axioms that for all . We show this via a finite support iteration of Hechler forcings which is of weakly compact length. More…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Simultaneously vanishing higher derived limits
Jeffrey Bergfalk
Universität Wien
Institut für Mathematik
Kurt Gödel Research Center
Kolingasse 14-16
1010 Wien, Austria
and
Chris Lambie-Hanson
Department of Mathematics and Applied Mathematics
Virginia Commonwealth University
Richmond, VA 23284
United States
Abstract.
In 1988, Sibe Mardešić and Andrei Prasolov isolated an inverse system 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 (the derived limit of ) vanishes for every . Since that time, the question of whether it is consistent with the axioms that for every 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 axioms that for all . 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 will hold for each . This condition is of interest in its own right; namely, it is the triviality of every coherent -dimensional family of certain specified sorts of partial functions which are indexed in turn by -tuples of functions . The triviality and coherence in question here generalize the classical and well-studied case of .
Key words and phrases:
derived limit, additivity, strong homology, Hechler forcing, iterated forcing, finite support, Delta system lemma, weakly compact cardinal
2010 Mathematics Subject Classification:
03E05, 03E75, 03E55, 55N07, 55N40, 18E25
1. Introduction
A main and organizing theme in the study of infinitary combinatorics is the phenomenon of incompactness; broadly speaking, the term denotes settings in which the local and global behaviors of a structure sharply diverge. Nontrivial coherent families of functions on a variety of index-sets form one prominent class of examples. These connect in turn to local-to-global questions in homology theory, wherein the nontrivial coherence relations of such set-theoretic interest figure as only the first in an infinite family of incompactness principles given by the derived functors of the inverse limit of various inverse systems. For one particular inverse system, denoted below, the question of whether these associated incompactness principles can simultaneously fail had been longstanding; the main result of this paper is that under the assumption of the existence of a weakly compact cardinal, they can. This result carries implications for the strong homology of metric spaces and, as we note below, possibly for other areas of mathematics as well.
We begin by reviewing the historical background to this result; it traces to Sibe Mardešić and Andrei Prasolov’s 1988 paper “Strong homology is not additive” [21]. Their title references the following potential continuity property of a homology theory:
Definition 1.1** ([23]).**
A homology theory is additive on the class of topological spaces if for every natural number and every family with each and in , the map
[TABLE]
induced by the inclusion maps is an isomorphism.
In [21], Mardešić and Prasolov isolated an inverse system with the property that the additivity of strong homology on any class of topological spaces which includes the closed subsets of Euclidean space would entail that for all . They succeeded also in casting the vanishing of in the following combinatorial terms: if and only if for every family of functions
[TABLE]
whose elements agree pairwise modulo finite sets there exists some agreeing mod finite with each function in . More succinctly, in a parlance that has since grown standard, if and only if every coherent as above is trivial. By way of this characterization, Mardešić and Prasolov showed that the continuum hypothesis implies that . It follows that it is consistent with the axioms that strong homology is not additive, not even on the class of closed subspaces of .
The following year, Alan Dow, Petr Simon, and Jerry Vaughan showed that the Proper Forcing Axiom implies that , underscoring the possibility that the additivity of strong homology may also be consistent with the axioms [9]. Soon thereafter, Stevo Todorcevic showed that the Open Coloring Axiom implies that , while Martin’s Axiom does not [33, 34]. Around 2000, Andrei Prasolov produced a nonmetrizable counterexample to the additivity of strong homology [27], but the additivity question on any “nicer” class — Polish or locally compact metric spaces, for example, or even metric spaces outright — remained entirely open (and for the aforementioned classes remains so; see, however, Remark 1.2 for recent progress on this question).111Prasolov’s example was, in essence, a geometric “realization” of an -Hausdorff gap. In short, in this sequence, the vanishing of became a topic of set-theoretic study in its own right [16, 12], one closely linked to the study of forcing axioms and one, furthermore, rekindling older lines of research into relations between homological dimension and the cardinals [26, 7]. It was therefore natural that the consistency of the additivity of strong homology would close out the list of open questions in Justin Moore’s 2010 ICM survey on the Proper Forcing Axiom [25]. Moore further observed therein that “it is entirely possible that it is a theorem of that either [] or [].” The first set-theoretic computation of appeared some six years later in [5]; here framings of in terms of higher-dimensional coherence were given and applied to show that the Proper Forcing Axiom implies that . Here also Goblot’s work [13] was applied to show that implies that for all . Still, Moore’s speculation remained unanswered.
Against this background, we may state our main result:
Main Theorem**.**
Let be a weakly compact cardinal and let denote a length- finite-support iteration of Hechler forcings. Then
[TABLE]
In addition to answering well-studied set-theoretic questions, the theorem is of interest for specifying a model — namely, — in which strong homology may well turn out to be additive on some “nice” class of spaces properly containing the class of homotopy types of CW-complexes. Moreover, although we have followed tradition in foregrounding the additivity question above, the nonvanishing of for some is also the only known obstacle to strong homology having compact supports on some such “nice” class; hence this property of strong homology conceivably holds in as well.
Remark 1.2**.**
We have largely retained the text of this article’s original incarnation, but a couple of recent developments should be noted.
First, work of the first author together with Nathaniel Bannister and Justin Tatch Moore [1] vindicated the speculations of the previous paragraph by showing that, in , strong homology is indeed additive and has compact supports on the class of locally compact separable metric spaces. For the property of having compact supports, this class of spaces is at least close to optimal, by the results of [14] and [20], but the question of whether strong homology is consistently additive on some broader class of spaces remains open, as we discuss at greater length in our conclusion below.
Second, work of the authors together with Michael Hrušák [6], building on the techniques of this paper, shows that the assumption of a weakly compact cardinal is not necessary to obtain the conclusion of our main theorem. More precisely, for all after adding -many Cohen reals to any model of .
For interested readers, the most immediate point is probably the following: [1] and [6] each couple multiple new ideas to techniques which first appear, and, consequently, receive their fullest and most direct treatment, in the present work. Given the complexity of these techniques, there will be benefits to reading this work before either of the others, though ultimately, of course, readers may and should order their approach to these three texts most fundamentally according to their interests.
These limits also bear on questions seemingly remote from strong homology: within the context of Dustin Clausen and Peter Scholze’s recently-developed condensed mathematics [28], is the most basic system in a family of inverse systems upon whose limits’ simultaneous vanishing the full and faithful embedding of the derived category of pro-abelian groups into the associated derived condensed category depends [8]. More generally speaking, the above theorem reflects new levels of insight into the set-theoretic content of derived functors, and as such takes its place in a line of research beginning with Shelah’s solution to Whitehead problem [30, 11]. It bears comparison, lastly, with Boban Velickovic and Alessandro Vignati’s recent result in the opposite direction:
Theorem** ([35]).**
For all integers it is consistent with the axioms that .
As in so much of the above-described research history, our argument of a fundamentally algebraic result will be predominantly set-theoretic in nature. Our Main Theorem, in particular, can and will be recast as a purely set-theoretic statement that we feel is of interest in its own right. For this reason we have divided Section 2, in which we fix our notational conventions and record the definitions and background facts most relevant to our main result, into two subsections. One is more set-theoretic and one is more cohomological in character. Section 2.1 contains the set-theoretic reformulation of our Main Theorem and must be read in order to understand the arguments of subsequent sections. Section 2.2 records some of the original context of the problems addressed in this paper together with the argument that our set-theoretic reformulation of the Main Theorem is in fact equivalent to its statement above. Readers less familiar with homological algebra may safely skip most of Section 2.2 without sacrificing any understanding of the remainder of the paper (we indicate at the end of Section 2.1 exactly which part of Section 2.2 is necessary for the rest of the paper). Of course, such readers are invited to return to this subsection after reading that remainder, in order to better contextualize its contents.
The paper thereafter is structured as follows. In Section 3 we describe a multidimensional -system lemma lying at the core of our subsequent arguments. We then turn to the proof of our Main Theorem. Due to the technical complexity of the full proof of the theorem, we begin by presenting two cases in which our argument’s core ideas more transparently appear. In Section 4, after recording the requisite facts about finite-support iterations of Hechler forcing, we prove the case of our main theorem. We prove the case in Section 5. The full proof of the Main Theorem is contained in Section 6. We conclude with a brief discussion of the import of this result and with the questions following most immediately in its wake.
We close this introduction with a more general word on notations and conventions. For any and cardinal we write to denote the collection of subsets of of cardinality and for . In particular we view as . When is a collection of ordinals, it is frequently convenient to regard elements of as finite increasing sequences, and vice versa. For such and we let denote the unique such that . The notation will always stand for an ordered tuple of the form , though we will occasionally begin our indexing with . Also, if , , and are finite sets of ordinals, then the statement indicates both that and that , i.e., that every ordinal in is less than every ordinal in , and the statement indicates that is an initial segment of . We use angled brackets to emphasize the indexed or ordered character of a set; in all of this, though, the surest guide will simply be context.
We follow [3] and [18] in our approach to forcing. We remark though that we view conditions in a -length finite support iteration as finite partial functions with domains contained in rather than as total functions such that is a name for the trivial condition for all but finitely many . The difference between these views, of course, is cosmetic.
2. Main definitions and conventions
2.1. Set theoretic background
Our primary objects of study are families of functions from subsets of to . Let us begin by introducing some basic definitions and notational conventions.
Given functions , let if and only if for all , let if and only if for all but finitely many , and let if and only if for all but finitely many . We let denote the greatest lower -bound of and , i.e., for all . Similarly, if is a sequence of elements of , then denotes the greatest lower -bound of the functions . If , then denotes the set ; visually, this is the region below the graph of . Relatedly, denotes the set . We note that, for ease of readability, we will sometimes write in place of the more formally correct in expressions such as . The correct interpretation will always be clear from context.
Our interest is in families of functions indexed by elements of for some positive integer . Before giving general definitions, we recall the better-known special case in which .
Definition 2.1**.**
A family of functions is coherent if
[TABLE]
for all .
The family is trivial if there exists a function such that
[TABLE]
for all . In this case, we say that trivializes .
The notions of coherent and trivial also apply to families of functions indexed by some subset of in the obvious way.
Remark 2.2**.**
In the following, as in Definition 2.1, sums involving functions with different domains will be common. In the interests of readability, we will tend to refrain from notating the restrictions of such functions to the intersection of their domains. An equation like
[TABLE]
for example, will more typically appear as
[TABLE]
hereafter.
Clearly any trivial family of functions is coherent. More interesting are those families of functions which are coherent but not trivial; in these families there is a tension between local and global behaviors which is exemplary of the broader set-theoretic theme of incompactness. More precisely, observe that any coherent is “locally” trivial: for any , the function trivializes the family . A nontrivial coherent is simply one in which these local phenomena do not globalize. Such families are the subjects of the works [9], [34], [16], and [12], among others. As we will see in Section 2.2, their existence is equivalent to the statement .
For the more general definitions of -coherence and -triviality, we need some more notation.
Definition 2.3**.**
Suppose that is a positive integer and is a sequence of length . If , then denotes the sequence of length obtained by removing the entry of , i.e., .
If is a permutation of , then denotes the sign or parity of (so is either or ). We will use the notation to denote the sequence .
Definition 2.4**.**
Let be a positive integer, and let
[TABLE]
be a family of functions.
- (1)
is alternating if
[TABLE]
for every and every permutation of . 2. (2)
is -coherent if it is alternating and if
[TABLE]
for all . (Note that, in accordance with Remark 2.2, for readability we have omitted the restrictions of the functions in the above expression to the intersection of their domains. Formally, each should be .) 3. (3)
For , is -trivial if there exists an alternating family
[TABLE]
such that
[TABLE]
for all . We term such a family an -trivialization of .
As in the case , the notions of alternating, -coherent, and -trivial apply in obvious ways to families indexed by , where is any subset of .
Notice that if then every family as above is alternating, and the definition of 1-coherence coincides with the that of coherence in Definition 2.1. Similarly, we define -triviality to coincide with triviality as defined in Definition 2.1. If the value of is clear from context then it may be dropped from the expression -trivial. Also we will sometimes consider functions or without explicitly specifying their domains or codomains. It is in such cases implicit that these functions have domain and codomain .
Observe that if is alternating then whenever has repeated entries, since if the permutation induces a simple swapping of two repeated entries in then and and therefore .
Just as when equals , any -trivial family of functions is -coherent. Also just as before, nontrivial -coherent families are exemplary cases of set-theoretic incompactness. This is again because if is an -coherent family then for each in the local family is -trivial, as witnessed by the collection
[TABLE]
This fact will contrast with the global structure of any nontrivial such .
We will see in Section 2.2 that for each positive integer the nonexistence of nontrivial -coherent families of functions is equivalent to the statement . Hence our Main Theorem may be rephrased as follows:
Main Theorem (version 2)****.
Let be a weakly compact cardinal in and let denote a length- finite-support iteration of Hechler forcings. Then the following holds in : for every positive integer , every -coherent family
[TABLE]
is -trivial.
It is this version of the Main Theorem that we will prove. To that end we give the following alternate characterization of the -triviality of an -coherent family, one which is at least locally more finitary in character than that of Definition 2.4. Our aim is to facilitate the analysis of these phenomena as they arise in forcing extensions. In what follows, and throughout the paper, if is a function, then the support of is the set . We say that is finitely supported if the support of is finite.
Lemma 2.5**.**
Suppose that , and let be an -coherent family. Then is -trivial if and only if there exists an alternating family of finitely supported functions such that
[TABLE]
for all .
Remark 2.6**.**
See Lemma 2.13 in Section 2.2 for a cohomological approach to the above fact; the treatment there is notably cleaner and neatly complements the more computational perspective below.
Proof of Lemma 2.5.
We first consider the case in which . Suppose that is trivial and that is a trivialization. For each , let
[TABLE]
It is straightforward to verify that is as desired. For the other direction, suppose that is as in the statement of the lemma. In particular, for all and all , we have
[TABLE]
We can therefore define by setting, for all ,
[TABLE]
for some (or, equivalently, all) such that (if there is no such that , simply let ). Since each is finitely supported, it follows that for all .
We now consider the case in which . Suppose first that is -trivial, and let be an -trivialization of . For each , let
[TABLE]
We claim that is as desired. The following statements are straightforward but tedious to verify. This direction of the lemma being inessential to the proof of our main result, we leave them to the reader:
- •
If is an -trivialization of then each is finitely supported.
- •
If both and are alternating families then also is an alternating family.
- •
For all
[TABLE]
as desired. This can be seen by writing
[TABLE]
and verifying that all of the terms in the double sum on the right-hand side of the above equation cancel out.
For the implication in the other direction, suppose that and are as in the statement of the lemma. For each , fix a function with if there exists such a function in (if not, then leave undefined). We will define an -trivialization of as follows. Given and , note that is defined, and let
[TABLE]
The fact that is an alternating family follows immediately from the fact that and are alternating families. To see that is an -trivialization of , fix and let be an element of outside of the support of . Then we have
[TABLE]
Letting , we have
[TABLE]
Rearranging the terms in this equation yields
[TABLE]
Recall that we chose so that . Hence, putting this all together, we obtain
[TABLE]
Since the support of is finite, it follows that
[TABLE]
as required. ∎
With the aid of one further lemma, we are now in a position to describe the basic strategy of the argument of our main theorem. When is a subset of and , we will write for . Recall that a subset is said to be -cofinal if, for all , there is such that .
Lemma 2.7**.**
Let be an -coherent family of functions. Then is -trivial if and only if is -trivial for some -cofinal .
Proof.
The rightwards implication is obvious. For the leftwards implication, the point is that any -trivialization of any such extends to an -trivialization of . Suppose first that , is -cofinal in , and trivializes . We claim that trivializes the entire family . Indeed, if , then we can find such that , i.e., contains modulo a finite set. By the coherence of , we have . Since trivializes , we have , and hence , as well.
We can therefore suppose that . Let be -cofinal in and let be an -trivialization of . Fix a map such that for each . Write for . The family is then an -trivialization of , where
[TABLE]
for each . The right-hand side of the equation is a sum of functions defined on all but finitely many elements of ; the function is defined more precisely as the extension of that sum to the domain by letting on any otherwise undefined arguments . The verification that this definition works takes the following shape: for any the terms in
[TABLE]
together simplify (mod finite) to . This together with of the terms in the sum (1) will simplify (mod finite) to . This process continues until (1) has entirely simplified (mod finite) to the term , thus completing the verification. ∎
There are in fact a number of ways to argue Lemma 2.7. The above approach may be clearer in the following example.
Example 2.8**.**
Let be -coherent. Let be as in the statement of Lemma 2.7 and let -trivialize . Let then be as in the proof of Lemma 2.7 and let for each . Then for all ,
[TABLE]
as desired.
We may now describe the broad outlines of our proof of our main theorem. Fix and a weakly compact cardinal , and let be a length- finite-support iteration of Hechler forcings. To show that we fix an arbitrary -coherent in and show that it is -trivial. This we accomplish by showing that is -trivial, where is a -cofinal family of Hechler reals. This in turn we achieve by defining a family of finitely supported functions trivializing in the sense of Lemma 2.5. These are formed out of the differences among particular functions in . To select those functions we rely heavily on uniformities among the conditions in the -generic filter which derive from the weak compactness of by way of the multidimensional -system Lemma of the following section. Our proof consists essentially in applying this procedure to each . As indicated, however, expository considerations lead us to break this proof into three stages: that of , that of , and that of .
2.2. Homological background
We described above a historical sequence of investigations into the derived limits , the point of departure for any of which is the following computation. For each positive integer let denote the one-point compactification of an infinite countable sum of copies of the -dimensional open unit ball ; more colloquially, is an -dimensional “Hawaiian earring.” Its strong homology groups are as follows:
[TABLE]
This is in marked contrast to the singular homology groups of [10], [2], and essentially certifies \vbox{\hrule height=0.5pt\kern 1.07639pt\hbox{\kern-1.99997ptH\kern 0.0pt}}_{*} as a Steenrod homology theory [24]. For countably infinite sums of copies of , on the other hand,
[TABLE]
We will define the inverse system and its higher derived limits momentarily; we will then leave all more direct references to strong homology behind until our conclusion. Interested readers are referred to [21] or to [22] more generally for details of the above computations. The significance of these computations, of course, is that they tell us that if strong homology is additive on closed subsets of Euclidean space then for all .
Let denote the partial order , and let denote its order-reversal. Let denote the topology on generated by the basis , where we recall that . Given a quotient of groups, we write for the coset of an element of .
Definition 2.9**.**
Let denote the inverse system , where
[TABLE]
and is the projection map for each in . Similarly, let and , where
[TABLE]
and and are projection maps for each in .
is an object, in other words, of the functor or presheaf category , and it is in this setting that its higher derived limits are most naturally defined. The inverse limit of , for example, admits both a category-theoretic characterization via a universal property in and the following more concrete characterization:
[TABLE]
More precisely, is the above family naturally viewed as a group.222Observe that in consequence , which equals by definition, is isomorphic to , as additivity in the degree in equation (2) would require. Similarly, higher derived limits admit abelian category theoretic description as the cohomology groups of the -image of an injective resolution of . Standard resolutions convert this description to a more concrete general form, as above. The characterizations of and of in [21] and [5], respectively, then each involved one further conversion, via the long exact sequence
[TABLE]
associated to the natural short exact sequence
[TABLE]
We will require for our work below two further reformulations.
First, for each in let
[TABLE]
Observe that
[TABLE]
Similar definitions and observations apply for the systems and . By Jensen’s observation in [15, page 4],
[TABLE]
where is the sheaf on given by together with the natural restriction maps. Analogous definitions apply for the systems and ; in particular, will denote the sheaf given by . Since is maximal in the refinement-ordering of open covers of , equation (3) now takes the following form:
[TABLE]
As observed in [5],
[TABLE]
The same therefore holds for . In consequence,
[TABLE]
We will define these cohomology groups more explicitly below. It will then be clear that the natural rendering of the above quotient is as the coherent families of functions modulo the trivial families of functions in the sense of Definition 2.1. The following is then immediate:
Theorem 2.10** (Theorem 1 in [21]).**
* if and only if every coherent family of functions is trivial.*
By point (5) above, the higher- analogue of equation (6) is simply
[TABLE]
The advantage of this formulation is that in computing Čech cohomology groups we have a choice among several indexing schema giving equivalent quotients [29, I.20 Proposition 2]. As a generic real may fail to integrate nontrivially into the ordering of its ground model, it is useful in contexts like ours to define higher coherence via indices as untethered to that order as possible. To that end we adopt the alternating cochains definition of the Čech complex.
Definition 2.11**.**
For , the group is the cohomology of the cochain complex
[TABLE]
where denotes the subgroup of
[TABLE]
whose elements satisfy
[TABLE]
for all and permutations of . The equality in (9) amounts simply to an application of the -variant of observation (4).
The differentials are defined as usual. Namely, for any and recall that denotes the element of formed via the omission of the coordinate from . Then for any , define by the assignment
[TABLE]
for each .
Entirely analogous definitions hold for and . Observe in particular that any in admits representatives in , i.e., alternating cochains taking values in the groups and satisfying for all .
As in the cases of Section 2.1, the requisite function-restrictions will tend to be clear from context. Hence again for readability we will rarely notate them, writing, for example, sums like that of equation (10) as
[TABLE]
It is now clear that -coherent and -trivial families are, respectively, representatives of the -cocycles and -coboundaries of the complex (8) above. Recall that every -trivial is -coherent. We have just argued that whether or not vanishes is precisely the question of the converse; we have in other words shown the following:
Theorem 2.12**.**
Let be a positive integer. Then if and only if every -coherent family is -trivial.
We end this subsection by indicating how Lemma 2.5 can be derived from cohomological considerations in the special case . (The more general case of an arbitrary can be obtained via a routine modification of the arguments in this subsection, working with the partial order and inverse systems , , and instead of , , , and . All of the results of this subsection carry through with no difficulty in this setting.) We return to equation (7), which had derived from the cohomological reformulation of equation (3). Equation (7) is more precisely stated as follows:
Lemma 2.13**.**
Let be greater than . Then is isomorphic to via the connecting map , where is any representative of in .
Proof.
Here the only new assertion is the characterization of the connecting map . This, though, is simply the general form of the connecting maps of a long exact sequence; see for example [36, Addendum 1.3.3]. ∎
For it follows that an -coherent family represents a coboundary in if and only if what we might write as is a coboundary in . Lemma 2.5 is then immediate.
3. A multidimensional -system lemma
We turn now more towards the argument of our main theorem. We begin by proving a generalization of the two-dimensional -system lemma appearing in [4] (see [32] for an earlier precedent). Structuring our generalization will be the following refinement of the relation holding between pairs of elements of a classical -system.
Definition 3.1**.**
Sets are aligned if
- •
, and
- •
for all .
Definition 3.2**.**
Let be natural numbers. A function is a type of width and length if
[TABLE]
Given and an increasing enumeration of , we say that the type of and is the unique type of width and length such that
- •
,
- •
, and
- •
.
We denote this unique type by . Observe that and are aligned if and only if satisfies
[TABLE]
for all in . Any such type is also called aligned.
Types as above admit natural representations as finite strings of [math]s, s, and s. If , for example, then is naturally rendered as .
We may now state our multidimensional -system lemma. We first remind the reader of the definition of a weakly compact cardinal.
Definition 3.3**.**
A cardinal is weakly compact if is uncountable and, for every positive integer , every , and every function , there is a set such that is constant.
There are many useful alternative characterizations of weakly compact cardinals; for example, is weakly compact if and only if is strongly inaccessible and has the tree property. We refer the reader to [17] for more information on this and other equivalent formulations of weak compactness.
Recall our notational convention that elements of are often thought of as increasing -tuples. So, for instance, when we write , it is implicit that .
Lemma 3.4**.**
Let be a positive number and let be a weakly compact cardinal, and suppose that the family of -tuples indexes elements of . Then there is a set and a collection of elements of such that
- (1)
for all ,
- (a)
if and , then , 2. (b)
if satisfies , then , 3. (c)
the set forms a -system with root ; 2. (2)
for all and all ,
- (a)
, and 2. (b)
if and are aligned, then and are aligned.
To prove Lemma 3.4, we require one further technical lemma.
Lemma 3.5**.**
Suppose that and that is an aligned type of width and length . Then for some positive number there exists a sequence of elements of such that
- •
* for all , and*
- •
.
Proof.
The proof is by induction on . We will also assume that . The case in which is essentially the same as that in which and is left to the reader. If , then either or . We may take in either case. For if then for any ordinal the sequence is as desired, while if then for any ordinals the sequence , , is as desired.
Now assume that and that we have established the lemma for all aligned types of width less than .
Case 1: . In this case, is an aligned type of width , hence by our inductive hypothesis there exists some positive and sequence of elements of witnessing the conclusion of the lemma for . Now take any , and let for all . Then and witness the conclusion of the lemma for .
Case 2: . The idea in this case is to form a type of width and length by deleting the last [math] and the last from . The induction hypothesis then furnishes a sequence as in the conclusion of the lemma for the type . It is then fairly straightforward (though notationally tedious) to modify to form a sequence as desired for the original type .
More formally, let be such that and for all with . Such an must exist since is aligned. Let . This number has the following significance: if are such that , then is the number of elements of that are smaller than the largest element of . In other words, is the least element of larger than every element of . Now define by letting
[TABLE]
This defines an aligned type of width . Apply the induction hypothesis to obtain a positive and a sequence of elements of witnessing the conclusion of the lemma for . By “stretching” each if necessary, we may assume that every element of every is a limit of limit ordinals.
We now augment the elements of the sequence to form a sequence for . Two cases are straightforward: those in which and those in which . In the latter case, for example, take such that
- •
for all , if is even and is odd, then ;
- •
.
Letting then defines a sequence as desired for . The case of is similar. Therefore assume that . We will assume as well that for all odd . We are free to assume this because if then is larger than every element of , hence for any with and consisting of arbitrarily large ordinals.
We now define limit ordinals so that for each . We first do this for the even . First let be a limit ordinal such that , and let be a limit ordinal such that . For any other even let be a limit ordinal satisfying
[TABLE]
This is all possible by the assumptions of the preceding paragraphs.
Lastly, let be a limit ordinal larger than any ordinal so far considered, and for all odd let . (More precisely we require that for all even and for all odd .) Now let for each . By construction, for all . However, may fail to hold: although indeed equals , it may not be the case that , as would require.
We address this possibility by adding a and to our sequence and then “rotating” it two steps. First, let be any element of such that
- •
,
- •
if , then (this is possible since and the latter is a limit ordinal), and
- •
.
Now define by letting and letting be any ordinal such that
[TABLE]
(and hence ). Then
[TABLE]
Therefore, if we define by setting , setting and, for , setting , we see that witnesses the conclusion of the theorem for . ∎
Readers may better appreciate the necessity of some argument like the above after constructing a cycle as in Lemma 3.5 for the type . For yet more on these matters, readers are referred to [19].
We turn now to the proof of our main lemma:
Proof of Lemma 3.4.
By the weak compactness of there exists a natural number and a such that for all .
For any and let , and let
[TABLE]
Recall that denotes the set of all hereditarily finite sets (in particular, is itself a countable set). Define a coloring by letting
[TABLE]
where the latter sequences record the images of the and , respectively, under the order-isomorphism ; more precisely,
- •
for each ,
- •
for each .
Again by the weak compactness of we may fix a set such that is constant on .
We now define for in by reverse induction on . The base case is given. In the induction step,
- •
,
- •
is defined for all in of length greater than , and
- •
the with in are all of the same size.
Now fix in .
Claim 3.6**.**
The set forms a -system with a root such that and for every with .
Proof.
First suppose that . Consider any in together with any in such that
- •
,
- •
,
- •
.
Let for . Then implies that
[TABLE]
for any in . It follows immediately that forms a -system. Let be its root. Routine pigeonhole arguments together with the homogeneity of then show that and for every with .
Now suppose that . We argue again essentially as above, beginning instead with a sequence in . Again take ; similarly for and . Let for each . Then again the -homogeneity of implies that forms a -system. Since for each such , and since the sets are all of the same size, forms a -system as well. As was arbitrary, forms a -system; pigeonhole and homogeneity arguments, as above, secure the remainder of the claim. ∎
Now let equal the root of the -system . By Claim 3.6, the homogeneity of , and a pigeonhole argument, we see that we have satisfied item (1) of Lemma 3.4. To see that we satisfy item (2a) as well (and hence that our third inductive assumption was justified), observe that we may calculate from the constant value of , which we denote by \big{\langle}\ell^{*},\langle\xi^{*}_{i}\mid i<2n\rangle,\langle v^{*}_{I}\mid I\in[2n]^{n}\rangle\big{\rangle}; the point is that this computation depends only on the size, , of . To this end, let . Consideration of for any end-extending then shows that .
It remains to verify item (2b). To this end, fix and an aligned pair of -tuples . Suppose for the sake of contradiction that and are not aligned and fix such that . Let . Observe that if for some then , by the homogeneity of .
By Lemma 3.5 there exists an integer and a sequence of elements of such that and for all . Let .
Claim 3.7**.**
* for all .*
Proof.
We proceed by induction on . For , the claim is trivial. Suppose that and . Then, since , we have that , as desired. ∎
It follows from the claim that . However, since , we also have , contradicting the fact that . This completes the proof of the lemma. ∎
4. Hechler forcing and
We begin this section with a few useful observations about Hechler forcing and finite-support iterations thereof. Recall that conditions in Hechler forcing are pairs , where and . We will often call the stem of . If and are conditions then if and only if
- •
,
- •
, and
- •
for all .
Observe that any two conditions with the same stem are compatible.
If is a finite-support iteration of Hechler forcings, then the set of such that, for all ,
- •
decides the value of , and
- •
is a nice -name for an element of
is dense in . We will in general implicitly assume that all of our conditions come from this dense set.
The following situation will frequently arise:
Lemma 4.1**.**
Suppose that
- •
* is a finite-support iteration of Hechler forcings,*
- •
* is a finite collection of conditions in such that for all and all ,*
- •
* and for every .*
Then the set has a lower bound in .
Proof.
We define such a lower bound in as follows. First, let . Next, let . Finally, for all , let for any with and let be a nice -name for the pointwise maximum of the set . It is now straightforward to verify that is a condition in and as desired. ∎
We now turn to proving a lemma about uniformizing families of conditions in finite support iterations of Hechler forcings. We first need the following consequence of weak compactness.
Lemma 4.2**.**
Suppose that is a weakly compact cardinal, , and that is a family of sets such that for every . Suppose also that is a function with domain such that, for all , we have . Then there is an unbounded set such that, for all , all , and all end-extending , we have .
Proof.
The proof is a relatively straightforward modification of the classical ramification argument used to prove that satisfies for all and . We provide some details for completeness.
We proceed by induction on . If , then the result follows simply from the fact that is regular and . Thus, suppose and we have established all instances of the result for . By standard arguments (cf. [17, Lemma 7.2]), using the strong inaccessibility of and the fact that for all , we can define a tree ordering such that
- (1)
for all , if , then ; 2. (2)
for all , we have ; 3. (3)
is a -tree, i.e., it has height and every level has cardinality less than .
Since is weakly compact and therefore has the tree property, we can fix an unbounded such that is linearly ordered by . Now define a function with domain as follows. For every , let for some . Note that, by property (2) of and the fact that is linearly ordered by , the value of is independent of our choice of .
Apply the inductive hypothesis to find an unbounded such that, for all , all , and all , end-extending , we have . We claim that is as desired. To this end, fix , , and end-extending . If , then the fact that is linearly ordered by implies that , so, in particular, . If , then, by our definition of and our choice of , we have
[TABLE]
as required. ∎
Lemma 4.3**.**
Let be a positive integer and let be a weakly compact cardinal. Let be a family of conditions in , a length- finite-support iteration of Hechler forcings. Let . Then there is an unbounded set , a family , a natural number , and a set of stems such that
- (1)
* for all , and if is the element of then ,* 2. (2)
* and satisfy the conclusions of Lemma 3.4,* 3. (3)
* for all and such that and .*
Proof.
First, apply the weak compactness of to the function on defined by
[TABLE]
to find an unbounded set , a natural number , and a sequence of stems such that, for all , we have and
[TABLE]
Next, apply Lemma 3.4 to to find an unbounded set and sets as in the conclusion of that lemma.
For each let and consider the function on defined as follows. For every , define by letting for all .
Apply Lemma 4.2 to find an unbounded such that, for all , all , and all end-extending , we have , i.e., . Then , , , and are as desired. ∎
Remark 4.4**.**
Suppose that , , , and are as in the conclusion of Lemma 4.3. Given , define by choosing any with and letting (observe that this is independent of our choice of ). The family then has the property that if and are aligned, then and are compatible in .
We turn now to the first of our results on the vanishing of . In this case, the assumption of the existence of a weakly compact cardinal is certainly more than we need. For example, it is shown in [16] that in any forcing extension by , the poset to add -many Cohen reals. A similar argument shows that in any forcing extension by a length- finite support iteration of Hechler forcings, at least as long as the ground model satisfies . This is to say that our main purpose in recording this theorem and proof is to foreground the essential logic of the more complicated arguments that will follow.
Theorem 4.5**.**
Suppose that is a weakly compact cardinal, and let be a finite-support iteration of Hechler forcings of length . Then
Proof.
For , let be a -name for the Hechler real added by . In , is a -increasing, cofinal sequence in , hence it suffices to show that, in , every coherent family indexed by is trivial. To this end, fix a condition and a sequence of -names forced by to be a coherent family. We will find a forcing to be trivial.
Let . Observe that for any in there exists a such that . Namely, let . Hence for each in , since forces that is coherent, we may extend to a such that for some ,
[TABLE]
Thin out , if necessary, to an unbounded such that equals some fixed for all . Now apply Lemma 4.3 to \big{\langle}q_{\alpha,\beta}\mid\langle\alpha,\beta\rangle\in[A_{1}]^{2}\big{\rangle} to find an unbounded , , , , and as in the statement of the lemma.
Define conditions and as follows. First, let be elements of and let . By Lemma 4.3 item (3), this definition is independent of the choice of and . Next, for a fixed , choose an arbitrary with and let . Here again the choice of is immaterial.
Let and notice that, since for all in , we also have . We claim that forces to be trivial. Let be a -name for the set of such that , where is the canonical -name for the -generic filter.
Claim 4.6**.**
.
Proof.
Let and be arbitrary. It suffices to find an such that and are compatible. By construction, the sequence consists of pairwise disjoint sets, so for some . This implies that is compatible with , since and . ∎
Claim 4.7**.**
* forces that, for all in , there is a such that and are in .*
Proof.
Fix and such that forces both and to be in . By the definition of , we may assume that extends both and . It then suffices to find a such that , and all have a common extension . By construction, the families and each consist of pairwise disjoint sets. We can therefore find a such that and . By item (2b) of Lemma 3.4, and are aligned, hence by item (1) of Lemma 4.3, the stems in and match whenever their domains intersect. Now apply Lemma 4.1 to and to find a single condition extending all three conditions. This is the condition that we had sought. ∎
Claim 4.8**.**
* forces that, for all in ,*
[TABLE]
for every and .
Proof.
Let be -generic with . Work in . Fix in . By Claim 4.7, we can find such that and are in . This implies that
- •
,
- •
, and
- •
for all and .
The claim follows. ∎
Hence if is -generic with , then we may define a function trivializing as follows. For all , if there is an with , then let for any such . Note that, by Claim 4.8, if , then the value of is independent of our choice of . If there is no such , let (or any other integer). It is then straightforward to verify that does in fact trivialize , thus completing the proof of the theorem. ∎
5. Hechler forcing and
In this section, we prove the case of our Main Theorem, which contains most of the key ideas of the general proof but is significantly less complex. We begin with some preliminary observations.
Suppose that is a -coherent family of functions. Recall that determines a function taking each to the function
[TABLE]
For simplicity, in what follows we write for the difference-function whenever and are clear. Observe that when is 2-coherent, every is finitely supported; in this case, we write for the restriction of to its support.
Recall also that, by the lemmas in Section 2.1, is trivial if and only if there exists a -cofinal family and an alternating family
[TABLE]
of finitely supported functions such that for all
[TABLE]
When the functions in question are from an enumerated sequence in , we will often write in place of , and in place of , and so on. In such cases, due to the fact that all of our families of functions will be alternating, it will suffice to deal only with functions for and for , since these determine the rest of the functions in the relevant families. A similar statement will hold in the general case in Section 6.
Theorem 5.1**.**
Suppose that is a weakly compact cardinal, and let be a finite-support iteration of Hechler forcing of length . Then
Proof.
As in the proof of Theorem 4.5, for all , let be a nice -name for the Hechler real added at the stage of . Much as before, it will suffice to consider 2-coherent families in indexed by pairs of functions from . Therefore fix a condition and a sequence of -names forced by to be a 2-coherent family. We will find a which forces to be trivial.
Let . Again, much as before, for all in , there exists a condition such that and decides the value of to be equal to some . This condition exists because is forced by to be a finitely supported function. Thin out to an unbounded such that equals some fixed for all .
Now apply Lemma 4.3 to to find an unbounded together with sets , , and , a natural number , and stems as in the statement of the lemma. Define conditions , , and as follows. First, for any in let . Next, for each fixed , choose in with and let . Finally, for fixed in , choose a with and let . By item (3) of Lemma 4.3, these definitions are independent of all of our choices.
Let , and note that . We claim that forces to be trivial. This we argue by first partitioning into two disjoint and unbounded subsets, and . Let be a -name for the set of such that , where is the canonical name for the -generic filter. The proofs of the next two claims follow those of Claims 4.6 and 4.7 almost verbatim, so we omit them.
Claim 5.2**.**
**
Claim 5.3**.**
* forces that, for all in , there is a such that and are in .*
Claim 5.4**.**
* forces the following to hold in : Suppose that is in and is such that, for all and all ,*
- •
, and
- •
.
Then there is an in such that, for all and , we have .
Proof.
Fix , , and such that forces and to be as in the premise of the claim. Much as before, we may assume that extends for all and . By construction, for all such and , the sequence consists of pairwise disjoint sets. Hence there exists an such that
[TABLE]
for all and . Observe that, for any , , and , the sets and are aligned (it was to ensure this alignment that we partitioned into the disjoint sets and ). Therefore, by item (2b) of Lemma 3.4, the sets and are aligned, hence by item (1) of Lemma 4.3 the conditions and are compatible, with identical stems wherever their domains intersect. Now apply Lemma 4.1 to and to find a single condition simultaneously extending all of these conditions. This forces to be as desired. ∎
We now turn more directly to the argument that forces to be trivial. Let be a -generic filter with ; work in , and let and be the realizations of and . Since is cofinal in , the family is -cofinal in . Therefore it will suffice to find a family of finitely supported functions such that, for all in ,
[TABLE]
Using Claim 5.3, choose ordinals such that and for all and all . Then, using Claim 5.4, choose ordinals such that and for all , all , and all . Together these choices ensure that and for all and and .
Now for arbitrary elements in let . Since and are both less than or equal to , the domain of is in fact , as desired. We claim that the family so defined witnesses the triviality of .
To see this, let be arbitrary elements of . To simplify notation, let and for , and let . We then have the following series of equations, each of which follows immediately from an expansion of expressions followed by a cancellation of like terms:
[TABLE]
The logic of the labeling is as follows: the operative indices in are and . The operative indices in are , and ; similarly for and . Here we have preferred readable equations to perfectly rigorous ones and have therefore omitted restriction-notations; the essential observation about the domains of the above functions is simply that is a subdomain of every one. This is because for every , , and .
By construction, the restriction of each of the first two terms of , , and to their support is equal to . In consequence, these terms all cancel in the sum , which reduces in turn, via cancellation of the third terms of , , and with the like terms in , to
[TABLE]
We may rewrite this equation as
[TABLE]
This is the relation we had desired; this concludes our proof. ∎
6. Hechler forcing and
In this section, we prove our Main Theorem. We prepare for the proof by first building up some technical machinery, frequently referring back to the proof of Theorem 5.1 for motivation. For the following sequence of definitions, let be a fixed regular uncountable cardinal. Ultimately, of course, will denote the weakly compact cardinal of our main theorem, but that hypothesis is irrelevant to Definitions and Claims 6.1 through 6.6.
Definition 6.1**.**
For any nonempty in , a subset-initial segment of is a sequence such that
- •
and
- •
for all with .
We write to indicate that is a subset-initial segment of . If , then we call a long string or long string for .
Suppose now that is an injective sequence of elements of . Suppose that for each positive integer the family
[TABLE]
is -coherent, where for each such and . Let denote the family . Suppose also that is unbounded and, to each nonempty we have assigned an ordinal in such a way that
- •
if , then and
- •
if , then .
Given a nonempty and a subset-initial segment , write to denote the sequence ; note that this sequence is increasing by assumption.
For of length at least two, let
[TABLE]
When the family is clear from context, it will be omitted from the superscript above. Similarly, we will continue to notationally suppress the restriction of sums of functions to the intersection of their domains. Since each family is -coherent, the function is finitely supported for any of length at least two. We write for the restriction of to its support.
We now record a series of formal equalities. First, for all of length at least three, let
[TABLE]
Observe that when the right-hand side of the above equation is fully expanded, its terms will cancel; is, after all, a composition of differentials. Hence is well-defined and equals [math] for all of length at least three. If is some linear combination of the form
[TABLE]
with all of length at least three then let
[TABLE]
Similarly, if is less than for all then let
[TABLE]
Finally, here dropping the assumption that each has length at least three, for any with for all , let
[TABLE]
where . If , then we will abuse notation and write and instead of and . Finally, if is less than for all then let
[TABLE]
For integers we now recursively define interrelated
- •
expressions parametrized by ,
- •
expressions and parametrized by , and
- •
statements parametrized by .
Again when the family is clear from context it is omitted from superscripts. In fact the above expressions will depend also on the collection fixed earlier, but this dependence is always plain enough that we ignore it, notationally, entirely.
To begin, let
[TABLE]
for each . Recall that we interpret elements of as finite increasing sequences, so, for example, if , then denotes . Next, given with and , if has been defined for all , let
[TABLE]
and let denote the conjunction of the following two statements:
- •
There exists an such that for every long string .
- •
For all nonempty with , we have .
Lastly, let
[TABLE]
Let us pause to connect these definitions with the proof of Theorem 5.1. There was an unbounded subset of . For , we set equal to . Then by deducing equation (11) for an arbitrary , we showed that this assignment of values was as desired. In the language just introduced, equation (11) translates to . Similarly, the expression corresponds to . By the definition of , the condition holds for all ; the relation then followed immediately. The terms in are all of the form , hence . This, in essence, was the deduction that .
The following two lemmas are easily proven by induction, so their proofs are left to the reader.
Lemma 6.2**.**
For all with , all , and all , the expressions , , and are all of the form
[TABLE]
where, for all , we have
- •
,
- •
, and
- •
* is of the form , where*
- –
* and, if , then ,*
- –
if , then ,
- –
* for all , and*
- –
letting , we have , in the case of , and , in the case of or .
The point of this lemma is that, although the expressions defining , , , and are constructed via a recursion referencing , the values of , , and , and the truth values of only ever depend on and not on for any . Hence we may meaningfully employ these expressions to argue as we do that while only referencing a single family at a time. Similarly, since the values of , , and depend on the ordinals but not on for , verifications via these expressions that will never require that any ordinal of longer index ( has yet been defined.
We can say more of than in the previous lemma:
Lemma 6.3**.**
For all with and all , the expression is of the form
[TABLE]
where and for all . Since for all , it follows that .
The following is the main technical lemma regarding these formal expressions. Recall that we often interpret an element has an increasing sequence, so, for example, the expression denotes .
Lemma 6.4**.**
Suppose that , , and holds. Then
[TABLE]
Proof.
We proceed by induction on , in fact establishing the following strengthening of the lemma, which we maintain as an inductive hypothesis:
[TABLE]
Such cancellations will be referred to as cancellations of type (1) and type (2), respectively.
These cancellations could conceivably alter the domain of . We first show that they do not; we show in particular that when holds, the domain of both and is . By Lemma 6.2, every term in each of and is an integer multiple of , where is of the form , where the sequence is as described therein. In particular, for all . The condition then ensures that for all and . It follows that and hence that the domains of and both contain . Since both expressions explicitly include the term , whose domain is , the desired equalities hold.
Now observe that the expression can be rewritten as follows:
[TABLE]
If type (1) and type (2) cancellations reduce the expression on the starred line to zero, then we will have shown while maintaining our inductive hypothesis. This is our goal. We begin with the base case of . This amounts simply to a more careful translation of the end of the proof of Theorem 5.1 into our current terminology.
Since for any fixed and hence , the starred line in this case rearranges to
[TABLE]
The only cancellation above is of type (1).
Fix and and observe that is of the form , with . But then is a long string for and . Hence by there is a fixed such that the restriction of each such term to the common domain is equal to . The starred line thus reduces further to
[TABLE]
as desired. The reduction is evidently by way of cancellations of type (2). This completes the base case.
Now assume that and that the inductive hypothesis holds for . We need two claims.
Claim 6.5**.**
For all ,
[TABLE]
Proof.
Rewrite the sum in the following sequence of steps; each simply consists of an application of the definitions of the expressions under consideration:
[TABLE]
∎
Claim 6.6**.**
For all , the condition implies that
[TABLE]
via cancellations of type (1) and of type (2).
Proof.
By the inductive hypothesis applied to , we know that the terms appearing in but not in pair off in pairs either of type (1), meaning that the pair consists of identical terms with opposite signs, or of type (2), meaning that the pair is of the form \big{(}e(\vec{\alpha}[\vec{\sigma}_{0}]),-e(\vec{\alpha}[\vec{\sigma}_{1}])\big{)}, where and are long strings for .
If such a pair is of type (1), then and also form a type (1) canceling pair in . Notice also that if is a long string for then is a long string for and . Therefore, if \big{(}e(\vec{\alpha}[\vec{\sigma}_{0}]),-e(\vec{\alpha}[\vec{\sigma}_{1}])\big{)} is a type (2) pair of terms from then and . The condition then implies that these terms are equal to some and , respectively, and thus cancel in in a type (2) manner.
The terms of that remain after these cancellations are precisely those of the form , where appears in . Hence . Hence via cancellations of type (1) and of type (2). ∎
By Claims 6.5 and 6.6 the starred line above now reduces to the following:
[TABLE]
Observe that the only cancellation above is of type (1). Now the key observation is that to each with there corresponds a with , and vice versa. Namely, when and then . In the above sum, these each associate to the signs and , respectively. We therefore conclude by rewriting that sum as
[TABLE]
where again all cancellations are of type (1). This completes the induction step. It therefore completes the proof of Lemma 6.4. ∎
We are now ready to prove our main result, which we restate here for convenience.
Main Theorem**.**
Let be a weakly compact cardinal, and let denote a length- finite-support iteration of Hechler forcings. Then
[TABLE]
Proof.
We will show that any -coherent family of functions in is trivial. Since we have already done so for , we will assume in what follows that . For all , let be a nice -name for the Hechler real added at the stage of . As in the and cases, it will suffice to consider -coherent families in indexed by -tuples of functions from . Therefore fix a condition and a family of -names forced by to be an -coherent family of functions. We will find a which forces to be trivial.
Let . Much as before, for all there exists a condition such that and decides the value of to be equal to some . Thin out to an unbounded such that equals some fixed for all .
Now apply Lemma 4.3 to to find an unbounded together with sets , a natural number , and stems as in the statement of the lemma. Next, define conditions as follows: for each in let be an element of such that and let . As usual, by item (3) of Lemma 4.3, these definitions are independent of all of our choices of -tuples . We will sometimes abuse notation and write, for example, instead of .
Let , and note that . We claim that forces to be trivial. This we argue by first partitioning into disjoint and unbounded subsets . Let be a -name for the set of such that , where is the canonical name for the -generic filter. By exactly the same reasoning as in the proofs of Theorem 4.5 and Theorem 5.1,
[TABLE]
Claim 6.7**.**
Fix . The condition forces the following to hold in
Suppose that and are such that
- •
,
- •
* for all ,*
- •
* whenever is a proper subset of ,*
- •
* for all nonempty , and*
- •
for any and subset-initial segment of length , we have . In particular, for all .
Then there exists a sequence of elements of which together with satisfies
- •
* whenever is a proper subset of , and*
- •
for any subset-initial segment of length , we have .
Proof.
Fix an and and an such that forces and to be as in the premise of the claim. In particular, forces that is in for every as in the premise of the claim. As before, we may assume that extends all such . For each and of length , observe that the sequence consists of pairwise disjoint sets. Therefore, we can choose an so that for all of length . This then defines a family of pairwise-aligned sequences , since for any in the intersection of two such and ,
[TABLE]
As before, this implies that the family consists of pairwise compatible conditions, with identical stems wherever their domains intersect. Applying Lemma 4.1 to this collection together with then yields a lower bound for all of these conditions, thereby witnessing the conclusion of the claim. ∎
As in the proof of Theorem 5.1, we will conclude our argument in , where is a -generic filter containing . Let be the realization of and the realization of in . For each nonempty , we will specify an ordinal in such a way that the collection satisfies the following:
- •
for all ,
- •
whenever is a proper subset of ,
- •
for all nonempty , and
- •
for every and every subset-initial segment , we have .
The construction of proceeds via a straightforward recursion on , invoking Claim 6.7.
The -coherent family and collection determine expressions for all and expressions and and statements for all . Note that our choices of , , and the sequence ensure that holds for all .
For each , let . It follows from the definition of and the fact that holds for all that is a finitely-supported function with domain . To show that is trivial, it will suffice to show that
[TABLE]
for all . Fix such a . The above equation is easily seen to be equivalent to the assertion that . By Lemma 6.4 and the fact that holds, . By Lemma 6.3, . In consequence, . This shows equation (12) for an arbitrary hence is trivial. ∎
7. Conclusion
Several natural questions follow immediately from the above results. The first of these is whether the assumption of a weakly compact cardinal is necessary for the conclusion of the Main Theorem. As noted in Remark 1.2 above, this was answered in the negative by the authors together with Michael Hrušák in [6], where they showed that for all after the addition of -many Cohen reals. Closely related is the question of whether a large continuum is necessary for the conclusion of the Main Theorem.
Question 7.1**.**
What is the minimum value of the continuum compatible with the statement ?
By the results of [21], that minimum value is at least . By the aforementioned result in [6], is an upper bound for the answer to Question 7.1.
Our Main Theorem also lends the original, motivating questions a certain renewed charge:
Question 7.2**.**
Is it consistent with the axioms (possibly modulo large cardinal assumptions) that strong homology is additive
- •
on Polish spaces?
- •
on locally compact metric spaces?
- •
on metric spaces?
The extension of the Main Theorem is, of course, a candidate model for an affirmative answer to any of these questions, and indeed, as noted in Remark 1.2, Bannister, Bergfalk, and Moore recently showed in [1] that strong homology is additive on the class of locally compact Polish spaces in . A word is in order here about the machinery of strong homology, which consists first in an assignment of a system of approximations to a given topological space and second in an assignment of a homology group to by way of the system of homology groups of its approximations [22]. Compact metric spaces figure within this framework as particularly tractable: they admit sequential systems of approximations. Indeed, the index-set so central to all our considerations above arose as a countable product (induced by a countable topological sum) of just such a family of height- systems of approximations to -dimensional Hawaiian earrings; the argument of [1] consists largely in correlating a broader class of -indexed inverse systems to strong homology computations for locally compact Polish spaces, and in then showing that the present work’s arguments apply to that broader class. In short, strong homology computations translate the ways that each of the bulleted classes above relate to “simpler” spaces to an associated family of index-sets; Question 7.2 is perhaps largely one of what sorts of combinatorics these index-sets may or may not simultaneously support. Accordingly, the combinatorics of the interrelations among various partial orders may well play some role in its further solution (see, e.g., [31]). Through these interrelations, the vanishing of one system’s higher derived limits may entail the vanishing of others’; Theorem 5.1 of [5] is an example of such a result.
At some broader level, Question 7.2 is asking what sorts of continuities we may compatibly expect of homology functors on categories of topological spaces properly extending , i.e., properly including the category of spaces homotopy equivalent to a CW-complex. For the question on what class of spaces may a homology theory be both strong shape invariant and additive? is at heart a question about the interactions of the inverse and direct limits associated to the first prospective property and the second, respectively. As mentioned, closely related is the question of whether the strong homology groups of a space are the direct limits of the strong homology groups of its compact subspaces; a highly canonical extension of Steenrod homology exists on any class for which the answer is yes. This is the case in [1]; see its introduction and [21] and [22, Chapter 21.5] for further discussion.
Lastly, one of this paper’s referees asked what happens if we replace our iteration of Hechler forcing with the standard length- finite support iteration for forcing Martin’s Axiom () together with . We conjecture that, for all , will hold in as well, but our argument does not directly generalize to prove this, since it makes essential use of the fact that Hechler forcing is -centered (in particular, any finitely many conditions with the same stem have a common lower bound). This is evident in Lemmas 4.1 and 4.3(1), which are then used in the proof of Claim 6.7. There are straightforward generalizations of Lemmas 4.1 and 4.3 to arbitrary length- finite support iterations of -centered forcings of size . (In this more general context, if is a -centered poset and , then , the stem of , is interpreted as the unique such that , where is a fixed partition of the underlying set of into centered subsets.) With this in mind, our proof adapts to show that, if is weakly compact and is the standard length- finite support iteration for forcing , then for all . The proof proceeds by considering -coherent families indexed by -tuples of the generic reals , where is an unbounded subset of such that, for each , the iterand of is a -name for Hechler forcing and is a name for the corresponding Hechler real. We therefore close with the question of the full form of Martin’s Axiom, and with thanks to the referee for asking it:
Question 7.3**.**
Suppose that is a weakly compact cardinal and that is the standard length- finite support iteration for forcing . Is it the case that, in , for all ?
Acknowledgements. This work began with a visit by Chris Lambie-Hanson to UNAM Morelia. The authors would like to thank both the institutions VCU and UNAM for their support for this visit. More particularly, many of this paper’s most fundamental impulses are due to Michael Hrušák and grew out of conversations with him both before and during Chris’s visit; the authors would like to thank him very especially. Jeffrey Bergfalk would like to thank Justin Moore and Jim West as well for much patient and formative instruction in the subject-matter of this paper. The authors would also like to thank Stevo Todorcevic for encouraging them to reduce their large-cardinal assumption from a measurable to a weakly compact, and for his several suggestions for how to do so. Finally, they would like to thank both referees for their extremely thorough and thoughtful readings, comments, and questions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Nathaniel Bannister, Jeffrey Bergfalk, and Justin Tatch Moore, On the additivity of strong homology for locally compact separable metric spaces , (2020), Preprint, https://arxiv.org/abs/2008.13089.
- 2[2] M. G. Barratt and John Milnor, An example of anomalous singular homology , Proc. Amer. Math. Soc. 13 (1962), 293–297. MR 137110
- 3[3] James E. Baumgartner, Iterated forcing , Surveys in set theory, London Math. Soc. Lecture Note Ser., vol. 87, Cambridge Univ. Press, Cambridge, 1983, pp. 1–59. MR 823775
- 4[4] J. Bergfalk, M. Hrušák, and S. Shelah, Ramsey theory for highly connected monochromatic subgraphs , Acta Math. Hungar. 163 (2021), no. 1, 309–322. MR 4217971
- 5[5] Jeffrey Bergfalk, Strong homology, derived limits, and set theory , Fund. Math. 236 (2017), no. 1, 71–82. MR 3577392
- 6[6] Jeffrey Bergfalk, Michael Hrušák, and Chris Lambie-Hanson, Simultaneously vanishing higher derived limits without large cardinals , (2021), Preprint, https://arxiv.org/abs/2102.06699.
- 7[7] Jeffrey Bergfalk and Chris Lambie-Hanson, The cohomology of the ordinals I: Basic theory and consistency results , (2019), Preprint, https://arxiv.org/abs/1902.02736.
- 8[8] Dustin Clausen and Peter Scholze, Personal communication , July 2019.
