Product and Coproduct
Products and coproducts are the simplest non-trivial limits and colimits. They generalize the Cartesian product and disjoint union from to arbitrary categories, defined purely by their universal properties.
Products
Let be objects in a category . A product of and is an object together with morphisms and (called projections) satisfying the following universal property:
For every object and morphisms , , there exists a unique morphism such that and .
For a family of objects , the product is an object with projections universal for compatible families: any family factors uniquely through .
Coproducts
The coproduct of and is an object (or , or ) with morphisms and (called coprojections or inclusions) satisfying:
For every object and morphisms , , there exists a unique morphism such that and .
The coproduct in is the product in . This is the first instance of categorical duality: every statement about products dualizes to a statement about coproducts by reversing all arrows.
Examples
In , the product is the Cartesian product with the usual projections. More generally, is the set of all choice functions.
In , the coproduct is the disjoint union . Given and , the unique map acts as on elements from and on elements from .
In , the product is the direct product with componentwise operations: . The projections are the standard group homomorphisms.
In , the coproduct is the free product : words alternating between elements of and , subject only to the relations in and individually. For example, (the free group on 2 generators). The free product is typically much larger than the direct product.
In , finite products and finite coproducts coincide: (the direct sum). The projections and inclusions make it both a product and a coproduct. For infinite families, the product and coproduct differ: the coproduct consists of tuples with only finitely many nonzero entries.
In , the product has the product topology (generated by products of open sets). For arbitrary products , this is the product topology (coarsest topology making all projections continuous), not the box topology.
In , the coproduct is the disjoint union with the topology where is open iff is open in for each .
In a poset viewed as a category, the product of and is the greatest lower bound (meet, infimum) . The coproduct is the least upper bound (join, supremum) . A category where all binary products and coproducts exist corresponds to a lattice.
In , the product (fiber product over the base ) is the scheme representing . For affine schemes, .
In , the product is the direct product (all tuples) and the coproduct is the direct sum (finite support). When is finite, these coincide.
In , the coproduct is the tensor product: . This is because naturally. In (the category of -algebras), the coproduct is .
Not every category has products. In the category of fields , the product does not exist. If it did, there would be ring homomorphisms from a field to both and , which is impossible since they have different characteristics.
Relation to Hom
An object with morphisms is a product if and only if for every :
naturally in . Dually, with is a coproduct if and only if naturally in .
Products and coproducts are special cases of limits and colimits — they are limits over discrete diagrams. Together with equalizers, products suffice to construct all limits. The existence of all products and equalizers in a category is equivalent to the existence of all (small) limits.