Categories

  1. algebraic geometry
  2. algebraic topology
  3. analysis of PDEs
  4. category theory
  5. classical analysis and ODEs
  6. combinatorics
  7. commutative algebra
  8. complex variables
  9. differential geometry
  10. dynamical systems
  11. functional analysis
  12. general mathematics
  13. general topology
  14. geometric topology
  15. group theory
  16. information theory
  17. K-theory and homology
  18. logic
  19. mathematical physics
  20. metric geometry
  21. number theory
  22. numerical analysis
  23. operator algebras
  24. optimization and control
  25. probability
  26. quantum algebra
  27. representation theory
  28. rings and algebras
  29. spectral theory
  30. statistics theory
  31. symplectic geometry

Fun example. Empty colimit does not commute with empty limit

One of the important properties of filtered colimits is that they commute with finite limits in the category of sets.

Theorem: Let F \colon \mathcal{C}\times \mathcal{D} \to \mathbf{Sets} be a functor, where \mathcal{C} is a filtered small category and \mathcal{D} is a finite category. Then the natural mapping

    \[\mathrm{colim}_{\mathcal{C}} \lim_{\mathcal{D}} F (c, d) \to \lim_{\mathcal{D}} \mathrm{colim}_{\mathcal{C}} F(c, d)\]

is an isomorphism.

This statement is, for example, useful to check that a continuous morphism of sites \mathcal{D} \to \mathcal{C} commuting with finite limits induces a topos morphism \mathrm{Shv}(\mathcal{C}) \to \mathrm{Shv}(\mathcal{D}), i.e. the pullback map f^{-1} is exact (note that a continuous site morphism does not induce a topos morphism in the general case).

The definition of a filtered system has a somewhat strange condition that it is non-empty. For some time I was not sure why it is essential to require this property. It turns out that without this condition, the filtered colimits will not commute with finite limits. Namely, the empty colimit will not commute with the empty limit (and only with it!).

I claim that the limit over an empty diagram in any category is simply a final object in that category.

Indeed, let F\colon \emptyset \to X be an empty diagram in a category X. Then \lim_{\emptyset} F is an object in X such that any other object A\in X admits exactly one morphism A \to \lim_{\emptyset} F. This means that \lim_{\emptyset} F is a final object in X. Clearly, a final object in \mathbf{Sets} is the one-point sets \{*\}.

Similarly, colimit on an empty diagram \mathrm{colim}_{\emptyset} F is nothing more than an initial object in X. Clearly, an initial object in \mathbf{Sets} is the empty set \emptyset.

Then we apply these considerations to the empty diagram F\colon \emptyset \to \mathbf{Sets}, the natural map

    \[\textrm{colim} \lim F\times F \to \lim \textrm{colim} F\times F\]

is the map

    \[\emptyset \to \{*\}\]

that is clearly not an isomorphism!

Subscribe
Notify of
1 Comment
Most Voted
Newest Oldest
Inline Feedbacks
View all comments
Slava Naprienko
1 month ago

A comment from this paper might be relevant. They describe closed classes of colimits.

Three more classes arise from the anomalous behavior of the empty set (the empty colimit does not commute with the empty limit, but does commute with all nonempty ones): we may add the empty colimit to the class of filtered colimits the class of sifted colimits, to obtain the classes which commute with all nonempty finite limits (resp. with nonempty finite products), and by cutting down the class of all colimits to the class of connected colimits, we obtain the class which commutes (with all conical limits and) with the empty limit.

Last edited 1 month ago by Slava Naprienko