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 with some objects X₁ and X₂. An object X is a product of X₁ and X₂, denoted X₁ × X₂, iff it satisfies this universal property:

there exist morphisms π₁ : X → X₁, π₂ : X → X₂ such that for every object Y and pair of morphisms f₁ : Y → X₁, f₂ : Y → X₂ there exists a unique morphism f : Y → X such that the following diagram commutes:

The unique morphism f is called the product of morphisms f₁ and f₂ and is denoted < f₁, f₂ >. The morphisms π₁ and π₂ are called the canonical projections or projection morphisms.

Above we defined the binary product. Instead of two objects we can take an arbitrary family of objects indexed by some set I. Then we obtain the definition of a product.

An object X is the product of a family (X_i)_i∈I of objects iff there exist morphisms π_i : X → X_i, such that for every object Y and a I-indexed family of morphisms f_i : Y → X_i there exists a unique morphism f : Y → X such that the following diagrams commute for all i∈I:

The product is denoted Π_i∈I X_i; if I = {1, ..., n}, then denoted X₁ × ... × X_n and the product of morphisms is denoted < f₁, ..., f_n >.

Equational definition

Alternatively, the product may be defined through equations. So, for example, for the binary product:

• Existence of f is guaranteed by the operation < -,- >.
• Commutativity of the diagrams above is guaranteed by the equality ∀f₁, ∀f₂, ∀i∈{1, 2}, π_i o < f₁, f₂ > = f_i.
• Uniqueness of f is guaranteed by the equality ∀g : Y → X, < π₁ o g, π₂ o g > = g.

As a limit

The product is a special case of a limit. This may be seen by using a discrete category (a family of objects without any morphisms, other than their identity morphisms) as the diagram required for the definition of the limit. The discrete objects will serve as the index of the components and projections. If we regard this diagram as a functor, it is a functor from the index set I considered as a discrete category. The definition of the product then coincides with the definition of the limit, { f }_i being a cone and projections being the limit (limiting cone).

Universal property

Just as the limit is a special case of the universal construction, so is the product. Starting with the definition given for the universal property of limits, take J as the discrete category with two objects, so that C^J is simply the product category C × C. The diagonal functor Δ : C → C × C assigns to each object X the ordered pair (X, X) and to each morphism f the pair (f, f). The product X₁ × X₂ in C is given by a universal morphism from the functor Δ to the object (X₁, X₂) in C × C. This universal morphism consists of an object X of C and a morphism (X, X) → (X₁, X₂) which contains projections.

Examples

In the category of sets, the product (in the category theoretic sense) is the cartesian product. Given a family of sets X_i the product is defined as

Π_i∈I X_i := { (x_i)_i∈I | ∀i∈I, x_i∈X_i }

with the canonical projections

π_j : Π_i∈I X_i → X_j, π_j((x_i)_i∈I) := x_j.

Given any set Y with a family of functions

f_i : Y → X_i,

the universal arrow f is defined as

f : Y → Π_i∈I X_i, f(y) := (f_i(y))_i∈I .

Other examples:

• In the category of topological spaces, the product is the space whose underlying set is the cartesian product and which carries the product topology. The product topology is the coarsest topology for which all the projections are continuous.
• 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 the direct product of groups given by the cartesian product with multiplication defined componentwise.
• In the category of relations (Rel), the product is given by the disjoint union. (This may come as a bit of a surprise given that the category of sets (Set) is a subcategory of Rel.)
• 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 does not necessarily exist. For example, an empty product (i.e. I 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 G there are infinitely many morphisms ℤ → G, so G cannot be terminal.

If I is a set such that all products for families indexed with I exist, then one can treat each product as a functor C^I → C. 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 f₁ : X₁ → Y₁, f₂ : X₂ → Y₂ we should find a morphism X₁ × X₂ → Y₁ × Y₂. We choose < f₁ o π₁, f₂ o π₂ >. This operation on morphisms is called cartesian product of morphisms. Second, consider product functor. For families {X}_i, {Y}_i, f_i : X_i → Y_i we should find a morphism Π_i∈I X_i → Π_i∈I Y_i. We choose the product of morphisms {f_i o π_i }_i.

A category where every finite set of objects has a product is sometimes called a cartesian category (although some authors use this phrase to mean "a category with all finite limits").

The product is associative. Suppose C is a cartesian category, product functors have been chosen as above, and 1 denotes the terminal object of C. 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 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 diagram

File:Product-Coproduct Distributivity.png

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\times (Y + Z)\simeq (X\times Y)+ (X \times Z).$

See also

• Coproduct – the dual of the product
• Diagonal functor – the left adjoint of the product functor.
• Limit and colimits
• Equalizer
• Inverse limit
• Cartesian closed category
• Categorical pullback

References

• Chapter 5.

External links

• Interactive Web page which generates examples of products in the category of finite sets. Written by Jocelyn Paine.