The core of finite lattices (Q1176723)

This paper contains the lattice-theoretic analysis of a rather obvious but useful result (due to the same author but also present in database dependency theory) describing closure operators on finite sets \(U\) by means of ``bases'' of dependencies \(X\to A\), where \(X\subseteq U\), \(A\in U\), which are minimal in the sense that none of the \(X\)'s can be omitted. The closures of the \(X\)'s are the essential elements in the lattice \(L\) of closed sets. Together with the join irreducibles they form a partial lattice having \(L\) as its filter lattice. For modular lattices the essential elements are those which are the pairwise joins of at least 3 irreducibles. Characterizations are also given for upper and lower semimodular lattices and their atomistic special cases as well as for meet-distributive lattices. This allows a fruitful new view on the structure of lattices in some of these classes. Last but not least reading is recommended for the witty style.