nLab
accessible category

Contents

Idea

An accessible category is a possibly large category which is however essentially determined by a small category. There are several ways to make this precise, all equivalent.

Definition

A locally small category C is accessible if for some regular cardinal κ:

  • the category has κ-directed colimits (or, equivalently, κ-filtered colimits), and
  • there is a set of κ-compact objects that generate the category under κ-directed colimits.

If C satisfies these properties for some κ, we say that it is κ-accessible. Unlike for locally presentable categories, it does not follow that if C is κ-presentable and κ<λ then C is also λ-presentable. It is true, however, that for any accessible category, there are arbitrarily large cardinals λ such that C is λ-presentable.

Equivalent characterizations include that C is accessible iff:

  • it is the category of models (in Set) of some small sketch.
  • it is of the form Ind κ(S) for S small, i.e. the κ-ind-completion of a small category, for some κ.
  • it is of the form κFlat(S) for S small and some κ, i.e. the category of κ-flat functors from some small category to Set.
  • it is the category of models (in Set) of a suitable type of logical theory.

The important notion of functor between accessible categories is an accessible functor, meaning a functor F:CD such that there exists a κ such that C and D are both κ-accessible and F preserves κ-filtered colimits.

Relation to other concepts

Properties

Proposition (preservation of accessibility under inverse images)

Let F:CD be a functor between locally presentable categories which preserves κ-filtered colimits, and let D 0D be an accessible subcategory. Then the inverse image f 1(D 0)C is a κ-accessible subcategory.

Proof

This appears as HTT, corollary A.2.6.5.

Proposition (accessibility of fibrations and weak equivalences in a combinatorial model category)

Let C be a combinatorial model category, Arr(C) its arrow category, WArr(C) the full subcategory on the weak equivalences and FArr(C) the full subcategory on the fibrations. Then F, W and FW are accessible subcategories of Arr(C).

Proof

This appears as HTT, corollary A.2.6.6.

In addition:

  • The 2-category Acc of accessible categories, accessible functors, and natural transformations has all small 2-limits.

  • Every accessible functor satisfies the solution-set condition?, and every left or right adjoint between accessible categories is accessible. Therefore, the adjoint functor theorem takes an especially pleasing form for accessible categories: a functor is a left (resp. right) adjoint iff it is accessible and preserves all small colimits (resp. limits).

References

The term accessible category is due to

  • Makkai, Paré 1989.

The standard textbook on the theory of accessible categories is

  • Adámek and Rosicky, Locally Presentable and Accessible Categories. Cambridge University Press, Cambridge, 1994.

A discussion of accessible (infinity,1)-categories is in section 5.4, p. 341 of