The aim of this note is to give a short account of
Freyd, P. J., & Kelly, G. M. (1972). Categories of continuous functors, I. JPAA, 2(3), 169-191.
as part of the Kan Extension Seminar series of lectures.
This paper was the first to raise and solve in a very elegant way some fundamental problems in elementary Category Theory.
Definition. An object in a category is said to be orthogonal to an arrow (we say ) if the hom-functor sends to a bijection between sets.
If has a terminal object, then if and only if the terminal arrow has the so-called (unique) right lifting property against : this means that for any choice of in the diagram
there exists a unique arrow making the upper triangle commute. Obviously, there is a dual notion of left lifting property.
Now, a classical issue in elementary Category Theory is the so-called “orthogonal subcategory problem”:
Orthogonal Subcategory Problem (OSP). Given a class of arrows in a category , when is the full subcategory of all objects orthogonal to a reflective subcategory (i.e., when there exists a left adjoint to the inclusion )?
There are lots of “protoypical” examples of the OSP in Algebra and Geometry: think for example to the case of sheaves of sets (on a given Grothendieck site) as a reflective subcategory among presheaves: the sheaf condition can be easily stated in terms of an orthogonality request: a presheaf on a site is a -sheaf if and only if
for every covering sieve .
In fact this is not a case, since following a general tenet “(at least some) localizations are determined by an orthogonality class” (see for example the definition of -local object and the Lab page about the OSP).
Freyd and Kelly were the first to point out that a solution for the OSP turns out to solve another fundamental question, which falls under the name of “continuous functor problem”:
Continuous Functor Problem (CFP). Given a category and a class of diagrams (say ) in it, when is the category of all functors which preserve limits of all -shaped diagrams reflective in the category of functors ?
(Important) Remark. Before going on, we must spend a word on the notion of continuity: Freyd and Kelly published an erratum shortly after the paper, to correct the “stupid mistake of supposing that the limit of a constant diagram is the constant itself”; counterexamples to this statement abound, and in fact it can be easily shown that the limit of the constant functor is (whenever this copower exists) precisely , where is the set of connected components of the category .
Once this is fixed, notice that the CFP arises in an extremely elementary way: for example,
This should give you evidence that the two problems are not unrelated:
Proposition. Given a class of diagrams in a small complete category , we get a family of natural transformations
and a functor is -continuous if and only if it is orthogonal to each arrow in .
(This result is not in its full generality: see [FK], Prop. 1.3.1.)
Proof. The following diagram commutes,
and one of the two arrows is an isomorphism if and only if the other is.
The strategy adopted by Freyd and Kelly to solve the OSP, is to find sufficient conditions on so that Freyd’s Adjoint Functor Theorem applies to the inclusion (in particular, since it can be shown that is always complete, this boils down to find a solution set for to apply Freyd Adjoint Functor Theorem).
These conditions are of 1+3 different types:
Notation. We denote (resp, ) the (possibly large) class of all arrows left (resp, right) orthogonal to each arrow of the class .
In the previous notation, .
Definition. A prefactorization system on a category consists of two classes of arrows such that and .
A prefactorization system on is said proper if and .
A factorization system (OFS, or simply FS) on a category corresponds to the modern notion of strong factorization system: a (proper) factorization on the category is precisely a (proper) prefactorization such that each can be written as a composition with .
Examples. 0. Any category has two trivial factorization systems, namely and , where denotes the class of all isomorphisms, and the class of all arrows in ; 1. The category has a factorization system where denotes the class of surjective maps, and the class of injective maps. More generally, this is true for the category of models of any algebraic theory (monoids, (abelian) groups, …), and for abelian categories, (elementary) toposes…
Definition. If is a category with a proper factorization system , we say that a family of objects lies in if there exists a unique solving (all at once) the lifting problems
(one for each ). If has sufficiently large coproducts, this condition is obviously equivalent to ask that the arrow .
Definition. A generator in a category with a proper factorization system consists of a small full subcategory such that for any the family lies in in the former sense.
Remark. Mild completeness assumptions on entail that
For extremal FSs (in which the left/right class coincides with that of extremal epi/mono) the converse of 1,2 is also true, so as to recover the notion of generator as a “separator for objects”.
Notation. In this section admits all limits and colimits whenever needed
Definition(s). An ordered set is said to be -directed (for a regular cardinal ) if every subset of with less than elements has an upper bound in . A -directed family of subobjects of consists of a functor from a -directed set to the posetal class of subobjects of . The colimit of such a functor, denoted is called the -directed union of the family.
With these conventions, we say that an object is bounded by a regular cardinal (called the bound of ) if every arrow to a -directed union factors through one of the . The category is bounded if each is bounded by a regular cardinal (possibly depending on ).
Example. In a set of cardinality is -bounded.
Remark. -boundedness is obviously linked to local -presentability: [PK]‘s locally -presentable categories are precisely those categories which
Examples. Examples of such structures/properties on categories abound:
Theorem (OS theorem). If is complete, cocomplete, bounded and co-well-powered with a proper FS , and is a class of arrows whose elements are “almost all” in , i.e. (we call these classes quasi-small with respect to ), where
Then is a reflective subcategory.
Proof. [FK] performs a clever transfinite induction to generate a solution set for any object : if is the typical arrow in , we define
This is where boundedness comes into play: if is the cardinal bounding , then the induction stops at : is the desired solution set for , namely every arrow whose codomain lies in factors through some .
The procedure we adopted to reduce the CFP to the OSP (building \mathcal G(\Gamma)
) doesn’t take care of any size issue: to repair this deficiency we exploit the following
Lemma. Let be cocomplete, endowed with a proper factorization system and a generator . For any class of natural transformations in we denote
Then there exists a class contained in such that .
The particular shape of is due to the procedure used in [FK] to reduce the CFP to the OSP. The operation is a copower, in the obvious sense: given , , where .
The key point of this result is that the class is small (obviously) whenever is, so we can conclude applying the OS theorem:
Theorem (CF theorem). Let be a small category, and a bicomplete, bounded, co-wellpowered category with a generator and a proper factorization . Let be a class of cylinders whose elements are almost all cones (this means that the collection of cylinders which are not cones is a set). Then the subcategory of -continuous functors is reflective in .
The rough idea behind this result is the following: can be written as , and itself can be split as a union , where the two sub-classes consist of the -arrows and the -arrows of the various . The assumptions made on and the presence of a generator on entail that is a set, so we can conclude.
[FK]‘s solution of the OSP can be generalized: [AHS] show that is reflective in a category with a proper FS whenever the class is quasi-presentable, namely it can be written as a union , where and is presentable (in a suitable sense).
The same paper offers a fairly deep point of view about the “weak analogue” of the OSP, which can be regarded as a generalization of the Small Object Argument (SOA) in Homotopical Algebra; if we build the class of arrows having a non-unique lifting property against each , then we can only hope in a weak reflection, where the unit of the adjunction is only weakly universal. In a setting where “things are defined up to homotopy” this can still be enough, provided that we ensure the reflection maps satisfy some additional properties. The additional property requested in the SOA is that the weak reflection maps belong to the cellular closure of , i.e. they can be obtained as a transfinite composition of pushouts of maps in .
The theory of factorization systems is deeply intertwined with the SOA, too: in [SOA] R. Garner defines an “algebraic” Small Object Argument, exploiting a description of OFS and WFS as suitable pairs over the category . In this respect I think that the best person which can give us sensible references for this is our boss, since she wrote this paper.
[LPAC] Jiří Adámek, Jiří Rosický, Locally presentable and accessible categories, LMS Lecture Notes Series 189, Cambridge University Press, (1994).
[FK] Freyd, P. J., & Kelly, G. M. (1972). Categories of continuous functors, I. JPAA, 2(3), 169-191.
[SOA] R. Garner, Understanding the small object argument, Applied Categorical Structures 17 (2009), no. 3, pages 247-285.
[PK] P. Gabriel and F. Ulmer, Lokal präsentierbare Kategorien, Springer LNM 221, 1971.
[AHS] J. Adamek, M. Hebert, L. Sousa, The Orthogonal Subcategory Problem and the Small Object Argument, Applied Categorical Structures 17, 211-246.