On the -base of Finite Lattices: Semidistributive, Modular, and Geometric Lattices
arXiv:2502.04146
Abstract
Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits multiple bases. Among these, the canonical base, the canonical direct base as well as the -base aroused significant attention due to their structural and algorithmic properties. Recently, a new base has emerged from the study of free lattices: the -base. It is a refinement of the -base that, unlike the aforementioned implicational bases, does not always accurately represent its associated closure space. This leads to an intriguing question: for which classes of (closure) lattices do closure spaces have valid -base? Lower-bounded lattices are known to form such a class. In this paper, we prove that for semidistributive lattices, the -base is both valid and minimum. We also characterize those modular and geometric lattices that have valid -base. Finally, we prove that any lattice is a sublattice of a lattice with valid -base.
32 pages, 17 figures, long version