Related papers: Adjunction in Monoids

Lenses are a well-established structure for modelling bidirectional transformations, such as the interactions between a database and a view of it. Lenses may be symmetric or asymmetric, and may be composed, forming the morphisms of a…

We introduce a bialgebra axiom for a pair $(c,\ell)$ of a colax-monoidal and a lax-monoidal structures on a functor $F\colon \mathscr{M}_1\to \mathscr{M}_2$ between two (strict) symmetric monoidal categories. This axiom can be regarded as a…

We present an extension of Martin-L\"of Type Theory that contains a tiny object; a type for which there is a right adjoint to the formation of function types as well as the expected left adjoint. We demonstrate the practicality of this type…

For flows the rank is an invariant by linear change of time. But what we can say about isomorphisms? It seems that in case of mixing flows this problem is the most difficult. However the known technique of joinings provides non-isomorphism…

Let $<X>$ be the free monoid on a generating set $X$, and suppose one adjoins to $<X>$ universal 2-sided inverses to a finite set $S$ of its elements. We note an elementary algorithm which yields a normal form for elements of the resulting…

Given a pseudomonad $\mathcal{T} $, we prove that a lax $\mathcal{T} $-morphism between pseudoalgebras is a $\mathcal{T} $-pseudomorphism if and only if there is a suitable (possibly non-canonical) invertible $\mathcal{T} $-transformation.…

We apply the notion of relative adjoint functor to generalise closed monoidal categories. We define representations in such categories and give their relation with left actions of monoids. The translation of these representations under lax…

Let $A$ be a ring and $\M_A$ the category of $A$-modules. It is well known in module theory that for any $A $-bimodule $B$, $B$ is an $A$-ring if and only if the functor $-\otimes_A B: \M_A\to \M_A$ is a monad (or triple). Similarly, an $A…

For any algebra morphism in a monoidal category, we provide sufficient conditions (which are also necessary if the unit is a left tensor generator) for the attached induction functor being semiseparable. Under mild assumptions, we prove…

A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…

We prove an adjoint functor theorem in the setting of categories enriched in a monoidal model category $\mathcal V$ admitting certain limits. When $\mathcal V$ is equipped with the trivial model structure this recaptures the enriched…

This chapter describes interrelations between: (1) algebraic structure on sets of scalars, (2) properties of monads associated with such sets of scalars, and (3) structure in categories (esp. Lawvere theories) associated with these monads.…

Associated to a simple root of a finite-dimensional complex semisimple Lie algebra, there are several endofunctors (defined by Arkhipov, Enright, Frenkel, Irving, Jantzen, Joseph, Mathieu, Vogan and Zuckerman) on the BGG category…

Given a morphism of (small) groupoids with injective object map, we provide sufficient and necessary conditions under which the induction and co-induction functors between the categories of linear representations are naturally isomorphic. A…

We revisit once again the connection between three notions of computation: monads, arrows and idioms (also called applicative functors). We employ monoidal categories of finitary functors and profunctors on finite sets as models of these…

The functor between operadic algebras given by restriction along an operad map generally has a left adjoint. We give a necessary and sufficient condition for the restriction functor to admit a right adjoint. The condition is a factorization…

We present the notion of "cyclic double multicategory", as a structure in which to organise multivariable adjunctions and mates. The classic example of a 2-variable adjunction is the hom/tensor/cotensor trio of functors; we generalise this…

This note analyzes in terms of categorial proof theory some standard assumptions about negation in the absence of any other connective. It is shown that the assumptions for an involutive negation, like classical negation, make a kind of…

Via the adjunction $ - \boldsymbol{\cdot} 1 \dashv \mathcal V(1,-) \colon \mathsf{Span}(\mathcal V) \to \mathcal V \text{-} \mathsf{Mat} $ and a cartesian monad $ T $ on an extensive category $ \mathcal V $ with finite limits, we construct…

If $M$ is a matroid, then a simple matroid $M'$ with the same rank as $M$ is an adjoint of $M$ if there is an inclusion-reversing embedding $\phi$ of the lattice of flats of $M$ into the lattice of flats of $M'$ such that $\phi$ maps the…