|
|
|
|
|
Introduction he product of two (or more) objects in a category is a notion designed to capture the essence behind constructions in other areas of mathematics such as the cartesian product of sets, the direct product of groups, the direct product of rings and the product of topological spaces. Essentially, the product of a family of objects is the "most general" object which admits a morphism to each of the given objects. Introduction Definition Examples Discussion Distributivity See also Definition Let be a category with some objects and . An object is the product of and , denoted , iff it satisfies this universal property: there exist morphisms , called the canonical projections or projection morphisms, such that for every object and pair of morphisms there exists a unique morphism such that the following diagram commutes:The unique morphism is called the product of morphisms and and is denoted .Above we defined the binary product. Instead of two objects we can take an arbitrary family of objects indexed by some set . Then we obtain the definition of a product.An object is the product of a family of objects iff there exist morphisms , such that for every object and a -indexed family of morphisms there exists a unique morphism such that the following diagrams commute for all : The product is denoted ; if , then denoted and the product of morphisms is denoted .Alternatively, product may be defined totally by equations, here is an example for binary product: Examples In the category of sets, the product (in the category theoretic sense) is the cartesian product. Given a family of sets Xi the product is defined as with the canonical projections Given any set Y with a family of functions the universal arrow f is defined as Other examples:Discussion The product does not necessarily exist. For example, an empty product (i.e. is the empty set) is the same as a terminal object, and some categories, such as the category of infinite groups, do not have a terminal object: given any infinite group there are infinitely many morphisms , so cannot be terminal. If is a set such that all products for families indexed with exist, then it is possible to choose the products in a compatible fashion so that the product turns into a functor . How this functor maps objects is obvious. Mapping of morphisms is subtle, because product of morphisms defined above does not fit. First, consider binary product functor, which is a bifunctor. For we should find a morphism . We choose . This operation on morphisms is called cartesian product of morphisms.(although some authors use this phrase to mean "a category with all finite limits").Suppose is a cartesian category, product functors have been chosen as above, and denotes the terminal object of . We then have natural isomorphisms These properties are formally similar to those of a commutative monoid; a category with its finite products constitutes a symmetric monoidal category.Distributivity In a category with finite products and coproducts, there is a canonical morphism X×Y+X×Z ? X×(Y+Z), where the plus sign here denotes the coproduct. To see this, note that we have various canonical projections and injections which fill out the diagramcenterThe universal property for X×(Y+Z) then guarantees a unique morphism X×Y+X×Z ? X×(Y+Z). A distributive category is one in which this morphism is actually an isomorphism. Thus in a distributive category, one has the canonical isomorphism See also |
|
![]() |
|
|