Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
In mathematics, an autonomous category is a where dual objects exist. A left (resp. right) autonomous category is a 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. is a synonym for autonomous category. In a , the existence of left duals is equivalent to the existence of right duals, categories of this kind are called (symmetric) . 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 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.