\section{Further preliminaries}\label{rv-sec:prelim} In Sections~\ref{rv-sec:prelim}--\ref{rv-sec:remarks}, $P$ is an arbitrary finite poset unless stated otherwise, and a walk may also repeat a state (see below). From Section~\ref{rv-sec:construction} on, the letters $a_i$, $b_j$, $h$, $x_j$, $y_i$, $w_i$, $u^-$, $u^+$, $\sigma$ and $A$, $B$, $U$, $L$, $T$, $W$ denote elements, maps and sets of the poset $P_n$ defined there, not of the band. Two distinct elements of a poset are \emph{comparable} if one is smaller than the other, and \emph{incomparable} otherwise; an element is neither comparable nor incomparable to itself. A subset $D$ of $P$ is \emph{connected} if it is not empty and the comparability graph of $P$ induces a connected graph on $D$. The \emph{components} of a set are its maximal connected subsets. A set $D$ is a \emph{star} at $x$ if $x\in D$ and $x$ is comparable to every other element of $D$; a star is connected. We write $X\sd Y$ for the symmetric difference, ${\downarrow}S$ and ${\uparrow}S$ for the sets of elements below or equal to, respectively above or equal to, some element of $S$, and ${\downarrow}p={\downarrow}\{p\}$, ${\uparrow}p={\uparrow}\{p\}$. A \emph{common lower bound} of $p$ and $q$ is an element $c$ with $c\le p$ and $c\le q$; common upper bounds are defined dually. We use the adjacency criteria of Theorem~\ref{thm:adjacency}: two antichains $X\ne Y$ of $P$ are adjacent in the graph of $\CP(P)$ exactly if $X\sd Y$ is connected, and two ideals are adjacent exactly if they are nested and their difference is connected. We write $d_{\OP}$ and $d_{\CP}$ for the graph distances. A \emph{walk} of length $m$ from $X_0$ to $X_m$ is a sequence $(X_0,\dots,X_m)$ of antichains, its \emph{states}, in which any two consecutive states are equal or have a connected symmetric difference. By Theorem~\ref{thm:adjacency}, consecutive states are equal or adjacent, so $d_{\CP}(X_0,X_m)\le m$. \begin{lemma}[Components]\label{rv-lem:components} Let $J\subseteq I$ be ideals of $P$, and let $C$ be a union of components of $I\setminus J$. Then $J\cup C$ and $I\setminus C$ are ideals. \end{lemma} \begin{proof} Let $z\in C$ and $z'w'_jw_i$ is a path in $P\setminus I$; so $w_k\in\Gamma$. Let $w'_l\notin I$. Then $t_{il}\notin I$, and $w'_lw_i$; so $w'_l\in\Gamma$. A target $u\notin I$ has $u^+\notin I$, so $u$ is joined to $u^+\in\Gamma$. \ref{rv-it:rK} $K$ is an ideal by Lemma~\ref{rv-lem:components} (with the ideals $I\subseteq P$). $K\setminus I=\Gamma$ is connected, so $K$ is adjacent to $I$. By Lemma~\ref{rv-lem:mixed}\ref{rv-it:mJ}, $J\subseteq L\cup U$; here $L\subseteq I$, and every target of $J$ outside $I$ lies in $\Gamma$ by~\ref{rv-it:rall}. So $J\subseteq K$, and $J\ne K$ since $h\in K\setminus J$. \ref{rv-it:rKJ} By~\ref{rv-it:rall}, $K$ contains all of $W$, and $W\cap J=\varnothing$. Every element of $K\setminus J$ outside $U$ is $h$ or comparable to $h$; every target $u\in K\setminus J$ is comparable to $u^+\in K\setminus J$, which is comparable to $h$. So $K\setminus J$ is connected, and $(I,K,J)$ is a path in the graph of $\OP(P)$. \end{proof} \begin{proposition}\label{rv-prop:mixed} For every mixed pair $(I,J)$, $d_{\OP}(I,J)\le2$. \end{proposition} \begin{proof} Let $\Iso=\Iso(I,J)$ and $\Delta=\Iso\cup(J\setminus I)$, a set of targets. For $u\in\Iso$ we have $u^+\notin I$ by definition; for $u\in J\setminus I$ we have $u\notin I$, hence $u^+\notin I$. So if $\Delta$ meets both $A$ and $B$, Lemma~\ref{rv-lem:repair} applies. The automorphism $\sigma$ fixes $h$, so it maps mixed pairs to mixed pairs; it exchanges $A$ and $B$, and $\sigma(u^-)=\sigma(u)^-$ and $\sigma(u^+)=\sigma(u)^+$ for every target $u$. Hence $\Iso(\sigma I,\sigma J)=\sigma(\Iso(I,J))$ and $\sigma J\setminus\sigma I=\sigma(J\setminus I)$, so $\sigma$ carries $\Delta$ to the corresponding set of $(\sigma I,\sigma J)$. As $\sigma$ preserves distances, we may assume from now on that $\Delta\subseteq A$. If $\Delta=\varnothing$, then $J\subseteq I$ and $I\setminus J=\Gamma_h$ is connected (Lemma~\ref{rv-lem:mixed}\ref{rv-it:miso}), so $I$ and $J$ are adjacent. Let $\Delta\ne\varnothing$. Then $J\cap(A\cup Y_A)\ne\varnothing$: a target of $J\setminus I$ lies in $J\cap A$, and $u\in\Iso$ has $u^-\in J\cap Y_A$. Let $J_1$ be the component of $J$ that contains $J\cap(A\cup Y_A)$ (Lemma~\ref{rv-lem:mixed}\ref{rv-it:mone}); then $J_1\subseteq\Lambda_A$. Put $K=J\setminus J_1$. By Lemma~\ref{rv-lem:components} (with the ideals $\varnothing\subseteq J$), $K$ is an ideal, and $J\setminus K=J_1$ is connected; so $K$ is adjacent to $J$. Since $J\setminus I\subseteq J\cap A\subseteq J_1$, we have $K\subseteq I$, and \[ I\setminus K=(I\setminus J)\cup(I\cap J_1)=\Gamma_h\cup\Iso\cup(I\cap J_1). \] We show that every element of this set is joined to $h$ inside it; then $I\setminus K$ is connected, and $K$ is adjacent to $I$ (note $h\in I\setminus K$). \begin{itemize}[leftmargin=*] \item Elements of $\Gamma_h$: by definition. \item Elements of $I\cap J_1$ in $L$: they are comparable to $h$. \item Targets in $I\cap J_1$: such a target is some $a_k$, as $J_1\subseteq\Lambda_A$. Then $y_k\in J$ lies in $J_1$ by the choice of $J_1$, and in $L\subseteq I$; so $y_k\in I\cap J_1$ is comparable to $a_k$ and to $h$. \item Elements of $\Iso$: they are targets of $A$, since $\Iso\subseteq\Delta\subseteq A$. For $a_k\in\Iso$, $y_k=a_k^-\in J\cap Y_A\subseteq J_1$ and $y_k\in L\subseteq I$; so $y_k\in I\cap J_1$ is comparable to $a_k$ and to $h$. \end{itemize} Hence $(I,K,J)$ is a path, and $d_{\OP}(I,J)\le2$. \end{proof} \begin{theorem}\label{rv-thm:order} For every $n\ge2$, $\diam\OP(P_n)=2$. \end{theorem} \begin{proof} Let $I,J$ be ideals. If both contain $h$, both are connected by Lemma~\ref{rv-lem:keyfacts}, so both are adjacent to $\varnothing$. If neither contains $h$, then $P\setminus I$ and $P\setminus J$ are connected, so both are adjacent to $P$. Otherwise one of them contains $h$ and the other does not, and Proposition~\ref{rv-prop:mixed} applies. Hence $\diam\OP(P_n)\le2$. The ideals $\{m_{12}\}$ and $\{m'_{12}\}$ are not nested, so they are not adjacent, and $\diam\OP(P_n)\ge2$. \end{proof} \section{The chain distance of the two target sets of \texorpdfstring{$P_n$}{Pn}}\label{rv-sec:chain} Throughout this section $P=P_n$. For an antichain $X$ let $\mathcal N[X]$ be the set of antichains that are equal or adjacent to $X$. We list the possible forms of the members of $\mathcal N[A]$; by the automorphism $\sigma$ this also describes $\mathcal N[B]$. Let $Z_A$ be the set of elements outside $A$ that are incomparable to every target of $A$, and define $Z_B$ in the same way for $B$. By Lemma~\ref{rv-lem:structure}, ${\downarrow}A=\Lambda_A$ and ${\uparrow}A=A\cup W_A\cup T$, so \[ Z_A=\Lambda_B\cup\{h\}\cup W_B,\qquad Z_B=\Lambda_A\cup\{h\}\cup W_A. \] \begin{lemma}[Neighbors of $A$]\label{rv-lem:neighbors} Every antichain $X\in \mathcal N[A]$ with $X\ne A$ has one of the following forms. \begin{enumerate} \item[\textup{(D)}] $X=A\setminus\{a_i\}$ for some $i$. \item[\textup{(E)}] $X=A\cup\{z\}$ for some $z\in Z_A$. \item[\textup{(L)}] $X=(A\setminus R)\cup S$, where $\varnothing\ne R\subseteq A$, $\varnothing\ne S\subseteq M_A\cup Y_A$, and every element of $S$ lies below some element of $R$ and below no element of $A\setminus R$. \item[\textup{(H)}] $X=(A\setminus\{a_i\})\cup S$ for some $i$, where $S=\{w_i\}$ or $\varnothing\ne S\subseteq\{t_{i1},\dots,t_{in}\}$. \end{enumerate} The letters stand for delete, extend, lower and higher. \end{lemma} \begin{proof} Let $R=A\setminus X$ and $S=X\setminus A$. By Theorem~\ref{thm:adjacency}, $A\sd X=R\cup S$ is connected. If $S=\varnothing$, then $R$ is a connected subset of an antichain, so $|R|=1$: type (D). If $R=\varnothing$, then $S$ is a connected subset of the antichain $X$, so $S=\{z\}$; as $A\cup\{z\}$ is an antichain, $z\in Z_A$: type (E). Let $R,S\ne\varnothing$. Since $R$ and $S$ are antichains and $R\cup S$ is connected with at least two elements, every $s\in S$ is comparable to some element of $R$; and since $X$ is an antichain, $s$ is comparable to no element of $A\setminus R$. Thus $s\in({\downarrow}A\cup{\uparrow}A)\setminus A=M_A\cup Y_A\cup W_A\cup T$. Every element of $M_A\cup Y_A\subseteq L$ lies below every element of $W_A\cup T$ (Lemma~\ref{rv-lem:structure}\ref{rv-it:hub}), so the antichain $S$ lies in $M_A\cup Y_A$ or in $W_A\cup T$. In the first case $X$ has type (L). In the second case every $s\in S$ lies above exactly one target of $A$ (Lemma~\ref{rv-lem:structure}\ref{rv-it:upper}), which belongs to $R$. In the connected bipartite comparability graph on $R\cup S$, every element of $S$ then has exactly one neighbor; a path between two elements of $R$ would pass through an element of $S$ with two neighbors in $R$. So $R=\{a_i\}$ for some $i$, and $S$ is an antichain in ${\uparrow}a_i\setminus\{a_i\}=\{w_i,t_{i1},\dots,t_{in}\}$. As $w_i$ lies below every $t_{ij}$, either $S=\{w_i\}$ or $S\subseteq\{t_{i1},\dots,t_{in}\}$: type (H). \end{proof} Applying $\sigma$, every $Y\in \mathcal N[B]$ with $Y\ne B$ has one of the forms (D$'$) $B\setminus\{b_j\}$; (E$'$) $B\cup\{z\}$ with $z\in Z_B$; (L$'$) $(B\setminus R)\cup S$ with $\varnothing\ne R\subseteq B$, $\varnothing\ne S\subseteq M_B\cup Y_B$, and every element of $S$ below some element of $R$ and below no element of $B\setminus R$; (H$'$) $(B\setminus\{b_j\})\cup S$ with $S=\{w'_j\}$ or $\varnothing\ne S\subseteq\{t_{1j},\dots,t_{nj}\}$. \begin{lemma}[An isolated element]\label{rv-lem:isolated} Let $X,Y$ be antichains and $G=X\sd Y$. If $u\in X\setminus Y$ is comparable to no element of $Y$, then no element of $G$ is comparable to $u$. Consequently, if moreover $|G|\ge2$, then $G$ is not connected. The same holds with $X$ and $Y$ exchanged. \end{lemma} \begin{proof} An element of $G$ comparable to $u$ would lie in $X$ or in $Y$. It is not in the antichain $X$, which contains $u$, and not in $Y$ by hypothesis. \end{proof} We record which elements of a neighbor of $B$ are equal or comparable to targets of $A$. Call an element $z$ \emph{attached} to a target $u$ if $z=u$ or $z$ is comparable to $u$. \needspace{6\baselineskip} \begin{lemma}\label{rv-lem:attached} Let $Y\in \mathcal N[B]$. \begin{enumerate} \item\label{rv-it:aDL} If $Y=B$ or $Y$ has type \textup{(D$'$)} or \textup{(L$'$)}, then $Y\subseteq\Lambda_B$, and no element of $Y$ is attached to a target of $A$. \item\label{rv-it:aE} If $Y=B\cup\{z\}$ has type \textup{(E$'$)}, then $z$ is the only element of $Y$ that can be attached to a target of $A$, and it is attached to at most two of them. \item\label{rv-it:aH} If $Y=(B\setminus\{b_j\})\cup S$ has type \textup{(H$'$)}, then $Y\cap A=\varnothing$, the only elements of $Y$ comparable to targets of $A$ are the tops $t_{pj}\in S$, and $t_{pj}$ is comparable to $a_p$ only. \end{enumerate} The same statements hold with $A$ and $B$ exchanged, for $X\in \mathcal N[A]$. \end{lemma} \begin{proof} \ref{rv-it:aDL} follows from Lemma~\ref{rv-lem:structure}\ref{rv-it:sides}. For~\ref{rv-it:aE}: $B\subseteq\Lambda_B$, and $z\in Z_B=\Lambda_A\cup\{h\}\cup W_A$. If $z=a_k$, it is attached to $a_k$ only; if $z=m_{ik}$, to $a_i$ and $a_k$; if $z=y_i$, to $a_i$ only; if $z=h$, to none; if $z=w_i$, to $a_i$ only (Lemma~\ref{rv-lem:structure}). For~\ref{rv-it:aH}: $S\subseteq\{w'_j,t_{1j},\dots,t_{nj}\}$ and $B\setminus\{b_j\}\subseteq\Lambda_B$, so $Y\cap A=\varnothing$, and the elements of $B\setminus\{b_j\}$ are comparable to no target of $A$ (Lemma~\ref{rv-lem:structure}\ref{rv-it:sides}); $w'_j$ is comparable to no target of $A$ (Lemma~\ref{rv-lem:structure}\ref{rv-it:target}), and $t_{pj}$ is comparable to $a_p$ only (Lemma~\ref{rv-lem:structure}\ref{rv-it:upper}). \end{proof} \begin{proposition}\label{rv-prop:nowalk} Let $n\ge4$. For all $X\in \mathcal N[A]$ and $Y\in \mathcal N[B]$, the set $X\sd Y$ is nonempty and disconnected. In particular $X\ne Y$, and $X$ and $Y$ are not adjacent. \end{proposition} \begin{proof} Let $G=X\sd Y$. We call $X$ \emph{low} if $X=A$ or $X$ has type (D) or (L), so that $X\subseteq\Lambda_A$ is nonempty; similarly $Y$ is low if $Y=B$ or $Y$ has type (D$'$) or (L$'$). Otherwise $X$ has type (E) or (H) and contains at least $n-1$ targets of $A$, and similarly for $Y$. Cases~1, 2, 3 and~5 below use only $n\ge3$; Case~4 uses $n\ge4$. \emph{Case 1: $X$ and $Y$ are low.} Then $X\subseteq\Lambda_A$ and $Y\subseteq\Lambda_B$ are nonempty and disjoint, so $G=X\cup Y$, and no element of $X$ is comparable to an element of $Y$ (Lemma~\ref{rv-lem:structure}\ref{rv-it:sides}). So $G$ is not connected. \emph{Case 2: $X$ is low and $Y$ is not.} $Y$ contains at least $n-1\ge2$ targets of $B$. No element of $X\subseteq\Lambda_A$ is attached to a target of $B$. So these targets lie in $Y\setminus X\subseteq G$ and are comparable to no element of $X$; as there are at least two of them, Lemma~\ref{rv-lem:isolated} applies. The case where $Y$ is low and $X$ is not is symmetric. \emph{Case 3: $X=A\cup\{z\}$ and $Y=B\cup\{z'\}$, of types \textup{(E)} and \textup{(E$'$)}.} By Lemma~\ref{rv-lem:attached}\ref{rv-it:aE}, at most two targets of $A$ are attached to elements of $Y$. So at least $n-2\ge1$ target of $A$ lies in $X\setminus Y$ and is comparable to no element of $Y$. By the same lemma with $A$ and $B$ exchanged, at least $n-2\ge1$ target of $B$ lies in $Y\setminus X$; so $|G|\ge2$, and Lemma~\ref{rv-lem:isolated} applies. \emph{Case 4: $X=A\cup\{z\}$ of type \textup{(E)} and $Y=(B\setminus\{b_j\})\cup S$ of type \textup{(H$'$)}.} By the version of Lemma~\ref{rv-lem:attached}\ref{rv-it:aE} with $A$ and $B$ exchanged, $z$ is the only element of $X$ that can be attached to a target of $B$, and it is attached to at most two of them. The set $Y$ contains the $n-1\ge3$ targets of $B\setminus\{b_j\}$. So some $b\in Y\cap B$ is not attached to $z$; then $b\in Y\setminus X$, and $b$ is comparable to no element of $X$. Also $A\subseteq X\setminus Y$, as $Y\cap A=\varnothing$; so $|G|\ge2$, and Lemma~\ref{rv-lem:isolated} applies. See Remark~\ref{rv-rem:small}. The case of types (H) and (E$'$) is symmetric. \emph{Case 5: $X=(A\setminus\{a_i\})\cup S$ of type \textup{(H)} and $Y=(B\setminus\{b_j\})\cup S'$ of type \textup{(H$'$)}.} Fix $p\ne i$. Then $a_p\in X\setminus Y$, so $a_p\in G$. The elements comparable to $a_p$ are $y_p$, the $m_{pk}$, $w_p$ and the $t_{pq}$. None of them lies in $X$: they are not targets, and none of them lies in ${\uparrow}a_i$, which contains $S$ (the elements below $a_p$ are not above $a_i$ by Lemma~\ref{rv-lem:structure}\ref{rv-it:target}, and by Lemma~\ref{rv-lem:structure}\ref{rv-it:upper} no element of ${\uparrow}a_i\setminus\{a_i\}$ lies above $a_p$). The only one that can lie in $Y$ is $t_{pj}$, if $t_{pj}\in S'$. In that case $t_{pj}\notin X$, so $t_{pj}\in G$. The elements comparable to $t_{pj}$ are the elements of ${\downarrow}t_{pj}\setminus\{t_{pj}\}=\{w_p,w'_j,a_p,b_j,h\}\cup L$. Of these, only $a_p$ lies in $X\cup Y$: $w_p\notin X$ since $p\ne i$, and $w_p\notin Y$; $w'_j\notin Y$ since $S'\subseteq T$ when $t_{pj}\in S'$, and $w'_j\notin X$; $b_j$ lies in neither; and no element of $L\cup\{h\}$ lies in $X\cup Y$, because sets of types (H) and (H$'$) contain only targets, upper connectors and tops. Hence the component of $a_p$ in $G$ is contained in $\{a_p,t_{pj}\}$. But $G$ also contains the targets of $B\setminus\{b_j\}$, which lie outside $\{a_p,t_{pj}\}$; so $G$ is not connected. The cases cover all pairs: by the remark on low sets, a non-low $X$ has type (E) or (H), and a non-low $Y$ has type (E$'$) or (H$'$). Each case exhibits elements of $G$, so $G$ is nonempty and $X\ne Y$; and since $G$ is disconnected, $X$ and $Y$ are not adjacent, by Theorem~\ref{thm:adjacency}. \end{proof} \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 a star at $h$. The last two moves are symmetric. \emph{Lower bound.} Suppose $d_{\CP}(A,B)\le3$, and let $A=Q_0,Q_1,\dots,Q_d=B$ be a shortest path, $1\le d\le3$. Put $X=Q_1$ and $Y=Q_{d-1}$. Then $X\in \mathcal N[A]$, $Y\in \mathcal N[B]$, and $X=Y$ (if $d=2$) or $X$ and $Y$ are adjacent (if $d\in\{1,3\}$; for $d=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} \section{Remarks}\label{rv-sec:remarks} \begin{remark}[Small $n$]\label{rv-rem:small} For $n\in\{2,3\}$ the antichains $A$ and $B$ of $P_n$ are at distance at most $3$. With $F=[n]\setminus\{1\}$ if $n=3$, and $F=\{1,2\}$ if $n=2$, the sequence \[ A\ \to\ (A\setminus\{a_1\})\cup\{t_{11},\dots,t_{1n}\}\ \to\ B\cup\{m_F\}\ \to\ B \] is a walk: the first move is a star at $a_1$; in the middle difference, $m_F$ lies below the retained targets of $A$ and below every top, and $t_{1j}$ lies above $b_j$; the last move removes $m_F$. This is the case of types (H) and (E$'$), symmetric to Case~4 of the proof of Proposition~\ref{rv-prop:nowalk}, which $n\ge4$ excludes: for $n\ge4$, three targets of $A$ are retained, and the added pair minimum lies below only two of them. We do not determine $\diam\CP(P_2)$ and $\diam\CP(P_3)$; by Theorems~\ref{rv-thm:order} and~\ref{rv-thm:upper}, both are at most $4$. \end{remark} \begin{remark}[Computations]\label{rv-rem:comp} The following checks were made before and after the hand proofs; they are not inputs to any proof. For $P_4$, three independently written programs find $|\mathcal N[A]|=|\mathcal N[B]|=152$ (the antichain $A$ itself, $4$ of type (D), $19$ of type (E), $64$ of type (H) and $64$ of type (L)), and confirm that no pair in $\mathcal N[A]\times \mathcal N[B]$ is equal or adjacent; one of them also finds $|\mathcal N[A]|=|\mathcal N[B]|=1165$ for $P_5$ (again counting $A$ and $B$ themselves), and again no such pair. The poset $P_4$ has $275744$ ideals (and antichains); Lemma~\ref{rv-lem:keyfacts} holds for all of them. For mixed pairs, an ideal adjacent to both ideals of the pair, of the kinds used in Section~\ref{rv-sec:order}, was found for every pair when $n\in\{2,3\}$, for $220000$ random pairs with $n=4$ and, in a second program, for $20076$ further random pairs with $4\le n\le7$. A further program searched all $275744$ ideals of $P_4$ for a common neighbor of $12200$ sampled mixed pairs and found one in every case. \end{remark} \begin{remark}[Larger differences]\label{rv-q:open} Whether $\diam\CP(P)-\diam\OP(P)$ is bounded on connected finite posets is Question~\ref{q:unbounded}. An example with difference at least $3$ must have $\diam\OP(P)\ge3$. Indeed, the empty poset has both diameters $0$. If $P$ is nonempty and $\diam\OP(P)\le1$, then any two ideals are nested; incomparable elements $p,q$ would give the non-nested ideals ${\downarrow}p$ and ${\downarrow}q$, so $P$ is a chain. Then the antichains are $\varnothing$ and the singletons; any two of them are adjacent, and $\diam\CP(P)=1$. If $\diam\OP(P)=2$, Theorem~\ref{rv-thm:upper} applies. \end{remark}