nLab
filtered category

Filtered categories

Idea

A filtered category is a categorification of the concept of directed set. In addition to having an upper bound (but not necessarily a coproduct) for every pair of objects, there must also be an upper bound (but not necessarily a coequaliser) for every pair of parallel morphisms.

A diagram F:DC where D is a filtered category is called a filtered diagram. A colimit of a filtered diagram is called a filtered colimit.

A category whose opposite is filtered is called cofiltered.

Definitions

A (finitely) filtered category (sometimes called a filtrant category, as for instance in Kashiwara–Schapira's book Categories and Sheaves) is a category C in which any finite diagram has a cocone. That is, for any finite category D and any functor F:DC, there exists an object cC and a natural transformation FΔc where Δc:DC is the constant diagram at c.

Equivalently, filtered categories can be characterized as those categories where, for every finite diagram J, the diagonal functor Δ:CC J is final. This point of view can be generalized to other kinds of categories whose colimits are well-behaved with respect to a type of limit, such as sifted categories.

This can be rephrased in more elementary terms by saying that:

  • There exists an object of C (the case when D=)
  • For any two objects c 1,c 2C, there exists an object c 3C and morphisms c 1c 3 and c 2c 3.
  • For any two parallel morphisms f,g:c 1c 2 in C, there exists a morphism h:c 2c 3 such that hf=hg.

Just as all finite colimits can be constructed from initial objects, binary coproducts, and coequalizers, so a cocone on any finite diagram can be constructed from these three.

More generally, if κ is a cardinal number, then a κ-filtered category is one such that any diagram DC has a cocone where D has fewer than κ arrows. Note that a preorder is κ-filtered as a category just when it is κ-directed as a preorder.

Examples