Concept

Autonomous category

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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.