Processing math: 100%

Functor category

Collection

context C … small category
context D … category
definiendum DC in it
definition ObDC:=CD
definition DC[F,G]:=FG

Discussion

Firstly, A class of sets together with functions between them form a category. The only job of the arrows between objects here is to transfer individual elements from set to sets. Secondly, A class of categories and functors between them is a category too, but here the objects exhibit some internal structure and the arrows are required to respect that structure. Finally, A class of functors and natural transformations between them also form a category, call it DC. Here, the objects can be thought of as copies of the category fixed category C seated inside of D, and the arrows must respect (only) the C-structure.

Some very simple examples

If 5 is the discrete category of five different objects, then Set5 is the category of all choices of up to 5 sets. Set1 is just Set itself. If we'd consider a category 5 to be the same category with some ordering of the object expressed arrows, then Set5 is just the category of all choices of up to 5 sets, where the arrows expressing ordering are substituted by some function.

Again, a functor F:CD just embeds the diagram C within a category D. Therefore, think of the functor category DC as the collection of all (possibly squeezed) copies of C in D.

Algebraic picture if the target is structured

The nice target category Set is like a ring (say R) and the functor category SetC with objects ω,μ, is like a space of functionals on a space C. The topos/functional space is richer than the base C: The target (Set resp. C) has a nice algebraic structure (e.g. co-products resp. addition), which we can pull back to define one on SetC. As in ω+λ:=(vω(v)+μ(v)).

Adding more details leads to finer analogies: If C has co-products itself, then it's like a vector space and it's object should be viewed as a set of base vectors. If a functor preserves co-product, it's like a linear functional and SetC becomes a kind of dual vector space. This sheds light on the (co-variant) Yoneda embedding: If we view the objects of C as a set of base vectors, then the can be mapped to functionals in the dual space, but that space is bigger / also contains a lot of other functionals.

Remark: We don't necessarily need to take Set as target, although it's the traditional choice. It corresponds to the cardinal arithmetic (arbitrary cardinals). Meanwhile, the category of finite sets behaves like natural number (finite cardinals) and groupoids behave like reals (groupoid cardinality can be defined, where non-trivial automorphisms give fractional cardinality).

Example

topoiiiix.jpg

Reference

Wikipedia: Functor category


Subset of

Categories

Requirements

Functor, Natural transformation