Splitting chains, tunnels and twisted sums
F\'elix Cabello S\'anchez, Antonio Avil\'es, Piotr Borodulin-Nadzieja,, David Chodounsk\'y, Osvaldo Guzm\'an

TL;DR
This paper investigates splitting chains in set theory and their independence from ZFC axioms, demonstrating their applications in constructing special Banach spaces and exploring their topological counterparts called tunnels.
Contribution
It establishes the independence of splitting chains from ZFC and introduces their use in constructing twisted sums of Banach spaces and in topological tunnel concepts.
Findings
Existence of splitting chains is independent of ZFC.
Splitting chains can be used to construct twisted sums of Banach spaces.
Introduction of tunnels as topological analogs of splitting chains.
Abstract
We study splitting chains in , that is, families of subsets of which are linearly ordered by and which are splitting. We prove that their existence is independent of axioms of . We show that they can be used to construct certain peculiar Banach spaces: twisted sums of and . Also, we consider splitting chains in a topological setting, where they give rise to the so called tunnels.
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.
Taxonomy
TopicsAdvanced Topology and Set Theory · Homotopy and Cohomology in Algebraic Topology · Advanced Operator Algebra Research
Splitting chains, tunnels and twisted sums
Félix Cabello Sánchez
Departamento de Matemáticas and IMUEx, Universidad de Extremadura, 06071 Badajoz (Spain)
,
Antonio Avilés
Departamento de Matemáticas, Universidad de Murcia, 30100 Murcia (Spain)
,
Piotr Borodulin-Nadzieja
Instytut Matematyczny, Uniwersytet Wrocławski, Wrocław (Poland)
,
David Chodounský
Institute of Mathematics of the Czech Academy of Sciences, Praha 1 (Czech Republic)
and
Osvaldo Guzmán
University of Toronto, Toronto (Canada)
(Date: July 22, 2019)
Abstract.
We study splitting chains in , that is, families of subsets of which are linearly ordered by and which are splitting. We prove that their existence is independent of axioms of . We show that they can be used to construct certain peculiar Banach spaces: twisted sums of and . Also, we consider splitting chains in a topological setting, where they give rise to the so called tunnels.
Key words and phrases:
twisted sums of Banach spaces, short exact sequences of Banach spaces, splitting families, tight gaps, complete tunnels, Aronszajn trees, Cohen forcing
2010 Mathematics Subject Classification:
03E17,03E75,46B25,46E15,54A35
AA was supported by projects MTM2017-86182-P (AEI, Government of Spain and ERDF, EU) and 20797/PI/18 by Fundación Séneca, ACyT Región de Murcia. PBN was supported by Polish National Science Center grant no 2018/29/B/ST1/00223. He is also indebted to Universidad de Murcia for financing his stay in Murcia, during which AA introduced him to the concept of splitting chains. FCS was supported in part by DGICYT project MTM2016-76958-C2-1-P (Spain) and Junta de Extremadura program IB-16056. DCh was supported by the GACR project 17-33849L and RVO: 67985840. OG was supported by NSERC grant number 455916.
1. Introduction
We say that a compact space has a tunnel, if there is a continuous mapping , where is a linearly ordered topological space, such that is nowhere dense in for each . This notion was introduced by Nyikos in [Nyi88] (under the name of a complete tunnel). Although it may seem like the spaces with tunnels should resemble in a sense linearly ordered topological spaces, in fact the property of possessing a tunnel is quite widespread among compact spaces without isolated points. Actually, it is not easy to find a compact space without isolated points which does not have a tunnel.
In this article we are going to study the notion of tunnel and some of its variations in the context of infinitary combinatorics, topology and homological Banach space theory.
We will be mostly interested in the question if (that is , the remainder of the Čech-Stone compactification of ) has a tunnel. This question is interesting in all the settings mentioned above. In particular, it is connected to the existence of certain peculiar family of subsets of . A family of subsets of the set of natural numbers is called splitting if for every infinite set there exists such that both and are infinite. Splitting families are well studied objects in set theory, specially in connection with the important cardinal , the least cardinality of such a family. In this paper we are interested in splitting families which are moreover chains in the almost inclusion order, that is, with the extra property that if , then either or is finite. Nyikos proved several results about existence of splitting chains in various models of set theory: he showed e.g. that implies that there are no splitting chains whereas. In this article we partially follow Nyikos’ path (although most of the results we proved before we have discovered Nyikos’ work), reproving some of his theorems and proving that splitting chains do exist in the standard Cohen model (Nyikos announced that the proof of that result would appear in a later paper that, however, was never published). Also, we show that the existence of a splitting chain is compatible with the assumption that .
Our initial motivation for the study of tunnels and splitting chains stems from their uses in the construction and analysis of certain “twisted sums” of Banach spaces. Let us recall that a short exact sequence of Banach spaces is a diagram of Banach spaces and (linear, continuous) operators
[TABLE]
in which the kernel of each arrow agrees with the range of the preceding one. The middle space is often called a “twisted sum” of and … in that order! One says that such an exact sequence is trivial (or that it splits, but we prefer to avoid this terminology in this paper) if the mapping admits an inverse (see Section 3 for the precise definition) in which case the twisted sum space is “well isomorphic” to the direct sum .
Questions about whether a Banach space contains a copy of some classical Banach space (or it does not) are central in Banach space theory (recall, e.g., the celebrated Rosenthal’s theorem [Ros74], or Bessaga-Pełczyński theorem characterizing Banach spaces containing a copy of , [BP58]).
We may ask about how a subspace is situated in considering also the quotient space and the exact sequence
[TABLE]
where is the inclusion and is the natural quotient map. In this context, is complemented in if and only if (2) is trivial; if the sequence is not trivial, then lies in in a non-trivial way and is kind of an alloy of and , but not a trivial one. Determining for which Banach spaces and one can construct a nontrivial sequence (1) is a fundamental question in the homological theory of Banach spaces (see the monograph [CG97] for a general account; the approaches of the more recent papers [ACSC*+*13], [CSCKY03], [MP18] are more akin to ours).
As we shall see, each tunnel of induces an exact sequence of the form
[TABLE]
which is nontrivial if the tunnel has some additional properties, for instance, when it is made of regular open sets. Here, and throughout the paper, denotes the Banach space of all continuous functions with the sup norm. Also, if is a set, then denotes the space of all functions such that, for every , the set is finite, again with the sup norm.
The most interesting case is, by far, when is the Čech-Stone remainder of the natural numbers. Our main result in this line is that if there is a splitting chain of clopens in , then a nontrivial exact sequence
[TABLE]
exists; see Theorem 3.7. Twisted sums of the form
[TABLE]
were constructed first by Amir [Ami64] and later by Avilés and Todorcevic [AT11], but not much is specified in these constructions about the structure of . Amir’s construction is described in [ACSC*+*16, Section 2.5, Proposition 2.43]. More recently, the authors of [ACSC*+*17] constructed a twisted sum like (3) under . As we have mentioned above, we are able to prove the existence of splitting chains of clopens in under several other assumptions, and so by Theorem 3.7 we get new examples of twisted sums of the form (3).
The paper is organized as follows: In Section 2 we study the notion of tunnels and splitting chains in the more general context of topological spaces. Section 3 relates tunnels and splitting chains with twisted sums of Banach spaces, and finally in Section 4 we prove the consistency results concerning the existence of splitting chains in .
2. Tunnels and splitting chains of open sets
We assume that all topological spaces are Hausdorff. Let , be open in a topological space . By we will denote the relation . The relation “” defined by
[TABLE]
is a partial order on the topology of .
Definition 2.1**.**
We say that a family of open subsets of is a chain (of open sets) if it is linearly ordered by .
Definition 2.2**.**
A chain of open subsets of is a tunnel if the set is dense in .
Clearly, no space with an isolated point can have a tunnel. However, the property of having a tunnel is quite common among spaces without isolated points. We will begin with some easy examples.
Example 2.3*.*
The family of all open balls with fixed center forms a tunnel in Euclidean spaces. More generally if is a metric space with a point such that for each
[TABLE]
then the family is a tunnel. Consequently, normed spaces have tunnels.
Less obvious examples of spaces with tunnels are given by the following proposition.
Proposition 2.4**.**
If is a separable normal space without isolated points, then has a countable tunnel.
Proof.
First, notice that if are open subsets of and , then there is an open such that and . Indeed, use normality to find an open neighbourhood of such that . Since is not an isolated point, . Now, again by normality, there is such that and . The set is as desired.
Let be a dense subset of . Using the above remark it is easy to construct inductively a chain of open sets such that . Of course is a tunnel. ∎
Corollary 2.5**.**
Every compact metrizable space without isolated points has a countable tunnel.
Remark 2.6*.*
A study of tunnels in metric spaces was undertaken by Maciej Niewczas in [Nie17]. Witold Marciszewski proved that the assumption on compactness is obsolete and in fact every metrizable space without isolated points has a countable tunnel, using the fact that every metric space has a -discrete base.
Proposition 2.7**.**
If has a tunnel and is a topological space, then has a tunnel.
Proof.
Let be a tunnel in . It is easy to verify that is a tunnel in . ∎
Corollary 2.8**.**
The space has a countable tunnel for each infinite .
Proof.
and has a tunnel, according to Proposition 2.4. ∎
We say that splits if both and are nonempty. A family of subsets of is splitting if every nonempty open subset of is split by some member of . It will be convenient to notice that splitting families which form chains of open sets satisfy a slightly stronger splitting property.
Lemma 2.9**.**
If is a splitting chain, then for each nonempty open there is such that and .
Proof.
Let be a nonempty open set. Consider which splits and then which splits . We have because is impossible. Clearly, and . ∎
The proof of the following simple fact is left to the reader.
Proposition 2.10**.**
Every tunnel is a splitting chain.
Of course not every splitting chain is a tunnel, but in compact spaces each splitting chain can be used to produce a tunnel.
Proposition 2.11**.**
Assume that is a splitting chain in a compact space . Then
[TABLE]
forms a tunnel in . Moreover, has the following properties:
- (1)
if , then ; 2. (2)
if , then there is such that .
Proof.
First, we will show that is a chain. Let , be distinct elements of and let , , where and are subfamilies of without maximal elements. Without loss of generality, we may assume that there is such that for each and so . Since is not maximal in , there is . Hence and so . So, is a chain.
Now let be a nonempty open subset of and let be a nonempty open set such that (since admits a splitting chain, it cannot have an isolated point, so there is such ). Using Lemma 2.9 we can recursively find a sequence of elements of such that and splits for every . Then . By compactness, there is
[TABLE]
But this means that and so .
It is straightforward to check that has properties (1) and (2). ∎
A variant of the above proposition in which we take only countable unions will be important for us later:
Proposition 2.12**.**
Assume that is a splitting chain in a compact space . Then
[TABLE]
forms a tunnel in .
Proof.
Just the same proof as the previous proposition. ∎
Remark 2.13*.*
Thanks to Proposition 2.11 to show that a compact zerodimensional space has a tunnel it is enough to find a family of clopens which is linearly ordered by and which is splitting (although, the tunnel produced according to the recipe from Proposition 2.11 does not contain any element of ). It is however unclear for us if the existence of a tunnel in a compact zerodimensional space implies the existence of such chain of clopens.
Theorem 2.14**.**
Let be a compact space. The following are equivalent:
- (a)
* has a tunnel.*
- (b)
* has a splitting chain of open sets.*
- (c)
There is a continuous mapping , where is a linearly ordered space, whose fibers are nowhere dense (i.e. is nowhere dense for each ).
Proof.
The equivalence of (a) and (b) follows from Proposition 2.11 and Proposition 2.10.
(b)(c) Assume that is a tunnel in . We may immediately assume that it has properties (1) and (2) of Proposition 2.11. Now, equip with the order topology with respect to “”. Define by
[TABLE]
Assume that and and notice that . In order to verify the continuity of we will show that has an open neighbourhood contained in . First, notice that for each we have . Therefore, if , then . Second, if , and , then . Now, let be such that and notice that . Then, using the above remarks, we have
[TABLE]
(c)(b) Suppose is a mapping with the desired properties. For by we will denote the set , where is the linear ordering compatible with the topology of . We will understand in the similar way. For let
[TABLE]
We claim that is a splitting chain of open sets. First, we will check that it is a chain. Let . Then, by continuity of ,
[TABLE]
To show that is splitting, consider a nonempty open set and notice that, by the assumption on , we can find in . Then splits . ∎
Remark 2.15*.*
In [Nyi88] Nyikos introduced the notion of complete tunnel. A chain of open subsets of is a complete tunnel if for every we have
[TABLE]
Nyikos proved ([Nyi88, Theorem 1.5]) that being a complete tunnel is equivalent to (c) of Theorem 2.14 and so it is equivalent, at least in the realm of compact spaces, to being a tunnel in our sense.
Corollary 2.16**.**
Let be a compact space without an isolated point and let be linearly ordered and metrizable. Assume that there is a continuous mapping with nowhere dense fibers. Then has a countable splitting chain of -open sets.
Proof.
Let be a countable dense subset of and let , where . That is splitting can be proved in the same way as in proof of Theorem 2.14, (c) (b). ∎
Recall that an interval algebra is a Boolean algebra generated by a chain. The Stone space of an interval algebra is linearly ordered (and the Boolean algebra of clopens of a linearly ordered zerodimensional compact space forms an interval algebra).
Corollary 2.17**.**
If is a Boolean algebra which contains an interval subalgebra which splits nonempty elements of , then the Stone space of has a tunnel.
Proof.
Let , be the Stone spaces of , respectively. Then there is a canonical continuous surjection , where is a linearly ordered space. If is a clopen subset of , then it is split by some . So, if and , then and so has nowhere dense fibers. ∎
Recall that a measure on a compact space is strictly positive if for each nonempty open set . A measure is atomless if for every . If is zerodimensional, then is atomless if and only if for every there is a partition of into clopen sets of measure at most .
Proposition 2.18**.**
Every compact zerodimensional space supporting a strictly positive atomless probability measure has a tunnel.
Proof.
Assume supports such a measure . It is enough to construct a chain of clopen subsets of such that is dense in . Indeed, suppose that has this property and is a nonempty clopen subset of . Then . Let and consider such that . Then because . If , then contains and all the such that , so we would have . We conclude that splits . Now we can use Theorem 2.14.
One can construct inductively subsequently using the following remark. Assume is non-empty clopen subsets of . Then, by non-atomicity of , there is a clopen set such that and . ∎
2.1. Spaces without tunnels
After so many examples of spaces having tunnels, we have to face the natural question: are there compact spaces without isolated points and without tunnels?
Recall that a compact space is Corson compact if it can be embedded into
[TABLE]
for some .
Lemma 2.19**.**
If is Corson compact and has a splitting chain, then has a countable splitting chain of open sets.
Proof.
According to Theorem 2.14, we have a continuous mapping with nowhere dense fibers onto a linearly ordered compact space. By [Ark92, IV.3.15], is a Corson compact space. But every linearly ordered Corson compact space is metrizable [Ev78], so we can use Corollary 2.16. ∎
Recall than an Aronszajn tree is an uncountable tree without an uncountable level and without an uncountable branch. Notice that Aronszajn trees are of height . We will say that a Boolean algebra is Aronszajn if it is generated by an Aronszajn tree , in the sense that there is a set of generators of such that when and when and are incomparable.
Theorem 2.20**.**
Stone spaces of Aronszajn algebras do not have tunnels.
Proof.
Let be an Aronszajn tree and let be the Boolean algebra generated by . Let be the Stone space of . Notice that is Corson compact. Indeed, let be given by if and only if . It is plain to check that is a continuous embedding. Moreover, there is no of an uncountable support (since then would contain an uncountable branch). If has a tunnel, then according to Lemma 2.19, has a countable splitting chain of open sets. Since each open set in is , it is a countable union of clopen sets, and there is a countable ordinal such that each element of is in the algebra generated by the elements with of height less than . Consider now of height greater than . Then is not split by any element of height less than (each of height less than either contains or is disjoint from ). Hence is not split by any element of , a contradiction. ∎
We finish with a remark which indicates that seeking for a compact space without tunnels (and isolated points) we should rather focus on spaces with many disjoint open sets. Recall that a topological space is ccc if it does not contain an uncountable family of nonempty open subsets.
Proposition 2.21**.**
Suslin Hypothesis is equivalent to the assertion that every ccc compact zerodimensional space without isolated points has a tunnel.
Proof.
() Suppose that is a ccc compact zerodimensional space without isolated points. Using Zorn’s lemma, we can find a maximal family of clopen sets of the form such that is a tree, when and when and are incomparable. The algebra generated by this tree is countable, and is therefore an interval algebra. By Corollary 2.17, it is enough to check that the elements split all clopen subsets of . So take a nonempty clopen set in that is not split by that family. Since we have no isolated points, we find two disjoint nonempty clopens . Notice that because they split . The family would be a larger tree family, in contradiction with maximality.
() Let be a Suslin tree, and let be the set of all (maximal) branches of . For every , let , and let be the algebra of subsets of generated by the . Since Suslin trees are Aronszajn, we can use Theorem 2.20. It remains to show that is ccc. For this, notice that every nonempty element of contains nonempty element with atomic formula . If we take a high enough node in a branch that belongs to , then . All this means that if there is an uncountable pairwise disjoint family in , then there is one made of elements of the form , and that would give an uncountable family of pairwise incompatible elements of , that contradicts that is Suslin. ∎
2.2. Ultraproducts of tunnels
We assume some familiarity with the Banach space ultraproduct construction, as presented in [ACSC*+*16, Chapter 4], [Ste78] or [HI02]. Let be a family of compact spaces indexed by and let be a countably incomplete ultrafilter on . Then the Banach space ultraproduct is a Banach algebra under the product
[TABLE]
By general representation results, this algebra is isometrically isomorphic to one of the form for some compact space which is called the topological ultracoproduct of the family following and is denoted by . If all the coincide we speak of the ultracopower, instead.
Proposition 2.22**.**
With the preceding notations, if each has a tunnel, then so does.
Proof.
We need to translate our topological notions from to the algebra . The basic idea is that each open subset of gives rise to a closed ideal just taking
[TABLE]
and, conversely, all closed ideals of have this form. On the other hand, the condition is equivalent to the class of being the unit of the quotient algebra .
Thus, the fact that and are open subsets of with , which is obviously equivalent to the existence of such that and can be stated as:
- •
There is such that for all and whose class is the unit of .
Now assume that each has a tunnel . We construct a family of open sets of as follows. For each we pick , then we consider the corresponding ideal and form the ultraproduct . Quite clearly, is a closed ideal in and, by the preceding remarks, this ideal determines a certain open set of . Let us check that the family of open sets of obtained in this way forms a tunnel.
First, we prove that they form a chain. Take two families , with and let and be the corresponding subsets of . We partition into three subsets as follows:
- •
;
- •
;
- •
.
Then exactly one of these sets belongs to . If belongs to , then . Now assume belongs to and let us prove that . For each , take a continuous such that and . If , set . Let us take a look at . It is clear that the class of in
[TABLE]
is the unit of the quotient algebra. On the other hand, if is a bounded family such that for all , then since at least for . This shows that . Finally, if , then .
To complete the proof we need to manage some points of , that is, some “nice” maximal ideals of .
Let be a family such that for each . Then we can define a unital homomorphism by the formula
[TABLE]
The definition makes sense and, moreover, two families and induce the same homomorphism if and only if they represent the same element in the set-theoretic ultraproduct , that is, when the set belongs to . If we agree to denote by the “point” of associated to (5) (as in the Gelfands representation theorem, see e.g. [AK16, Theorem 4.2.1]), then we have an injective mapping . This mapping is known to have dense range. We need a slightly stronger fact:
Claim. If, for each , the set is dense in , then every nonempty zero set of meets . In particular, is dense in .
Proof of the Claim.
The second assertion clearly follows from the first one since, by the very definition, is a completely regular space.
So, let us check the first statement. The hypothesis that is countably incomplete is used as follows: there is a function such that along . Now, take a non-negative, continuous with . Write , with in and put
[TABLE]
Note that along since otherwise would be invertible. Take as before and, for each , choose so that . Then vanishes on the point and the Claim is proved. ∎
The proof will be complete if we show that if for each index the set is open in and , then , where is the open set of attached to the family – that is, to the ideal .
To do this we add two new entries to our basic dictionary: suppose is an open set in a compactum and that . Then:
- •
is equivalent to the statement “for every one has ”.
- •
is equivalent to the statement “for such that there is such that ”.
Now, if are as before, then . Since every can be written as , with , we have
[TABLE]
so, certainly, .
Finally, we check that . We first remark that contains every point of the form with for all (think of functions such that and ). Now, if is a continuous function on such that , then writing and recalling that we can pick such that , so , so . ∎
We now give the application that motivated our interest in ultracoproducts. We need some basic facts from model theory in the context of Banach spaces. The reader can take a look to [Ste78] or [HI02] for the general background and to [Ban77] for a more topological approach.
Following the uses in model theory, let us say that two compact spaces and are co-elementarily equivalent if there are ultrafilters and such that and are homeomorphic, equivalently, the Banach algebras and are isomorphic. This happens if and only if the underlying Banach spaces and are (linearly) isometric. This roughly means that the base Banach spaces and “approximately” satisfy the same positive bounded sentences (in a suitable signature); see [HI02, Chapter 5].
Thus, the following result explains in part why it is so difficult to find compacta (without isolated points) having no tunnel.
Proposition 2.23**.**
Let be a compact space. The following conditions are equivalent:
- (a)
* has no isolated points.*
- (b)
There is an ultrafilter (on some index set) for which the ultracopower has a tunnel.
- (c)
* is co-elementarily equivalent to a compactum having a tunnel.*
Proof.
We first remark that the property of (not) having isolated point is preserved under co-elementary equivalence. This is implied by the following two facts:
- •
A compact space has an isolated point if and only if the algebra has a “minimal idempotent”: a non-zero such that with the property that if , then for some .
- •
Every idempotent in can be written as , where is an idempotent of .
We thus have (c)(a). Next, we prove (a)(b). The key fact is that every compactum is co-elementarily equivalent to some metrizable compact space. This follows from the Banach space version of the (“downward”) Löwenheim–Skolem theorem; see [Ste78, Theorem 2.2] or [HI02, 9.13 Proposition]. Suppose has no isolated points and let be a metrizable compactum such that and are homeomorphic, where and are ultrafilters on suitably chosen sets of indices. By the preceding remark, neither nor have isolated points. By Corollary 2.5, has a tunnel and so and have, by Proposition 2.22.
(b)(c) Each compact space is co-elementarily equivalent to its ultracopowers, by the Banach space version of the Keisler–Shelah (“ultrapower”) theorem; see [Ste78, Theorem 2.1] or [HI02, 10.7 Theorem]. ∎
3. Twisted sums
Recall that a short exact sequence is a diagram of Banach spaces and (linear, bounded) operators
[TABLE]
in which the kernel of each arrow agrees with the range of the preceding one. We say that a short exact sequence is trivial if there is an operator such that (or, equivalently, there is an operator such that ). Note that (6) is trivial if and only if is a complemented subspace of . In this case the space is linearly homeomorphic to the direct sum . Simple examples show that the converse is not true.
The space can be viewed as a subspace (or a subalgebra) of , the Banach algebra of all bounded functions , again with the supremum norm.
Given a family of subsets of , we define an intermediate space as the Banach space generated by and by the characteristic functions of the sets in . This produces a short exact sequence
[TABLE]
in which is the inclusion map and is the natural quotient map. This was the approach followed by Amir [Ami64]. For this sequence to provide a relevant example, we must ensure that it is not trivial, and we must identify what the quotient is. Lemmas 3.1 and 3.3 will deal with these issues.
Recall that the oscillation of a function at a point is defined by
[TABLE]
where runs over the neighborhoods of in . The oscillation of an arbitrary function on is the number .
Lemma 3.1**.**
Let be a family of subsets of . If the boundaries of sets in are all nonempty and pairwise disjoint, then the quotient space is isometric to .
Proof.
The equivalence classes of the characteristic functions for generate the quotient space . We check that these vectors are isometric to the basis of multiplied by . That is, we want to show that
[TABLE]
whenever and . The norm of (the class of) a function in the quotient space by is the distance of to , which by a classical result in topology (see e.g. [BL00, Proposition 1.18]) equals half of the oscillation of , so
[TABLE]
A characteristic function has oscillation 1 at every point of while it is continuous (oscillation 0) out of . Since the sets of have disjoint nonempty boundaries, a linear combination has oscillation on and oscillation 0 out of these boundaries. From this, equation (8) follows. ∎
We now describe a derivation procedure induced by that will help in proving that the short exact sequence (7) is not trivial. This is based on an idea of Ditor [Dit73]. Suppose again that the subsets of have disjoint boundaries.
Definition 3.2**.**
Given , we define as the set of those for which the following is true: If and is a neighborhood of , then there are , both different from , such that and .
For every we recursively define , starting from . Recall that if is a subspace of a Banach space , then by a linear lifting of the quotient map we understand a (not necessarily bounded) linear right-inverse of . The quotient map admits a bounded linear lifting if and only if is complemented in , the map being a bounded projection of onto .
Lemma 3.3**.**
Let be a family of subsets of with nonempty pairwise disjoint boundaries. Let . If , then the norm of any linear lifting for the quotient map is at least . Therefore, if for every , then is uncomplemented in .
Proof.
We will first prove the following claim.
Claim. Let be any family in such that for every . Suppose and fix any . Then there are different sets and signs such that
[TABLE]
To obtain this we will prove by induction on that there are different sets , signs , and a point
[TABLE]
such that
[TABLE]
First we deal with the case . Pick any and let be the set from whose boundary contains . Consider the neighborhood of ,
[TABLE]
Using Definition 3.2, we can find and that do not belong to . We have two cases:
- •
If , then and we take and .
- •
If , then and we take and .
Let us check the induction step. Suppose one has found for and satisfying (10) and (11). The point does not belong to any border by (10), each function is continuous at , and hence also each function is continuous at . Since is continuous at we can find a neighborhood of disjoint from and such that the value of at any point of differs from at most by . Let be the set of whose boundary contains . Shrinking if necessary, we may also assume that
[TABLE]
According to Definition 3.2 there are different from such that
[TABLE]
[TABLE]
If , then we take and any element in the set (12), and we get
[TABLE]
The other case is that . Then we take and in the set (13) and we get
[TABLE]
This finishes the proof of the claim.
If is a linear lifting for the quotient map , then the functions satisfy that . Therefore (9) holds for some and , and hence
[TABLE]
Since this holds for arbitrary we conclude that . ∎
Corollary 3.4**.**
Let be a family of subsets of with nonempty pairwise disjoint boundaries such that
[TABLE]
for all . Then the exact sequence
[TABLE]
is not trivial.
Recall that an open set is said to be regular if it is the interior of its closure, or equivalently if .
Definition 3.5**.**
A regular tunnel is one made of regular open sets.
Theorem 3.6**.**
If has a regular tunnel of cardinality , then there exists nontrivial exact sequence
[TABLE]
Proof.
We can suppose that the tunnel is nontrivial, in the sense that all borders are nonempty. We have to prove that such a tunnel satisfies the hypotheses of Corollary 3.4. Fix , and , and a neighborhood of . Since , we have that is a nonempty open set, so by the definition of tunnel there exists such that . On the other hand, since is a regular tunnel, , therefore , and again there exists such that . ∎
Now we are ready to prove the theorem announced in the Introduction.
Theorem 3.7**.**
If there is a splitting chain of clopen sets in , then there is a nontrivial exact sequence
[TABLE]
Proof.
The Čech-Stone remainder has the property that every open -set is regular (this is a consequence of the fact that every nonempty closed set has nonempty interior). Thus, if is a splitting chain of clopen subsets of , the countable increasing unions form a tunnel (by Proposition 2.12) which is moreover regular. Its cardinality is . ∎
As we will see in the next section, splitting chains of clopen sets do exist in under some assumptions, e.g., under or in the classical Cohen model, but one cannot prove their existence in . We do not know if twisted sums like in Theorem 3.7 exist in .
In [ACSC*+*17], a twisted sum as above was constructed under . It was used to produce a further nontrivial twisted sum
[TABLE]
We do not know if such a sequence exists in any axiomatic setting other than . The note [ACSC*+*17] pointed out that a statement made in [ACSC*+*13] that all exact sequences like (15) are trivial was incorrect. It is also unknown if there are nontrivial sequences
[TABLE]
with of density less than . It cannot be taken separable because is “separably injective”; see [ACSC*+*16, Section 2.5] for this issue. We remark that if (1) is nontrivial, then so is the “expanded” sequence
[TABLE]
where, as one can guess, and , whichever is the space . In particular, any reduction of the size of on the right side of our exact sequences would be an improvement of our statements.
We finish this section with some results relating tunnel-like conditions with the existence of twisted sums in settings different than that of .
Proposition 3.8**.**
Suppose that there exists a continuous surjection , where is a linearly ordered space, and a set such that
[TABLE]
for every . Then there is a nontrivial sequence
[TABLE]
Proof.
For , put and then consider the family . Notice that by the assumption and by continuity of . Thus, and we can apply Corollary 3.4. ∎
Proposition 3.8 unifies a number of earlier constructions of twisted sums with -spaces. Indeed, if we take with the usual order, the identity, and is the set of dyadic rationals, one gets the Foiaş–Singer sequence in [FS65, Theorems 3 and 4], in which the space corresponds to “our” . Analogously, taking as the Cantor set with the “lexicographical” order, the identity, and is the subset of sequences with finitely many ones, one obtains the exact sequence used in [ACSC*+*17].
Finally, a nontrivial sequence of the form
[TABLE]
(see [CSCKY03, Section 4]) can be obtained from Lemma 3.3 as follows. We need the following representation of . We consider a reversed, signed version of Schreier family:
[TABLE]
We put on the lexicographical order, declaring if , where is the first index such that . The line is compact in the order topology. This is because the order is complete: every subset has an infimum and a supremum. Moreover, is countable, hence scattered. The derivatives can be checked to be the sets
[TABLE]
Thus, has height and is a singleton, so is homeomorphic to the ordinal interval .
Now, for , put and define . Then if we have and by the peculiarities of the ordering we have for all and Lemma 3.3 shows that the sequence
[TABLE]
is not trivial.
4. Splitting chains in
A set splits if . We say that a family is splitting if for each there is splitting . Clearly, has a splitting chain of clopens if and only if there is a family which is splitting and which forms a -chain. We will call such a splitting chain. Consequently, if there is a splitting chain in , then has a tunnel. It is unclear if this implication can be reversed (see Remark 2.13).
In this section we will consider the question of the existence of splitting chains.
We will begin with the easy observation that the existence of a splitting chain is consistent with . Recall that is a pre-gap if both and are lienarly ordered by , and for each and . We will assume that both and are nonempty. If is such that and for each and , then we say that interpolates . If there is no interpolating , then we say that is a gap.
Proposition 4.1**.**
(See [Nyi88, Theorem 2.4].) implies that there is a splitting chain.
Proof.
Enumerate . We will construct the desired chain inductively. Let and suppose that we have constructed for each in such a way that for each and is split by an element of for . If is split by , then put . Otherwise, let and and notice that . Since there are no -gaps, there is an infinite such that for each and . Fix any splitting . If splits then let . If , then let . Finally, if , then let .
If is a limit ordinal, then let . ∎
We say that is a cut in a -chain if it is a pre-gap, and there is no element of interpolating it. In other words, if , then either for some or for some .
We call a pre-gap tight if for each infinite such that for each , there is such that . We say that spreads a pre-gap if and for each , . In other words, spreads a pre-gap if and only if it witnesses that is not tight. We say that a cut in a chain is tight if it is tight as a pre-gap.
Proposition 4.2**.**
A -chain is splitting if and only if every cut in is tight.
Proof.
Assume that is a cut in which is not tight. It means that there is an infinite such that and for each , . If , then either for some or for some . In both cases does not split .
If an infinite is not split by , then let and . It is easy to verify that is a cut in and witnesses that it is not tight. ∎
We say that a pre-gap is of type if is of cofinality and is of coinitiality (with respect to the order).
Theorem 4.3** ([NV83]).**
There is a -tight pre-gap if and only if .
The above result indicates that it is quite difficult to construct a splitting chain in general. It is not completely trivial to obtain a single tight pre-gap, and a splitting chain has to look like a tight pre-gap everywhere. Also, Theorem 4.3 suggests a strategy to prove that consistently there are no splitting chains. We have to find a model in which but for some reasons every chain has to have a cut being an -gap. As we will see such a reason can be provided by Proper Forcing Axiom. The following theorem was proved by Nyikos in [Nyi88].
Theorem 4.4**.**
Assume holds, and there are no -gaps. Then there is no splitting chain.
Proof.
Assume is a -chain of infinite subsets of and assume that . If is splitting, then we can find an increasing sequence of elements of . implies that if for some , then there is such that for each . Using this remark one can construct inductively a -decreasing sequence of elements of such that forms a gap. Indeed, assume that and suppose that is not a gap. Then there is interpolating it. Using, the above remark, we can find such that for each . There is splitting . Clearly, has to interpolate and thus, we can proceed with the construction.
Now, by our assumption . By Theorem 4.3 cannot be tight. Thus, there is such that and for every . So, is not split by . ∎
Corollary 4.5**.**
* implies that there is no splitting chain.*
Proof.
implies that the assumptions of Theorem 4.4 are satisfied, see e.g. [Tod89, Theorem 8.6]. ∎
Remark 4.6*.*
Of course Theorem 4.4 means that there is no splitting chain of clopens in . In [Nyi88] Nyikos proved a stronger theorem: under the assumptions of Theorem 4.4 the space does not have a tunnel (cf. Remark 2.13).
In the light of the above results it is natural to ask if the existence of a splitting chain implies . First, notice that the proof of Proposition 4.1 uses in an essential way. The reason is that, by the classical result of Hausdorff, there are -gaps in . So, to construct a splitting chain by a transfinite induction longer than we would have to keep control on the cuts appearing in the construction at steps of cofinality to avoid a situation in which we have constructed a non-tight gap in our chain. This seems to be a hopeless task.
What is worse, the gaps constructed by Hausdorff are indestructible, i.e. we cannot interpolate them even in -preserving extensions of the universe (see e.g. [Sch93, Section 2]). So, even in the forcing constructions we have to be quite careful.
We will show two ways to avoid this problem. In the first construction, showing that splitting chains exist in the standard Cohen model, we will add generically elements of the chain, ensuring that all uncountable cuts which show up are tight and that their tightness will not be killed later on. In the second construction we will have to change our method (as we want to have in the final model). This time we will keep all the gaps in the constructed chain destructible. In this way for every cut we will be able to split (generically) sets spreading it.
4.1. Splitting chains after adding Cohen reals.
Let be the forcing with Cohen reals. We are going to prove the following.
Theorem 4.7**.**
If is of uncountable cofinality, then in there is a splitting chain.
This result was mentioned by Nyikos in [Nyi88]. He announced that its proof would appear in a later paper which however never appeared.
First, we will recall the standard forcing adding a set interpolating a given gap.
Definition 4.8**.**
Let be a pre-gap. Let be defined in the following way: if , where
- •
,
- •
, are finite subsets of and , respectively,
- •
* for each and .*
Denote . Now, if
- •
,
- •
, ,
- •
.
Say that a gap is destructible if there is a ccc (or just -preserving) forcing notion which adds a set interpolating . In fact, as the following fact shows, if there is such forcing interpolating the gap, then the above one would do the job, too.
Fact 4.9**.**
([Sch93]) A gap is destructible if and only if the forcing is ccc.
Lemma 4.10**.**
Assume that a pre-gap. Then adds generically a name for a set interpolating . Moreover, splits each set spreading from the ground model. If is countable, i.e. , then is just a Cohen forcing.
Proof.
If is a -generic and is a name for , then
[TABLE]
Now, assume that spreads . Since
[TABLE]
is dense for each ,
[TABLE]
Clearly, if is countable, then is countable and atomless, so it is isomorphic to the Cohen forcing. ∎
We will need one more fact. It is known that a Cohen forcing does not destroy towers (see e.g. [Hir00, Theorem 2.5]). The argument can be easily modified to show the following.
Theorem 4.11**.**
Let be a tight pre-gap. Adding any number of Cohen reals cannot add a subset spreading .
Proof.
Denote by the Cohen forcing. Assume that is a tight pre-gap. We may assume that and are regular. We will show that
[TABLE]
Translating our task using the standard Cohen names for subsets of we have to show that there is no Borel function such that and are comeager.
Indeed, suppose that such function exists and let be a co-meager set such that is continuous. Fix a countable base of . Denote
[TABLE]
Since is continuous on , each is closed in . By Baire theorem there is and such that . Since is tight, it has to be uncountable and so we may assume that is uncountable. Hence, we can find , and cofinal in such that and for every .
We have to deal with two cases.
- •
** is countable.** Let . Let . Then is comeager, since is comeager for each . Pick and let . Then for each and for each . Thus, for each and so spreads , a contradiction.
- •
** is uncountable.** Then, let
[TABLE]
Using the same argument as before we can find , and cofinal in , such that for . Let and let . Then for each and for each . Therefore, spreads , a contradiction.
Since each set added by forcing with many Cohen reals can be added by a single Cohen real, we are done. ∎
Proof of Theorem 4.7.
Let be a model with . We will construct an iteration and a sequence of names for -chains such that for every
- (1)
, 2. (2)
, where is a name for a countable cut in , if there are countable cuts in or otherwise (where is the standard Cohen forcing), 3. (3)
is the name for the chain , where is the name for a set added generically by , 4. (4)
if is limit, then is the finite support iteration of and , 5. (5)
“each uncountable cut in is tight“, 6. (6)
there are no countable cuts in .
Let be the trivial forcing and let . Then we can recursively define and satisfying (2) and (3), using the standard bookkeeping argument (and the fact that each countable cut in a -chain can be interpolated and so there are at most countable cuts in a -chain) to satisfy also (6).
To show that the condition (5) will be satisfied we first prove the following claim.
Claim. For each
[TABLE]
We will prove it by induction on . First, notice that does not contain any uncountable cut, so is satisfied trivially. Suppose that there is such that holds for each and that does not hold. Since Cohen forcing cannot destroy tightness of a pre-gap (thanks to Theorem 4.11) and it cannot add any new uncountable pre-gap (since each uncountable set of ordinals in the Cohen extension contains an uncountable subset from the ground model), has to be of uncountable cofinality. Let be an uncountable cut in which is not tight and let spreads it. Since , there is such that . There is a cut in such that spreads it. By the induction hypothesis has to be countable. Since is uncountable, there is such that , where is equivalent to (in the sense that and have the same family of interpolating sets). But then using Lemma 4.10 we get that splits , a contradiction. The claim is proved.
Of course the conjunction of (5) and (6) implies that
[TABLE]
and so, by Proposition 4.2 we are done. ∎
4.2. Splitting chains with big
Theorem 4.3 and Theorem 4.4 seem to suggest that the existence of splitting chains may be connected to the value of . Indeed, if , then a splitting chain could not have cuts which are -gaps (as they cannot be tight) and it is not obvious how to avoid them in the construction. However, we will show that splitting chains can exist even if . The basic idea is to use iteration intertwining forcings destroying gaps from Definition 4.8 with forcings adding pseudointersections to bases of filters on .
Definition 4.12**.**
Let be a filter on . The Mathias–Prikry forcing is defined in the following way: iff , where , and . if , and whenever .
Recall that diagonalizes (i.e. it adds a pseudo-intersection of ; see e.g. [Mat77]).
Let be a regular uncountable cardinal. For the rest of this section fix two subsets , which form a partition of into cofinal subsets. In our construction, at steps from we will add sets interpolating cuts, and at steps from we will diagonalize filters. Namely, we start with a model with and perform a finite support iteration , where is the trivial forcing, for every . Moreover, for each the forcing is either trivial or
- •
for it is of the form , where is a -name for a filter generated by less than sets.
- •
for it is of the form , where is a -name for a cut in the chain , where is the -name for a subset of added generically by .
Let be the limit of the iteration.
Note that in this definition we a priori assume that forces to be a chain. That this is the case can be shown by induction using Lemma 4.10: if , forms a chain, and is a -name for a cut in , then adds a set interpolating the cut and thus forces to be a chain.
In what follows we will make a cosmetic change in the definition of . At step of the iteration, as and thus elements of are naturally indexed by elements of , the sets and , for , will be subsets of (instead of ). (To avoid problems with and , we may assume that and , .)
We will prove inductively that regardless of the choice of the names for the filters and cuts, the forcing is ccc for every . We will use arguments from [Lav79]. Although Laver’s construction serves for different purposes and concerns a different structure, in fact we follow the path of his proof quite strictly.
Notice that usually to prove that a finite support iteration is ccc, one uses the preservation theorem for finite support iterations of ccc forcings. This time, the fact that the iterands are ccc will be rather a conclusion of the fact that the whole iteration is ccc. Further conclusion is that all the cuts in the generically added chain which form gaps are destructible (see Fact 4.9).
Theorem 4.13**.**
* is ccc for every .*
To prove the theorem we will need several lemmas.
Definition 4.14**.**
Let be the set of conditions in satisfying the following properties:
- (1)
* decides for and decides for ,* 2. (2)
for each we have (in such case denote this maximum by ), 3. (3)
for each we have .
The following simple lemma says that we may work only with conditions in .
Lemma 4.15**.**
For each the set is dense in .
Proof.
We will prove it inductively on . Since the iteration is of finite support, the limits steps are obvious. Let and consider . Denote . Find so that
- •
decides ,
- •
,
- •
for some .
Use the inductive hypothesis to find , . Now, notice that there is such that and . Indeed, the existence of such follows from the fact that and (and so can be appropriately extended). Clearly, is in . ∎
Lemma 4.16**.**
Let . If , and (), then there is such that
- •
* and for each , for ,*
- •
* ().*
Proof.
Assume that (the other case is clearly symmetric). We will prove the lemma by induction on . The limit step is obvious so assume that and consider ’s step. We may assume that .
Notice that . Hence, for each we have . By inductive hypothesis used many times we may find as in the lemma, such that or for every . Finally, let
[TABLE]
∎
Lemma 4.17**.**
Let be such that and for each and for . Then there is .
Proof.
As before, we will prove it inductively on . In fact, to make induction work, we will prove a stronger statement: we show that under the above conditions there is such that and .
Again, the limit step is clear, so let and consider . Define in the following way:
- •
if is empty, then let ,
- •
if is empty, then let ,
- •
if both of the supports are non-empty, then let be given by the inductive hypothesis for and .
We may assume that , otherwise will be as desired. Similarly, we assume that .
Suppose first that . Then it is enough to take
[TABLE]
If , then notice that
[TABLE]
Indeed, if () and (), then () and so () forces that .
Notice that extending in the obvious way on would give us a condition stronger than and but not necessarily in . To fulfil condition (3) of Definition 4.14 we have to apply subsequently Lemma 4.16 to find such that
- •
for every and every we have or .
- •
and for each .
Take . ∎
Now, we are ready to prove Theorem 4.13.
Proof.
(of Theorem 4.13) Suppose that is an uncountable subset of . We may assume that , that for each and, finally, that the supports of elements in form a -system with a root . Again, shrinking if needed, we may assume that for each we have for and for . Now, use Lemma 4.17. ∎
Theorem 4.18**.**
The existence of a splitting chain is consistent with for each regular uncountable .
Proof.
Assume that is a -name for an infinite subset of . If it is not split by the chain , then let and . Let . By Theorem 4.13 the forcing is ccc and it adds a generic set interpolating . Moreover, by Lemma 4.10, splits .
Using this remark, we can apply the standard bookkeeping machinery over all the -names, , for infinite subsets of to ensure that all of them will appear as a subset defining a cut as above which will be used to define for some (if at step the subset is already split by the previously constructed chain, then let be the trivial forcing).
Simultaneously, we apply the bookkeeping over all the -names, , for filters generated by less than sets to ensure that all of them will be diagonalized in the process of iteration. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[ACSC + 13] Antonio Avilés, Félix Cabello Sánchez, Castillo, Jesús M. F., Manuel González, and Yolanda Moreno. On separably injective Banach spaces. Adv. Math. , 234:192–216, 2013.
- 2[ACSC + 16] Antonio Avilés, Félix Cabello Sánchez, Jesús M. F. Castillo, Manuel González, and Yolanda Moreno. Separably injective Banach spaces , volume 2132 of Lecture Notes in Mathematics . Springer, [Cham], 2016.
- 3[ACSC + 17] Antonio Avilés, Félix Cabello Sánchez, Jesús M. F. Castillo, Manuel González, and Yolanda Moreno. Corrigendum to “On separably injective Banach spaces” [Adv. Math. 234 (2013) 192–216] [ MR 3003929]. Adv. Math. , 318:737–747, 2017.
- 4[AK 16] Fernando Albiac and Nigel J. Kalton. Topics in Banach space theory , volume 233 of Graduate Texts in Mathematics . Springer, [Cham], second edition, 2016. With a foreword by Gilles Godefory.
- 5[Ami 64] Dan Amir. Projections onto continuous function spaces. Proc. Amer. Math. Soc. , 15:396–402, 1964.
- 6[Ark 92] Alexander V. Arkhangelskiĭ. Topological function spaces , volume 78 of Mathematics and its Applications (Soviet Series) . Kluwer Academic Publishers Group, Dordrecht, 1992. Translated from the Russian by R. A. M. Hoksbergen.
- 7[AT 11] Antonio Avilés and Stevo Todorcevic. Multiple gaps. Fund. Math. , 213(1):15–42, 2011.
- 8[Ban 77] Paul Bankston. Ultraproducts in topology. General Topology and Appl. , 7(3):283–308, 1977.
