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:
as objects: pairs of objects (A, B), where A is an object of C and B of D; as arrows from (A1, B1) to (A2, B2): pairs of arrows (f, g), where f : A1 → A2 is an arrow of C and g : B1 → B2 is an arrow of D; as composition, component-wise composition from the contributing categories: (f2, g2) o (f1, g1) = (f2 o f1, g2 o g1); as identities, pairs of identities from the contributing categories: 1(A, B) = (1A, 1B). 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 C i {\displaystyle C_{i}} indexed by a set I {\displaystyle I} , P = ∏ C i , p j : P → C j , j ∈ I {\displaystyle P=\prod C_{i},p_{j}:P\to C_{j},j\in I} satisfy:
given a family of functors f i : D → C i {\displaystyle f_{i}:D\to C_{i}} , there exists a unique functor f : D → P {\displaystyle f:D\to P} such that f j = p j ∘ f {\displaystyle f_{j}=p_{j}\circ f} for each j ∈ I {\displaystyle j\in 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 C a t {\displaystyle {\mathsf {Cat}}} . Thus, for example,
F c t ( A , ∏ i B i ) ≃ ∏ i F c t ( A , B i ) {\displaystyle \textstyle {\mathsf {Fct}}(A,\prod _{i}B_{i})\simeq \prod _{i}{\mathsf {Fct}}(A,B_{i})}
where F c t {\displaystyle {\mathsf {Fct}}} denotes a functor category.
Functoriality Given two functors f : C → D , g : C ′ → D ′ {\displaystyle f:C\to D,g:C'\to D'} , the product f × g : C × C ′ → D × D ′ {\displaystyle f\times g:C\times C'\to D\times D'} is defined component-wise; that is,
( f × g ) ( x , x ′ ) = ( f ( x ) , g ( x ′ ) ) {\displaystyle (f\times g)(x,x')=(f(x),g(x'))}
for a pair of objects or morphisms x , x ′ {\displaystyle x,x'} . (This product may also be characterized by the universal property similar to that for categories.) This way, we get the functor
× : C a t × C a t → C a t . {\displaystyle \times :{\mathsf {Cat}}\times {\mathsf {Cat}}\to {\mathsf {Cat}}.}
It satisfies the tensor-hom adjunction in the sense
Hom C a t ( A × B , C ) ≃ Hom C a t ( A , F c t ( B , C ) ) {\displaystyle \operatorname {Hom} _{\mathsf {Cat}}(A\times B,C)\simeq \operatorname {Hom} _{\mathsf {Cat}}(A,{\mathsf {Fct}}(B,C))}
where F c t {\displaystyle {\mathsf {Fct}}} denotes a functor category.
… excerpt ends here. Continue reading the full article.
