ترغب بنشر مسار تعليمي؟ اضغط هنا

The 2-Chu-Dialectica construction and the polycategory of multivariable adjunctions

135   0   0.0 ( 0 )
 نشر من قبل Michael Shulman
 تاريخ النشر 2018
  مجال البحث
والبحث باللغة English
 تأليف Michael Shulman




اسأل ChatGPT حول البحث

Cheng, Gurski, and Riehl constructed a cyclic double multicategory of multivariable adjunctions. We show that the same information is carried by a double polycategory, in which opposite categories are polycategorical duals. Moreover, this double polycategory is a full substructure of a double Chu construction, whose objects are a sort of polarized category, and which is a natural home for 2-categorical dualities. We obtain the double Chu construction using a general Chu-Dialectica construction on polycategories, which includes both the Chu construction and the categorical Dialectica construction of de Paiva. The Chu and Dialectica constructions each impose additional hypotheses making the resulting polycategory representable (hence *-autonomous), but for different reasons; this leads to their apparent differences.



قيم البحث

اقرأ أيضاً

116 - Rune Haugseng 2020
We use the basic expected properties of the Gray tensor product of $(infty,2)$-categories to study (co)lax natural transformations. Using results of Riehl-Verity and Zaganidis we identify lax transformations between adjunctions and monads with commut ative squares of (monadic) right adjoints. We also identify the colax transformations whose components are equivalences (generalizing the icons of Lack) with the 2-morphisms that arise from viewing $(infty,2)$-categories as simplicial $infty$-categories. Using this characterization we identify the $infty$-category of monads on a fixed object and colax morphisms between them with the $infty$-category of associative algebras in endomorphisms.
The categorical modeling of Petri nets has received much attention recently. The Dialectica construction has also had its fair share of attention. We revisit the use of the Dialectica construction as a categorical model for Petri nets generalizing th e original application to suggest that Petri nets with different kinds of transitions can be modeled in the same categorical framework. Transitions representing truth-values, probabilities, rates or multiplicities, evaluated in different algebraic structures called lineales are useful and are modeled here in the same category. We investigate (categorical instances of) this generalized model and its connections to more recent models of categorical nets.
Godels Dialectica interpretation was designed to obtain a relative consistency proof for Heyting arithmetic, to be used in conjunction with the double negation interpretation to obtain the consistency of Peano arithmetic. In recent years, proof theor etic transformations (so-called proof interpretations) that are based on Godels Dialectica interpretation have been used systematically to extract new content from proofs and so the interpretation has found relevant applications in several areas of mathematics and computer science. Following our previous work on Godel fibrations, we present a (hyper)doctrine characterisation of the Dialectica which corresponds exactly to the logical description of the interpretation. To show that we derive in the category theory the soundness of the interpretation of the implication connective, as expounded on by Spector and Troelstra. This requires extra logical principles, going beyond intuitionistic logic, Markovs Principle (MP) and the Independence of Premise (IP) principle, as well as some choice. We show how these principles are satisfied in the categorical setting, establishing a tight (internal language) correspondence between the logical system and the categorical framework. This tight correspondence should come handy not only when discussing the applications of the Dialectica already known, like its use to extract computational content from (some) classical theorems (proof mining), its use to help to model specific abstract machines, etc. but also to help devise new applications.
282 - Adriana Balan 2014
Let $U$ be a strong monoidal functor between monoidal categories. If it has both a left adjoint $L$ and a right adjoint $R$, we show that the pair $(R,L)$ is a linearly distributive functor and $(U,U)dashv (R,L)$ is a linearly distributive adjunction , if and only if $Ldashv U$ is a Hopf adjunction and $Udashv R$ is a coHopf adjunction. We give sufficient conditions for a strong monoidal $U$ which is part of a (left) Hopf adjunction $Ldashv U$, to have as right adjoint a twisted version of the left adjoint $L$. In particular, the resulting adjunction will be (left) coHopf. One step further, we prove that if $L$ is precomonadic and $Lmathbf I$ is a Frobenius monoid (where $mathbf I$ denotes the unit object of the monoidal category), then $Ldashv Udashv L$ is an ambidextrous adjunction, and $L$ is a Frobenius monoidal functor. We transfer these results to Hopf monads: we show that under suitable exactness assumptions, a Hopf monad $T$ on a monoidal category has a right adjoint which is also a Hopf comonad, if the object $Tmathbf I$ is dualizable as a free $T$-algebra. In particular, if $Tmathbf I$ is a Frobenius monoid in the monoidal category of $T$-algebras and $T$ is of descent type, then $T$ is a Frobenius monad and a Frobenius monoidal functor.
Chu connections and back diagonals are introduced as morphisms for distributors between categories enriched in a small quantaloid $mathcal{Q}$. These notions, meaningful for closed bicategories, dualize the constructions of arrow categories and the F reyd completion of categories. It is shown that, for a small quantaloid $mathcal{Q}$, the category of complete $mathcal{Q}$-categories and left adjoints is a retract of the dual of the category of $mathcal{Q}$-distributors and Chu connections, and it is dually equivalent to the category of $mathcal{Q}$-distributors and back diagonals. As an application of Chu connections, a postulation of the intuitive idea of reduction of formal contexts in the theory of formal concept analysis is presented, and a characterization of reducts of formal contexts is obtained.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا