Product (category theory)

From Wikipedia, the free encyclopedia

Jump to: navigation, search

In category theory, the 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.

Contents

Let C be a category and let {Xi | iI} be an indexed family of (not necessarily distinct) objects in C. The product of the set {Xi} is an object X together with a collection of morphisms πi : XXi (called the canonical projections or projection morphisms, which are often, but not always, epimorphisms) which satisfy a universal property: for any object Y and any collection of morphisms fi : YXi, there exists a unique morphism f : YX such that for all iI it is the case that fi = πi f. That is, the following diagram commutes (for all i):

Universal product of the product

If the family of objects consists of only two members the product is usually written X1×X2, and the diagram takes the form:

Universal product of the product

The unique arrow f making this diagram commute is sometimes denoted 〈f1,f2〉.

  • In the category Set (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
\prod_{i \in I} X_i := \{(x_i)_{i \in I} | x_i \in X_i \, \forall i \in I\}

with the canonical projections

\pi_j : \prod_{i \in I} X_i \to X_j \mathrm{ , } \quad \pi_j((x_i)_{i \in I}) := x_j

Given any set Y with a family of functions

f_i : Y \to X_i

the universal arrow f is defined as

f:Y \to \prod_{i \in I} X_i \mathrm{ , } \quad f(y) := (f_i(y))_{i \in I}
  • A partially ordered set can be treated as a category, using the order relation as the morphisms. In this case the products and coproducts correspond to greatest lower bounds (meets) and least upper bounds (joins).

The product construction given above is actually a special case of a limit in category theory. The product can be defined as the limit of any functor from a discrete category to C. Not every family {Xi} needs to have a product, but if it does, then the product is unique in a strong sense: if πi : XXi and πi : X’ → Xi are two products of the family {Xi}, then (by the definition of products) there exists a unique isomorphism f : XX’ such that πi = πi f for each i in I.

As with any universal property, the product can be understood as a universal morphism. Let Δ: CC×C be the diagonal functor which assigns to each object X the ordered pair (X,X) and to each morphism f:XY the pair (f,f). Then the product X×Y in C is given by a universal morphism from the functor Δ to the object (X,Y) in C×C.

An empty product (i.e. I is the empty set) is the same as a terminal object in C.

If I is a set such that all products for families indexed with I exist, then it is possible to choose the products in a compatible fashion so that the product turns into a functor CIC. The product of the family {Xi} is then often denoted by ∏i Xi, and the maps πi are known as the natural projections. We have a natural isomorphism

\operatorname{Hom}_C\left(Y,\prod_{i\in I}X_i\right) \simeq \prod_{i\in I}\operatorname{Hom}_C(Y,X_i)

(where HomC(U,V) denotes the set of all morphisms from U to V in C, the left product is the one in C and the right is the cartesian product of sets). Thus the covariant hom-functor takes products to products. This is a consequence of the fact that the hom-functor is continuous.

If I is a finite set, say I = {1,...,n}, then the product of objects X1,...,Xn is often denoted by X1×...×Xn. Suppose all finite products exist in C, product functors have been chosen as above, and 1 denotes the terminal object of C corresponding to the empty product. We then have natural isomorphisms

X\times (Y \times Z)\simeq (X\times Y)\times Z\simeq X\times Y\times Z
X\times 1 \simeq 1\times X \simeq X
X\times Y \simeq Y\times X

These properties are formally similar to those of a commutative monoid; a category with its finite products and terminal object constitutes a symmetric monoidal category.

In general, there is a canonical morphism X×Y+X×ZX×(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 diagram

The universal property for X×(Y+Z) then guarantees a unique morphism X×Y+X×ZX×(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

X\times (Y + Z)\simeq (X\times Y)+ (X \times Z).

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.