Rahul Sharma (Editor)

Compact closed category

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

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 having finite-dimensional vector spaces as objects and linear maps as morphisms, with tensor product as the monoidal structure. Another example is Rel, the category having sets as objects and relations as morphisms, with Cartesian monoidal structure.

Contents

Symmetric compact closed category

A symmetric monoidal category ( C , ⊗ , I ) is compact closed if every object A ∈ C has a dual object. If this holds, the dual object is unique up to canonical isomorphism, and it is denoted A ∗ .

In a bit more detail, an object A ∗ is called the dual of A if it is equipped with two morphisms called the unit η A : I → A ∗ ⊗ A and the counit ε A : A ⊗ A ∗ → I , satisfying the equations

λ A ∘ ( ε A ⊗ A ) ∘ α A , A ∗ , A − 1 ∘ ( A ⊗ η A ) ∘ ρ A − 1 = i d A

and

ρ A ∗ ∘ ( A ∗ ⊗ ε A ) ∘ α A ∗ , A , A ∗ ∘ ( η A ⊗ A ∗ ) ∘ λ A ∗ − 1 = i d A ∗ ,

where λ , ρ are the introduction of the unit on the left and right, respectively.

For clarity, we rewrite the above compositions diagramatically. In order for ( C , ⊗ , I ) to be compact closed, we need the following composites to equal i d A :

A → ≅ A ⊗ I → A ⊗ η A ⊗ ( A ∗ ⊗ A ) → ≅ ( A ⊗ A ∗ ) ⊗ A → ϵ ⊗ A I ⊗ A → ≅ A

and i d A ∗ :

A ∗ → ≅ I ⊗ A ∗ → η ⊗ A ∗ ( A ∗ ⊗ A ) ⊗ A ∗ → ≅ A ∗ ⊗ ( A ⊗ A ∗ ) → A ∗ ⊗ ϵ A ∗ ⊗ I → ≅ A ∗

Definition

More generally, suppose ( C , ⊗ , I ) is a monoidal category, not necessarily symmetric, such as in the case of a pregroup grammar. The above notion of having a dual A ∗ for each object A is replaced by that of having both a left and a right adjoint, A l and A r , with a corresponding left unit η A l : I → A ⊗ A l , right unit η A r : I → A r ⊗ A , left counit ε A l : A l ⊗ A → I , and right counit ε A r : A ⊗ A r → I . These must satisfy the four yanking conditions, each of which are identities:

A → A ⊗ I → η r A ⊗ ( A r ⊗ A ) → ( A ⊗ A r ) ⊗ A → ϵ r I ⊗ A → A A → I ⊗ A → η l ( A ⊗ A l ) ⊗ A → A ⊗ ( A l ⊗ A ) → ϵ l A ⊗ I → A

and

A r → I ⊗ A r → η r ( A r ⊗ A ) ⊗ A r → A r ⊗ ( A ⊗ A r ) → ϵ r A r ⊗ I → A r A l → A l ⊗ I → η l A l ⊗ ( A ⊗ A l ) → ( A l ⊗ A ) ⊗ A l → ϵ l I ⊗ A l → A l

That is, in the general case, a compact closed category is both left and right-rigid, and biclosed.

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.

Properties

Compact closed categories are a special case of monoidal closed categories, which in turn are a special case of closed categories.

Compact closed categories are precisely the symmetric autonomous categories. They are also *-autonomous.

Every compact closed category C admits a trace. Namely, for every morphism f : A ⊗ C → B ⊗ C , one can define

T r A , B C ( f ) = ρ B ∘ ( i d B ⊗ ε C ) ∘ α B , C , C ∗ ∘ ( f ⊗ C ∗ ) ∘ α A , C , C ∗ − 1 ∘ ( i d A ⊗ η C ∗ ) ∘ ρ A − 1 : A → B

which can be shown to be a proper trace. It helps to draw this diagrammatically: A → ≅ A ⊗ I → A ⊗ η C ∗ A ⊗ ( C ⊗ C ∗ ) → ≅ ( A ⊗ C ) ⊗ C ∗ → f ⊗ C ∗ ( B ⊗ C ) ⊗ C ∗ → ≅ B ⊗ ( C ⊗ C ∗ ) → B ⊗ ε C B ⊗ I → ≅ B .

Examples

The canonical example is the category FdVect with finite-dimensional vector spaces as objects and linear maps as morphisms. Here A ∗ is the usual dual of the vector space A .

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, it is symmetric monoidal closed.

Simplex category

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

f r ( n ) = sup { m ∈ N | f ( m ) ≤ n }

and the left adjoint

f l ( n ) = inf { m ∈ N | n ≤ f ( m ) }

The left and right units and counits are:

id ≤ f ∘ f l (left unit) id ≤ f r ∘ f (right unit) f l ∘ f ≤ id (left counit) f ∘ f r ≤ id (right counit)

One of the yanking conditions is then

f = f ∘ id ≤ f ∘ ( f r ∘ f ) = ( f ∘ f r ) ∘ f ≤ id ∘ f = f .

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 dagger symmetric monoidal category which is compact closed is a dagger compact category.

Rigid 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.

References

Compact closed category Wikipedia
(Text) CC BY-SA