We show that the lattice of noncrossing (set) partitions is self-dual and that it admits a symmetric chain decomposition. The self-duality is proved via an order-reversing involution. Two proofs are given of the existence of the symmetric chain decomposition, one recursive and one constructive. Several identities involving Catalan numbers emerge from the construction of the symmetric chain decomposition.
Read full abstract