This may be a naive question, but I'll pose it.

Is there an example of a notion of forcing $\mathbb{P}$ that has the $\kappa$-c.c. which is not also $\kappa$-Knaster Property also is not "factorable" as a product of partial orderings?

For reference, let me state the relevant definitions and a typical example.

Definition. A partial order $\mathbb{P}$ is $\theta$-c.c. if there is no antichain $A\subseteq\mathbb{P}$ of size $\kappa$.

Definition. A partial order is $\kappa$-Knaster if, for every sequence $\overline{p}=\langle p_\alpha\rangle_{\alpha<\kappa}$ of elements of $\mathbb{P}$ of size $\kappa$, there is an unbounded set $X\subset\kappa$ of ordinals such that $\langle p_\beta\rangle_{\beta\in X}\subset \overline{p}$ which is pairwise compatible.

The prototype example involves a product of Souslin trees:

If $T$ is a Souslin tree, then $T$ has $\omega_1$-c.c. and is therefore also also $\omega_1$-Knaster. However, $T\times T$ is not $\omega_1$-c.c., yet this product is $\omega_1$-Knaster.

Is this an accident of the separability of $T$ or are there "natural" (perhaps even non-separative) examples of partial orders that are not "resolvable" or "decomposable" into products (Cartesian or otherwise) of other partial orders?


After going through much confusion and re-reading my source text several times, I realize that the "prototypical example" I gave above is not $\omega_1$-Knaster. In fact, the very text I was reading from explicitly states this and for whatever reason, I did not see the word "not" there. It turns out this is the most important word in that particular sentence, so many thanks are due to Paul McKenney for raising the issue.

I think my original question was intended to be whether the Knaster property can hold for partial orders that are not decomposable into products of some sort, but obviously I got carried away trying to give some background.

  • 2
    $\begingroup$ I think you mean it is $\kappa-c.c.$ but not $\kappa-$Knaster, since $\kappa-$Knaster implies $\kappa-c.c.$. $\endgroup$ Feb 13 '14 at 8:37
  • $\begingroup$ @MohammadGolshani: Yes, thank you!. I've edited my question. $\endgroup$ Feb 13 '14 at 9:13
  • 4
    $\begingroup$ I still don't understand what you say in the second-to-last paragraph. No $\omega_1$-Aronszajn tree can be $\omega_1$-Knaster. A Souslin tree $T$ is ccc, but its square is neither ccc nor Knaster. $\endgroup$ Feb 13 '14 at 12:51
  • $\begingroup$ @Paul McKenney: Thanks for your comment. I posed the question because I had a deep misunderstanding of the concept and you alerted me to this fact. Thanks! $\endgroup$ Feb 16 '14 at 4:49

Let me concentrate on the case $\kappa=\omega_1.$ Then we know that $MA$ implies every $c.c.c.$ notion of forcing has the Knaster property

On the other hand the following is proved by Judah-Rosłanowski-Shelah in the paper ``Examples for Souslin forcing'':

Theorem. It is consistent that there exists a ccc Souslin forcing notion which does not satisfy the Knaster condition

Their forcing seems to satisfy the conditions you want.

  • 1
    $\begingroup$ How does this answer the question about decomposition into a product? $\endgroup$ Feb 13 '14 at 21:24

Jech states in Chapter 30 of his book that $\diamondsuit$ implies that there exists a Suslin tree whose boolean completion is a simple algebra. This means that it has no nontrivial subalgebras. Such a tree would be c.c.c., not Knaster, and not factorable as a product. I don't know if the construction is written up, but it might be in the book by Devlin and Johnsbraaten.

  • 1
    $\begingroup$ Jech, Simple complete Boolean algebras, Israel J. Math. 18 (1974), 1-10. Jensen's forcing to add a definable real of minimal degree also works because the complete Boolean algebra he used is rigid and minimal. $\endgroup$ Feb 13 '14 at 22:29

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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