6 Filtered Colimits
Definition 6.1 (Filtered).
We say a category
is filtered if every finite diagram
has a cone under it.
Lemma 6.2.
is filtered if and only if:
For preorders, we say directed instead of filtered.
Definition 6.3 (Has filtered colimits).
We say
has filtered colimits if every ,
where
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:
Proof.
By Proposition 4.4(i), enough to show
has all small coproducts.
Given a set-indexeud family
of objects, the finite coproducts ,
for
finite, form the vertices of a diagram of shape
whose edges are coprojections.
is directed, and a colimit for this diagram has the universal property of a coproduct .
□
Suppose given a ,
where has limits
of shape and
colimits of shape .
We can form
, by Example 4.7(e) these are
the vertices of a diagram ,
and we can form .
Similarly, the colimits form
a diagram of shape , and
we can form . We get an
induced morphism ; if this
is an isomorphism for all ,
we say colimits of shape
commute with limits of shape
in .
Equivalently, preserves
limits of shape ,
or preserves
colimits of shape .
In Remark 5.13(d) we saw that reflexive coequalisers commute with finite products in
.
Theorem 6.5.
Assuming that:
Proof.
-
Let
be a diagram with
finite. We have a diagram
defined by .
For each ,
is a singleton since every
is identified with
in the colimit, so
is a singleton.
But elements of
are cones under
with apex ,
so if
is nonempty there must be such a cone for some .
-
Suppose given
where
is finite and
is filtered. In general, the colimitof
is the quotient of
by the smallest equivalence relation identifying
with
for all
in .
For filtered ,
this identifies
with
if and only if there exists
with ,
and moreover if
we may assume .
Now, given an element
of ,
we can write it as
where
is an equivalence class of elements .
If
in ,
then
and
represent the same element of
so by repeated use of Lemma 6.2(ii) we can choose representatives in
for some fixed ,
and by repeated use of Lemma 6.2(iii) we can assume that these representatives define an element of
.
This defines an element of
mapping to the given element of .
The proof of injectivity is similar: if two elements
of
have the same image in
we can choose representatives
in
and then find
so that each of the components
and
map to the same element of
under .
So
in .
□
Corollary 6.6.
Assuming that:
Then
Proof.
-
(i)
This is just like Example 5.14(a): Given a filtered diagram
and a colimit for
with apex ,
then
is the colimit of
for all ,
so each -ary
operation on the ’s
induces an -ary
operation on ,
and
also inherits all the equations defining ,
so there’s a unique lifting of the colimit cone under
to a colimit cone for .
-
(ii)
Follows from (i) and Theorem 6.5, since
also creates finite limits (and reflects isomorphisms). □
Similar results hold for categories such as .
Given a functor , the
category of elements of
is : its objects
are pairs
with and
morphisms are
morphisms
such that .
Proposition 6.8.
Assuming that:
Then the following are equivalent:
Proof.
-
(i) (ii)
By Lemma 4.10,
has finite limits so
is filtered.
-
(ii) (iii)
Consider the diagram
where
is the forgetful functor and
is the Yoneda embedding. A cone under this diagram (with apex ,
say) yields a family of morphisms
for each ,
subject to compatibility conditions which say that
for every
in ,
i.e. such that
is a natural transformation .
So the cone
has the universal property of a colimit for the diagram.
-
(iii) (i)
Functors of the form
preserve any limits which exist, so this follows from Theorem 6.5 plus the fact that
colimits in
are computed pointwise. □
Given a category with filtered
colimits, we say is finitary if it
preserves filtered colimits. If ,
then a finitary is determined
by its restriction to ,
since any set is the directed union of its finite subsets.
In fact the restriction functor
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
as in Example 5.14(a) or Corollary 6.6, the corresponding monad
on
is finitary.
From now on,
will denote the skeleton of the category of finite sets whose objects are the sets
.
For example, if is a
monad on , the full
subcategory of whose
objects are the sets
is a Lawvere theory.
Lemma 6.10.
Assuming that:
Proof.
Given a model ,
we have
for all .
Also, any morphism
induced by a morphism
in
is determined by its composites with the projections ,
so specifying
on morphisms is determined by its effect on morphisms with domain .
So, given a set ,
specifying a model
with is equivalent to
specifying operations
for each in
, subject
to
whenever is
the -th
coprojection, and
commutes whenever
commutes.
□
Note that the characterisation of -models
in any category with finite products. Note also that the equations of Lemma 6.10 allow us to reduce any compound
operation to a
single operation .
Theorem 6.11.
Assuming that:
Then the following are equivalent:
-
(i)
is
equivalent to a finitary algebraic
category in the sense of Example
5.14(a). (Recall that these
categories are those whose objects are sets with finitary operations satisfying some equations,
and morphisms are homomorphisms between them.)
-
(ii)
-
(iii)
for a finitary
monad
on
.
Proof.
-
(ii) (i)
Let
be the full subcategory of
on the free algebras ,
for .
Then
is a Lawvere theory, and for every object
of ,
the functor
restricted to
preserves finite products, so it’s a model of .
This defines a functor ;
but
for some finitary monad
on ,
so we get a functor
which is the identity on underlying sets.
In this situation,
is induced by a morphism of monads ,
i.e. a natural transformation
commuting with the units and multiplications. (Clearly, such a
induces a functor
sending
to ).
But we know
is bijective for all ,
since elements of the free algebras on
are just morphisms
in .
But both functors are finitary, so
is bijective for all ,
i.e. it’s an isomorphism of monads. □
For a general monad
on , this construction
produces a finitary monad
which is the coreflection of
in the category of finitary monads.
For example:
-
For ,
we obtain .
-
For Č,
we obtain the trivial monad .