\section{Order diameter at most two implies chain diameter at most four}\label{rv-sec:upper} In this section $P$ is an arbitrary finite poset. The proof has two steps. First, the hypothesis $\diam\OP(P)\le2$ forces a local structure: two incomparable elements that have a third element incomparable to both have a common lower bound or a common upper bound (Lemma~\ref{rv-lem:pair}), since otherwise two particular ideals would have no common neighbor. Then, for a split $(A,B)$ of an antichain $U$, one step at each end replaces the elements of $U$ below a maximal element $t$ by $t$ itself, and the common lower bounds given by Lemma~\ref{rv-lem:pair} join the two new antichains in at most two steps; so $d_{\CP}(A,B)\le1+2+1=4$. A \emph{common lower bound} of $p$ and $q$ is an element $z$ with $z\le p$ and $z\le q$; common upper bounds are defined dually. \begin{lemma}[Pair lemma]\label{rv-lem:pair} Suppose that $\diam\OP(P)\le2$. Let $p,q$ be incomparable elements of $P$, and suppose that some third element $r\notin\{p,q\}$ is incomparable to both. Then $p$ and $q$ have a common lower bound or a common upper bound. \end{lemma} \begin{proof} The sets $I={\downarrow}p\cup{\downarrow}q$ and $J=P\setminus({\uparrow}p\cup{\uparrow}q)$ are ideals. An element $x\in I\setminus J$ satisfies $x\le p$ or $x\le q$, and $x\ge p$ or $x\ge q$. As $p,q$ are incomparable, this forces $x\in\{p,q\}$; hence $I\setminus J=\{p,q\}$. Also $r\in J\setminus I$. Thus $I$ and $J$ are not nested, and therefore not adjacent, and since $\diam\OP(P)\le2$ there is an ideal $K$ adjacent to both. By Theorem~\ref{thm:adjacency}, $K$ is nested with $I$ and with $J$. The cases $J\subseteq K\subseteq I$ and $I\subseteq K\subseteq J$ are impossible, since $r\in J\setminus I$ and $p\in I\setminus J$. So $K\subseteq I\cap J$ or $K\supseteq I\cup J$. Suppose that $p,q$ have no common lower bound and no common upper bound. Then ${\downarrow}p$ and ${\downarrow}q$ are disjoint, and no element of ${\downarrow}p$ is comparable to an element of ${\downarrow}q$: if $x\le p$, $y\le q$ and $x\le y$, then $x$ is a common lower bound, and similarly if $y\le x$. Dually for ${\uparrow}p$ and ${\uparrow}q$. If $K\subseteq I\cap J$, then $I\setminus K$ contains $p$ and $q$ and lies in ${\downarrow}p\cup{\downarrow}q$, so it is not connected. If $K\supseteq I\cup J$, then $K\setminus J$ contains $I\setminus J=\{p,q\}$ and lies in $P\setminus J={\uparrow}p\cup{\uparrow}q$, so it is not connected. Both contradict Theorem~\ref{thm:adjacency}. \end{proof} \begin{proof}[Proof of Theorem~\ref{rv-thm:upper}] By Lemma~\ref{lem:split} it suffices to show $d_{\CP}(A,B)\le4$ for every split $(A,B)$ of an antichain $U$. We may assume $U\ne\varnothing$. Pick $u\in U$ and a maximal element $t$ of $P$ with $t\ge u$. Let $U_t=U\cap{\downarrow}t$; it contains $u$. If $t\in U$ then $t=u$ and $U_t=\{u\}$. Put \[ U'=(U\setminus U_t)\cup\{t\},\qquad A_t=(A\setminus U_t)\cup\{t\},\qquad B_t=(B\setminus U_t)\cup\{t\}. \] The set $U'$ is an antichain: $t$ is maximal and lies above no element of $U\setminus U_t$. The difference $A\sd A_t$ is empty if $A\cap U_t=\{t\}$, and otherwise it is $(A\cap U_t)\cup\{t\}$, which is connected because every element of $A\cap U_t$ lies below $t$; so $A$ and $A_t$ are equal or adjacent. In the same way $B_t$ and $B$ are equal or adjacent. Moreover $A_t\sd B_t=U\setminus U_t$ and $A_t\cup B_t=U'$. If $|U\setminus U_t|\le2$, then $d_{\CP}(A_t,B_t)\le|A_t\sd B_t|\le2$ by Proposition~\ref{prop:components}. Otherwise let $v\in U\setminus U_t$ be arbitrary. Then $v$ and $t$ are incomparable, since $v\notin{\downarrow}t$ and $t$ is maximal, and any $r\in U\setminus(U_t\cup\{v\})$ is a third element incomparable to both. By Lemma~\ref{rv-lem:pair}, $v$ and $t$ have a common lower bound or a common upper bound. Since $t$ is maximal, its only upper bound is $t$ itself, and $v\not\le t$; hence $v$ and $t$ have no common upper bound, and there is a common lower bound $z_v$, with $z_vb_j$. (We do not determine $\diam\CP(P_n)$ for $n\le3$.) \end{remark} \begin{theorem}\label{rv-thm:chain} For every $n\ge4$, $d_{\CP(P_n)}(A,B)=4$. Hence $\diam\CP(P_n)=4$. \end{theorem} \begin{proof} \emph{Upper bound.} The sequence \[ A\ \to\ M_A\ \to\ \{h\}\ \to\ M_B\ \to\ B \] is a walk. The states are antichains. $A\sd M_A=A\cup M_A$ is connected, since $m_{ik}$ lies below $a_i$ and $a_k$ and the complete graph on $[n]$ is connected. $M_A\sd\{h\}=M_A\cup\{h\}$ is connected, since every element of $M_A$ lies below $h$. The last two moves are symmetric. \emph{Lower bound.} Suppose $d_{\CP}(A,B)\le3$, and let $A=V_0,V_1,\dots,V_r=B$ be a shortest path, $1\le r\le3$. Put $X=V_1$ and $Y=V_{r-1}$. Then $X\in \mathcal N[A]$, $Y\in \mathcal N[B]$, and $X=Y$ (if $r=2$) or $X$ and $Y$ are adjacent (if $r\in\{1,3\}$; for $r=1$, $X=B$ and $Y=A$). This contradicts Proposition~\ref{rv-prop:nowalk}. So $\diam\CP(P_n)\ge4$. By Theorems~\ref{rv-thm:order} and~\ref{rv-thm:upper}, $\diam\CP(P_n)\le4$. \end{proof} \begin{proof}[Proof of Theorem~\ref{rv-thm:main}] $P_n$ is connected by Lemma~\ref{rv-lem:structure}\ref{rv-it:conn} and has $2n^2+5n+1$ elements. Theorems~\ref{rv-thm:order} and~\ref{rv-thm:chain} give the diameters. \end{proof}