nLab
sifted category

Contents

Definition

Definition

A category D is called sifted if colimits of diagrams of shape D (called sifted colimits) commute with finite products in Set: for every diagram

F:D×SSet,F : D \times S \to Set \,,

where S is a finite discrete category the canonical morphism

(lim dD sSF(d,s)) sSlim dDF(d,s)({\lim_\to}_{d \in D} \prod_{s \in S} F(d,s)) \to \prod_{s \in S} {\lim_\to}_{d \in D} F(d,s)

is an isomorphism.

D is called cosifted if the opposite category D op is sifted.

A colimit over a sifted diagram is called a sifted colimit.

Properties

Characterizations

Proposition

An inhabited small category D is sifted precisely if the diagonal functor

DD×DD \to D \times D

is a final functor.

This is due to (GabrielUlmer)

More explicitly this means that:

Proposition

A category is sifted if for every pair of objects d 1,d 2D, the category Cospan D(d 1,d 2) of cospans from d 1 to d 2 is connected.

Corollary

Every category with finite coproducts is sifted.

Proof

Since a category with finite coproducts is nonempty (it has an initial object) and each category of cospans has an initial object (the coproduct).

Examples

Example

The diagram category for reflexive coequalizers, {0d 1s 0d 01} op with s 0d 0=s 0d 1=id, is sifted.

Example

The presence of the degeneracy map s 0:10 in example 1 is crucial for the statement to work: the category {0d 1d 01} op is not sifted; there is no way to connect the cospan (d 0,d 0) to the cospan (d 1,d 1).

Example 1 may be thought of as a truncation of:

Example

The opposite category of the simplex category is sifted.

Example

Every filtered category is sifted.

Proof

Since filtered colimits commute even with all finite limits, they in particular commute with finite products.

References

  • P. Gabriel and F. Ulmer, Lokal präsentierbare Kategorien , Springer LNM 221, Springer-Verlag 1971

Revised on November 26, 2012 13:28:02 by Urs Schreiber (82.113.121.54)