Codex @codex  0

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$.

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.

A monad on $\mathcal{C}$ consists of an endofunctor $T$ and natural transformations $\eta :1\to T$, $\mu :T^2\to T$ satisfying the unit and multiplication of a monad lawsAn algebra for a monad is an object $A$ equipped with $a:TA\to A$ such thatA morphism of algebras for a monad $f:(A,a)\to (B,b)$ is a morphism $f:A\to B$ satisfying $fa=bT(f)$. Identities and composition obey this equation, giving the Eilenberg-Moore category ${\mathcal{C}}^T$ and its forgetful functor $U^T(A,a)=A$.

For an adjunction $F⊣U:\mathcal{D}\to \mathcal{C}$ with induced monad $T=UF$, the Eilenberg-Moore comparison functor isThe functor $U$ is monadic when it has such a left adjoint and this comparison is an equivalence of categories; a stricter convention requires an isomorphism of categories over $\mathcal{C}$. We will identify which limit-lifting conclusion each convention supports in part (iii).

A monad on $\mathcal{C}$ consists of an endofunctor $T$ and natural transformations $\eta :1\to T$, $\mu :T^2\to T$ satisfying, at every object $A$,These are the associativity and unit laws. An algebra for a monad is $(A,a:TA\to A)$ withA monad algebra morphism $h:(A,a)\to (B,b)$ is a morphism $h:A\to B$ satisfying $ha=bTh$. Identity morphisms satisfy this equation, and if $h,k$ satisfy it, then $kha=kbTh=cTkTh=cT(kh)$. Hence these objects and morphisms form the Eilenberg-Moore category ${\mathcal{C}}^T$, with the forgetful functor $U(A,a)=A$ and $Uh=h$.

A monad on a category $\mathcal{C}$ consists of an endofunctor $T$, a unit natural transformation $\eta :1_{\mathcal{C}}\Rightarrow T$, and a multiplication $\mu :T^2\Rightarrow T$, satisfyingAn algebra for a monad is $(A,a:TA\to A)$ with $a{\eta }_A=1_A$ and $aTa=a{\mu }_A$. A morphism of algebras for a monad $h:(A,a)\to (B,b)$ satisfies $ha=bTh$. These objects and arrows form the Eilenberg-Moore category ${\mathcal{C}}^T$.

For an adjunction $F:\mathcal{C}\rightleftarrows \mathcal{D}:U$ with $F⊣U$, the monad induced by an adjunction is $T=UF$, with $\mu =U\epsilon F$. The Eilenberg-Moore comparison functor is $K(D)=(UD,U{\epsilon }_D)$ and $K(h)=Uh$. The functor $U$ is monadic when this comparison is an equivalence of categories; this is a monadic adjunction.

The precise monadicity theorem says that $U:\mathcal{D}\to \mathcal{C}$ is monadic exactly when it has a left adjoint, reflects isomorphisms, and satisfies the following condition: whenever the image of a parallel pair in $\mathcal{D}$ admits a split coequalizer in $\mathcal{C}$, the pair has a coequalizer in $\mathcal{D}$ and $U$ preserves that coequalizer. Equivalently, these coequalizers are created up to the canonical isomorphism identifying their underlying coequalizer objects. Here a split coequalizer of $f,g:A\rightrightarrows B$ consists of $q:B\to Q$, $s:Q\to B$, and $t:B\to A$ withThese equations prove its universal property: if $hf=hg$, then $h=hft=hgt=hsq$, and $hs$ is the unique factor through $q$. Every functor preserves these equations, so every functor preserves split coequalizers.

First consider the forgetful functor $U^T:{\mathcal{C}}^T\to \mathcal{C}$. It has the free algebra functor $A\mapsto (TA,{\mu }_A)$ as a left adjoint: the inverse transposition formulas are $h\mapsto h{\eta }_A$ and $v\mapsto bTv$. An monad algebra morphism whose underlying arrow is invertible has an algebra-morphism inverse, by rearranging its structure equation. Thus $U^T$ reflects isomorphisms.

Suppose $f,g:(A,a)\rightrightarrows (B,b)$ have an underlying split coequalizer $q:B\to Q$. Applying $T$ gives a coequalizer of $Tf,Tg$. The equation $qbTf=qfa=qga=qbTg$ therefore gives a unique $c:TQ\to Q$ with $cTq=qb$. The monad algebra laws follow by cancellation: composing $c{\eta }_Q=1_Q$ with the epimorphism $q$ reduces it to $b{\eta }_B=1_B$, and composing $cTc=c{\mu }_Q$ with $T^{2}q$ reduces it to $bTb=b{\mu }_B$. Both $Tq$ and $T^{2}q$ are epimorphisms because they remain split coequalizers. Thus $(Q,c)$ is an algebra for a monad and $q$ is an monad algebra morphism. If an algebra map $h:(B,b)\to (R,r)$ equalizes $f,g$, its underlying factor $v:Q\to R$ obeys $vc=rTv$, since this equation becomes $hb=rTh$ after composition with $Tq$. This proves that $U^T$ creates the required coequalizers. An equivalence of categories transfers these properties to any monadic $U$, proving necessity.

Conversely assume the three conditions and write $T=UF$. Given $(A,a)\in {\mathcal{C}}^T$, take the pairIts image is ${\mu }_A,Ta:T^{2}A\rightrightarrows TA$, with split coequalizer $a:TA\to A$: the splittings are $s={\eta }_A$ and $t={\eta }_{TA}$, becauseLet $q:FA\to D_a$ be its coequalizer in $\mathcal{D}$. Preservation gives a canonical isomorphism $U{D}_a\cong A$ under which $Uq=a$. Transporting the algebra action of $K(D_a)$ along this isomorphism gives $\alpha :TA\to A$. Naturality of the adjunction counit says that $K(q)$ is an monad algebra morphism, hence $\alpha Ta=a{\mu }_A$. But $aTa=a{\mu }_A$ too, and $Ta$ is a split epimorphism, with section $T{\eta }_A$. Therefore $\alpha =a$. Every algebra is consequently isomorphic to some $K(D_a)$.

It remains to establish full faithfulness, rather than merely construct objects. For $B\in \mathcal{D}$, put $b=U{\epsilon }_B$. The adjunction counit ${\epsilon }_B:FUB\to B$ coequalizes ${\epsilon }_{FUB},Fb$. The coequalizer supplied by the hypothesis has underlying coequalizer $b:TUB\to UB$. The induced arrow from that coequalizer object to $B$ is therefore sent by $U$ to an isomorphism; reflection of isomorphisms makes it invertible. Thus ${\epsilon }_B$ itself is this coequalizer.

Now let $h:K(B)\to K(C)$ be an monad algebra morphism, and put $c=U{\epsilon }_C$. The arrow $v={\epsilon }_{C}Fh:FUB\to C$ coequalizes the two arrows in the preceding presentation. To check this directly, use transposition along $F⊣U$: the transposes of $vFb$ and $v{\epsilon }_{FUB}$ are respectively $hb$ and $cTh$, which agree by the algebra-morphism equation. Hence a unique $\bar{h}:B\to C$ satisfies $\bar{h}{\epsilon }_B=v$. Applying $U$ gives $(U\bar{h})b=cTh=hb$; cancellation of the split epimorphism $b$ yields $U\bar{h}=h$. Finally, any arrow $r:B\to C$ satisfies $r{\epsilon }_B={\epsilon }_{C}FUr$ by naturality, so two arrows with equal image under $U$ are equal by the coequalizer property. The comparison is full and faithful and essentially surjective, hence an equivalence of categories. This proves the theorem.

For the application, the free compact Hausdorff space on a set $S$ is the Stone-Čech compactification $\beta (S_{\mathrm{disc}})$ of the corresponding discrete space. Its standard extension property says that every set map $S\to UX$, for compact Hausdorff $X$, extends uniquely to a continuous map $\beta S\to X$. This constructs the required left adjoint. Also a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, so $U$ reflects isomorphisms.

Take continuous maps $f,g:X\rightrightarrows Y$ whose underlying functions have a split coequalizer $q:Y\to Q$ with splittings $s,t$. The splittings need not be continuous. LetThe set $E$ is compact and hence closed. Since $qf=qg$, it is contained in $R$. Conversely $(y,sq(y))=(ft(y),gt(y))\in E$. ThusThe set of triples on the right is closed in the compact Hausdorff space $Y^3$, so its projection onto the first two coordinates is compact and closed. This proves that the equivalence relation $R$ is closed, without assuming continuity of either splitting.

Give $Q\cong Y/R$ the quotient topology. The allowed closed-relation criterion makes it a compact Hausdorff space. If a continuous map $h:Y\to Z$ equalizes $f,g$, the split-coequalizer property makes it constant on the fibres of $q$; its unique factor $Q\to Z$ is continuous by the quotient topology. Hence this is a coequalizer in compact Hausdorff spaces, preserved by $U$. Its topology is forced uniquely, since any continuous surjection from a compact space to a Hausdorff space is a quotient map. All three conditions hold, and therefore the forgetful functor from compact Hausdorff spaces to sets is monadic.

A monad on $\mathcal{C}$ consists of an endofunctor $T$ and natural transformations $\eta :1\to T$, $\mu :T^2\to T$ satisfying $\mu T\eta =\mu \eta T=1_T$ and $\mu T\mu =\mu \mu T$. Its Eilenberg-Moore category has objects $(X,a)$ with $a:TX\to X$, $a{\eta }_X=1_X$ and $a{\mu }_X=aTa$. A morphism $f:(X,a)\to (Y,b)$ satisfies $fa=bTf$. An adjunction $F⊣G$, with unit $\eta$ and counit $\epsilon$, induces $T=GF$, $\mu =G\epsilon F$. It is a monadic adjunction if the Eilenberg-Moore comparison functor $K(D)=(GD,G{\epsilon }_D)$ is an equivalence with the Eilenberg-Moore category.

A fork $A\stackrel{p,q}{\rightrightarrows }B\stackrel{r}{\to }C$ is a split coequalizer if $rp=rq$ and there are $s:C\to B$, $t:B\to A$ with $rs=1$, $pt=1$ and $qt=sr$. It is indeed a coequalizer: if $hp=hq$, then $h=hpt=hqt=hsr$, so $h$ factors uniquely through $r$, which is split epic. Every functor preserves these splitting identities, making such coequalizers absolute.

The precise monadicity theorem states: for an adjunction $F:\mathcal{C}\rightleftarrows \mathcal{D}:G$, the comparison is an equivalence if and only if $G$ reflects isomorphisms and every pair in $\mathcal{D}$ whose $G$-image admits a split coequalizer has a coequalizer which $G$ preserves. Equivalently, the right adjoint creates these split-underlying coequalizers, with creation understood up to the canonical isomorphism of the prescribed underlying coequalizer. Here is a proof.

First consider the forgetful functor from monad algebras. It reflects isomorphisms: the inverse of an invertible algebra morphism also obeys the algebra-morphism identity, by multiplying that identity by the inverses. For an algebra pair with a split underlying coequalizer $r:B\to C$, all powers of $T$ preserve its coequalizer. If $b:TB\to B$ is the algebra structure on $B$, the map $rb$ coequalizes $Tp,Tq$, so there is a unique $c:TC\to C$ withThe unit law follows by composing with the epimorphism $r$: $c{\eta }_{C}r=cTr{\eta }_B=rb{\eta }_B=r$. For associativity, naturality and the algebra law giveCancel the epimorphism $T^{2}r$ to obtain $c{\mu }_C=cTc$. Thus $(C,c)$ is an algebra and $r$ is an algebra morphism. Any algebra morphism coequalizing the pair factors through $r$ on underlying objects, and its factor is an algebra morphism by cancellation of the epimorphism $Tr$. This creates the coequalizer. Transporting these facts through an equivalence proves necessity.

For sufficiency, let $(X,a)$ be a $T$-algebra. In $\mathcal{D}$ consider the free pairIts underlying pair is ${\mu }_X,Ta:T^{2}X\rightrightarrows TX$, with split coequalizer $a:TX\to X$: the splittings are $s={\eta }_X$ and $t={\eta }_{TX}$, using the algebra unit law, the monad unit law and naturality of $\eta$. By hypothesis its coequalizer $q:FX\to D$ exists and is preserved. Identify $GD$ with $X$ by the unique coequalizer isomorphism, so $Gq=a$. Naturality of the counit makes $Kq$ an algebra morphism, hence the comparison structure $c$ on $GD$ satisfies $cTa=a{\mu }_X=aTa$. The map $Ta$ is split epic because $a{\eta }_X=1$, so $c=a$. Every algebra is therefore isomorphic to a comparison algebra.

For an actual object $D$, its counit ${\epsilon }_D:FGD\to D$ is a coequalizer of the analogous free pair. It coequalizes that pair by counit naturality. Compare it with the coequalizer furnished by the hypothesis; applying $G$ gives an isomorphism, since both underlying arrows coequalize the same split pair. Reflection of isomorphisms makes the comparison map an isomorphism. This proves the counit's asserted coequalizer property.

Let $f:KD\to KE$ be an algebra morphism. Its transpose is $h_0={\epsilon }_{E}Ff:FGD\to E$. The two composites of $h_0$ with the free pair have adjunct transposes $G{\epsilon }_{E}Tf$ and $fG{\epsilon }_D$, equal because $f$ is an algebra morphism. Consequently $h_0$ factors uniquely through ${\epsilon }_D$ as $h:D\to E$. Applying $G$ gives $(Gh)G{\epsilon }_D=fG{\epsilon }_D$; the last factor is split epic, so $Gh=f$. Conversely any lift of $f$ must satisfy $h{\epsilon }_D={\epsilon }_{E}Ff$ by naturality and hence is unique. Thus $K$ is full and faithful, and the earlier construction makes it essentially surjective. The comparison is an equivalence, completing the theorem's proof.

Now take $G:\mathbf{CompHaus}\to \mathbf{Set}$. Its left adjoint exists by the permitted topological result; it can be realized as the Stone-Čech compactification of the discrete input set. A bijective continuous map from a compact space to a Hausdorff space is a homeomorphism, so $G$ reflects isomorphisms.

For continuous $f,g:X\rightrightarrows Y$ with a split underlying fork $q,s,t$, let $R$ be the relation of having the same $q$-image. We claimFor the forward inclusion choose $x=t(y)$, $x^{\prime }=t(y^{\prime })$: $ft=1$ and $gt=sq$ supply the equality. For the reverse inclusion use $qf=qg$. The subset $\{(x,x^{\prime }):g(x)=g(x^{\prime })\}\subset X^2$ is closed, because $Y$ is Hausdorff, and compact. Its continuous image $R\subset Y^2$ is compact and hence closed. A closed equivalence relation on a compact Hausdorff space has a compact Hausdorff quotient; its quotient map is a coequalizer here, since it identifies exactly the generated relation. Its underlying set coequalizer is the specified one up to the unique isomorphism. Thus $G$ preserves the needed coequalizers, andThe closedness argument is the closed relation generated by a set-split pair of compact Hausdorff maps lemma; the splitting maps themselves need not be continuous.

Since the full endofunctor subcategory contains $1$ and is closed under composition, $1,T^2,T^3$ all belong to it. Terminality supplies unique natural transformations $\eta :1\to T$ and $\mu :T^2\to T$. The monad unit laws compare arrows $T\to T$, both necessarily the unique endomorphism, namely the identity. The associativity law compares arrows $T^3\to T$, again necessarily equal. Every monad structure uses these two unique arrows, so $\boxed{T\text{ has a unique monad structure}}$.

For a monad $S$ with underlying functor in the subcategory, the unique $\alpha :S\to T$ is a monad morphism. Its unit and multiplication compatibility compare, respectively, arrows $1\to T$ and $S^2\to T$ and therefore follow from terminality. A $T$-algebra $a:TX\to X$ restricts to the $S$-algebra $b=a{\alpha }_X$. The unit law is immediate. For multiplication, naturality and the monad-morphism law giveAn algebra morphism for $T$ also commutes with the restricted action by naturality of $\alpha$. Keeping underlying objects and arrows gives the required functor ${\mathcal{C}}^T\to {\mathcal{C}}^S$.

Now define $TA$ to be the set of ultrafilters on $A$, and for $f:A\to B$ defineInverse images preserve inclusions, intersections and complements, so this is an ultrafilter; composition of inverse images makes $T$ a functor. There are no ultrafilters on the empty set. Every ultrafilter on a disjoint binary union chooses exactly one summand, and restriction to that summand gives an ultrafilter there; extension back is inverse to restriction. Hence $T(A⨿B)\cong TA⨿TB$ canonically, and $T$ preserves finite coproducts, including the empty one.

Let $H$ be any other finite-coproduct-preserving endofunctor. For $x\in HA$, putThe decomposition $A=U⨿U^c$ and coproduct preservation show that exactly one of $U,U^c$ belongs. Refining two subsets into the four disjoint parts $U\cap V,U\setminus V,V\setminus U,(U\cup V{)}^c$ shows that an element lying in both indicated summands lies in their intersection summand. The same refinement for $U\subseteq V$ proves upward closure. Thus ${\alpha }_A(x)$ is an ultrafilter. For $f:A\to B$, decomposition by $f^{-1}(V)$ and its complement showsproving naturality.

For uniqueness, suppose $\beta :H\to T$ is natural. Since $T1$ is a singleton, naturality on the two inclusions $1\to 2$ forces ${\beta }_2$ to send every element in each of the two $H1$ summands of $H2$ to the corresponding principal ultrafilter. Apply naturality to the characteristic map ${\chi }_U:A\to 2$. It gives $U\in {\beta }_A(x)$ precisely when $H{\chi }_U(x)$ lies in the selected summand, which by the decomposition is precisely when $x$ lies in $HU\subseteq HA$. Hence ${\beta }_A={\alpha }_A$ for every $A$. ThereforeThis proves ultrafilter functor. For clarity, the resulting unit sends $a$ to its principal ultrafilter; multiplication sends an ultrafilter $\mathfrak{U}$ on $\mathrm{Ult}(A)$ to the ultrafilter whose members are $U$ with $\{\mathcal{V}:U\in \mathcal{V}\}\in \mathfrak{U}$. Naturality and the monad laws for these formulas also follow from the terminal construction.

A monad on $\mathcal{C}$ consists of an endofunctor $T:\mathcal{C}\to \mathcal{C}$ and natural transformations $\eta :1_{\mathcal{C}}\Rightarrow T$ and $\mu :T^2\Rightarrow T$ satisfying, at every object $A$,These are the unit and associativity laws for the unit and multiplication of a monad.

An algebra for a monad is a pair $(A,a)$ with $a:TA\to A$ satisfyingA monad algebra morphism $f:(A,a)\to (B,b)$ is a morphism $f:A\to B$ with $fa=bTf$. Identities satisfy this condition, and composing two such maps preserves it by functoriality of $T$. The resulting Eilenberg-Moore category is denoted ${\mathcal{C}}^T$. Its forgetful functor $U:{\mathcal{C}}^T\to \mathcal{C}$ sends $(A,a)$ to $A$ and leaves the underlying arrows unchanged.

Write the adjunction unit as $\eta :1_{\mathcal{C}}\Rightarrow GF$ and the adjunction counit as $\epsilon :FG\Rightarrow 1_{\mathcal{D}}$. Define the monad induced by an adjunction bywith unit $\eta$. Naturality of $\epsilon$ makes $\mu$ a natural transformation.

The triangle identities for an adjunction give the two unit laws:For associativity, apply naturality of $\epsilon$ to the arrow ${\epsilon }_{FA}:FGFA\to FA$ in $\mathcal{D}$:Applying $G$ yieldsThus the induced data satisfy all the monad laws, rather than merely supplying an endofunctor and two transformations.

A monad $\mathbb{T}=(T,\eta ,\mu )$ consists of an endofunctor $T:\mathcal{C}\to \mathcal{C}$ and natural transformations $\eta :1_{\mathcal{C}}\Rightarrow T$ and $\mu :T^2\Rightarrow T$ satisfyingAn algebra for a monad is $(A,a)$ with $a:TA\to A$ satisfying $a{\eta }_A=1_A$ and $a{\mu }_A=aT(a)$. A morphism of algebras for a monad $h:(A,a)\to (B,b)$ obeys $ha=bT(h)$. The functor laws show that identities and composites obey this equation, giving the Eilenberg-Moore category ${\mathcal{C}}^{\mathbb{T}}$.

For an adjunction $F⊣G$, let $\eta$ be its adjunction unit and $\epsilon$ its adjunction counit. The monad induced by an adjunction isThe two unit laws are $G{\epsilon }_{FA}{\eta }_{GFA}=1_{GFA}$ and $G({\epsilon }_{FA}F{\eta }_A)=1_{GFA}$, respectively the two triangle identities for an adjunction.

For associativity, naturality of the adjunction counit at ${\epsilon }_{FA}:FGFA\to FA$ saysApply $G$ to obtain ${\mu }_A{\mu }_{TA}={\mu }_{A}T{\mu }_A$. The composites defining $\eta$ and $\mu$ are natural transformations, so all monad axioms have been checked, not only their underlying objectwise types.

For an adjunction $F:\mathcal{C}\rightleftarrows \mathcal{D}:G$ with unit and counit of an adjunction $\eta ,\epsilon$, the monad induced by an adjunction is $T=GF$, with multiplication $\mu =G\epsilon F$. Its Eilenberg-Moore comparison functor isHere ${\mathcal{C}}^T$ is the Eilenberg-Moore category. If $\mathcal{D}$ has reflexive coequalizers, the Left adjoint to the Eilenberg-Moore comparison functor is defined on an algebra for a monad $(A,a)$ bywhere the last arrow is a coequalizer. The parallel pair has common section $F{\eta }_A$, so it is a reflexive pair. The coequalizer property induces $L$ on algebra morphisms and gives $L⊣K$.

Starting with $K_0=G$, iterate this construction: if $L_i⊣K_i:\mathcal{D}\to {\mathcal{E}}_i$, put ${\mathcal{E}}_{i+1}={\mathcal{E}}_i^{K_i{L}_i}$ and let $K_{i+1}:\mathcal{D}\to {\mathcal{E}}_{i+1}$ be its comparison. The monadic length is the least $\ell$ for which $K_{\ell }$ is an equivalence of categories. Thus an equivalence has length zero, and an already monadic adjunction whose right adjoint is not an equivalence has length one. The assumed reflexive coequalizers ensure the needed left adjoints; in the example we identify them explicitly.

For the nested partial unary operation category ${\mathcal{C}}_n$, writeFor the empty list of operations, take ${\mathcal{C}}_0=\mathbf{Set}$ and $A_0=A$. We use positive chain indices $k\ge 1$ for new points, so the index zero already labels the copy of $A$. This makes the free-object hint independent of the convention for $\mathbb{N}$.

For $n\ge 1$, the free extension of nested partial unary operations $F_{n}A$ has underlying setKeep the old operations on the zero layer. On new points define onlyand leave every ${\alpha }_i$, $2\le i\le n$, undefined there. Define the new top operation byand leave it undefined elsewhere. These are precisely the permitted domains: the first unary operation on every new point moves it, so none of the higher operations is defined there. When $n=0$, take $F_{0}A=A\times {\mathbb{N}}_{\ge 0}$ with ${\alpha }_1(a,k)=(a,k+1)$. In either case the unit is $a\mapsto (a,0)$.

For $B\in {\mathcal{C}}_{n+1}$, let its operations be ${\beta }_i$. Any ${\mathcal{C}}_n$ morphism $f:A\to G_{n}B$ extends uniquely toThe value ${\beta }_{n+1}(f(a))$ is defined because $f$ preserves the previous fixed-point equations. The extension respects the top operation at old fixed points and respects the first operation along each new chain; there are no other defined operations on those chains to check. Uniqueness follows from the same forced formulas. For $n=0$ the formula is $\bar{f}(a,k)={\beta }_1^k(f(a))$. These extensions are natural and proveOn a morphism $f$ the free functor sends $(a,k)$ to $(f(a),k)$.

Crucially, the top operation of $F_{n}A$ has no fixed points: its defined old values move to new points, and it has no defined new values when $n\ge 1$; for $n=0$ it is the shift. The next free extension therefore adds no points and equips the object with an everywhere-undefined next operation. The same remains true at every subsequent free extension. Hence, for $m>n$, the composite left adjoint $F_{m-1}\cdots F_n$ has the same first $n+1$ operations and underlying set as $F_n$.

This agreement includes the monad structure, not just its underlying endofunctor. The units are the same zero-layer inclusions. The composite counit on an object of ${\mathcal{C}}_m$ is the same forced extension formula, depending only on its first $n+1$ operations. Applying the composite forgetful functor therefore gives the same multiplication $G_n\epsilon F_n$. Thus

Next prove creation of the required split coequalizers. Suppose $f,g:B\rightrightarrows C$ are arrows in ${\mathcal{C}}_{n+1}$ and their images have a split coequalizer $q:C\to Q$ in ${\mathcal{C}}_n$. Choose the splitting orientationwith $s:Q\to C$, $t:C\to B$ morphisms in ${\mathcal{C}}_n$. Denote the top operations on $B,C$ by $b,c$. For $z\in Q_n$ defineSince $s$ preserves the lower operations, $s(z)\in C_n$ and this value exists. For $y\in C_n$, $t(y)\in B_n$, so preservation by $f,g$ givesThus $q$ respects the top operation. The splitting $s$ and $qs=1$ also show that this is the unique operation on its prescribed domain $Q_n$ for which $q$ is a morphism. For $n=0$ all these domains mean the whole underlying set.

If $u:C\to D$ is a ${\mathcal{C}}_{n+1}$ morphism equalizing $f,g$, its unique factor $v:Q\to G_{n}D$ in ${\mathcal{C}}_n$ satisfies, on $Q_n$,where $d$ is the top operation of $D$. Hence $v$ is a ${\mathcal{C}}_{n+1}$ morphism. This proves $G_n$ creates coequalizers of $G_n$-split pairs.

Moreover, $G_n$ reflects isomorphisms: an isomorphism of the first $n$ operations reflects their fixed-point conditions, hence the domain of the next operation; the inverse of a bijective top-operation-preserving map then preserves that operation too. The Beck monadicity theorem now givesUnder this equivalence, the first Eilenberg-Moore comparison functor for the long composite is exactly forgetting all operations after the $(n+1)$st: its algebra structure is the top-operation extension formula already computed. Repeating the argument identifies its monadic tower with the successive categoriesAt each stage the corresponding comparison has the remaining composite of the already constructed free extensions as a left adjoint.

No earlier stage can be an equivalence of categories. For $j<m$, take the two-point set with its first $j$ operations all identities. One extension to ${\mathcal{C}}_m$ has every later operation the identity; another has its $(j+1)$st operation interchange the two points, and all subsequent operations undefined. Both have the same image in ${\mathcal{C}}_j$, but the identity function between those images is not a morphism between the extensions. Thus forgetting from ${\mathcal{C}}_m$ to ${\mathcal{C}}_j$ is not full. The final comparison at $j=m$ is an equivalence. This proves the monadic tower for nested partial unary operations has