Opentopia Directory Encyclopedia Tools

Cartesian closed category

Encyclopedia : C : CA : CAR : Cartesian closed category


In category theory, a category is cartesian closed if, roughly speaking, any morphism defined on a product of two objects can be naturally identified with a morphism defined on one of the factors. These categories are particularly important in mathematical logic and the theory of programming. For generalizations of this notion to monoidal categories, see closed monoidal category.

Definition

The category C is called cartesian closed iff it satisfies the following three properties: For the first two conditions above, it is the same to require that any finite (possibly empty) family of objects of C admit a product in C, because of the natural associativity of the categorical product and noticing that the empty product in a category is nothing but the terminal object of that category.

For the third condition it is equivalent to ask that the functor –×Y (i.e. the functor from C to C that maps objects X to X×Y and morphisms φ to φ×idY) has a right adjoint, usually denoted –Y, for all objects Y in C. This in turn, is expressed by the existence of a bijection between the hom-sets

[\mathrm(X\times Y,Z) \cong \mathrm(X,Z^Y)]
which is natural in both X and Z.

Examples

Examples of cartesian closed categories include: The following categories are not cartesian closed:

Applications

In cartesian closed categories, a "function of two variables" (a morphism f:X×YZ) can always be represented as a "function of one variable" (the morphism λf:XZY). In computer science applications, this is known as currying; it has led to the realization that simply-typed lambda calculus can be interpreted in any cartesian closed category.

Certain cartesian closed categories, the topoi, have been proposed as a general setting for mathematics, instead of traditional set theory.

The renowned computer scientist John Backus has advocated a variable-free notation, or Function-level programming, which in retrospect bears some similarity to the internal language of cartesian closed categories. CAML is more consciously modelled on cartesian closed categories.

Equational theory

In every cartesian closed category (using exponential notation), (XY)Z and (XZ)Y are isomorphic for all objects X, Y and Z. We write this as the "equation"

(xy)z = (xz)y
What other such equations are valid in all cartesian closed categories? It turns out that all of them follow logically from the following axioms:

 


From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.

Search Titles
0123456789
ABCDEFGHIJ
KLMNOPQRST
UVWXYZ?

E-mail this article to:

Personal Message: