A category is called sifted if colimits of diagrams of shape (called sifted colimits) commute with finite products in Set: for every diagram
where is a finite discrete category the canonical morphism
is an isomorphism.
is called cosifted if the opposite category is sifted.
A colimit over a sifted diagram is called a sifted colimit.
An inhabited small category is sifted precisely if the diagonal functor
is a final functor.
This is due to (GabrielUlmer)
More explicitly this means that:
A category is sifted if for every pair of objects , the category of cospans from to is connected.
Every category with finite coproducts is sifted.
Since a category with finite coproducts is nonempty (it has an initial object) and each category of cospans has an initial object (the coproduct).
The diagram category for reflexive coequalizers, with , is sifted.
The presence of the degeneracy map in example 1 is crucial for the statement to work: the category is not sifted; there is no way to connect the cospan to the cospan .
Example 1 may be thought of as a truncation of:
The opposite category of the simplex category is sifted.
Every filtered category is sifted.
Since filtered colimits commute even with all finite limits, they in particular commute with finite products.
sifted category, sifted (∞,1)-category
Jiri Adamek, Jiri Rosicky, On sifted colimits and generalized varieties, TAC (pdf)
Jiri Adamek, Jiri Rosicky, Enrico Vitale, What are sifted colimits?, TAC 23 (2010) pp. 251–260. (tac)