Birkhoff's representation theorem for finite distributive lattices
ProvedFamousTheorems.birkhoff_representation_finite_distributiveBirkhoff's representation theorem for finite distributive lattices. Every finite distributive lattice is isomorphic to the lattice of lower sets (down-closed subsets) of the poset of its join-irreducible elements.
The isomorphism sends to the set of join-irreducible elements below . The theorem says that finite distributive lattices and finite posets carry the same information. It is the finite case of Stone and Priestley duality and is a basic tool in combinatorics and order theory.
Formalization note. Mathlib's OrderIso.lowerSetSupIrred, which is a construction, so the statement asserts the existence of an order isomorphism α ≃o LowerSet {a : α // SupIrred a}. SupIrred a says that is join-irreducible: is not the bottom element and forces or . The lattice is assumed to have a bottom element, which is automatic for a nonempty finite lattice.
import Mathlib
namespace FamousTheorems
theorem birkhoff_representation_finite_distributive {α : Type*} [DistribLattice α] [Fintype α] [OrderBot α] :
Nonempty (α ≃o LowerSet {a : α // SupIrred a}) := by sorry
end FamousTheorems