Compact closed category
In category theory, compact closed categories are a general context for treating dual objects. The idea of a dual object generalizes the more familiar concept of the dual of a finite-dimensional vector space. So, the motivating example of a compact closed category is FdVect, the category with finite-dimensional vector spaces as objects and linear maps as morphisms.
Symmetric compact closed category
where are the introduction of the unit on the left and right, respectively.
For clarity, we rewrite the above compositions diagramatically. In order for to be compact closed, we need the following composites to be :
More generally, suppose is a monoidal category, not necessarily symmetric, such as in the case of a pregroup grammar. The above notion of having a dual for each object A is replaced by that of having both a left and a right adjoint, and , with a corresponding left unit , right unit , left counit , and right counit . These must satisfy the four yanking conditions, each of which are identities:
Non-symmetric compact closed categories find applications in linguistics, in the area of categorial grammars and specifically in pregroup grammars, where the distinct left and right adjoints are required to capture word-order in sentences. In this context, compact closed monoidal categories are called (Lambek) pregroups.
Every compact closed category C admits a trace. Namely, for every morphism , one can define
which can be shown to be a proper trace. It helps to draw this diagrammatically:
The category of finite-dimensional representations of any group is also compact closed.
The category Vect, with all vector spaces as objects and linear maps as morphisms, is not compact closed.
The simplex category provides an example of a (non-symmetric) compact closed category. The simplex category is just the category of order-preserving (monotone) maps of finite ordinals (viewed as totally ordered sets); its morphisms are order-preserving (monotone) maps of integers. We make it into a monoidal category by moving to the arrow category, so the objects are morphisms of the original category, and the morphisms are commuting squares. Then the tensor product of the arrow category is the original composition operator. The left and right adjoints are the min and max operators; specifically, for a monotonic function f one has the right adjoint
and the left adjoint
The left and right units and counits are:
One of the yanking conditions is then
The others follow similarly. The correspondence can be made clearer by writing the arrow instead of , and using for function composition .
Dagger compact category
A monoidal category that is not symmetric, but otherwise obeys the duality axioms above, is known as a rigid category. A monoidal category where every object has a left (resp. right) dual is also sometimes called a left (resp. right) autonomous category. A monoidal category where every object has both a left and a right dual is sometimes called an autonomous category. An autonomous category that is also symmetric is then a compact closed category.