The fundamental theorem of finite semidistributive lattices (Q2046885)

It is known that a finite poset \(L\) is a distributive lattice if and only if it is isomorphic to \(Downset(P)\) for some finite poset \(P\). The authors prove a similar result for semidistributive lattices. Theorem 2.1. A finite poset \(L\) is a semidistributive lattice if and only if there exists a set \(S\) with some additional structure, such that \(L\) is isomorphic to the admissible subsets of \(S\) ordered by inclusion. In this case, \(S\) and its additional structure are uniquely determined by \(L\). All of these concepts are defined in the paper. The authors also study an infinite case and prove a number of theorems on semidistributive lattices and the mentioned construction.