Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMonads of regular theories
154
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We characterize the category of monads on $Set$ and the category of Lawvere theories that are equivalent to the category of regular equational theories.
rate research
Read More
Monads can be interpreted as encoding formal expressions, or formal operations in the sense of universal algebra. We give a construction which formalizes the idea of evaluating an expression partially: for example, 2+3 can be obtained as a partial evaluation of 2+2+1. This construction can be given for any monad, and it is linked to the famous bar construction, of which it gives an operational interpretation: the bar construction induces a simplicial set, and its 1-cells are partial evaluations. We study the properties of partial evaluations for general monads. We prove that whenever the monad is weakly cartesian, partial evaluations can be composed via the usual Kan filler property of simplicial sets, of which we give an interpretation in terms of substitution of terms. In terms of rewritings, partial evaluations give an abstract reduction system which is reflexive, confluent, and transitive whenever the monad is weakly cartesian. For the case of probability monads, partial evaluations correspond to what probabilists call conditional expectation of random variables. This manuscript is part of a work in progress on a general rewriting interpretation of the bar construction.
We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.
We provide new categorical perspectives on Jacobs notion of hypernormalisation of sub-probability distributions. In particular, we show that a suitable general framework for notions of hypernormalisation is that of a symmetric monoidal category endowed with a linear exponential monad---a notion arising in the categorical semantics of Girards linear logic. We show that Jacobs original notion of hypernormalisation arises in this way from the finitely supported probability measure monad on the category of sets, which can be seen as a linear exponential monad with respect to a monoidal structure on sets arising from a quantum-algebraic object which we term the Giry tricocycloid. We give many other examples of hypernormalisation arising from other linear exponential monads.
An adjunction is a pair of functors related by a pair of natural transformations, and relating a pair of categories. It displays how a structure, or a concept, projects from each category to the other, and back. Adjunctions are the common denominator of Galois connections, representation theories, spectra, and generalized quantifiers. We call an adjunction nuclear when its categories determine each other. We show that every adjunction can be resolved into a nuclear adjunction. The resolution is idempotent in a strict sense. The resulting nucleus displays the concept that was implicit in the original adjunction, just as the singular value decomposition of an adjoint pair of linear operators displays their canonical bases. [snip] In his seminal early work, Ross Street described an adjunction between monads and comonads in 2-categories. Lifting the nucleus construction, we show that the resulting Street monad on monads is strictly idempotent, and extracts the nucleus of a monad. A dual treatment achieves the same for comonads. This uncovers remarkably concrete applications behind a notable fragment of pure 2-category theory. The other way around, driven by the tasks and methods of machine learning and data analysis, the nucleus construction also seems to uncover remarkably pure and general mathematical content lurking behind the daily practices of network computation and data analysis.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
