For every $n \in \mathbb{N}$, let $NC(n)$ denote the set of noncrossing partitions of $[n] := \{1,\dots,n\}$ with respect to the usual cyclic order, ordered by refinement: for $\pi,\sigma \in NC(n)$, write $\pi \leq \sigma$ if every block of $\pi$ is contained in a block of $\sigma$. Then $(NC(n),\leq)$ is a lattice.