4

Let $\alpha > 0$ be any ordinal. Consider the forcing $Add(\omega,\alpha) * Add(\omega_1,1)$. Let $B$ be its boolean completion. Let $\dot{X}$ be the canonical $B$-name for the generic subset of $\omega_1$ added by the second iterand. By forcing folklore, there is a complete subalgebra $A \subseteq B$ that adds $X$, completely generated by the boolean values $|| \check{\beta} \in \dot{X} ||$ (see Jech p. 247). One can check that for each $\beta < \omega_1$, $|| \check{\beta} \in \dot{X} || = (1,\check{ \lbrace (\beta,1) \rbrace } ) $.

Questions:

(1) What is the nature of $A$ in relation to $B$? Although $A$ adds all the reals of $B$, I think I can show that it is always a proper subset of $B$ (even for $\alpha = 1$). This leads to the second question.

(2) If $G$ is generic for $A$, what is the nature of the quotient algebra $B/G$? One can show that it is $(\omega,\infty)$-distributive. In the case where $\alpha$ is countable, it is atomic. Is it nonatomic for uncountable $\alpha$? Is it strategically closed?

(3) If $G$ is generic for $A$, does $V[G]$ always contain some $Add(\omega,\alpha)$ generic, like in the case $\alpha$ is countable?

Edit: I thank J.D. Hamkins for his answer, but I already knew about the case $\alpha < \omega_1$, as stated in the original post. I would really like some insight on the case $\alpha \geq \omega_1$.

flag
I strongly suspect you mean that $\Vert \check{\beta} \in \dot{X} \Vert = \{ (p,\dot{q}) \in Add(\omega,\alpha)\ast Add(\omega_1,1): p \Vdash (\beta, 1) \in \dot{q} \}$ – Michael Blackmon Apr 2 at 1:53
(Where the completion of $Add(\omega,\alpha)\ast Add(\omega_1,1)$ is taken to be corresponding regular open algebra) – Michael Blackmon Apr 2 at 1:55
Michael, let $e: Add(\omega,\alpha)∗Add(\omega_1,1) \to B$ be the canonical dense embedding. If $(p,\dot{q}) \Vdash \beta \in X$, then it must be that $p \Vdash \dot{q}(\beta)=1$. Thus $(p,\dot{q}) \leq (1,\lbrace (\beta,1) \rbrace )$. And clearly, $(1,\lbrace (\beta,1) \rbrace )$ forces $\beta \in X$. Therefore, $|| \beta \in X|| =e((1,\lbrace (\beta,1) \rbrace ))$. – mbsq Apr 3 at 0:29

1 Answer

4

Update. If $\alpha$ is countable, then I claim that $A$ and $B$ are forcing equivalent, the quotient forcing is atomic, isomorphic to $P(\omega_1)$, and every extension by $A$ adds a generic for $\text{Add}(\omega,\alpha)$.

Suppose that $\alpha$ is countable and we have $V[g][X]$, the extension by $B=\text{Add}(\omega,\alpha)\ast\text{Add}(\omega_1,1)$. Thus, $g$ is an $\alpha$ sequence of Cohen reals, and we may string them together end-to-end and make a binary sequence of length $\omega\cdot\alpha$. In the model $V[g]$, it is dense that this sequence appears explicitly as a block in the generic set $X$, since any condition in $V[g]$ can be extended to include it. Thus, it follows that $g\in V[X]$ and at least in this situation, the set $X$ explicitly gives us a $V$-generic $\alpha$-sequence of Cohen reals, namely $g$.

But more to the point, it follows that $V[g][X]=V[X]$. Thus, forcing with $A$ or $B$ gives rise to the same extensions, and so $A$ and $B$ are forcing equivalent. As Andreas pointed out in a comment to my earlier answer (and as the OP seems to be aware), this does not necessarily mean that $A=B$, although it does mean that the quotient forcing is atomic.

Note that every ordinal $\beta\lt\omega_1$ has a nonzero Boolean possibility in $B$ of being the first ordinal where $g$ appears as a block in $X$. Thus, we have the Boolean value $b_\beta$ which is the Boolean value in $B$ that this is the case. It follows that $\{b_\beta\mid\beta\lt\omega_1\}$ forms a maximal antichain in $B$. Furthermore, I claim that $A$ together with the $b_\beta$'s generate all of $B$, because if we know the values in $A$ and we also know which $b_\beta$ holds then we can compute any Boolean value in $B$, which is determined by the information about $g$ and the information about $X$. Finally, notice that the OP's automorphism argument in the comments shows that no $b_\beta$ is in $A$, since we can know $X$ fully and still not know $g$ exactly, since we might have had $\pi(g)$ instead. So no information about $X$ (which is all $A$ knows about) can tell us anything definite about where the block of $g$ starts.

Thus, the quotient forcing is the atomic forcing using the atoms $b_\alpha$, which is isomorphic to the power set $P(\omega_1)$.

Lastly, let me just mention---although you probably know this already---that when $\alpha$ is countable, then $\text{Add}(\omega,\alpha)$ is isomorphic to $\text{Add}(\omega,1)$.

link|flag
1 
I don't see the inference from "the quotient forcing is trivial" to "$A=B$". A trivial forcing can be a big atomic Boolean algebra. Note that mbsq already mentioned in the question that, in the countable case, the quotient algebra is atomic, so the problem is whether this atomic algebra is just 2. – Andreas Blass Feb 16 at 21:25
Joel, doesn't your argument work even when $\alpha$ is uncountable? That is, every real in $V[g]$ will appear as a block in $X$, regardless of the size of $\mathbb{R}$. – jonasreitz Feb 16 at 21:38
...I guess this just shows that $V[g][X]$ and $V[X]$ have the same reals - I'm not sure it follows that $g \in V[X]$. – jonasreitz Feb 16 at 21:42
I agree with Andreas. I think this gives an example of an atomic but not =2 quotient. For suppose $B = A$. Let $C \subseteq B$ be the complete subalgebra equivalent to $Add(\omega,\alpha)$. Now let $G \subseteq B$ be generic. Then we trivially compute $G \cap C$ as $(G \cap A) \cap C$. However, let $\pi$ any nontrivial automorphism of $C$. Let $H$ be $C$-generic, and let $X$ be $Add(\omega_1,1)$-generic over $V[H]$, and let $G \subseteq B$ be the corresponding generic.... – mbsq Feb 16 at 21:55
Then $V[G] = V[H][X] = V[\pi H][X]$. Furthermore, $G \cap A$ is fully determined by $X$, so our computation would yield $G \cap A \cap C = H$, but also $G \cap A \cap C = \pi H$, contradiction. – mbsq Feb 16 at 21:56
show 9 more comments

Your Answer

Get an OpenID
or

Not the answer you're looking for? Browse other questions tagged or ask your own question.