Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Suppose $V\models ZFC$ and $P\in V$ is a poset of forcing conditions.

  • It is a basic theorem in forcing that $V[G]\models ZFC$ for any generic extension by a $V$-generic filter $G$.

  • It is also known that if $V\subseteq M\subseteq V[G]$, and $M\models ZFC$ then $M$ is a forcing extension of $V$ and $V[G]$ is a forcing extension of $M$.

Now, consider $V[G]$ to be some generic extension. We can define in $V[G]$ a transitive subclass which is a model of $ZF$, but often not of $AC$. This is done by considering some permutation group of the forcing conditions and taking only names which obey some condition. The interpretation of this class of special names is called a symmetric extension of $V$.

In most interesting cases the symmetric extension negates the axiom of choice one way or another. This doesn't sit right with the two theorems mentioned above, since if $M$ is actually a generic extension of $V$ then the axiom of choice should hold in $M$, but it does not. (This is nullified by the correction points by Andreas Blass and Amit Kumar Gupta in the comments).

Edit: Instead of the above, then, how much choice is needed to have the second theorem stated in $ZF$ alone? does that depend on the forcing $P$ at hand? If the answer is that the theorem is nontransferable?

The way I see it negative answers would mean at least one of two possible things:

  1. We consider $V$ as a model of $ZF$ and by some forcing which preserves only $ZF$ we obtain $M$ as the generic extension, this is similar to the way we may violate the continuum hypothesis or collapse the continuum to be $\aleph_1$, and so change the truth value of an unprovable statement (very much like $AC$ is unprovable from $ZF$).

  2. $M$ can be achieved by class forcing. I have very little intuition on that topic, so I cannot see any reason why this may be either true or false.

Is my intuition correct?

While we're on the topic, I do recall forcing is indeed possible without choice, but that should require extra assumptions or different methods to handle the genericity. Is there a good introduction to the topic available?

share|improve this question
    
I think the second theorem you quoted, the one saying the intermediate model M is generic over V (and V[G] is generic over M), should have as a hypothesis that M satisfies ZFC. Maybe you found it in some source that has, far from this theorem, a global assumption that only ZFC-models are under consideration. –  Andreas Blass Sep 1 '11 at 22:23
    
In your second bullet, surely some additional hypothesis on $M$ is required. If we take $M = V \cup \{G\}$ then not only is $M$ not a forcing extension of $V$, it fails spectularly to satisfy ZFC, for instance it fails to satisfy pairing, power set, and separation. –  Amit Kumar Gupta Sep 1 '11 at 22:28
    
@Andreas, Amit: Thanks! This completely nullifies half of my question, I'm editing it to make more sense. –  Asaf Karagila Sep 1 '11 at 22:42
add comment

1 Answer

up vote 6 down vote accepted

These intermediate model questions were thoroughly investigated by Serge Grigorieff in Intermediate Submodels and Generic Extensions in Set Theory [Annals of Mathematics 101 (1975), 447-490].

The basic result of the kind you are looking for is due to Solovay (according to Grigorieff):

Let $P$ be a poset in $M$, a model of ZF, and let $G$ be $P$-generic over $M$. If $a \in M[G]$ contains only elements of $M$, then $M[a]$ is a generic extension of $M$ and $M[G]$ is a generic extension of $M[a]$.

This is similar to what you state, but note the special form of the intermediate model. In fact, the intermediate models of ZF between $M$ and $M[G]$ that are generic extensions of $M$ are precisely those of the form $M[a]$ as described above.

When $M$ satisfies ZFC, then any intermediate model of ZFC between $M$ and $M[G]$ is of the form $M[a]$ for some set of ordinals $a \in M[G]$. Thus, your stated result does hold provided that all models involved satisfy ZFC.

Since you mentioned symmetric models in the questions, note that Grigorieff goes on to classify all of those too:

The symmetric submodels of $M[G]$, are all intermediate models of the form $(HOD\ M[a])^{M[G]}$ as $a$ varies over $M[G]$.

share|improve this answer
    
Francois, I always thought that the $HOD(A)$ construction was analogous to taking finite supports in the symmetric extension. If it is the case, then taking any form of infinite support would mean that it is not $HOD(A)$. I have an hypothesis that it would mean the hereditary ordinal definable closure in $\mathcal L_{\kappa\kappa}$ (for some suitable $\kappa$ of course), however that is far from being substantiated in any way so far. –  Asaf Karagila Sep 1 '11 at 23:19
    
Grigorieff's definition of symmetric model is on the bottom of the first page and it's the usual one. The paper is very long and I read it very long ago. I don't recall any unusual definitions in the paper, but you better check for yourself to be sure. –  François G. Dorais Sep 1 '11 at 23:46
    
Hm. Most interesting! I'm going to put this paper on the top of my reading list. Thanks a lot! –  Asaf Karagila Sep 2 '11 at 0:16
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

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