is the category whose objects are suplattices and whose morphisms are suplattice homomorphisms, that is functions which preserve all joins (including the bottom element). Analogously, is the category whose objects are inflattices and whose morphisms are inflattice homomorphisms, which preserve all meets.
Actually, and are equivalent; the difference between the two is merely the notational choice between and . However, this choice corresponds to using either of two inclusion functors representing and as replete subcategories of Pos; similarly, CompLat can be viewed as a replete wide subcategory of and in two different ways.
One can write (meaning the category of complete semilattices) if one wishes to remain ambiguous about the notation.
is given by a variety of algebras, or equivalently by an algebraic theory, so it is an equationally presented category; however, it requires operations of arbitrarily large arity. Nevertheless, it is a monadic category (over Set), because it has free objects. Specifically, the free suplattice on a set is the power set of with the operation of union; an element of appears as the singleton subset in .
The free inflattice on is slightly less natural; of course, we can take it to be with the operation of union again, but then the order on the elements is the opposite of the usual order. However, we can also take it to be with the operation of intersection; this uses the fact that complementation is an automorphism of . Then the generator appears as in the lattice.
is a monoidal category; it admits a tensor product which represents binary morphisms: functions which preserve joins separately in each variable. A monoid in is a quantale, including frames as a special case.
In fact, is even a star-autonomous category, and a fortiori a linearly distributive category. The dual of a suplattice is its opposite poset, which is also a suplattice since every suplattice is also an inflattice.
For all practical purposes, is not available in predicative mathematics. The definition goes through, but we cannot prove that has any infinite objects. (More precisely, the power set of any nontrivial small suplattice must be small.) Generally speaking, predicative mathematics treats infinite suplattices only as large objects. Although they are of little interest, we can ask which of the facts above hold predicatively; the answer is that is not wide as a subcategory of , and is not monadic (since is generally large).
In impredicative constructive mathematics, we cannot intepret with intersection as the free inflattice on , since complementation is not an automorphism. Everything else goes through, however, including the interpretation of with reverse inclusion as the free inflattice. In particular, (and hence ) is still a monadic category.