Functor category explained

In category theory, a branch of mathematics, a functor category

DC

is a category where the objects are the functors

F:C\toD

and the morphisms are natural transformations

η:F\toG

between the functors (here,

G:C\toD

is another object in the category). Functor categories are of interest for two main reasons:

Definition

Suppose

C

is a small category (i.e. the objects and morphisms form a set rather than a proper class) and

D

is an arbitrary category. The category of functors from

C

to

D

, written as Fun(

C

,

D

), Funct(

C

,

D

),

[C,D]

, or

DC

, has as objects the covariant functors from

C

to

D

, and as morphisms the natural transformations between such functors. Note that natural transformations can be composed: if

\mu(X):F(X)\toG(X)

is a natural transformation from the functor

F:C\toD

to the functor

G:C\toD

, and

η(X):G(X)\toH(X)

is a natural transformation from the functor

G

to the functor

H

, then the composition

η(X)\mu(X):F(X)\toH(X)

defines a natural transformation from

F

to

H

. With this composition of natural transformations (known as vertical composition, see natural transformation),

DC

satisfies the axioms of a category.

In a completely analogous way, one can also consider the category of all contravariant functors from

C

to

D

; we write this as Funct(

Cop,D

).

If

C

and

D

are both preadditive categories (i.e. their morphism sets are abelian groups and the composition of morphisms is bilinear), then we can consider the category of all additive functors from

C

to

D

, denoted by Add(

C

,

D

).

Examples

I

is a small discrete category (i.e. its only morphisms are the identity morphisms), then a functor from

I

to

C

essentially consists of a family of objects of

C

, indexed by

I

; the functor category

CI

can be identified with the corresponding product category: its elements are families of objects in

C

and its morphisms are families of morphisms in

C

.

l{C} →

(whose objects are the morphisms of

l{C}

, and whose morphisms are commuting squares in

l{C}

) is just

l{C}2

, where 2 is the category with two objects and their identity morphisms as well as an arrow from one object to the other (but not another arrow back the other way).

bf{Set}C

, where

C

is the category with two objects connected by two parallel morphisms (source and target), and Set denotes the category of sets. When viewed from this perspective, such directed graphs are often called quivers.

G

can be considered as a one-object category in which every morphism is invertible. The category of all

G

-sets is the same as the functor category Set

G

. Natural transformations are

G

-maps.

G

is the same as the functor category VectK

G

(where VectK denotes the category of all vector spaces over the field K).

R

can be considered as a one-object preadditive category; the category of left modules over

R

is the same as the additive functor category Add(

R

,

bf{Ab}

) (where

bf{Ab}

denotes the category of abelian groups), and the category of right

R

-modules is Add(

Rop

,

bf{Ab}

). Because of this example, for any preadditive category

C

, the category Add(

C

,

bf{Ab}

) is sometimes called the "category of left modules over

C

" and Add(

Cop

,

bf{Ab}

) is the "category of right modules over

C

".

X

is a functor category: we turn the topological space into a category

C

having the open sets in

X

as objects and a single morphism from

U

to

V

if and only if

U

is contained in

V

. The category of presheaves of sets (abelian groups, rings) on

X

is then the same as the category of contravariant functors from

C

to

bf{Set}

(or

bf{Ab}

or

bf{Ring}

). Because of this example, the category Funct(

Cop

,

bf{Set}

) is sometimes called the "category of presheaves of sets on

C

" even for general categories

C

not arising from a topological space. To define sheaves on a general category

C

, one needs more structure: a Grothendieck topology on

C

. (Some authors refer to categories that are equivalent to

bf{Set}C

as presheaf categories.[1])

Facts

Most constructions that can be carried out in

D

can also be carried out in

DC

by performing them "componentwise", separately for each object in

C

. For instance, if any two objects

X

and

Y

in

D

have a product

X x Y

, then any two functors

F

and

G

in

DC

have a product

F x G

, defined by

(F x G)(c)=F(c) x G(c)

for every object

c

in

C

. Similarly, if

ηc:F(c)\toG(c)

is a natural transformation and each

ηc

has a kernel

Kc

in the category

D

, then the kernel of

η

in the functor category

DC

is the functor

K

with

K(c)=Kc

for every object

c

in

C

.

As a consequence we have the general rule of thumb that the functor category

DC

shares most of the "nice" properties of

D

:

D

is complete (or cocomplete), then so is

DC

;

D

is an abelian category, then so is

DC

;

We also have:

C

is any small category, then the category

bf{Set}C

of presheaves is a topos.

So from the above examples, we can conclude right away that the categories of directed graphs,

G

-sets and presheaves on a topological space are all complete and cocomplete topoi, and that the categories of representations of

G

, modules over the ring

R

, and presheaves of abelian groups on a topological space

X

are all abelian, complete and cocomplete.

The embedding of the category

C

in a functor category that was mentioned earlier uses the Yoneda lemma as its main tool. For every object

X

of

C

, let

Hom(-,X)

be the contravariant representable functor from

C

to

bf{Set}

. The Yoneda lemma states that the assignment

X\mapsto\operatorname{Hom}(-,X)

is a full embedding of the category

C

into the category Funct(

Cop

,

bf{Set}

). So

C

naturally sits inside a topos.

The same can be carried out for any preadditive category

C

: Yoneda then yields a full embedding of

C

into the functor category Add(

Cop

,

bf{Ab}

). So

C

naturally sits inside an abelian category.

The intuition mentioned above (that constructions that can be carried out in

D

can be "lifted" to

DC

) can be made precise in several ways; the most succinct formulation uses the language of adjoint functors. Every functor

F:D\toE

induces a functor

FC:DC\toEC

(by composition with

F

). If

F

and

G

is a pair of adjoint functors, then

FC

and

GC

is also a pair of adjoint functors.

The functor category

DC

has all the formal properties of an exponential object; in particular the functors from

E x C\toD

stand in a natural one-to-one correspondence with the functors from

E

to

DC

. The category

bf{Cat}

of all small categories with functors as morphisms is therefore a cartesian closed category.

See also

Notes and References

  1. Book: Tom Leinster . 2004 . Higher Operads, Higher Categories . Cambridge University Press . 2004hohc.book.....L . dead . https://web.archive.org/web/20031025120434/http://www.maths.gla.ac.uk/~tl/book.html . 2003-10-25.