Product (Category Theory) Information
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 |
Definition
Let C be a category with some objects X1 and X2. An object X is the product of X1 and X2, denoted , iff it satisfies this universal property:
- there exist morphisms , called the canonical projections or projection morphisms, such that for every object Y and pair of morphisms there exists a unique morphism such that the following diagram commutes:
The unique morphism f is called the product of morphisms f1 and f2 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 I. Then we obtain the definition of a product.
An object X is the product of a family {X}i of objects iff there exist morphisms , such that for every object Y and a I-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:
- Existence of f is guaranteed by the operation .
- Commutativity of diagrams above are guaranteed by the equality .
- Uniqueness of f is guaranteed by the equality .[1]
Also product may be derived from limit. A family of objects is a diagram without morphisms. If we regard our diagram as a functor, it is a functor from I considered as a discrete category. Then the definition of product coincides with the definition of limit, {f}i being a cone and projections being the limit (limiting cone).
As well as limit, product may be defined via universal property. For comparison see Limit#Universal property. Lets unfold that definition for binary product. In our case J is a discrete category with two objects, CJ is simply the product category , diagonal functor assigns to each object X the ordered pair (X,X) and to each morphism f the pair (f,f). The product in C is given by a universal morphism from the functor Δ to the object (X1,X2) in . This universal morphism consists of an object X of C and a morphism which contains projections.
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
with the canonical projections
Given any set Y with a family of functions
the universal arrow f is defined as
- 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 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 , so G cannot be terminal.
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 . 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 in.[2] Second, consider product functor. For families we should find a morphism . We choose the product of morphisms .
A category where every finite set of objects has a product is sometimes called a cartesian category[2] (although some authors use this phrase to mean "a category with all finite limits").
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
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
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
See also
- Coproduct – the dual of the product
- Limit and colimits
- Equalizer
- Inverse limit
- Cartesian closed category
- Categorical pullback
References
- ^ Lambek J., Scott P. J. (1988). Introduction to Higher-Order Categorical Logic. Cambridge University Press. p. 304.
- ^ a b Michael Barr, Charles Wells (1999). Category Theory - Lecture Notes for ESSLLI. p. 62. http://www.let.uu.nl/esslli/Courses/barr/barrwells.ps.
- Adámek, Jiří; Horst Herrlich, and George E. Strecker (1990). Abstract and Concrete Categories. John Wiley & Sons. ISBN 0-471-60922-6. http://katmat.math.uni-bremen.de/acc/acc.pdf.
- Barr, Michael; Charles Wells (1999). Category Theory for Computing Science. Les Publications CRM Montreal (publication PM023). Chapter 5.
- Mac Lane, Saunders (1998). Categories for the Working Mathematician. Graduate Texts in Mathematics 5 (2nd ed. ed.). Springer. ISBN 0-387-98403-8.
External links
- Interactive Web page which generates examples of products in the category of finite sets. Written by Jocelyn Paine.
Categories: Limits in categories
|
)
44 x 161px
[source page]
has created the article Ibn al-Banna (1256-1321), to whom he attributes