Sign up ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

For the notion of distributivity of forcings, we have equivalent defintions, one combintorial, the other in terms of what the generic extensions look like. For a partial order $\mathbb{P}$, the following are equivalent:

1) Forcing with $\mathbb{P}$ adds no new functions from ordinals to ordinals with domain $\kappa$.

2) The intersection of $\kappa$ many dense open subsets of $\mathbb{P}$ is dense.

$\kappa$-closure of partial orders is definitely not a forcing invariant, as witnessed just by the fact that an atomless complete boolean algebra is never countably closed. However, we can ask is there a characterization partial orders $\mathbb{P}$ in terms of what happens in their generic extensions that is equivalent to the following: The boolean completion of $\mathbb{P}$ has a $\kappa$-closed dense subset?

EDIT: Changed the question in light of the example mentioned by Dorais.

share|cite|improve this question
It seems to me that having a $\kappa$-closed dense subset automatically makes you forcing equivalent to a $\kappa$-closed partial order, and in the other direction being forcing equivalent to a $\kappa$-closed partial order means you must have a $\kappa$-closed dense subset; so this stronger property is basically just $\kappa$-closure. Is this correct? – Noah Schweber Sep 19 '12 at 1:45
Or rather, this stronger property is just "is forcing equivalent to a $\kappa$-closed poset." – Noah Schweber Sep 19 '12 at 4:04
Noah, yes that's right. But to me this is just a different way of stating a combinatorial property of the forcing. – Monroe Eskew Sep 19 '12 at 5:03
Sorry, maybe I didn't understand your question. Isn't theorem VII 6.14 in Kunen's book (consequence of lambda-closedness) an answer to your question? Also, how does forcing invariants (in Francois' answer) answer your question? – Eran Sep 19 '12 at 11:25
Eran, the theorem you mention just shows that closure implies distributivity. What I'm looking for is some property of generic extensions that implies closure. Francois' answer shows that there can be equivalent forcing notions which differ on the property of having a dense countably closed subset, thus the implication I'm looking for cannot be found. However this doesn't really get at the issue I am interested, so I will rephrase my question. – Monroe Eskew Sep 19 '12 at 16:56

1 Answer 1

Actually, "having a $\kappa$-closed dense subset" is not (necessarily) a forcing invariant. In his paper On the existence of a $\sigma$-closed dense subset [Comment. Math. Univ. Carolin. 51 (2010), 513-517; MR2741884], Jindra Zapletal shows that it is relatively consistent with ZFC that there is a partial order $(P \cup Q,{\leq})$ in which $P$ and $Q$ are both dense, $(P,{\leq})$ is $\omega_1$-closed but $(Q,{\leq})$ has no $\omega_1$-closed dense subset. It is an open problem whether such an example provably exists in ZFC.

This example shows that a nice characterization is unlikely in general. However, Matt Foreman [J. Symbolic Logic 48 (1983), 714-723; MR0716633] and Petr Vojtáš [Comment. Math. Univ. Carolin. 24 (1983), no. 2, 349–369; MR0711272] have found some useful partial results.

share|cite|improve this answer
However, a dense embedding from one seperative partial order to another implies that their respective boolean completions are isomorphic. (right?) For this question I am more interested in combinatorial properties of the boolean completion (because it's the canonical representiative of the forcing-equivalence class) vs. things satisfied by the generic extension. I'm not sure if I can give a rigorous definition of what I'm looking for, but the equivalent formulations of distributivity properties, plus things like weak $(\lambda,\kappa)$-saturation seem to capture the spirit. – Monroe Eskew Sep 19 '12 at 6:07
The papers by Foreman and Vojtáš have what you want but the results are partial. Their results are also optimal, in some sense, because of Zapletal's example. Zapletal's example shows that it is generally hard to tell which complete Boolean algebras have a $\kappa$-closed dense subset. – François G. Dorais Sep 19 '12 at 7:24

Your Answer


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.