nLab
DistLat

DistLat is the category whose objects are distributive lattices and whose morphisms are lattice homomorphisms, that is functions which preserve finitary meets and joins (equivalently, binary meets and joins and the top and bottom elements). DistLat is a subcategory of Pos and a replete subcategory of Lat.

DistLat is given by a finitary variety of algebras, or equivalently by a Lawvere theory, so has all the usual properties of such categories. The free distributive lattice on a set X is the set of irredundant finite subsets of the finite power set 𝒫 fin of X; a collection 𝒞 of subsets of X is irredundant if, whenever AB for A,B𝒞, we have A=B (that is, no two distinct elements of 𝒞 may be comparable). Note that 𝒫 finX is the free semilattice on X; we may interpret an element of it as a finitary join of elements of X. Then we interpret an element of 𝒫 fin𝒫 finX as a finitary meet of elements of 𝒫 finX. However, if two of the elements of 𝒫 finX that appear in this meet are comparable, then we need only the smaller of them, so we take only the irredundant elements of 𝒫 fin𝒫 finX. (We could equally well take joins of meets instead of meets of joins; then we keep only the larger of two meets that appear in a given join.)

category: category