Upward closure in the toy multiverse of all countable models of set theory

The Multiverse by KaeltykThe toy multiverse of all countable models of set theory is upward closed under countably many successive forcing extensions of bounded size…

I’d like to explain a topic from my recent paper

G. Fuchs, J. D. Hamkins, J. ReitzSet-theoretic geology, to appear in the Annals of Pure and Applied Logic.

We just recently made the final revisions, and the paper is available if you follow the title link through to the arxiv. Most of the geology article proceeds from a downward-oriented focus on forcing, looking from a universe 𝑉 down to its grounds, the inner models 𝑊 over which 𝑉 might have arisen by forcing 𝑉 =𝑊[𝐺]. Thus, the set-theoretic geology project arrives at deeper and deeper grounds and the mantle and inner mantle concepts.

One section of the paper, however, has an upward-oriented focus, namely, §2 A brief upward glance, and it is that material about which I’d like to write here, because I find it to be both interesting and comparatively accessible, but also because the topic proceeds from a different perspective than the rest of the geology paper, and so I am a little fearful that it may get lost there.

First is the observation that I first heard from W. Hugh Woodin in the early 1990s.

Observation. If 𝑊 is a countable model of ZFC set theory, then there are forcing extensions 𝑊[𝑐] and 𝑊[𝑑], both obtained by adding a Cohen real, which are non-amalgamable in the sense that there can be no model of ZFC with the same ordinals as 𝑊 containing both 𝑊[𝑐] and 𝑊[𝑑]. Thus, the family of forcing extensions of 𝑊 is not upward directed.

Proof. Since 𝑊 is countable, let 𝑧 be a real coding the entirety of 𝑊. Enumerate the dense subsets 𝐷𝑛 𝑛 <𝜔 of the Cohen forcing Add(𝜔,1) in 𝑊. We construct 𝑐 and 𝑑 in stages. We begin by letting 𝑐0 be any element of 𝐷0. Let 𝑑0 consist of exactly as many 0s as |𝑐0|, followed by a 1, followed by 𝑧(0), and then extended to an element of 𝐷0. Continuing, 𝑐𝑛+1 extends 𝑐𝑛 by adding 0s until the length of 𝑑𝑛, and then a 1, and then extending into 𝐷𝑛+1; and 𝑑𝑛+1 extends 𝑑𝑛 by adding 0s to the length of 𝑐𝑛+1, then a 1, then 𝑧(𝑛), then extending into 𝐷𝑛+1. Let 𝑐 =𝑐𝑛 and 𝑑 =𝑑𝑛. Since we met all the dense sets in 𝑊, we know that 𝑐 and 𝑑 are 𝑊-generic Cohen reals, and so we may form the forcing extensions 𝑊[𝑐] and 𝑊[𝑑]. But if 𝑊 𝑈 ZFC and both 𝑐 and 𝑑 are in 𝑈, then in 𝑈 we may reconstruct the map 𝑛 𝑐𝑛,𝑑𝑛, by giving attention to the blocks of 0s in 𝑐 and 𝑑. From this map, we may reconstruct 𝑧 in 𝑈, which reveals all the ordinals of 𝑊 to be countable, a contradiction if 𝑈 and 𝑊 have the same ordinals. QED

Most of the results here concern forcing extensions of an arbitrary countable model of set theory, which of course includes the case of ill-founded models. Although there is no problem with forcing extensions of ill-founded models, when properly carried out, the reader may prefer to focus on the case of countable transitive models for the results in this section, and such a perspective will lose very little of the point of our observations.

The method of the observation above is easily generalized to produce three 𝑊-generic Cohen reals 𝑐0, 𝑐1 and 𝑐2, such that any two of them can be amalgamated, but the three of them cannot. More generally:

Observation. If 𝑊 is a countable model of ZFC set theory, then for any finite 𝑛 there are 𝑊-generic Cohen reals 𝑐0,𝑐1,,𝑐𝑛1, such that any proper subset of them are mutually 𝑊-generic, so that one may form the generic extension 𝑊[𝑐], provided that 𝑐 omits at least one 𝑐𝑖, but there is no forcing extension 𝑊[𝐺] simultaneously extending all 𝑊[𝑐𝑖] for 𝑖 <𝑛. In particular, the sequence 𝑐0,𝑐1,,𝑐𝑛1 cannot be added by forcing over 𝑊.

Let us turn now to infinite linearly ordered sequences of forcing extensions. We show first in the next theorem and subsequent observation that one mustn’t ask for too much; but nevertheless, after that we shall prove the surprising positive result, that any increasing sequence of forcing extensions over a countable model 𝑊, with forcing of uniformly bounded size, is bounded above by a single forcing extension 𝑊[𝐺].

Theorem. If 𝑊 is a countable model of ZFC, then there is an increasing sequence of set-forcing extensions of 𝑊 having no upper bound in the generic multiverse of 𝑊. 𝑊[𝐺0]𝑊[𝐺1]𝑊[𝐺𝑛]

Proof. Since 𝑊 is countable, there is an increasing sequence 𝛾𝑛 𝑛 <𝜔 of ordinals that is cofinal in the ordinals of 𝑊. Let 𝐺𝑛 be 𝑊-generic for the collapse forcing Coll(𝜔,𝛾𝑛), as defined in 𝑊. (By absorbing the smaller forcing, we may arrange that 𝑊[𝐺𝑛] contains 𝐺𝑚 for 𝑚 <𝑛.) Since every ordinal of 𝑊 is eventually collapsed, there can be no set-forcing extension of 𝑊, and indeed, no model with the same ordinals as 𝑊, that contains every 𝑊[𝐺𝑛]. QED

But that was cheating, of course, since the sequence of forcing notions is not even definable in 𝑊, as the class {𝛾𝑛 𝑛 <𝜔} is not a class of 𝑊. A more intriguing question would be whether this phenomenon can occur with forcing notions that constitute a set in 𝑊, or (equivalently, actually) whether it can occur using always the same poset in 𝑊. For example, if 𝑊[𝑐0] 𝑊[𝑐0][𝑐1] 𝑊[𝑐0][𝑐1][𝑐2] is an increasing sequence of generic extensions of 𝑊 by adding Cohen reals, then does it follow that there is a set-forcing extension 𝑊[𝐺] of 𝑊 with 𝑊[𝑐0][𝑐𝑛] 𝑊[𝐺] for every 𝑛? For this, we begin by showing that one mustn’t ask for too much:

Observation. If 𝑊 is a countable model of ZFC, then there is a sequence of forcing extensions 𝑊 𝑊[𝑐0] 𝑊[𝑐0][𝑐1] 𝑊[𝑐0][𝑐1][𝑐2] , adding a Cohen real at each step, such that there is no forcing extension of 𝑊 containing the sequence 𝑐𝑛 𝑛 <𝜔.

Proof. Let 𝑑𝑛 𝑛 <𝜔 be any 𝑊-generic sequence for the forcing to add 𝜔 many Cohen reals over 𝑊. Let 𝑧 be any real coding the ordinals of 𝑊. Let us view these reals as infinite binary sequences. Define the real 𝑐𝑛 to agree with 𝑑𝑛 on all digits except the initial digit, and set 𝑐𝑛(0) =𝑧(𝑛). That is, we make a single-bit change to each 𝑑𝑛, so as to code one additional bit of 𝑧. Since we have made only finitely many changes to each 𝑑𝑛, it follows that 𝑐𝑛 is an 𝑊-generic Cohen real, and also 𝑊[𝑐0][𝑐𝑛] =𝑊[𝑑0][𝑑𝑛]. Thus, we have 𝑊𝑊[𝑐0]𝑊[𝑐0][𝑐1]𝑊[𝑐0][𝑐1][𝑐2], adding a generic Cohen real at each step. But there can be no forcing extension of 𝑊 containing 𝑐𝑛 𝑛 <𝜔, since any such extension would have the real 𝑧, revealing all the ordinals of 𝑊 to be countable. QED

We can modify the construction to allow 𝑧 to be 𝑊-generic, but collapsing some cardinals of 𝑊. For example, for any cardinal 𝛿 of 𝑊, we could let 𝑧 be 𝑊-generic for the collapse of 𝛿. Then, if we construct the sequence 𝑐𝑛 𝑛 <𝜔 as above, but inside 𝑊[𝑧], we get a sequence of Cohen real extensions 𝑊𝑊[𝑐0]𝑊[𝑐0][𝑐1]𝑊[𝑐0][𝑐1][𝑐2] such that 𝑊[𝑐𝑛 𝑛 <𝜔] =𝑊[𝑧], which collapses 𝛿.

But of course, the question of whether the models 𝑊[𝑐0][𝑐1][𝑐𝑛] have an upper bound is not the same question as whether one can add the sequence 𝑐𝑛 𝑛 <𝜔, since an upper bound may not have this sequence. And in fact, this is exactly what occurs, and we have a surprising positive result:

Theorem. Suppose that 𝑊 is a countable model of \ZFC, and 𝑊[𝐺0]𝑊[𝐺1]𝑊[𝐺𝑛] is an increasing sequence of forcing extensions of 𝑊, with 𝐺𝑛 𝑛 𝑊 being 𝑊-generic. If the cardinalities of the 𝑛’s in 𝑊 are bounded in 𝑊, then there is a set-forcing extension 𝑊[𝐺] with 𝑊[𝐺𝑛] 𝑊[𝐺] for all 𝑛 <𝜔.

Proof. Let us first make the argument in the special case that we have 𝑊𝑊[𝑔0]𝑊[𝑔0][𝑔1]𝑊[𝑔0][𝑔1][𝑔𝑛], where each 𝑔𝑛 is generic over the prior model for forcing 𝑛 𝑊. That is, each extension 𝑊[𝑔0][𝑔1][𝑔𝑛] is obtained by product forcing 0 × ×𝑛 over 𝑊, and the 𝑔𝑛 are mutually 𝑊-generic. Let 𝛿 be a regular cardinal with each 𝑛 having size at most 𝛿, built with underlying set a subset of 𝛿. In 𝑊, let 𝜃 =2𝛿, let 𝛼 𝛼 <𝜃 enumerate all posets of size at most 𝛿, with unbounded repetition, and let =𝛼<𝜃𝛼 be the finite-support product of these posets. Since each factor is 𝛿+-c.c., it follows that the product is 𝛿+-c.c. Since 𝑊 is countable, we may build a filter 𝐻 that is 𝑊-generic. In fact, we may find such a filter 𝐻 that meets every dense set in 𝑛<𝜔𝑊[𝑔0][𝑔1][𝑔𝑛], since this union is also countable. In particular, 𝐻 and 𝑔0 × ×𝑔𝑛 are mutually 𝑊-generic for every 𝑛 <𝜔. The filter 𝐻 is determined by the filters 𝐻𝛼 𝛼 that it adds at each coordinate.

Next comes the key step. Externally to 𝑊, we may find an increasing sequence 𝜃𝑛 𝑛 <𝜔 of ordinals cofinal in 𝜃, such that 𝜃𝑛 =𝑛. This is possible because the posets are repeated unboundedly, and 𝜃 is countable in 𝑉. Let us modify the filter 𝐻 by surgery to produce a new filter 𝐻, by changing 𝐻 at the coordinates 𝜃𝑛 to use 𝑔𝑛 rather than 𝐻𝜃𝑛. That is, let 𝐻𝜃𝑛 =𝑔𝑛 and otherwise 𝐻𝛼 =𝐻𝛼, for 𝛼 {𝜃𝑛 𝑛 <𝜔}. It is clear that 𝐻 is still a filter on . We claim that 𝐻 is 𝑊-generic. To see this, suppose that 𝐴 is any maximal antichain in 𝑊. By the 𝛿+-chain condition and the fact that cof(𝜃)𝑊 >𝛿, it follows that the conditions in 𝐴 have support bounded by some 𝛾 <𝜃. Since the 𝜃𝑛 are increasing and cofinal in 𝜃, only finitely many of them lay below 𝛾, and we may suppose that there is some largest 𝜃𝑚 below 𝛾. Let 𝐻 be the filter derived from 𝐻 by performing the surgical modifications only on the coordinates 𝜃0,,𝜃𝑚. Thus, 𝐻 and 𝐻 agree on all coordinates below 𝛾. By construction, we had ensured that 𝐻 and 𝑔0 × ×𝑔𝑚 are mutually generic over 𝑊 for the forcing ×0 × ×𝑚. This poset has an automorphism swapping the latter copies of 𝑖 with their copy at 𝜃𝑖 in , and this automorphism takes the 𝑊-generic filter 𝐻 ×𝑔0 × ×𝑔𝑚 exactly to 𝐻 ×𝐻𝜃0 × ×𝐻𝜃𝑚. In particular, 𝐻 is 𝑊-generic for , and so 𝐻 meets the maximal antichain 𝐴. Since 𝐻 and 𝐻 agree at coordinates below 𝛾, it follows that 𝐻 also meets 𝐴. In summary, we have proved that 𝐻 is 𝑊-generic for , and so 𝑊[𝐻] is a set-forcing extension of 𝑊. By design, each 𝑔𝑛 appears at coordinate 𝜃𝑛 in 𝐻, and so 𝑊[𝑔0][𝑔𝑛] 𝑊[𝐻] for every 𝑛 <𝜔, as desired.

Finally, we reduce the general case to this special case. Suppose that 𝑊[𝐺0] 𝑊[𝐺1] 𝑊[𝐺𝑛] is an increasing sequence of forcing extensions of 𝑊, with 𝐺𝑛 𝑛 𝑊 being 𝑊-generic and each 𝑛 of size at most 𝜅 in 𝑊. By the standard facts surrounding finite iterated forcing, we may view each model as a forcing extension of the previous model 𝑊[𝐺𝑛+1]=𝑊[𝐺𝑛][𝐻𝑛], where 𝐻𝑛 is 𝑊[𝐺𝑛]-generic for the corresponding quotient forcing 𝑛/𝐺𝑛 in 𝑊[𝐺𝑛]. Let 𝑔 Coll(𝜔,𝜅) be 𝑛𝑊[𝐺𝑛]-generic for the collapse of 𝜅, so that it is mutually generic with every 𝐺𝑛. Thus, we have the increasing sequence of extensions 𝑊[𝑔][𝐺0] 𝑊[𝑔][𝐺1] , where we have added 𝑔 to each model. Since each 𝑛 is countable in 𝑊[𝑔], it is forcing equivalent there to the forcing to add a Cohen real. Furthermore, the quotient forcing 𝑛/𝐺𝑛 is also forcing equivalent in 𝑊[𝑔][𝐺𝑛] to adding a Cohen real. Thus, 𝑊[𝑔][𝐺𝑛+1] =𝑊[𝑔][𝐺𝑛][𝐻𝑛] =𝑊[𝑔][𝐺𝑛][𝑛], for some 𝑊[𝑔][𝐺𝑛]-generic Cohen real 𝑛. Unwrapping this recursion, we have 𝑊[𝑔][𝐺𝑛+1] =𝑊[𝑔][𝐺0][1][𝑛], and consequently 𝑊[𝑔]𝑊[𝑔][𝐺0]𝑊[𝑔][𝐺0][1]𝑊[𝑔][𝐺0][1][2], which places us into the first case of the proof, since this is now product forcing rather than iterated forcing. QED

Definition. A collection {𝑊[𝐺𝑛] 𝑛 <𝜔} of forcing extensions of 𝑊 is finitely amalgamable over 𝑊 if for every 𝑛 <𝜔 there is a forcing extension 𝑊[𝐻] with 𝑊[𝐺𝑚] 𝑊[𝐻] for all 𝑚 𝑛. It is amalgamable over 𝑊 if there is 𝑊[𝐻] such that 𝑊[𝐺𝑛] 𝑊[𝐻] for all 𝑛 <𝜔.

The next corollary shows that we cannot improve the non-amalgamability result of the initial observation to the case of infinitely many Cohen reals, with all finite subsets amalgamable.

Corollary. If 𝑊 is a countable model of ZFC and {𝑊[𝐺𝑛] 𝑛 <𝜔} is a finitely amalgamable collection of forcing extensions of 𝑊, using forcing of bounded size in 𝑊, then this collection is fully amalgamable. That is, there is a forcing extension 𝑊[𝐻] with 𝑊[𝐺𝑛] 𝑊[𝐻] for all 𝑛 <𝜔.

Proof. Since the collection is finitely amalgamable, for each 𝑛 <𝜔 there is some 𝑊-generic 𝐾 such that 𝑊[𝐺𝑚] 𝑊[𝐾] for all 𝑚 𝑛. Thus, we may form the minimal model 𝑊[𝐺0][𝐺1][𝐺𝑛] between 𝑊 and 𝑊[𝐾], and thus 𝑊[𝐺0][𝐺1][𝐺𝑛] is a forcing extension of 𝑊. We are thus in the situation of the theorem, with an increasing chain of forcing extensions. 𝑊𝑊[𝐺0]𝑊[𝐺0][𝐺1]𝑊[𝐺0][𝐺1][𝐺𝑛] Therefore, by the theorem, there is a model 𝑊[𝐻] containing all these extensions, and in particular, 𝑊[𝐺𝑛] 𝑊[𝐻], as desired. QED

Please go to the paper for more details and discussion.

12 thoughts on “Upward closure in the toy multiverse of all countable models of set theory

  1. Very nice results. Can you get the same results using the naturalist account of forcing, i.e. when you ‘take the training wheels off’?

    • That is a very difficult question, since it isn’t clear to me how one would formalize the results purely from the perspective of the original ground model. I’m not sure it is possible, since from the perspective of the ground model, in the only way we seem able to speak of it, any two forcing extensions are amalgamable via product forcing. So these arguments seem really to require the toy model perspective, but thereby hint at what might really be out there, inaccessible to us, for the real multiverse of V.

      • So there is, then, no general structure theorem from model theory (perhaps treating the class of countable transitive models and the class of universes formed by the naturalist account of forcing as categories(?)) that says, in effect, that whatever holds for the class of countable transitive models holds for the class of universes formed by the naturalistic account of forcing?

  2. The following may be somehow related to the above question. First let me recall a theorem of Solovay

    Theorem. Let 𝑅 be a real. Then in 𝑉𝐶𝑜𝑙(0,20), there are reals 𝑎,𝑏 which are Cohen generic over 𝑉 and 𝑅 is constructible from them.

    The point of the argument is that in the extension, there are only countably many dense subsets of the Cohen forcing which are in 𝑉.

    However I have proved the following, which avoids collapsing cardinals.

    Theorem. Let 𝑅 be a real, and force with 𝐴𝑑𝑑(𝜔,1) 𝐴𝑑𝑑(𝜔,1). Then in the extension there are reals 𝑎,𝑏 which are Cohen generic over 𝑉 and 𝑅 is constructible from them.

    Note that here we have much more dense open sets that should take care of them, and the argument is completely different from Solovay’s argument.

    • That is very interesting, Mohammad. Here is how I would prove it: fix any Cohen real a, and then let b flip digits in a according to R. So b will be an isomorphic copy of a, as the bit-flipping automorphism is in V, and so both a and b are V-generic Cohen reals, but from a and b together, we can recover R. (It cannot be in general that a*b is V-generic or even L-generic, since then this would imply that R is L-generic for Cohen forcing, but it might not be.)

  3. Mohammad: is the proof short enough to be printed here? I was thinking along the lines of natural transformations for categories of models.

  4. Theorem. Suppose that 𝑅 is a real in 𝑉. Then there are two reals 𝑎 and 𝑏 such that

    (𝑎) 𝑎 and 𝑏 are Cohen generic over 𝑉,

    (𝑏) all of the models 𝑉,𝑉[𝑎],𝑉[𝑏] and 𝑉[𝑎,𝑏] have the same cardinals,

    (𝑐) 𝑅 𝐿[𝑎,𝑏].

    Proof. Working in 𝑉, let 𝑎 be 𝐴𝑑𝑑(𝜔,1) generic over 𝑉 and let 𝑏 be 𝐴𝑑𝑑(𝜔,1) generic over 𝑉[𝑎], where 𝐴𝑑𝑑(𝜔,1) is the Cohen
    forcing for adding a new real. Note that 𝑉[𝑎] and 𝑉[𝑎,𝑏] are cardinal preserving generic extensions of 𝑉. Working
    in 𝑉[𝑎,𝑏] let (𝑘𝑁 :𝑁 <𝜔) be an
    increasing enumeration of {𝑁 :𝑎(𝑁) =0} and let 𝑎 =𝑎 and
    𝑏 ={𝑁 :𝑏(𝑁) =𝑎(𝑁) =1} {𝑘𝑁 :𝑅(𝑁) =1}.
    Then clearly 𝑅 𝐿[(𝑘𝑁 :𝑁 <𝜔),𝑏] 𝐿[𝑎,𝑏] as
    𝑅 ={𝑁 :𝑘𝑁 𝑏}.

    We show that 𝑏 is 𝐴𝑑𝑑(𝜔,1) generic over 𝑉. It suffices
    to prove the following:

    For any (𝑝,𝑞) 𝐴𝑑𝑑(𝜔,1) ˙𝐴𝑑𝑑(𝜔,1) and any dense
    open subset 𝐷 𝑉 of 𝐴𝑑𝑑(𝜔,1) there is
    (¯𝑝,¯𝑞) (𝑝,𝑞)
    such that (¯𝑝,¯𝑞) ˙𝑏 extends some element of $D $.

    Let (𝑝,𝑞) and 𝐷 be as above. By extending one of 𝑝 or 𝑞 if
    necessary, we can assume that 𝑙(𝑝) =𝑙(𝑞). Let (𝑘𝑁 :𝑁 <𝑀) be an increasing enumeration of {𝑁 <𝑙(𝑝) :𝑝(𝑁) =0}.
    Let 𝑠 :𝑙(𝑝) 2 be such that considered as a subset
    of 𝜔,

    𝑠 ={𝑁 <𝑙(𝑝) :𝑝(𝑁) =𝑞(𝑁) =1} {𝑘𝑁 :𝑁 <𝑀,𝑅(𝑁) =1}.

    Let 𝑡 𝐷 be such that 𝑡 𝑠.
    Extend 𝑝,𝑞 to ¯𝑝,¯𝑞 of length 𝑙(𝑡)
    so that for 𝑖 in the interval [𝑙(𝑠),𝑙(𝑡))

    1) ¯𝑝(𝑖) =1,

    2) ¯𝑞(𝑖) =1 iff 𝑖 𝑡.

    Then

    𝑡 ={𝑁 <𝑙(𝑡) :¯𝑝(𝑁) =¯𝑞(𝑁) =1} {𝑘𝑁 :𝑁 <𝑀,𝑅(𝑁) =1}.

    Thus
    (¯𝑝,¯𝑞) ˙𝑏 extends t
    and ( ) follows.

    • This is nice, but I find the proof I had suggested in my comment above to be more direct. Namely, let 𝑅 be any real in 𝑉 and let 𝑎 be any 𝑉-generic Cohen real. Let 𝜋 be the automorphism of the forcing that flips bits on the numbers in 𝑅, and let 𝑏 =𝜋(𝑎). Thus, 𝑎(𝑖) =𝑏(𝑖) just in case 𝑖 𝑅. Since 𝜋 is an automorphism of the forcing, it follows that 𝑏 is also 𝑉-generic, but from 𝑎 and 𝑏 together you can tell which digits were changed, and so 𝑅 is in 𝐿[𝑎,𝑏].

  5. The argument above is really nice and much simpler.

    But the prove I have presented has the advantage that it can be applied in much more complicated situations where maybe the above argument doesn’t work. See my papers with Moti Gitik “Adding a lot of Cohen reals by adding a few I, II”

  6. Joel, thanks for putting this up – it’s very nice to see the “upward glance” material getting some proper attention, as I think it contains a rich field of questions. “Set-theoretic astronomy” perhaps? Great!

    Jonas

    ps. Your “Multiverse” image at the top of the post seems to be broken

  7. Pingback: Upward closure in the generic multiverse of a countable model of set theory, RIMS 2015, Kyoto, Japan | Joel David Hamkins

  8. Pingback: Upward countable closure in the generic multiverse of forcing to add a Cohen real | Joel David Hamkins

Leave a Reply

Your email address will not be published. Required fields are marked *