|
|
|
|
functor category
|
(Definition)
|
|
|
Let
be categories. Consider the class of all covariant functors
, and the class of all natural transformations
for every pair
of functors. Write
for the pair .
For each pair of functors
, write the class of all natural transformations from to . If is in both and , then and
.
Using the composition of natural transformations, we have a mapping
for every triple
. Since composition of natural transformations is associative, the associativity of applies.
In addition, for each
, we have the identity natural transformation
. For every
and every
, we have
and
.
From the discussion above, we are ready to call
a category. However, unless is a set for every pair of functors in ,
is not a category. When
is a category, we call it the category of functors from
to
, or simply a functor category.
That
is a functor category depends on various restrictions being placed on the “sizes” of
and
:
Proposition 1 If
is
-small, then
is a category.
Proof. Suppose
 is
 -small. Consider the class  . Each
 is determined by the collection of morphisms
 for each object  in
 . This means that, for each  in
 ,
contains the image of every
 under  . So the class of all these natural transformations is a subclass of the product
 |
(1) |
Since
 , as well as each
 is a set, so is the product (1). Hence  , being a subclass of (1), is a set, or that
 is a category. 
Proposition 2 If in addition
is a
-category, then so is
.
Proof.
 being a
 -category means that
 is
 -small, for every object  in
 . Since
 is also
 -small (assumption in Proposition 1), the product (1) above is
 -small. Consequently,  , being a subclass of (1), is
 -small. This shows that
 is a
 -category. 
Proposition 3 If
is furthermore
-small, so is
.
Proof. We want to show that the class
 of all functors from
 to
 is
 -small. A functor
 can be broken up into two components: a function
 , and a function
 , so that
 .
Define a binary relation on
so that iff they have the same first component: . It is easy to see that is an equivalence relation on
. Let be the equivalence class containing the functor . For every morphism , its image under the second component of every functor in lies in
. So the size of can not exceed the size of
Since
 is
 -small (assumption in Prop 1), so is
 . Furthermore, since each
 is
 -small (assumption in Prop 2), ![$ [S]$ $ [S]$](http://images.planetmath.org:8080/cache/objects/11082/l2h/img105.png) is
 -small as well.
Next, let us estimate the size of the class
of equivalence classes in
. First, note that for every functor
, its first component is a function from the set
to the set
by assumption. As
iff
, the size can not exceed
the cardinality of the set of all functions from
 to
 . By assumption,
 is
 -small, so is
 . As a result,
 is
 -small. Together with the fact that ![$ [S]$ $ [S]$](http://images.planetmath.org:8080/cache/objects/11082/l2h/img122.png) is
 -small for each functor  , we have that
 itself must be
 -small, which completes the proof. 
|
"functor category" is owned by CWoo.
|
|
(view preamble | get metadata)
Cross-references: proof, completes, estimate, size, equivalence class, equivalence relation, easy to see, iff, binary relation, function, components, proposition, product, subclass, image, contains, object, morphisms, collection, restrictions, identity natural transformation, addition, associative, mapping, composition of natural transformations, natural transformations, covariant functors, class, categories
There are 7 references to this entry.
This is version 5 of functor category, born on 2008-09-23, modified 2008-09-30.
Object id is 11082, canonical name is FunctorCategory.
Accessed 250 times total.
Classification:
| AMS MSC: | 18A05 (Category theory; homological algebra :: General theory of categories and functors :: Definitions, generalizations) | | | 18A25 (Category theory; homological algebra :: General theory of categories and functors :: Functor categories, comma categories) | | | 18-00 (Category theory; homological algebra :: General reference works ) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|