nLab
finitely complete category

Context

Category theory

Limits and colimits

Contents

Definition

A finitely complete category (which the Elephant calls a cartesian category ) is a category CC which admits all finite limits, that is all limits for any diagrams F:JCF: J \to C with JJ a finite category. Finitely complete categories are also called lex categories. They are also called (at least by Johnstone in the Elephant) cartesian categories, although this term more often means a cartesian monoidal category.

Variants

There are several well known reductions of this concept to classes of special limits. For example, a category is finitely complete if and only if:

An appropriate notion of morphism between finitely complete categories CC, DD is a left exact functor, or a functor that preserves finite limits (also called a lex functor, a cartesian functor, or a finitely continuous functor). A functor preserves finite limits if and only if:

  • it preserves terminal objects, binary products, and equalizers; or
  • it preserves terminal objects and binary pullbacks.

Since these conditions frequently come up individually, it may be worthwhile listing them separately:

  • F:CDF: C \to D preserves terminal objects if F(t C)F(t_C) is terminal in DD whenever t Ct_C is terminal in CC;

  • F:CDF: C \to D preserves binary products if the pair of maps

    F(c)F(π 1)F(c×d)F(π 2)F(d)F(c) \stackrel{F(\pi_1)}{\leftarrow} F(c \times d) \stackrel{F(\pi_2)}{\to} F(d)

    exhibits F(c×d)F(c \times d) as a product of F(c)F(c) and F(d)F(d), where π 1:c×dc\pi_1: c \times d \to c and π 2:c×dd\pi_2: c \times d \to d are the product projections in CC;

  • F:CDF: C \to D preserves equalizers if the map

    F(i):F(e)F(c)F(i): F(e) \to F(c)

    is the equalizer of F(f),F(g):F(c)F(d)F(f), F(g): F(c) \stackrel{\to}{\to} F(d), whenever i:eci: e \to c is the equalizer of f,g:cdf, g: c \stackrel{\to}{\to} d in CC.

References

Section A1.2 in

Revised on January 13, 2012 21:13:56 by Mike Shulman (71.136.235.72)