nLab
ind-object

Idea

An ind-object of a category C is a “formal filtered colimit” of objects of C. The category of ind-objects of C is written ind-C.

Here, “ind” is short for “inductive system”, as in the inductive systems used to define directed colimits, as contrasted with “pro” in the dual notion for “projective system”.

Would it make sense to take this opportunity on nLab to give this a new modern name? Maybe call it “colimit-object” or “filtered colimit” or something? Something more consistent with the rest of the nLab might be nice. Just a thought. - Eric

Tim: As they are very special diagrams, I do not think that Eric’s suggestion is a good one. The pro and ind terminology was to replace inverse and direct system which was already being used in the 1930s (I think?) The ‘ind’ terminology is at least as old as 1960 (see Grothendeck’s seminar on descent.)

Mike: I think the terminology “ind-object” is too well-established to be changed. And I don’t really think there’s much reason to want to change it anyway; it may come historically from a terminology that we do not use, but it is unambiguous and the notion deserves its own name. In particular, it is not a (filtered) colimit; the whole point is that you don’t actually take the colimit (or alternately, you only take it inside the free colimit-completion).

Toby: Not to disparage ‘ind-object’, but I think that the term that Eric's looking for is ‘formal filtered colimit’.

Recalling the nature of filtered colimits, this means that in particular chains of inclusions

c 1c 2c 3c 4c_1 \hookrightarrow c_2 \hookrightarrow c_3 \hookrightarrow c_4 \hookrightarrow \cdots

of objects in C are regarded to converge to an object in indC, even if that object does not exist in C itself. Standard examples where ind-objects are relevant are categories C whose objects are finite in some sense, such as finite sets or finite vector spaces. Their ind-categories contain then also the infinite versions of these objects as limits of sequences of inclusions of finite objects of ever increasing size.

Moreover, ind-categories allow to handle “big things in terms of small things” also in another important sense: many large categories are actually (equivalent to) ind-categories of small categories. This means that, while large, they are for all practical purposes controlled by a small category (see the description of the hom-set of indC in terms of that of C below). Such large categories equivalent to ind-categories are therefore called accessible categories.

Definition

There are several equivalent ways to define ind-objects

as diagrams

One definition is to define the objects of ind-C to be diagrams F:DC where D is a small filtered category.
The idea is to think of these diagrams as being the placeholder for the colimit over them (possibly non-existent in C) We identify an ordinary object of C with the corresponding diagram 1C. To see what the morphisms should be between F:DC and G:EC, we stipulate that

  1. The embedding Cind-C should be full and faithful,
  2. each diagram F:DC should be the colimit of itself (considered as a diagram in ind-C via the above embedding), and
  3. the objects of C should be finitely presentable in ind-C.

Thus, we should have

ind-C(F,G) =ind-C(colim dDFd,colim eEGe) lim dDind-C(Fd,colim eEGe) lim dDcolim eEind-C(Fd,Ge) lim dDcolim eEC(Fd,Ge)\begin{aligned} ind\text{-}C(F,G) &= ind\text{-}C(colim_{d\in D} F d, colim_{e\in E} G e)\\ &\cong lim_{d\in D}\; ind\text{-}C(F d, colim_{e\in E} G e)\\ &\cong lim_{d\in D} colim_{e\in E}\; ind\text{-}C(F d, G e)\\ &\cong lim_{d\in D} colim_{e\in E}\; C(F d, G e) \end{aligned}

Here

  • the first step is by assumption that each object is a suitable colimit;

  • the second by the fact that the contravariant Hom sends colimits to limits (see properties of colimit);

  • the third by the assumption that each object is finitely presentable;

  • the last by the assumption that the embedding is a full and faithful functor.

So then one defines

ind-C(F,G):=lim dDcolim eEC(Fd,Ge).ind\text{-}C(F,G) := \cong lim_{d\in D} colim_{e\in E}\; C(F d, G e) \,.

as filtered colimits in presheaves

Recall the co-Yoneda lemma that every presheaf XPSh(C) is a colimit over representable presheaves:

there is some functor α:DC such that

Xcolim dDY(α(d)).X \simeq colim_{d \in D} Y(\alpha(d)) \,.
Definition

Let ind-CPSh(C) be the full subcategory of the presheaf category PSh(C)=[C op,Set] on those functors which are filtered colimits of representables, i.e. those for which

Xcolim dDY(α(d))X \simeq colim_{d \in D} Y(\alpha(d))

with D a filtered category.

Remarks

Given that [C op,Set] is the free cocompletion of C, ind-C defined in this way is its “free cocompletion under filtered colimits.”

To compare with the first definition, notice that indeed the formula for the hom-sets s reproduced:

Generally we have

[C op,Set](X,Y) [C op,Set](colim dDYFd,colim dDYGd) lim dD[C op,Set](YFd,colim dDYGd)\begin{aligned} [C^{op},Set](X,Y) & \simeq [C^{op}, Set](colim_{d \in D} Y F d, colim_{d' \in D'} Y G d) \\ & \simeq lim_{d \in D} [C^{op}, Set]( Y F d, colim_{d' \in D'} Y G d) \end{aligned}

by the fact that the hom-functor sends colimits to limits in its first argument (see properties at colimit).

By the Yoneda lemma this is

lim dD(colim dDYGd)(Fd).\cdots \simeq lim_{d \in D} (colim_{d' \in D'} Y G d')(F d) \,.

Using that colimits in PSh(C) are computed objectwise (see again properties at colimit) this is

lim dDcolim dDC(Fd,Gd).\cdots \simeq lim_{d \in D} colim_{d' \in D'} C(F d, G d') \,.

Examples

  • Let FinVect be the category of finite-dimensional vector spaces (over some field). Let V be an infinite-dimensional vector space. Then V can be regarded as an object of indFinVect as the colimit colim VVY(V) over the filtered category whose objects are inclusions VV of finite dimensional vector spaces V into V of the representables Y(V):FinVect opSet (Y is the Yoneda embedding).

  • For C the category of finitely presented objects of some equationally defined structure, ind-C is the category of all these structures.

    • The category Grp of groups is the ind-category of the category of finitely generated groups.

      • The category Ab of abelian groups is the ind-category of the category of finitely generated abelian groups.

Properties

Applications

Generalizations

in (,1)-catgeories

There is a notion of ind-object in an (infinity,1)-category.

With regard to the third of the properties listed above, notice that the comma category (Y,const F) is the category of elements of F, i.e. the pullback of the universal Set-bundle U:Set *Set along F:C opSet. This means that the forgetful functor (Y,const F)C is the fibration classified by F.

This is the starting point for the definition at ind-object in an (infinity,1)-category.

References

Ind-categories are discussed in

  • Kashiwara-Schapira, Categories and Sheaves, section 6

  • Grothendieck et al. SGA4.I.6 djvu file

  • A. Grothendieck, Techniques de déscente et théorèmes d’existence en géométrie algébrique, II: le théorème d’existence en théorie formelle des modules, Seminaire Bourbaki, 195, 1960.

See also the remarks at the beginning of section 5.3 of


Discussion

We had the following discussion on the comma category (Y,const F).

David Roberts: I don’t think this is true, since the fibration classified by F would be (F,U) (or (U,F), whichever is suitable) where U:Set *Set is the forgetful functor=universal set bundle. The F in (Y,F) is to be considered an object of Set C op, not as a functor C opSet.

Urs: Ahm, let me see. So (Y,F) (which, yes, should more precisely be written (Y,const F)) has as objects morphisms of presheaves e:Y(c)F, equivalently by Yoneda the objects are elements eF(c).

Its morphisms from e:Y(c)F to e:Y(c)F are given by morphisms f:cc in C such that f *e=e.

That seems to me to be the category which is also characterized as being the (strict) pullback of

Set * U C op F Set\array{ && Set_* \\ && \downarrow^{U} \\ C^{op} &\stackrel{F}{\to}& Set }

No?

Urs: Accordingly, I have now made the notation more precise by replacing ”F” by “const_F” in the above.