2024-09-05

Example

Fibre product

Consider the category . A functor is the following data:

F(1)F(2)F(0)

A cone of is an object of that fits into the following commutative diagram:

cF(1)F(2)F(0)

The limit is a universal cone such that

cecF(1)F(2)F(0)9!

So it is equivalent to the pullback or fibre product .

Pushout

“Oppositely”, if we have a functor , a colimit of is a universal cocone, called a pushout or coproduct

G(0)G(1)G(2)edd9!

Theorem

Let be a small category (i.e., its collection of objects is a set). If -products in exist, then -shaped limits exist in whenever equalisers do. Dually, if -coproducts and coequalisers exist in , then -shaped colimits exist in .

Proof

Let be a functor. Since , then -products exist. So we can consider the diagram

Yi2Ob(I)F(i)Y(f:k!l)2Arr(I)F(l)st

The maps and are given by (uniquely determined by the universal property of products)

Think of as meaning “source” and meaning “target”.

Now we have

LYi2Ob(I)F(i)Y(f:k!l)2Arr(I)F(l)eequaliserst

Claim:

is a universal cone for .
Proof. We have a diagram

LQiF(i)QiF(i)F(k)F(l)eeekeksf:k!lF(f)tf:k!l

The diagram commutes because .

Corollary 1

has all small limits and colimits.

Corollary 2

Let be a category and be a small category. Let be a functor.

  1. exists in if and only if the functor
    is representable.
  2. Dually, exists in if and only if the functor
    is corepresentable.

Note that both of the above are limits in , not colimits.

Corollary 3

Let be a ring. has all small limits and colimits and the forgetful functor preserves all small limits and filtered colimits (a colimit over a filtered category). #TODO

Corollary 4

Let be a topological space. Then has all small limits and colimits, and they are computed “pointwise”, i.e.,

also has all small limits and colimits, but we need more machinery to compute them. Sheaf limits are presheaf limits.

Theorem

Let be a finite category (finite objects and morphisms), and let be a filtered category. Let be a (bi)functor. If limits and colimits exist in each argument, then the following map is bijective:

Describing the map

We begin with the maps

F(i;j)lim¡!j2JF(i;j)F(i;j0)

for . There are induced maps

F(i;j)lim¡!j2JF(i;j)F(i;j0)F(i0;j)lim¡!j2JF(i0;j)F(i0;j0)

and

limái2IF(i;j)F(i;j)F(i0;j)limái2Ilim¡!j2JF(i;j)lim¡!j2JF(i;j)lim¡!j2JF(i0;j)

In other words, taking a limit over , we get maps

limái2IF(i;j)limái2Ilim¡!j2JF(i;j)limái2IF(i;j0)

So by universality, we have an induced map

limái2IF(i;j)lim¡!j2Jlimái2IF(i;j)limái2Ilim¡!j2JF(i;j)limái2IF(i;j0)

Proof (In the most useful case)

Making the statement more concrete

Let be a topological space, and . Let be a basis at , i.e.,

We take (which is filtered) and consider the (bi)functor

for a given functor . That is, is the data of

HGfginPreSh(X).

But now, if we unravel what the statement is saying, we want:

Now recalling our definition of a stalk in terms of colimits, the above colimits are just talks. Hence, the statement is just saying that we should have a bijection

Very concretely, we want the stalk of the equaliser to be the equaliser of the stalks.

Giving the proof

Injectivity

Note now that we are working in .We have

eq(HG)xeq(HxGx)Hx??

Certainly is injective. To show that the top map is injective, it suffices to show that the left map is injective.

We know that is a subpresheaf (the equaliser is a monomorphism). So it suffices to show the the following.
Claim: If as presheaves, then .
Proof. Consider with the same image in . Then there exists and such that . So . So in .

Surjectivity

Conversely, let . This means that , and there exists , such that has the same image in under and (equality in the stalk is detected on some open). So .