The fundamental theorem of finite semidistributive lattices

Abstract

We prove a Fundamental Theorem of Finite Semidistributive Lattices (FTFSDL), modelled on Birkhoff's Fundamental Theorem of Finite Distributive Lattices. Our FTFSDL is of the form "A poset L is a finite semidistributive lattice if and only if there exists a set Sha with some additional structure, such that L is isomorphic to the admissible subsets of Sha ordered by inclusion; in this case, Sha and its additional structure are uniquely determined by L." The additional structure on Sha is a combinatorial abstraction of the notion of torsion pairs from representation theory and has geometric meaning in the case of posets of regions of hyperplane arrangements. We show how the FTFSDL clarifies many constructions in lattice theory, such as canonical join representations and passing to quotients, and how the semidistributive property interacts with other major classes of lattices. Many of our results also apply to infinite lattices.

arXiv comment49 pages; v2: revised in accordance with suggestions by referees

References in corpus (6)

• Lattice congruences of the weak order
• Noncrossing partitions and the shard intersection order
• Lattice structure of Weyl groups via representation theory of preprojective algebras
• Rowmotion in slow motion
• Lattice Properties of Oriented Exchange Graphs and Torsion Classes
• Minimal inclusions of torsion classes

Cited by in corpus (2)

• Pairwise Compatibility for 2-Simple Minded Collections II: Preprojective Algebras and Semibrick Pairs of Full Rank
• Dynamical Combinatorics and Torsion Classes