Product (category theory)


Product (category theory)

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.

Definition

Let "C" be a category and let {"Xi" | "i" ∈ "I"} 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" : "X" → "Xi" (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" : "Y" → "Xi", there exists a unique morphism "f" : "Y" → "X" such that for all "i" ∈ "I" it is the case that "fi" = "πi" "f". That is, the following diagram commutes (for all "i"):

If the family of objects consists of only two members the product is usually written "X"1×"X"2, and the diagram takes the form:

The unique arrow "f" making this diagram commute is sometimes denoted ⟨"f"1,"f"2⟩.

Examples

* 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 o X_j mathrm{ , } quad pi_j((x_i)_{i in I}) := x_jGiven any set "Y" with a family of functions:f_i : Y o X_ithe universal arrow "f" is defined as:f:Y o prod_{i in I} X_i mathrm{ , } quad f(y) := (f_i(y))_{i in I}

*In the category of topological spaces, the product is the space whose underlying set is the cartesian product and which carries the product topology.

*In the category of modules over some ring R, the product is the cartesian product with addition defined componentwise and distributive multiplication.

*In the category of groups, the product is given by the cartesian product with multiplication defined componentwise.

* In the category of algebraic varieties, the categorical product is given by the Segre embedding.

* In the category of semi-abelian monoids, the categorical product is given by the history monoid.

* 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).

Discussion

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 {"X""i"} needs to have a product, but if it does, then the product is unique in a strong sense: if "π""i" : "X" → "X""i" and "π"’"i" : "X"’ → "X""i" are two products of the family {"X""i"}, then (by the definition of products) there exists a unique isomorphism "f" : "X" → "X"’ 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 Δ: "C" → "C"×"C" be the diagonal functor which assigns to each object "X" the ordered pair ("X","X") and to each morphism "f":"X" → "Y" 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 "C""I" → "C". The product of the family {"X""i"} is then often denoted by ∏"i" "X""i", and the maps π"i" are known as the natural projections. We have a natural isomorphism :operatorname{Hom}_Cleft(Y,prod_{iin I}X_i ight) simeq prod_{iin I}operatorname{Hom}_C(Y,X_i)(where Hom"C"("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 "X"1,...,"X""n" is often denoted by "X"1×...×"X""n".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 imes (Y imes Z)simeq (X imes Y) imes Zsimeq X imes Y imes Z:X imes 1 simeq 1 imes X simeq X:X imes Y simeq Y imes XThese properties are formally similar to those of a commutative monoid; a category with its finite products and terminal object constitutes a symmetric monoidal category.

Distributivity

In general, 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 diagram

The 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:X imes (Y + Z)simeq (X imes Y)+ (X imes Z).

ee also

* Coproduct – the dual of the product
* Limit and colimits
* Equalizer
* Inverse limit
* Cartesian closed category
* Categorical pullback


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Category theory — In mathematics, category theory deals in an abstract way with mathematical structures and relationships between them: it abstracts from sets and functions to objects and morphisms . Categories now appear in most branches of mathematics and in… …   Wikipedia

  • Product category — In the mathematical field of category theory, the product of two categories C and D , denoted nowrap| C × D and called a product category, is a straightforward extension of the concept of the Cartesian product of two sets.DefinitionThe product… …   Wikipedia

  • Limit (category theory) — In category theory, a branch of mathematics, the abstract notion of a limit captures the essential properties of universal constructions such as products and inverse limits. The dual notion of a colimit generalizes constructions such as disjoint… …   Wikipedia

  • Monoid (category theory) — In category theory, a monoid (or monoid object) (M,μ,η) in a monoidal category is an object M together with two morphisms called multiplication, and called unit, such that the diagrams and …   Wikipedia

  • Element (category theory) — In category theory, the concept of an element, or a point, generalizes the more usual set theoretic concept of an element of a set to an object of any category. This idea often allows to restate definitions or properties of morphisms (such as… …   Wikipedia

  • Pushout (category theory) — In category theory, a branch of mathematics, a pushout (also called a fibered coproduct or fibered sum or cocartesian square or amalgamed sum) is the colimit of a diagram consisting of two morphisms f : Z → X and g : Z → Y with a common …   Wikipedia

  • Pullback (category theory) — In category theory, a branch of mathematics, a pullback (also called a fibered product or Cartesian square) is the limit of a diagram consisting of two morphisms f : X → Z and g : Y → Z with a common codomain. The pullback is often written: P = X …   Wikipedia

  • End (category theory) — Not to be confused with the use of End to represent (categories of) endomorphisms. In category theory, an end of a functor is a universal dinatural transformation from an object e of X to S. More explicitly, this is a pair (e,ω), where e is an… …   Wikipedia

  • PRO (category theory) — In category theory, a PRO is a strict monoidal category whose objects are the natural integers and whose tensor product is given on objects by the addition on integers. By an integer n, we mean here the set {0,1,ldots,n 1}.Some examples of PROs:… …   Wikipedia

  • Descent (category theory) — In mathematics, the idea of descent has come to stand for a very general idea, extending the intuitive idea of gluing in topology. Since the topologists glue is actually the use of equivalence relations on topological spaces, the theory starts… …   Wikipedia


We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.