# A least model contains a given model and a given set

I have known that for a transitive model of ZFC, M, x is a M-generic filter of some forcing notion in M, then M[x] is least transitive model of ZFC which contains M and $\{x\}$. M[x] is just the set of all values of names in M. My question is, if I replace "a M-generic filter of some forcing notion in M" by an arbitrary subset of some element of M, how to define such a least model? i.e. M is a transitive model of ZFC, x is a set and x is a subset of some element of M. Can we define a least transitive model M[x] of ZFC such that $M\subset{M[x]}$ and $x\in{M[x]}$?

-
As pointed out in the answer to the question linked to above, in some cases there exists such a model M[x]. Now the question is, how could you obtain information about M[x] if you only happen to "know" what's in M? That's the magic of forcing notions and the relation of forcing, that you can actually get information about M[x] from the elements of M only. I don't know if you can do something analogous when adjoining just any set x to your model M. – David FernandezBreton Apr 4 '12 at 6:06
I vaguely recall that there is some result of the sort that if such an $M[x]$ exists, then it is in fact equivalent to a forcing extension. – Emil JeÅ™ábek Apr 4 '12 at 10:30
This is the case if x is an element of a forcing extension. – Juris Steprans Apr 4 '12 at 10:51
The link above might not exactly be the answer as it talks about set models of ZFC, and here Song Li probably allows classes as well. In this case there is always such a model - it should be defined similar to definition (13.24) in Jech's "Set Theory", relative constructibility, by closing under Goedels operations. @Emil - you probably refer to Jensen's coding theorem (see "Coding the Universe" by Beller, Jensen and Welch). – Eran Apr 5 '12 at 20:29