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 logic and the theory of programming.
| Table of contents |
|
2 Examples 3 Applications 4 Equational theory |
Definition
The category C is called cartesian closed iff it satisfies the following three properties:
- it has a terminal object
- any two objects X and Y of C have a product X×Y in C
- for every object Y in C, the functor −×Y from C to C has a right adjoint
The term "cartesian closed" is used because one thinks of Y×X as akin to the cartesian product of two sets.
Examples
Examples of cartesian closed categories include:
- The category Set of all sets, with functions as morphisms, is cartesian closed. The product X×Y is the cartesian product of X and Y, and ZY is the set of all functions from Y to Z. The adjointness is expressed by the following fact: the function f : X×Y → Z is naturally identified with the function g : X → ZY defined by g(x)(y) = f(x,y) for all x in X and y in Y.
- The category of finite sets, with functions as morphisms, is cartesian closed for the same reason.
- If G is a group, then the category of all G-sets is cartesian closed. If Y and Z are two G-sets, then ZY is again the set of all functions from Y to Z, with the following G action: (g.f)(y) = g.(f(g-1y)) for every g in G, f in ZY and y in Y.
- The category of finite G-sets is also cartesian closed.
- If C is a small category, then the functor category SetC consisting of all covariant functors from C into the category of sets, with natural transformations as morphisms, is cartesian closed. If F and G are two functors from C to Set, then the exponential FG is the functor whose value on the object X of C is given by the set of all natural transformations from (X,−) × G to F.
- The earlier example of G-sets can be seen as a special case of functor categories: every group can be considered as a one-object category, and G-sets are nothing but functors from this category to Set
- The category of all directed graphs is cartesian closed; this is a functor category as explained under functor category.
- In algebraic topology, cartesian closed categories are particularly easy to work with, and it is regrettable that neither the category of topological spaces with continuous maps nor the category of smooth manifolds with smooth maps is cartesian closed. Substitute categories have therefore been considered: the category of compactly generated Hausdorff spaces is cartesian closed, as is the category of Frölicher spaces.
- The category Cat of all small categories (with functors as morphisms) is cartesian closed; the exponential CD is given by the functor category consisting of all functors from D to C, with natural transformations as morphisms.
- If X is a topological space, then the open sets in X form the objects of a category O(X); there's a unique morphism from U to V if and only if U is a subset of V. This category is cartesian closed; the "product" of U and V is the intersection of U and V and the exponential UV is the interior of U∪(X\\V).
- The category of all vector spaces over some fixed field is not cartesian closed, neither is the category of all finite-dimensional vector spaces. While they have products (called direct sums), the product functors don't have right adjoints.
- The category of abelian groups is not cartesian closed, for the same reason.
Applications
In cartesian closed categories, a "function of two variables" can always be represented as a "function of one variable". In other contexts, this is known as currying; it has lead to the realization that lambda calculus can be formulated in any cartesian closed category.
Certain cartesian closed categories, the topoi, have been proposed as a general setting for mathematics.
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
- x×(y×z) = (x×y)×z
- x×y = y×x
- x×1 = x (here 1 denotes the terminal object of C)
- 1x = 1
- x1 = x
- (x×y)z = xz×yz
- (xy)z = x(y×z)
