Assume GCH and that $\kappa$ is a regular uncountable cardinal. Let $\mathbb{P}$ be a separative, $<\kappa$-directed closed, nowhere trivial, $\kappa^+$-cc poset of size $\kappa^+$. Must $\mathbb{P}$ be forcing equivalent to $\text{Col}(\kappa, < \kappa^+)$? (which I believe is equivalent to adding $\kappa^+$ many Cohen subsets of $\kappa$). If not, then what if we also assume that the $<\kappa$ directed closure of $\mathbb{P}$ is witnessed by greatest lower bounds? (i.e. that $\mathbb{P}$ satisfies a strong version of the ``well-met" requirement).


This question is somewhat related to the following earlier question on MO:["Resembling the Levy collapse"](https://mathoverflow.net/questions/121352/resembling-the-levy-collapse). There it was shown that for $\delta > \kappa$ where $\delta$ is inaccessible, the Silver collapse to turn $\delta$ into $\kappa^+$ has all the relevant properties but is not equivalent to Levy collapse $\text{Col}(\kappa, < \delta)$. I don't think the analogue of the Silver collapse between $\kappa$ and $\kappa^+$ is $\kappa^+$-cc, however, so I don't think that provides a counterexample to this question.



Forcings that are not equivalent to Levy collapse
First note that in the special case $\kappa = \omega\_1$, countably closed implies countably directed-closed.


**Answer 1:** No. In any model of CH, there is a countably closed, $\omega\_2$-c.c. forcing that is inequivalent to $\mathbb P = \text{Add}(\omega\_1,\omega\_2)$.


Proof: Let $\mathbb Q$ be Jensen's partial order for adding a Kurepa tree. Conditions are $(t,b)$, where $t$ is a countable tree of successor height $\alpha$, $b$ is a countable subset of $\mathcal P(\omega\_1)$, and for all $x \in b$, $x \cap \alpha \subseteq t$. Ordering is $(t\_1,b\_1) \leq (t\_0,b\_0)$ when $t\_1$ end-extends $t\_0$ and $b\_0 \subseteq b\_1$. It is not hard to show that $\mathbb Q$ is countably closed and $\omega\_2$-c.c. under CH. Any two conditions with the same first coordinate are compatible. The union of the first coordinates in any generic is a Kurepa tree $T$ by a density argument.


Note that every subset of $\omega\_1$ added by $\mathbb P$ is added by some $\omega\_1$-sized regular suborder. If $\mathbb Q$ were forcing equivalent to $\mathbb P$, then there would be some $\omega\_1$-sized regular subalgebra $\mathbb R$ of $ro(\mathbb Q)$ that adds the generic Kurepa tree $T$. $\mathbb Q$ forces an $\omega\_2$-size subset of $\mathcal P(\omega\_1)^V$ to be contained in the set of branches of $T$. Thus suppose $G \* H$ is $\mathbb R \* \mathbb Q / \mathbb R$-generic. But in $V[G]$ we can compute whether $(p,q) \in H$, since we just determine whether $p \subseteq T$ and whether all $x \in q$ are branches of $T$. Thus $V[G \* H] = V[G]$, and $\mathbb Q$ must have a dense set of size $\omega\_1$. But this is false: If $\{ (t\_i,b\_i) : i < \omega\_1 \} \subseteq \mathbb Q$, then pick $x \notin \bigcup b\_i$. No $(t\_i,b\_i)$ can force $x$ to be a branch of $T$ since we can extend $t$ to rule out $x$ as a branch.


Note that $\mathbb Q$ doesn't have infima to countable chains since we have a lot of choices for the "top level" of the countable tree. But...


**Answer 2:** Not necessarily, even for $\omega\_1$-closed with infima. Let $V$ be a model of GCH, and let $G \subseteq \text{Col}(\omega\_1,\omega\_2)$ be generic. $\omega\_3^V = \omega\_2^{V[G]}$. I claim that in $V[G]$, $\mathbb P = \text{Col}(\omega\_1,<\omega\_2)^{V[G]}$ and $\mathbb Q = \text{Col}(\omega\_2,<\omega\_3)^{V}$ are both countably closed with infima and both $\omega\_2$-c.c., but are not forcing equivalent.


The closure follows from the fact that $V$ and $V[G]$ have the same countable sequences. The $\omega\_2$-c.c. for $\mathbb Q$ follows from the fact that $\mathbb Q \times \text{Col}(\omega\_1,\omega\_2)$ is $\omega\_3$-c.c. in $V$.


Next, one can prove a similar fact to [Mohammad's answer](https://mathoverflow.net/questions/121352/resembling-the-levy-collapse). In $V[G]$,


**(1)** $\Vdash\_{\mathbb P} \exists A \in [\omega\_2]^{\omega\_2}$ such that $A$ does not contain any $\omega\_1$-sized set from $V[G]$.


**(2)** $\Vdash\_{\mathbb Q} \exists A \in [\omega\_2]^{\omega\_2}$ such that for all $X \in [\omega\_2]^{\omega\_2} \cap V[G]$, there is $y \in [X]^{\omega\_1} \cap V[G]$ such that $y \cap A = \emptyset$.


The justification for **(1)** is the same as for Mohammad's answer. To see **(2)**, let $\dot A$ be a name for a code of the generic $H$ for $\mathbb Q$. In $V$, let $\dot B$ be a name for a code for $G \times H$. If $X \in ([\omega\_2]^{\omega\_2})^{V[G]}$, let $\dot X$ be a name for it in $V$. Let $p \in \text{Col}(\omega\_1,\omega\_2)$ be arbitrary, and let $\{ p\_i : i < \omega\_3 \} \subseteq \text{Col}(\omega\_1,\omega\_2) \restriction p$ be such that $p\_i$ decides the $i^{th}$ member of $\dot X$. Let $p'$ be such that $p\_i = p'$ for $\omega\_3$ many $i$, giving a large set $Y$ such that $p' \Vdash \check Y \subseteq \dot X$. Let $q \in \mathbb Q$ be arbitrary. Interpreting $Y$ as a subset of $\mathbb Q$, find $Y' \subseteq Y$ of size $\omega\_3$ such that $q \nleq y$ for all $y \in Y'$. For each such $y$, choose $q\_y \leq q$ such that $q\_y \perp y$. Now form a $\Delta$-system among the $q\_y$, and let $z$ be an infimum of a set $S$ of $\omega\_1$ many of them. Then $z$ forces that the generic $H$ misses $y$ for $q\_y \in S$. As $p$ and $q$ were arbitrary, we are done.


Likewise, we can show that $\mathbb P$ forces the negation of the the property under the forcing sign in **(2)**, and vice versa. Some details are in section 2.1.2 of my thesis. I may post more later.


