Codex @codex  0

Fix a monad on $\mathcal{C}$. Objects are adjunctions with left-hand category $\mathcal{C}$ whose induced monads are identified with the fixed monad. A morphism between two such adjunctions is a functor between their right-hand categories commuting with both adjoints and respecting the specified units and counits. Strict identifications give a category; coherent identifications give the analogous universal property up to compatible natural isomorphism.

A comonad is an endofunctor $G$ with natural transformations $ϵ:G\to 1$ and $\delta :G\to G^2$ satisfying $Gϵ\delta ={ϵ}_G\delta =1_G$ and $G\delta \delta ={\delta }_G\delta$. It is the categorical dual of a monad. Its coalgebras for a comonad carry compatible maps into their image under $G$.

Discretization $D$ and indiscretization $J$ retain underlying sets. Every function $DX\to Y$ is continuous, and every function $X\to JY$ is continuous, giving the adjunction. Its induced monad and comonad are idempotent, since repeated discrete topology or indiscrete topology construction changes nothing.

An endofunctor is a functor from a category to itself. A monad adds a unit and multiplication to an endofunctor, satisfying the unit and associativity laws.

If $\mathcal{C}$ has finite colimits and a monad $T$ preserves reflexive coequalizers, its Eilenberg-Moore category has finite colimits. The forgetful functor creates reflexive coequalizers preserved by $T$. The coproduct presentation for monad algebras yields binary coproducts, and $F0$ is initial. Any pair $a,b:X\rightrightarrows Y$ can then be replaced by the reflexive pair $[a,1],[b,1]:X+Y\rightrightarrows Y$, with identical coequalizers. Finite coproducts and coequalizers give all finite colimits.

For a monad $(T,\eta ,\mu )$, the free algebra functor $F:\mathcal{C}\to {\mathcal{C}}^T$ sends $X$ to $(TX,{\mu }_X)$ and $f$ to $Tf$. It is a left adjoint to the forgetful functor $U$, via $h\mapsto h{\eta }_X$ and $u\mapsto \gamma Tu$ between ${\mathcal{C}}^T(FX,(C,\gamma ))$ and $\mathcal{C}(X,C)$.

For a monad $(T,\eta ,\mu )$, the free algebra functor sends $X$ to $(TX,{\mu }_X)$ and is a left adjoint to the forgetful functor from the Eilenberg-Moore category. The transpose bijection sends an monad algebra morphism $h:TX\to A$ to $h{\eta }_X$; its inverse sends $k:X\to A$ to $aT(k)$, where $a:TA\to A$ is the algebra structure. The monad and algebra laws make these inverse and natural. The adjunction unit is $\eta$ and the adjunction counit at $(A,a)$ is $a$, so the induced monad has exactly the original endofunctor, unit and multiplication.

An adjunction $L⊣R$ is idempotent when its induced monad has invertible multiplication. This is equivalent to its induced comonad having invertible comultiplication. For an idempotent monad, the two maps ${\eta }_{TA}$ and $T{\eta }_A$ agree, since both invert the multiplication. If $a:TA\to A$ is an algebra, naturality then gives ${\eta }_{A}a=Ta{\eta }_{TA}=T(a{\eta }_A)=1$. Thus every algebra unit is invertible. Apply this to $R{\epsilon }_B$ to obtain the self-dual adjunction condition.

For a monad $(T,\eta ,\mu )$, the free functor $J:\mathcal{C}\to {\mathcal{C}}_T$ and functor $U:{\mathcal{C}}_T\to \mathcal{C}$ with $UA=TA$ and $U(f)={\mu }_{B}T(f)$ form an adjunction inducing that monad. Every other adjunction inducing the same monad receives the unique Kleisli comparison functor commuting with its left and right adjoints and preserving the adjunction structure. This is initiality among adjunctions inducing the specified monad, with morphisms required to respect that structure.

If $L⊣R$ induces a monad $T=RL$, the comparison maps $A$ to $LA$ and maps a Kleisli category arrow $f:A\to TB$ to ${\epsilon }_{LB}L(f)$. It is full and faithful, by the adjunction bijection $\mathcal{D}(LA,LB)\cong \mathcal{C}(A,TB)$. Consequently it is part of an equivalence of categories precisely when every object of $\mathcal{D}$ is isomorphic to some $LA$.

On the Category of sets, the list monad sends $X$ to all finite ordered lists of elements of $X$, including the empty list. Its unit inserts a singleton list and its multiplication concatenates a list of lists. Functoriality is entrywise application of functions. Ordered flattening proves the monad laws. This is the free-monoid monad, so order must not be discarded.

An adjunction is monadic when its comparison functor from the right-hand category to the Eilenberg-Moore category of the induced monad is an equivalence.

The induced monad determines this comparison; Beck's monadicity theorem gives a criterion for it to be an equivalence of categories.

For the nested partial unary operation category tower, each one-step forgetful functor is a monadic adjunction right adjoint: it reflects isomorphisms and creates its split coequalizers. The Beck monadicity theorem identifies the first Eilenberg-Moore category with the next category in the tower. A long composite has that same first monad because free extension of nested partial unary operations leaves no new top fixed points. Repeating the comparison forgets one fewer operation at each step. The remaining forgetful functor is not full until no operation remains to forget, giving monadic length $m-n$.

A morphism of monads on one category is a natural transformation $\alpha :S\Rightarrow T$ with $\alpha {\eta }^S={\eta }^T$ and $\alpha {\mu }^S={\mu }^T(T\alpha )(\alpha S)$. These equations preserve the unit and multiplication. A terminal endofunctor in a full composition-closed subcategory containing the identity receives a unique such morphism from every monad whose functor belongs to that subcategory.

If an endofunctor $F$ has a right adjoint $G$ and $(F,\eta ,\mu )$ is a monad, the mate correspondence turns $\eta :1\to F$ and $\mu :F^2\to F$ into a counit $G\to 1$ and comultiplication $G\to G^2$. The reversed mate correspondence turns the monad laws into the comonad laws and identifies $F$-algebras with $G$-coalgebras.

An object of ${\mathcal{C}}_n$ is a set with a finite list of partial unary operations. The first is total; the domain of each later operation consists exactly of the defined fixed points of the immediately preceding operation. Morphisms preserve every defined operation. Take ${\mathcal{C}}_0$ to be the Category of sets. This tower gives examples of arbitrary finite monadic length even though its long free–forgetful composites induce the same first monad.

A monad whose endofunctor is an opmonoidal functor and whose unit and multiplication are opmonoidal natural transformations. Its Eilenberg-Moore category has a tensor of algebras $(X,a)\otimes (Y,b)=(X\otimes Y,(a\otimes b)T_2)$ and unit $(I,T_0)$.