Π₃ — the partition lattice on a 3-set

$\Pi_3$ is the lattice of set partitions of $\{1,2,3\}$ ordered by refinement. It has five elements: the finest partition $\{\{1\},\{2\},\{3\}\}$ at the bottom, the trivial partition $\{\{1,2,3\}\}$ at the top, and the three “two-block” partitions between them. As a lattice it is isomorphic to $M_3$ — but it carries different structure as a geometric lattice: it is the partition lattice of a 3-element matroid, and one of the simplest non-trivial examples of a lattice arising from combinatorial geometry.

Where it appears

• $\Pi_n$ is the intersection lattice of the braid arrangement $A_{n-1}$.
• $\Pi_n$ counts as the natural codomain of the “kernel” operation in algebra: for any function $f \colon X \to Y$, the partition $\ker f$ lives in $\Pi_{|X|}$.
• Hierarchical clustering produces chains in $\Pi_n$; a dendrogram is exactly a maximal chain.

The series $\Pi_n$ grows quickly — its size is the Bell number $B_n$ — but $\Pi_3$ is small enough to draw and large enough to be representative.