Autonomous category

In mathematics, an autonomous category is a monoidal category where dual objects exist.[1]

Definition

A left (resp. right) autonomous category is a monoidal category where every object has a left (resp. right) dual. An autonomous category is a monoidal category where every object has both a left and a right dual.[2] Rigid category is a synonym for autonomous category.

In a symmetric monoidal category, the existence of left duals is equivalent to the existence of right duals, categories of this kind are called (symmetric) compact closed categories.

In categorial grammars, categories which are both left and right rigid are often called pregroups, and are employed in Lambek calculus, a non-symmetric extension of linear logic.

The concepts of *-autonomous category and autonomous category are directly related, specifically, every autonomous category is *-autonomous. A *-autonomous category may be described as a linearly distributive category with (left and right) negations; such categories have two monoidal products linked with a sort of distributive law. In the case where the two monoidal products coincide and the distributivities are taken from the associativity isomorphism of the single monoidal structure, one obtains autonomous categories.

Notes and references
  1. Some authors use this term for a symmetric monoidal closed category, or for a biclosed monoidal category when symmetry is not assumed.
  2. Berman, pp 34

Sources
  • Yetter, David N. (2001). Functorial Knot Theory. World Scientific. ISBN 981-02-4443-6.
  • Berman, Stephen; Yuly Billi (2003). Vertex Operator Algebras in Mathematics and Physics. American Mathematical Society. ISBN 0-8218-2856-8.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.