6 Filtered Colimits

Definition 6.1 (Filtered). We say a category C is filtered if every finite diagram D:JC has a cone under it.

Lemma 6.2. C is filtered if and only if:

Proof.

For preorders, we say directed instead of filtered.

Definition 6.3 (Has filtered colimits). We say C has filtered colimits if every D:JC, where J is small and filtered, has a colimit.

Note that direct limits as in Example 4.3(g) are directed colimits.

Lemma 6.4. Assuming that:

Then C has all small colimits.

Proof. By Proposition 4.4(i), enough to show C has all small coproducts.

Given a set-indexeud family (Aj|jJ) of objects, the finite coproducts jFAj, for FJ finite, form the vertices of a diagram of shape PfJ={FJ|Ffinite} whose edges are coprojections. PfJ is directed, and a colimit for this diagram has the universal property of a coproduct jJAj.

Suppose given a D:I×JC, where C has limits of shape I and colimits of shape J.

    L(j)         L(j′)         colim L
                                  J

                                          limI M


    D (i,j)       D(i,j′)                   M (i)


LDDDMD(β(i(α(α(α(i),β,,)′,D)j)j′β))(i′,j)       D(i′,j′)                   M (i′)
We can form L(j)=limI(D(,j):IC), by Example 4.7(e) these are the vertices of a diagram L:JC, and we can form colimJL.

Similarly, the colimits M(i)=colimJD(i,) form a diagram of shape I, and we can form limIM. We get an induced morphism colimJLlimIM; if this is an isomorphism for all D:I×JC, we say colimits of shape J commute with limits of shape I in C.

Equivalently, colimJ:[J,C]C preserves limits of shape I, or limI:[I,C]C preserves colimits of shape J.

In Remark 5.13(d) we saw that reflexive coequalisers commute with finite products in Set.

Theorem 6.5. Assuming that:

Then colimits of shape J commute with all finite limits in Set if and only if J is filtered.

Proof.

Corollary 6.6. Assuming that:

Then

Proof.

Similar results hold for categories such as Cat.

Example 6.7. Consider the diagram

  ⋅⋅⋅     ℕ       ℕ      ℕ

sss111 ⋅⋅⋅     1       1      1
of shape op×2 in Set. The inverse limit of the top row is , but that of the bottom row is 1. So limop[op,Set]Set doesn’t preserve epimorphisms; equivalently colim:[,Setop]Setop doesn’t preserve monomorphisms. Thus by Remark 4.8, directed colimits don’t commute with pullbacks in Setop.

Given a functor F:CSet, the category of elements of F is (1F): its objects are pairs (A,x) with xFA and morphisms (A,x)(B,y) are morphisms f:AB such that (Ff)(x)=y.

Proposition 6.8. Assuming that:

Then the following are equivalent:

Proof.

Given a category C with filtered colimits, we say F:CD is finitary if it preserves filtered colimits. If C=Set, then a finitary F is determined by its restriction to Setf, since any set is the directed union of its finite subsets.

In fact the restriction functor [Set,D][Setf,D] has a left adjoint (the left Kan extension functor) and the finitary functors are those in the image of this left adjoint (up to isomorphism).

For a category C as in Example 5.14(a) or Corollary 6.6, the corresponding monad 𝕋 on Set is finitary. From now on, Setf will denote the skeleton of the category of finite sets whose objects are the sets [n]={1,2,,n}.

Definition 6.9 (Lawvere theory). By a Lawvere theory, we mean a small category T together with a functor SetfT which is bijective on objects and preserves finite coproducts. A model of a Lawvere theory T in any category C with finite products is a functor M:TopC preserving finite products.

For example, if 𝕋 is a monad on Set, the full subcategory of Set𝕋 whose objects are the sets [n] is a Lawvere theory.

Lemma 6.10. Assuming that:

Then the category of T-models in Set is (equivalent to) a finitary algebra category in the sense of Example 5.14(a).

Proof. Given a model M:TopSet, we have M[n]M[1]n for all n. Also, any morphism M[1]nM[1]p induced by a morphism [p][n] in T is determined by its composites with the projections M[1]pM[1], so specifying M on morphisms is determined by its effect on morphisms with domain [1].

So, given a set A, specifying a model M with M[1]=A is equivalent to specifying operations αA:AnA for each α:[1][n] in T, subject to (vi)A(a1,,an)=ai whenever vi:[1][n] is the i-th coprojection, and

  Ap      An


((γAαβA1)A,...,(βn)AA)
commutes whenever
  [1]      [n]


ασ(β1,...,βn)   [p]
commutes.

Note that the characterisation of T-models in any category with finite products. Note also that the equations of Lemma 6.10 allow us to reduce any compound operation α(β1(x),β2(x),,βn(x)) to a single operation γ.

Theorem 6.11. Assuming that:

Then the following are equivalent:

Proof.

For a general monad 𝕋 on Set, this construction produces a finitary monad 𝕋 which is the coreflection of 𝕋 in the category of finitary monads.

For example: