nLab
algebraic lattice

Contents

Definition

Definition

An algebraic lattice is a lattice which is

An algebraic lattice is a complete lattice (equivalently, a suplattice, or in different words a poset with the property of having arbitrary colimits but with the structure of directed colimits/directed joins) in which every element is the supremum of the compact elements below it (an element e is compact if, for every subset S of the lattice, e is less than or equal to the supremum of S just in case e is less than or equal to the supremum of some finite subset of S).

Here is an alternative formulation:

Definition

An algebraic lattice is a poset which is locally finitely presentable as a category.

This formulation suggests useful a way of viewing algebraic lattices in terms of Gabriel-Ulmer duality (but with regard to enrichment in truth values, instead of in Set).

As this last formulation suggests, algebraic lattices typically arise as subobject lattices for objects in locally finitely presentable categories. As an example, for any (finitary) Lawvere theory T, the subobject lattice of an object in T-Alg is an algebraic lattice (this class of examples explains the origin of the term “algebraic lattice”, which is due to Garrett Birkhoff).

Properties

The category of algebraic lattices

The morphisms most commonly considered between algebraic lattices are the finitary functors? between them, which is to say, the Scott-continuous functions between them; i.e., those functions which preserve directed joins (hence the parenthetical remarks above).

The resulting category AlgLat is cartesian closed and is dually equivalent to the category whose objects are meet semilattices (construed as categories with finite limits enriched over truth values) and whose morphisms are meet-preserving profunctors between them (using the convention that a V-enriched profunctor from C to D is a functor D op×CV; of course, with an opposite convention, one could similarly state a covariant equivalence).

There is a full embedding

i:AlgLatTop 0i \colon AlgLat \to Top_0

to the category of T 0-spaces, taking an algebraic lattice L to the space whose points are elements of L, and whose open sets U are defined by the property that their characteristic maps

χ U:L2\chi_U: L \to \mathbf{2}

(χ U(a)=1 if aU, else χ U(a)=0) are poset maps that preserve directed colimits. The specialization order of i(L) is L again.

Every T 0-space X occurs as a subspace of some space i(L) associated with an algebraic lattice. Explicitly, let L(X) be the power set of the underlying set of the topology, P𝒪(X), and define

X(iL)(X)X \to (i\circ L)(X)

to take x to N(x){U𝒪(X):xU}. This gives a topological embedding of X in i(L(X)).

Remark

On similar grounds, if U:AlgLatSet is the forgetful functor, then the 2-image of the projection functor π:SetUSet is the category of topological spaces Top. In more nuts-and-bolts terms, an object (S,L,f:SU(L)) gives a space with underlying set S and open sets those of the form f 1(O), where O ranges over the Scott topology on L. Notice that if (f:SS,g:LL) is a morphism in SetU, then f is continuous with respect to these topologies. Therefore the projection π:SetUSet factors through the faithful forgetful functor TopSet. Thus, working in the factorization system (eso+full, faithful) on Cat, we have a faithful functor 2-im(π)Top filling in as the diagonal

SetU Top 2-im(π) Set.\array{ Set \downarrow U & \to & Top \\ \downarrow & \nearrow & \downarrow \\ 2\text{-}im(\pi) & \to & Set. }

But notice also that SetUTop is eso and full. It is eso because any topology 𝒪(S) on S can be reconstituted from the triple (S,P𝒪(S),xN(x):SP𝒪(S)). We claim it is full as well. For, every continuous map XX between topological spaces induces a continuous map between their T 0 reflections X 0X 0, and since algebraic lattices like P𝒪(X) (being continuous lattices) are injective objects in the category of T 0 spaces, we are able to complete to a diagram

X X 0 P𝒪(X) X X 0 P𝒪(X)\array{ X & \to & X_0 & \to & P{|\mathcal{O}(X)|} \\ \downarrow & & \downarrow & & \downarrow \\ X' & \to & X_{0}' & \to & P{|\mathcal{O}(X')|} }

where the rightmost vertical arrow is Scott-continuous (and the horizontal composites are of the form xN(x)). Finally, since SetUTop is eso and full, it follows that 2-im(π)Top is eso, full, and faithful, and therefore an equivalence of categories.

This connection is explored in more depth with the category of equilogical spaces, which can be seen either as a category of (set-theoretic) partial equivalence relations over AlgLat, or equivalently of (set-theoretic) total equivalence relations on T 0 topological spaces.

Relation to locally finitely presentable categories

One of our definitions of algebraic lattice is: a poset L which is locally finitely presentable when viewed as a category. The completeness of L means that right adjoints LSet are representable, given by L(p,):LSet, and we are particularly interested in those representable functors that preserve filtered colimits. These correspond precisely to finitely presentable objects p, which in lattice theory are usually called compact elements. These compact elements are closed under finite joins.

By Gabriel-Ulmer duality, L is determined from the join-semilattice of compact elements K by LLex(K op,Set). Since the elements of K op are subterminal, we can also write LLex(K op,2) where 2=Sub(1).

Theorem

(Porst)

If C is a locally finitely presentable category and X is an object of C, then

  • The lattice of subobjects Sub(X),

  • the lattice of quotient objects (equivalence classes of epis sourced at X) Quot(X),

  • the lattice of congruences (internal equivalence relations) on X

are all algebraic lattices.

This is due to Porst.

Completely distributive lattices

Proposition

The category of Alexandroff locales is equivalent to that of completely distributive algebraic lattices.

This appears as (Caramello, remark 4.3).

The completely distributive algebraic lattices form a reflective subcategory of that of all distributive lattices. The reflector is called canonical extension.

Locally presentable categories: Large categories whose objects arise from small generators under small relations.

(n,r)-categoriessatisfying Giraud's axiomsinclusion of left exaxt localizationsgenerated under colimits from small objectslocalization of free cocompletiongenerated under filtered colimits from small objects
(0,1)-category theory(0,1)-toposesalgebraic lattices Porst’s theoremsubobject lattices in accessible reflective subcategories of presheaf categories
category theorytoposeslocally presentable categories Adámek-Rosický’s theoremaccessible reflective subcategories of presheaf categoriesaccessible categories
model category theorymodel toposescombinatorial model categories Dugger’s theoremleft Bousfield localization of global model structures on simplicial presheaves
(∞,1)-topos theory(∞,1)-toposeslocally presentable (∞,1)-categories
Simpson’s theorem
accessible reflective sub-(∞,1)-categories of (∞,1)-presheaf (∞,1)-categoriesaccessible (∞,1)-categories

References

The relation to locally finitely presentable categories is discussed in

  • Hans Porst, Algebraic lattices and locally finitely presentable categories (pdf)

Revised on October 15, 2012 18:06:54 by Urs Schreiber (82.113.99.246)