In ordinary category theory, categories and functors are defined analytically: a category has sets of objects and morphisms, and a functor consists of assignments on objects and morphisms that are compatible with composition; in particular, functors can be constructed ‘by hand’ by writing down specifications on objects and on morphisms and verifying that the compatibility conditions are satisfied. This approach no longer makes sense in synthetic category theory, where functors are taken as a primitive concept; the only way to produce functors is to apply some rule, axiom or theorem that constructs it wholesale. Indeed, all of the functors we defined in the previous chapters are ultimately built out of a couple of basic ones by combining them in various ways.
The main goal of this chapter is to introduce a fundamentally newThe closest we have seen to a functoriality principle is the defining property of the (full) subcategory \(C\) of \(D\) spanned by a subanima of objects and/or arrows. It says that given a preexisting functor \(F\colon T\to D\) we can construct a functor \(T\to C\) by the object- and/or arrow-wise verification that \(F\) takes values in \(C\). The reason we do not consider this a real functoriality principle is that it only allows to construct functors into a very special kind of category, namely one that is constructed by the (full) subcategory construction. So far, we are lacking a way to recognize a (differently constructed or a priori given) category as a (full) subcategory of some other category. Using the functoriality principle introduced in this chapter we will remedy the issue in Proposition 6.4.5 and Proposition 6.4.6. way of constructing functors, through a functoriality principle. Roughly speaking, a functoriality principle is any special condition that provides a sufficient criterion for the following question.
Question (Functoriality).
• (Absolute form) Let \(C,D\) be categories and assume that for each object \(x\in C\) we have an object \(f_x \in D\). When can we extend this objectwise assignment to a functor \(f\colon C\to D\)?
• (Dependent form) Let \(p\colon D\to C\) be a functor and assume that for each \(x\in C\) we have an object \(s_x\in D_x\) in the fiber. When can we extend this objectwise assignment to a section of \(p\), i.e., a functor \(s\colon C\to D\) with \(ps =\id_C\)?
Here “for each object \(x\in C\)” refers to the universal object in context \(C^{\simeq}\), as explained in Convention 5.4.4 and Remark 5.4.5. Thus the absolute assignment is a functor \(C^{\simeq}\to D^{\simeq}\), and the dependent assignment is a section of \(D^{\simeq}\to C^{\simeq}\). These assignments already respect isomorphisms and their higher identifications. The question is whether they extend to noninvertible morphisms, giving a functor on \(C\), or a section over \(C\), respectively. When \(C\) is an anima, there is nothing further to construct.
In this chapter, we will be interested in a particular instance of a functoriality principle, which we refer to as functoriality of universals. This principle says that terminal objects in the fibers of a cocartesian fibration assemble into a right adjoint section, and dually for initial objects in the fibers of a cartesian fibration. Informally, it expresses that the individual solutions to a functorial family of ‘universality problems’ automatically assemble into a functor.
One of the main results of this chapter is that this principle is equivalent to the Fundamental Theorem of category theory: the fact that a functor \(f\colon C \to D\) is an equivalence if and only if it is fully faithful (i.e. induces equivalences on hom animae \(C(x,y) \iso D(fx,fy)\)) and strongly surjective (i.e. each object \(d \in D\) is isomorphic to \(f(c)\) for some \(c \in C\).) It is also equivalent to the condition that the walking morphism detects equivalences: a functor \(f\) is an equivalence if and only if it induces an equivalence after applying \(\Map([1],-)\).
After establishing these equivalent properties, we discuss various applications: characterizations of subcategories and full subcategories as embeddings and fully faithful functors, a characterization of conservative functors, pointwise and fiberwise criteria for fibrations, and a criterion for relative adjunctions in terms of fiberwise data.
Sections
Functoriality of universals
13 numbered results
Universal arrows and adjoints
4 numbered results
The Fundamental Theorem of category theory
8 numbered results
Subcategories and conservative functors
19 numbered results
Pointwise and fiberwise criteria for fibrations
17 numbered results
Relative adjunctions
5 numbered results
Exercises Chapter 6
2 numbered results