A common forcing extension obtained via different forcing notions

I’d like to write about the situation that occurs in set theory when a forcing extension $V [G] = V [H]$ arises over a ground model $V$ in two different ways simultaneously, using generic filters over two different forcing notions $G \subset B$ and $H \subset C$ . The general fact, stated in theorem 1, is that in this case, the two forcing notions are actually isomorphic on a cone $B ↾ b ≅ C ↾ c$ , with the isomorphism carrying the one generic filter to the other. In other words, below these respective conditions $b$ and $c$ , the forcing notions and the respective generic filters are not actually different.

I have always assumed that this fact was part of the classical forcing folklore results, but ~~it doesn’t seem to be mentioned explicitly in the usual forcing literature~~ (it appears as lemma 25.5 in Jech’s book), and so I am writing an account of it here. Victoria Gitman and I have need of it in a current joint project. (Bob Solovay mentions in the comments below that the result is due to him, and provides a possible 1975 reference.)

Theorem 1. If $V [G] = V [H]$ , where $G \subset B$ and $H \subset C$ are $V$ -generic filters on the complete Boolean algebras $B$ and $C$ , respectively, then there are conditions $b \in B$ and $c \in C$ such that $B ↾ b$ is isomorphic to $C ↾ c$ by an isomorphism carrying $G$ to $H$ .

The proof will also establish the following related result, concerning the situation where one extension is merely contained in the other.

Theorem 2. If $V [H] \subset V [G]$ , where $G \subset B$ and $H \subset C$ are $V$ -generic filters on the complete Boolean algebras $B$ and $C$ , respectively, then there are conditions $b \in B$ and $c \in C$ such that $C ↾ c$ is isomorphic to a complete subalgebra of $B ↾ b$ .

By $B ↾ b$ , where $b$ is a condition in $B$ (that is, a nonzero element of $B$ ), what I mean is the Boolean algebra consisting of the interval $[0, b]$ in $B$ , using relative complement $b - a$ as the negation of $a$ . This is the complete Boolean algebra that arises when forcing with the conditions in $B$ below $b$ .

Proof: In order to prove theorem 2, let me assume at first only that $V [H] \subset V [G]$ . It follows that $H = {\dot{H}}_{G}$ for some $B$ -name $\dot{H}$ , and we may choose a condition $b \in G$ forcing that $\dot{H}$ is a $\overset{ˇ}{V}$ -generic filter on $\overset{ˇ}{C}$ .

I claim that there is some $c \in H$ such that every $d \leq c$ has $b \land [[\overset{ˇ}{d} \in \dot{H}]]^{B} \neq 0$ . Note that every $d \in H$ has $[[\overset{ˇ}{d} \in \dot{H}]] \in G$ by the truth lemma, since $H = {\dot{H}}_{G}$ , and so $b \land [[\overset{ˇ}{d} \in \dot{H}]]^{B} \neq 0$ for $d \in H$ . If $c \in H$ forces that every $d$ in the generic filter has that property, then indeed every $d \leq c$ has $b \land [[\overset{ˇ}{d} \in \dot{H}]]^{B} \neq 0$ as claimed.
In other words, from the perspective of the $B$ forcing, every $d \leq c$ has a nonzero possibility to be in $\dot{H}$ .

Define $π : C ↾ c \to B$ by $π (d) = b \land [[\overset{ˇ}{d} \in \dot{H}]]^{B} .$ Using the fact that $b$ forces that $\dot{H}$ is a filter, it is straightforward to verify that

$d \leq e ⟹ π (d) \leq π (e)$ , since if $d \leq e$ and $d \in H$ , then $e \in H$ .
$π (d \land e) = π (d) \land π (e)$ , since $[[\overset{ˇ}{d} \in \dot{H}]] \land [[\overset{ˇ}{e} \in \dot{H}]] = [[\overset{ˇ}{(b \land e)} \in \dot{H}]]$ .
$π (d - e) = π (d) - π (e)$ , since $[[\overset{ˇ}{(d - e)} \in \dot{H}]] = [[\overset{ˇ}{d} \in \dot{H}]] - [[\overset{ˇ}{e} \in \dot{H}]]$ .

Thus, $π$ is a Boolean algebra embedding of $C ↾ c$ into $B ↾ π (c)$ .

Let me argue that this embedding is a complete embedding. Suppose that $a = ⋁ A$ for some subset $A \subset C ↾ c$ with $A \in V$ . Since $H$ is $V$ -generic, it follows that $a \in H$ just in case $H$ meets $A$ . Thus, $[[\overset{ˇ}{a} \in \dot{H}]] = [[\exists x \in \overset{ˇ}{A} x \in \dot{H}]] = \underset{x \in A}{⋁} [[\overset{ˇ}{x} \in \dot{H}]]$ , and so $π (⋁ A) = \underset{x \in A}{⋁} π (x)$ , and so $π$ is complete, as desired. This proves theorem 2.

To prove theorem 1, let me now assume fully that $V [G] = V [H]$ . In this case, there is a $C$ name $\dot{G}$ for which $G = {\dot{G}}_{H}$ . By strengthening $b$ , we may assume without loss that $b$ also forces that, that is, that $b$ forces $Γ = {\overset{ˇ}{\dot{G}}}_{\dot{H}}$ , where $Γ$ is the canonical $B$ -name for the generic object, and $\overset{ˇ}{\dot{G}}$ is the $B$ -name of the $C$ -name $\dot{G}$ . Let us also strengthen $c$ to ensure that $c$ forces $\dot{G}$ is $\overset{ˇ}{V}$ -generic for $\overset{ˇ}{C}$ . For $d \leq c$ define $π (d) = [[\overset{ˇ}{d} \in \dot{H}]]^{B}$ as above, which provides a complete embedding of $C ↾ c$ to $B ↾ π (c)$ . I shall now argue that this embedding is dense below $π (c)$ . Suppose that $a \leq π (c)$ in $B$ . Since $a$ forces $\overset{ˇ}{a} \in Γ$ and also $\overset{ˇ}{c} \in \dot{H}$ , it must also force that there is some $d \leq c$ in $\dot{H}$ that forces via $C$ over $\overset{ˇ}{V}$ that $\overset{ˇ}{a} \in \dot{G}$ . So there must really be some $d \leq c$ forcing $\overset{ˇ}{a} \in \dot{G}$ . So $π (d)$ , which forces $\overset{ˇ}{d} \in \dot{H}$ , will also force $\overset{ˇ}{a} \in {\overset{ˇ}{\dot{G}}}_{\dot{H}} = Γ$ , and so $π (d) ⊩_{B} \overset{ˇ}{a} \in Γ$ , which means $π (d) \leq a$ in $B$ . Thus, the range of $π$ on $C ↾ c$ is dense below $π (c)$ , and so $π$ is a complete dense embedding of $C ↾ c$ to $B ↾ π (c)$ . Since these are complete Boolean algebras, this means that $π$ is actually an isomorphism of $C ↾ c$ with $B ↾ π (c)$ , as desired.

Finally, note that if $d \in H$ below $c$ , then since $H = {\dot{H}}_{G}$ , it follows that $[[\overset{ˇ}{d} \in \dot{H}]] \in G$ , which is to say $π (d) \in G$ , and so $π$ carries $H$ to $G$ on these cones. So $π^{- 1}$ is the isomorphism stated in theorem 1.QED

Finally, I note that one cannot get rid of the need to restrict to cones, since it could be that $B$ and $C$ are the lottery sums of a common forcing notion, giving rise to $V [G] = V [H]$ , together with totally different non-isomorphic forcing notions below some other incompatible conditions. So we cannot expect to prove that $B ≅ C$ , and are content to get merely that $B ↾ b ≅ C ↾ c$ , an isomorphism below respective conditions.

14 thoughts on “A common forcing extension obtained via different forcing notions”

Joel, this is a great argument to know and I am glad that my unfounded skepticism prompted you to write it up :). Although, I might claim later that the argument we needed this fact for could be carried out differently as well.
p.s. I am becoming more and more convinced of the advantages of forcing with Boolean algebras.

Reply ↓

Joel David Hamkins on July 18, 2014 at 2:13 pm said:

Oh, yes, I’d be interested to see your alternative argument in the context of our application. Meanwhile, I view theorems 1 and 2 here as basic facts about forcing, and so it is of course also fine to use them.

Reply ↓

Joel,

This is an old result of mine. I don’t think I ever published it. It may appear in:

Serge Grigorieff in Intermediate Submodels and Generic Extensions in Set Theory [Annals of Mathematics 101 (1975), 447-490].

— Bob

Reply ↓

Joel David Hamkins on July 18, 2014 at 7:02 pm said:

Bob, Great! Thanks for the reference. The need for this result pops up once in a while—I used it in my “As you like it” paper, and now Vika and I just used it again.

Reply ↓
Asaf Karagila on July 18, 2014 at 7:22 pm said:

Grigorieff’s paper always scared me for some reason.

Maybe it’s the outdated notation, maybe it’s the fact that I was never a big fan of relative constructibility (go symmetries!), or maybe it’s just the fact that each section had its own counter for theorems and remarks (resulting in a handful of Theorem 1 within the same paper).

Still, I’d rank this as one of the most important papers in choiceless set theory, maybe the most important. And I guess that it’s not without a reason that this paper appeared on Annals of Mathematics.

Reply ↓
- Joel David Hamkins on July 19, 2014 at 8:52 am said:
  
  Asaf,
  
  Could you check whether the result is stated in that paper? For completeness, I’d like to track down the earliest reference.
  
  Reply ↓
  - Asaf Karagila on July 19, 2014 at 5:07 pm said:
    
    Joel,
    
    I didn’t sit to read the whole thing. But it seems to me that you will be wise to take a look at sections 3.5 and 3.6 (Each include a single Theorem 1 and proof thereof).
    
    This would be pages 460-461 of the paper.
    
    Reply ↓

Appendix D of Bagaria lecture notes “Models of Set Theory. Master’s Course Notes 2013-2014” gives a classification of forcing extensions. Theorem 0.12 there characterizes the equivalence of forcing notions.

See

http://www.icrea.cat/Web/ScientificForm.aspx?key=119

http://www.icrea.cat/Web/OtherSectionViewer.aspx?key=718&titol=Models%20of%20Set%20Theory.%20Master%27s%20Course%20Notes%202013-2014.%20&researcher=119

Reply ↓

Joel David Hamkins on July 19, 2014 at 8:40 am said:

Thanks, Mohammad!

Bagaria states the result there as lemma 0.11, but he doesn’t actually prove it, instead he cites Jech’s book Lemma 25.5. So I looked it up in Jech, and there it is! Somehow, we missed the fact that it was in Jech’s book all along! And Jech’s proof is essentially the same as what I give here.

Reply ↓
- Asaf Karagila on July 19, 2014 at 3:56 pm said:
  
  Joel, with so many propositions, lemmas and theorems, it’s not that of a big deal to miss this!
  
  Reply ↓

Very interesting, thanks for sharing this insight!

I have some questions about the proof of theorem 2.

(1) If you strengthen the assumption to “For each $(V, B)$ -generic $G$ , there exists some $(V, C)$ -generic $H$ such that $H \in V [G]$ .”, then you have $1_{B} ⊨ \exists x (x is (\overset{ˇ}{V}, \overset{ˇ}{C}) -generic)$ . By the maximal principle, fix some name $\dot{H}$ such that $1_{B} ⊨ (\dot{H} is (\overset{ˇ}{V}, \overset{ˇ}{C}) -generic)$ . Also, fix some $(V, B)$ -generic $G$ , and let $H := {\dot{H}}_{G}$ . Then $H$ is indeed $(V, C)$ -generic, right? So, using your notation from above, you have $b = 1_{B}$ ?

(2) In the next paragraph, I don’t understand what you mean by “If $c \in H$ forces that every $d$ in the generic filter has that property, then …”. Could you explain how to find that condition $c$ ?

(3) As I didn’t understand how to find $c$ , I also don’t see why $π (c) = b$ holds. In other words, why does $b = [[\overset{ˇ}{c} \in \dot{H}]]^{B}$ hold?

Thanks in advance!

Reply ↓

Joel David Hamkins on July 23, 2014 at 7:45 am said:

Good questions.

Yes, I agree with (1). Except that ultimately the isomorphism is between $C ↾ c$ and $B ↾ π (c)$ , rather than $B ↾ b$ .

For (2), let $D$ be the set of $d$ with $b \land [[\overset{ˇ}{d} \in \dot{H}]] \neq 0$ . So $H \subset D$ , and $D$ is in the ground model. Let $c \in H$ be a condition forcing that every condition in the general filter is in $D$ . It follows that every $d \leq c$ has $d \in D$ , since otherwise, $c$ couldn’t force that.

For (3), we don’t necessarily have $π (c) = b$ in the proof. Rather, we have $π (c) \leq b$ , which is clear, since we took a meet with $b$ in the definition of $π$ . So the isomorphism is between $C ↾ c$ and $B ↾ π (c)$ .

Reply ↓
- Justus on July 23, 2014 at 9:42 am said:
  
  Thanks for your quick reply!
  
  So that $b$ in Theorem 2 is $π (c)$ and not the $b$ used in the proof. I was a bit confused about this.
  
  I wanted to apply your Theorem 2 (or some version of it) to the following problem:
  
  Suppose that, for each $(V, B)$ -generic $G$ , there exists some $(V, C)$ -generic $H$ such that $H \in V [G]$ . Also assume that $C$ is isomorphic to each of its cones. Then $C$ is isomorphic to some complete subalgebra of $B$ .
  
  In other words, can I get rid of the restriction to cones by the two strengthened assumptions?
  
  I think the above statement is widely applicable (if its provable after all) as the situation naturally occurs, for example, with amoeba tree forcing notions (and possible others).
  
  Reply ↓
  - Joel David Hamkins on July 23, 2014 at 10:27 am said:
    
    Yes, that’s right about $π (c)$ and $b$ ; is it confusing? We may assume that $π (c) = b$ without loss of generality, though, simply by strengthening $b$ to $π (c)$ .
    
    Your proposed theorem is correct. What you get is that a cone of $C$ and hence $C$ itself is isomorphic to a complete subalgebra of various cones $B ↾ b$ in $B$ . But there will be a dense set of these $b$ . So take a maximal antichain $A$ of those $b$ ’s, and then map any element of $C$ to the join of the corresponding copies of $C$ below each $b \in A$ . This will be a complete embedding of $C$ into $B$ .
    
    Reply ↓

Joel David Hamkins

mathematics and philosophy of the infinite

A common forcing extension obtained via different forcing notions

14 thoughts on “A common forcing extension obtained via different forcing notions”

Leave a Reply Cancel reply

Share:

14 thoughts on “A common forcing extension obtained via different forcing notions”

Leave a Reply Cancel reply