Convex partitions of a finite lattice (Q997121)

A subset \(S\) of a partially ordered set \(P\) is called convex if \(x\leq y\leq z\) with \(x,z\in S\) implies that \(y\in S\). A partition \(C={\dot\cup}_{\alpha \in A} C_\alpha\), where \(\dot\cup\) denotes the disjoint union symbol, is called a convex partition if each of the blocks \(C_\alpha\) of \(C\) is a convex subset of \(P\) for all \(\alpha\in A\). The author introduces and studies the lattice of convex partitions for a lattice \(L\). He proves, especially, that if \(L\) is a finite lattice, the lattice \(C_L\) of convex partitions of \(L\) is modular if, and only if, \(L\) is a finite chain.