Does there exist a partial order, nontrivial for forcing, that is countably closed, but whose separative quotient is not countably closed? Supposing the answer is yes, then is there a partial order, nontrivial for forcing, that is countably closed, but is not forcing equivalent to any countably closed separative partial order?
For those of you unfamiliar with the separative quotient of a partial order, it is defined as follows. Two elements of a partial order are compatible iff there is some element below both of them. We form the separative quotient of a partial order by taking equivalence classes: x is equivalent to y when x and y are compatible with the exact same things. We then define a new partial order for the separative quotient -- $x leq y$ iff everything compatible with x is compatible with y.
A partial order is said to be separative if whenever $x nleq y$, there is $z leq x$ such that z is incompatible with y. The separative quotient of any partial order is separative.
Some of the ways, order-theoretically speaking, that two partial orders can be forcing equivalent are
(1) They are isomorphic, or more generally,
(2) A dense subset of one of them is isomorphic to a dense subset of the other.
No comments:
Post a Comment