Product category

In the mathematical field of category theory, the product of two categories C and D, denoted C × D and called a product category, is an extension of the concept of the Cartesian product of two sets. Product categories are used to define bifunctors and multifunctors.

Definition

The product category C × D has:

A product of a family of categories is defined exactly the same way.

Universal property

Just like for sets, a product of a family of categories is characterized by the following universal property. Given categories Ci indexed by a set I, P=∏Ci,pj:P→Cj,j∈I satisfy:

given a family of functors fi:D→Ci, there exists a unique functor f:D→P such that fj=pj∘f for each j∈I.

Put in another way, a product of a family of small categories is exactly the categorical product of them in the category of small categories 𝖢𝖺𝗍. Thus, for example, 𝖥𝖼𝗍(A,∏iBi)≃∏i𝖥𝖼𝗍(A,Bi)

where 𝖥𝖼𝗍 denotes a functor category.

Functoriality

Given two functors f:C→D,g:C′→D′, the product f×g:C×C′→D×D′ is defined component-wise; that is, (f×g)(x,x′)=(f(x),g(x′)) for a pair of objects or morphisms x,x′. (This product may also be characterized by the universal property similar to that for categories.) This way, we get the functor

×:𝖢𝖺𝗍×𝖢𝖺𝗍→𝖢𝖺𝗍.

It satisfies the tensor-hom adjunction in the sense

Hom𝖢𝖺𝗍(A×B,C)≃Hom𝖢𝖺𝗍(A,𝖥𝖼𝗍(B,C))

where 𝖥𝖼𝗍 denotes a functor category.

Example: C × 2

Let f,g:C→D be functors. Suppose there is a natural transformation φ:f→g. Then φ determines the functor

h:C×2_→D

such that

h(⋅,0)=f,h(⋅,1)=g,

where 2_={0,1} is the category with two objects and the non-identity morphism ⇝:0→1. Intuitively, h is a non-invertible homotopy from f to g. Indeed, define h by, for x:a→b in C,

h(x,id0)=f(x),h(x,id1)=g(x),h(x,⇝)=g(x)∘φa=φb∘f(x).

Conversely, given h:C×2_→D, we get f,g,φ by f=h(⋅,0),g=h(⋅,1) and φa=h(ida,⇝).

Bifunctor

A functor whose domain is a product category is called a bifunctor. A bifunctor can be defined in each variable separately in the following sense:

Proposition— Each bifunctor

F:A×B→C

determines the families of the functors, for objects a in A and b in B,

Fb:A→C,Fa:B→C

given by

Fba=F(a,b) and Fbf=F(f,idb)

for f:a→a′ and similarly for Fa. They commute in the sense:

Fa′g∘Fbf=Fb′f∘Fag.

Conversely, given families of functors Fb,Fa as above, if they commute, they define the bifunctor F:A×B→C by

F(f,g)=Fb′f∘Fag.

For example, consider (a,b)↦Hom⁡(a,b):Cop×C→𝖲𝖾𝗍. For each fixed b in B, we have the functor

Hom⁡(−,b):Cop→𝖲𝖾𝗍

by pullback; i.e., f:a→a′ goes to the function

f∗:Hom⁡(a′,b)→Hom⁡(a,b)

defined by f∗g=g∘f. On the other hand, Hom⁡(a,−):C→𝖲𝖾𝗍 is defined by pushforward; i.e., f↦f∗=f∘−. Clearly, these two functors commute (the associativity of composition) and so, by the proposition, we get the functor called the Hom functor

Hom⁡(−,−):Cop×C→𝖲𝖾𝗍,

which is explicitly given as: (f,g)↦(h↦g∘h∘f).

There is a similar result for natural transformations between bifunctors:

Proposition— Let F,G:A,B→C be bifunctors and

α={αa,b:F(a,b)→G(a,b)∣a∈Ob⁡(A),b∈Ob⁡(B)}

a family of morphisms. Then α:F→G is a natural transformation if and only if it is natural in the first variable and the second variable separately; i.e., for each object b in B,

α−,b:F(−,b)→G(−,b)

is a natural transformation and similarly in the second variable.

References

  1. ↑ Mac Lane 1978, p. 37.
  2. ↑ Mac Lane 1978, Ch. II., § 5., Exercise 2.
  3. 1 2 Mac Lane 1978, Ch. II., § 3.
  4. ↑ Mac Lane 1978, Ch. II., § 5., Exercise 1.
  5. ↑ Mac Lane 1978, Ch. II., § 4., Exercise 8.
  6. ↑ Mac Lane 1978, Ch. II., § 3., Proposition 1.
  7. ↑ Mac Lane 1978, Ch. II., § 3., Proposition 2.