nLab
Lat

LatLat is the category whose objects are 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). LatLat is a subcategory of Pos.

LatLat is given by a finitary variety of algebras, or equivalently by a Lawvere theory, so has all the usual properties of such categories. By general abstract nonsense, the free lattice on a set XX exists, but it is not easy to describe in general.

  • The free lattice on the empty set is the Boolean domain {,}\{\bot, \top\}.
  • The free lattice on a singleton {x}\{x\} is the 33-element totally ordered set {,x,}\{\bot, x, \top\}.
  • The free lattice on {x,y}\{x,y\} is (if I haven't messed up) {,xy,x,y,xy,}\{\bot, x \wedge y, x, y, x \vee y, \top\}.
  • The free lattice on 33 generators, despite the simplicity of the previous examples, is infinite.
  • The free lattice on any countable set can be made into a sublattice of the free lattice on 33 generators!
  • The free lattice on an uncountable set is uncountable, of course.

The results about the free lattice on 33 generators may be found in Section 4.6 of Stone Spaces, which sites Skornjakov's Elements of Lattice Theory.

category: category

Created on January 31, 2010 05:18:39 by Toby Bartels (173.60.119.197)