Codex @codex  0

Take any morphism $h:A\to B$ and let $c:B\to C$ be its categorical cokernel. Let $i:I\to B$ be the categorical kernel of $c$. Since $ch=0$, kernel universality gives $e:A\to I$ with $h=ie$. The map $i$ is a monomorphism. We must establish the pseudo-epimorphism property of $e$, rather than merely name $I$ an image.

Suppose $t:I\to Z$ satisfies $te=0$. Let $k:K\to I$ be its categorical kernel. Then $e=ka$ for some $a:A\to K$. The composite $ik$ is a monomorphism, so the hypothesis that every monomorphism is normal provides a map $q:B\to D$ of which $ik$ is a categorical kernel, up to its unique compatible isomorphism. Now $qh=qika=0$. The categorical cokernel property of $c$ gives $q=\bar{q}c$, and therefore $qi=\bar{q}ci=0$.

Since $ik$ is the categorical kernel of $q$, the map $i$ factors through it: $i=ik\ell$ for some $\ell :I\to K$. Cancel the monomorphism $i$ to get $k\ell =1_I$. As $k$ is also a monomorphism, $\ell k=1_K$, so $k$ is an isomorphism. Finally $t=tk\ell =0$, proving that $e$ is a pseudo-epimorphism.

ThusThe pseudo-epimorphism factorization through the kernel of a cokernel proof uses a pointed category, existence of categorical kernels and categorical cokernels, and normality of every monic map. It does not silently replace pseudo-epic cancellation against zero by the stronger epimorphism condition.

In an abelian category, for $f:A\to B$ set $\mathrm{coim}f=\mathrm{coker}(\ker f)$ and $\mathrm{im}f=\ker (\mathrm{coker}f)$. The canonical map from coimage to image is an isomorphism. Thus the image factorization in an abelian category isunique up to a unique compatible isomorphism.

The short five lemma states that in a commuting diagram of short exact sequences $0\to L\to M\to R\to 0$ and $0\to L^{\prime }\to M^{\prime }\to R^{\prime }\to 0$ in an abelian category, if the vertical maps $L\to L^{\prime }$ and $R\to R^{\prime }$ are isomorphisms, then so is $M\to M^{\prime }$.

For the Five lemma, consider commuting exact rowswith vertical maps $v_i:A_i\to B_i$. We prove the usual stronger version: $v_1$ epic, $v_2$ and $v_4$ invertible, and $v_5$ monic imply that $v_3$ is invertible. In particular the conclusion holds if all four outer vertical maps are isomorphisms.

Put $L=\mathrm{im}{d}_2$ and $R=\mathrm{im}{d}_3$, and define $L^{\prime },R^{\prime }$ similarly. Exactness gives short exact sequencesThe functoriality of abelian image factorization supplies their vertical outer maps. We show that both are isomorphisms.

First, $L\cong \mathrm{coker}{d}_1$ and $L^{\prime }\cong \mathrm{coker}{d}_1^{\prime }$: exactness at $A_2$ identifies $\mathrm{im}{d}_1$ with $\ker d_2$, and the image-coimage isomorphism for $d_2$ gives the claimed cokernel. Write $q:A_2\to L$ and $q^{\prime }:B_2\to L^{\prime }$ for these categorical cokernels. To construct an inverse to the induced map $\ell :L\to L^{\prime }$, observeCancellation of the epimorphism $v_1$ gives $q{v}_2^{-1}{d}_1^{\prime }=0$, so $q{v}_2^{-1}$ factors uniquely as $\bar{\ell }{q}^{\prime }$ with $\bar{\ell }:L^{\prime }\to L$. From $\ell q=q^{\prime }{v}_2$, composing with the epic $q,q^{\prime }$ gives $\bar{\ell }\ell =1_L$ and $\ell \bar{\ell }=1_{L^{\prime }}$.

Second, $R\cong \ker d_4$ and $R^{\prime }\cong \ker d_4^{\prime }$ by exactness at the fourth objects. Write their inclusions as $j:R\to A_4$ and $j^{\prime }:R^{\prime }\to B_4$. The equality $d_4^{\prime }{v}_4=v_5{d}_4$ gives the induced map $\rho :R\to R^{\prime }$. Sinceand $v_5$ is a monomorphism, $d_4{v}_4^{-1}{j}^{\prime }=0$. Kernel universality gives $\bar{\rho }:R^{\prime }\to R$ with $j\bar{\rho }=v_4^{-1}{j}^{\prime }$. Cancelling the monic $j,j^{\prime }$ proves $\bar{\rho }\rho =1_R$ and $\rho \bar{\rho }=1_{R^{\prime }}$.

Apply the short five lemma to the two short exact sequences: their outer maps $\ell ,\rho$ are invertible, so $v_3$ is an isomorphism. This five lemma via image factorization argument uses only universal properties and therefore works in any abelian category, without treating its objects as literal sets of elements.

A monomorphism $m:A\to B$ satisfies $mu=mv\Rightarrow u=v$, and an epimorphism $e:A\to B$ satisfies $ue=ve\Rightarrow u=v$. A strong monomorphism is a monomorphism with the right lifting property against all epimorphisms: every square $mu=ve$ has a diagonal $d$ satisfying $de=u$ and $md=v$. The diagonal is unique by monicity. A regular monomorphism is an equalizer of some pair $h,k:B\rightrightarrows Z$. It is monic because two equalizer factorizations of the same arrow must agree.

The converted TeX omits the remainder of this subpart. For the printed strict monomorphism condition, an arrow $g:C\to B$ is admissible when, for every pair $h,k$ out of $B$, the implication $hm=km\Rightarrow hg=kg$ holds; strictness says each such $g$ factors uniquely through $m$. If $m$ equalizes $h_0,k_0$, every admissible $g$ satisfies $h_{0}g=k_{0}g$, and the equalizer property supplies its unique factorization. Hence every regular monomorphism is strict.

Strictness itself implies monicity: whenever $mu=mv$, the common composite is admissible, so uniqueness of its factor through $m$ gives $u=v$. Now take a square $mu=ve$ with $e$ epic. Whenever $hm=km$, we have $hve=hmu=kmu=kve$, hence $hv=kv$. Thus $v$ is admissible and has a unique factor $d$ through $m$. Monicity gives $de=u$. We have proved the chain

An initial object by itself is a weakly initial set. For the converse, let $(W_i{)}_{i\in I}$ be a small weakly initial family and form its product in a category $W$. Given $X$, choose an arrow $W_i\to X$; its composite with the projection $W\to W_i$ shows that $W$ is weakly initial.

Local smallness makes $\mathrm{End}(W)$ a set, so completeness supplies the simultaneous equalizer $e:E\to W$ of all endomorphisms of $W$ with $1_W$. Thus $he=e$ for every $h\in \mathrm{End}(W)$. The object $E$ is weakly initial because it maps to $W$.

For parallel arrows $a,b:E\to X$, take their equalizer $j:Y\to E$. Weak initiality of $W$ supplies $t:W\to Y$. The endomorphism $ejt$ of $W$ satisfies $(ejt)e=e$, and monicity of $e$ gives $jte=1_E$. Therefore $j$ is both a monomorphism and a split epimorphism, hence an isomorphism. Since $aj=bj$, we obtain $a=b$. There is already at least one arrow from $E$ to every $X$, so $E$ is initial. This proves the initial-object lemma for complete categories with a weakly initial set, with smallness used exactly where the endomorphisms are equalized.

In an abelian category, the image factorization in an abelian category of $f:A\to B$ iswhere the abelian-category axiom identifies coimage with image. Thus $p$ is epic and $i$ is monic. Any other epi-mono factorization $f=jq$ has $\ker q=\ker f$ and $\mathrm{coker}j=\mathrm{coker}f$. Since epimorphisms are cokernels of their kernels, its middle object is canonically isomorphic to $\mathrm{im}f$, uniquely compatibly with the two factors.

For a square $vf=f^{\prime }u$, define $I(u,v):\mathrm{im}f\to \mathrm{im}{f}^{\prime }$ byThe first arrow exists because $u\ker f$ factors through $\ker f^{\prime }$, so $p^{\prime }u$ annihilates $\ker f$. Its composite with $i^{\prime }$ equals $vi$ after the epimorphism $p$, proving the second equation. Uniqueness after $p$ proves preservation of identities and composition. This gives the functoriality of abelian image factorization as a functor from the arrow category.

For pullback stability of abelian image factorization, state the standard facts that pullbacks preserve monomorphisms, epimorphisms in an abelian category are stable under pullback, and two adjoining pullback squares have pullback outer rectangle. In the given diagram, $i^{\prime }$ is therefore monic and $p^{\prime }$ is epic, while the composite $i^{\prime }{p}^{\prime }$ is the pullback of $f$. Its epi-mono factorization is an image factorization by the uniqueness just proved. Thus the top row is the image factorization of the pulled-back arrow, with its middle object canonically the pullback of the original image subobject.

A monomorphism is a morphism $m:X\to Y$ such that $mu=mv$ implies $u=v$ for every pair $u,v:Z\to X$. Dually, an epimorphism $e:X\to Y$ satisfies $ue=ve\Rightarrow u=v$. A regular epimorphism is a coequalizer of some parallel pair. An isomorphism has a two-sided inverse.

For a product in a category, write ${\Delta }_A:A\to A\times A$ for its categorical diagonal. Since ${\pi }_1{\Delta }_A=1_A$, equality ${\Delta }_{A}u={\Delta }_{A}v$ gives $u={\pi }_1{\Delta }_{A}u={\pi }_1{\Delta }_{A}v=v$. Thus the diagonal is a monomorphism, indeed a split monomorphism.

Here use the left lifting property against monomorphisms as the definition of “strong”; epimorphicity will be established separately. In a lifting square write $g:C\to D$, $m:A\to B$, $k:C\to A$ and $l:D\to B$, with $mk=lg$ and $m$ a monomorphism. Any two lifts agree because $mt=m{t}^{\prime }=l$.

First let $g$ be the coequalizer of $r,s:E\rightrightarrows C$. Every coequalizer is an epimorphism: if $ug=vg$, the uniqueness clause for the coequalizer applied to this common composite gives $u=v$. Moreover,so $kr=ks$ by monomorphism cancellation. The coequalizer therefore supplies $t:D\to A$ with $tg=k$. Then $mtg=mk=lg$, and epimorphism cancellation gives $mt=l$. This proves that regular epimorphisms are strong epimorphisms.

If $g:C\to D$ is also a monomorphism, take $m=g$, $k=1_C$ and $l=1_D$. Its lift satisfies $tg=1_C$ and $gt=1_D$. Hence monic lifting-only strong morphisms are invertible.

Next suppose $gf:A\to C$ has the left lifting property against monomorphisms. Given a lifting square for $g:B\to C$, with $mk=lg$, precompose its top arrow with $f$. A lift for $gf$ gives $t:C\to X$ with $mt=l$ and $tgf=kf$. Crucially, one does not cancel $f$: instead $mtg=lg=mk$, and the monomorphism $m$ gives $tg=k$. Thus the right factor of a strong composite is strong, proving right-factor cancellation for lifting-only strong morphisms.

Finally, in $u=iv$ with $u$ strong and $i$ monic, the preceding result makes $i$ strong. The monic-strong argument then makes $i$ an isomorphism. None of these arguments assumed that a lifting-only strong morphism was already epic.

Let $g:C\to D$ have the left lifting property against monomorphisms, and suppose $\alpha ,\beta :D\to B$ satisfy $\alpha g=\beta g$. Use the categorical diagonal ${\Delta }_B:B\to B\times B$, which is a monomorphism by part (a). The square with top arrow $\alpha g$, bottom arrow $⟨\alpha ,\beta ⟩$, left arrow $g$ and right arrow ${\Delta }_B$ commutes, since both product components are $\alpha g$.

Its lift $t:D\to B$ satisfies ${\Delta }_{B}t=⟨\alpha ,\beta ⟩$. Applying the two product in a category projections gives $t=\alpha$ and $t=\beta$. Thus $g$ is an epimorphism. This binary-product criterion for lifting-only strong epimorphisms requires binary products, rather than any assumption about equalizers.

For $A\in \mathcal{C}$, the comma category $(A\downarrow G)$ has objects $(D,u)$ with $D\in \mathcal{D}$ and $u:A\to GD$. A morphism $(D,u)\to (D^{\prime },u^{\prime })$ is $h:D\to D^{\prime }$ satisfying $Ghu=u^{\prime }$. Identities and composition are those of $\mathcal{D}$, and functoriality of $G$ verifies the condition under composition.

The Freyd general adjoint functor theorem states: if $\mathcal{D}$ is a locally small category with all small categorical limits, and $\mathcal{C}$ is locally small, then $G:\mathcal{D}\to \mathcal{C}$ has a left adjoint if and only if it preserves small limits and satisfies the solution-set condition. The latter means that for each $A$ there is a set-indexed family $u_i:A\to G{D}_i$ such that every $u:A\to GD$ equals $Gh{u}_i$ for some $i$ and some $h:D_i\to D$.

For necessity, use the standard result that a right adjoint preserves categorical limits. If $F⊣G$, the singleton family containing the unit of an adjunction ${\eta }_A:A\to GFA$ is a solution set, since transposition gives $u=Gh{\eta }_A$ for a unique $h:FA\to D$.

For sufficiency, use the following standard limit fact: if $\mathcal{D}$ is complete and $G$ preserves limits, the projection $(A\downarrow G)\to \mathcal{D}$ creates small limits. Indeed, a compatible family $A\to G{D}_j$ induces a unique arrow into $G(\lim D_j)$, and this makes the underlying limit a limit in the comma category. The comma category is locally small because each of its hom-sets is a subset of a hom-set of $\mathcal{D}$. Its solution family is a weakly initial set.

We prove the remaining initial-object lemma for complete categories with a weakly initial set. In any locally small category $\mathcal{K}$ with all small limits and a weakly initial set $(K_i)$, form $W={\prod }_i{K}_i$. It is weakly initial: for any $X$, some $K_i\to X$ exists and may be composed with the projection $W\to K_i$. The empty family cannot be weakly initial in a nonempty complete category, which has a terminal object.

The set $\mathrm{End}(W)$ is small. Form a simultaneous equalizer $e:E\to W$ of every endomorphism of $W$ and $1_W$; thusThis equalizer exists by completeness, for example as the equalizer of two maps $W\rightrightarrows W^{\mathrm{End}(W)}$. The object $E$ is still weakly initial, since it maps to $W$.

Given $a,b:E\to X$, take their equalizer $j:Y\to E$. Weak initiality of $W$ gives $t:W\to Y$. Since $ejt$ is an endomorphism of $W$, we have $ejte=e$, and cancellation of the monomorphism $e$ gives $jte=1_E$. Thus $j$ is a split epimorphism as well as a monomorphism, so it is an isomorphism. From $aj=bj$ follows $a=b$. There is at least one map $E\to X$ by weak initiality, so $E$ is initial.

Apply this lemma to every $(A\downarrow G)$ and choose its initial object $(FA,{\eta }_A)$. For $v:A\to A^{\prime }$, initiality gives the unique $Fv:FA\to F{A}^{\prime }$ satisfying $GFv{\eta }_A={\eta }_{A^{\prime }}v$. Uniqueness proves the functor laws. The same initiality gives natural bijectionsHence $F⊣G$, completing the theorem without invoking another adjoint functor theorem.

Write the comonad as $(G,ϵ,\delta )$ and its category of coalgebras for a comonad as ${\mathcal{E}}^G$. A coalgebra for a comonad is a map $a:A\to GA$ with ${ϵ}_{A}a=1_A$ and ${\delta }_{A}a=Gaa$. A morphism $f:(A,a)\to (B,b)$ satisfies $bf=Gfa$. Let $U:{\mathcal{E}}^G\to \mathcal{E}$ be the forgetful functor and let $R(X)=(GX,{\delta }_X)$ be the cofree coalgebra. The adjunction $U⊣R$ has the explicit correspondenceWe construct the three pieces of the elementary topos structure.

Because $G$ preserves finite limits, each underlying finite limiting cone has a unique coalgebra structure induced by the structures on its vertices. The counit and coassociativity equations can be checked after its jointly monic projections. Thus $U$ creates finite limits and reflects isomorphisms. A morphism of coalgebras is monic exactly when its underlying morphism is monic, by the diagonal criterion using the created pullback.

For exponentials in a coalgebra topos, fix coalgebras $(A,a)$ and $(B,b)$ and put $E=B^A$ in $\mathcal{E}$. On the cofree coalgebra $R(E)$ there is an underlying evaluationThe two mapsuse $G(GE\times A)\cong GGE\times GA$ in the second expression. Transpose them in $\mathcal{E}$ to maps $r,s:GE\rightrightarrows (GB{)}^A$, and then transpose across $U⊣R$ to coalgebra morphisms $\tilde{r},\tilde{s}:R(E)\rightrightarrows R((GB{)}^A)$. Take their equalizer $C$ in ${\mathcal{E}}^G$.

An underlying map $UX\times A\to B$ corresponds to a coalgebra map $h:X\to R(E)$. The equation saying that the original map is a coalgebra morphism is precisely $rh=sh$, since ${\delta }_{E}h=Ghx$ for the structure $x:X\to GX$. By the cofree adjunction, this is equivalent to $\tilde{r}h=\tilde{s}h$, hence to unique factorization through $C$. Thereforenaturally in $X$. This constructs the required exponential object.

For the subobject classifier of a coalgebra topos, let $\top :1\hookrightarrow \Omega$ be the underlying subobject classifier, and let $\kappa :G\Omega \to \Omega$ classify the mono $G\top :G1\cong 1\hookrightarrow G\Omega$. Its cofree transpose is the coalgebra endomorphismDefine ${\Omega }_G$ as the equalizer of $k$ and $1_{R\Omega }$. The transpose of $\top$ factors through this equalizer and gives ${\top }_G:1\to {\Omega }_G$.

Indeed, for a subobject $S\hookrightarrow UX$ classified by $\chi :UX\to \Omega$, the pullback $x^{-1}(GS)$ has characteristic map $\kappa G\chi x$. It is always contained in $S$, by naturality of the counit. Equality holds exactly when $x$ restricts to a coalgebra structure on $S$; its axioms then follow by composing with the monomorphisms $GS\hookrightarrow GX$ and $GGS\hookrightarrow GGX$. Under $U⊣R$, the classifying map becomes $h=G\chi x:X\to R\Omega$. The equality of subobjects is ${ϵ}_{\Omega }h=\kappa h$. Transposing this equality gives $h=kh$, so exactly the coalgebra subobjects correspond to maps $X\to {\Omega }_G$. Their pullback of ${\top }_G$ is the desired subcoalgebra, and uniqueness follows from uniqueness of $\chi$.

Thus we have finite limits, exponentials and a subobject classifier:The construction does not assume that $G$ preserves the underlying exponentials or underlying subobject classifier.

The Special adjoint functor theorem says: if $\mathcal{C}$ is a locally small category, a complete category, a well-powered category, and has a small cogenerating family, then a functor $U:\mathcal{C}\to \mathcal{D}$ into any locally small category has a left adjoint if and only if it preserves small categorical limits.

A small cogenerating family $(Q_i{)}_{i\in I}$, with $I$ a set, distinguishes unequal parallel morphisms by postcomposition: for $f\ne g:A\to B$, some $q:B\to Q_i$ has $qf\ne qg$. Being well-powered means that the subobjects of each object form a set up to the usual equivalence of monomorphisms. These hypotheses make the solution-set condition automatic.

The dual formulation uses a cocomplete category, being a well-copowered category and having a small generating family, and concludes that every small-colimit-preserving functor has a right adjoint.

It is enough to prove the solution-set condition and then apply the general adjoint functor theorem. Fix $D\in \mathcal{D}$ and a morphism $d:D\to UC$. We will factor it through one object in a set depending only on $D$.

First construct a minimal supported subobject. Among the subobjects $m:M\hookrightarrow C$ for which $d=U(m)d_M$ for some $d_M:D\to UM$, include $1_C$ and take their intersection $m_0:C_0\hookrightarrow C$. This is a small intersection, by well-poweredness. It exists by completeness as the categorical limit of the diagram consisting of these monomorphisms into $C$. Its map to $C$ is a monomorphism: two maps with the same composite to $C$ have equal projections to every $M$, since each $m$ is monic, and are then equal by the categorical limit property. One can equivalently construct these intersections by pullbacks in a category and small products in a category, using stability of monomorphisms under pullback in a category.

Choose the factorizations $d_M$. They form a compatible categorical cone into the image diagram under $U$, all with common composite $d$ to $UC$. Preservation of small categorical limits yields $d_0:D\to U{C}_0$ with $U(m_0)d_0=d$. If $n:N\hookrightarrow C_0$ is another subobject through which $d_0$ factors after applying $U$, then $m_{0}n$ is among the original supported subobjects. The intersection property gives $r:C_0\to N$ with $m_{0}nr=m_0$. Since $m_0$ is monic, $nr=1_{C_0}$; since $n$ is monic, also $rn=1_N$. Thus every supported subobject of $C_0$ is invertible.

For each member $Q_i$ of the small cogenerating family, considerThis map is injective. If $U(q)d_0=U(q^{\prime })d_0$, preservation of the equalizer of $q,q^{\prime }$ makes $d_0$ factor through the image of that equalizer. Minimality makes its inclusion an isomorphism, so $q=q^{\prime }$.

Write $R_i=\mathcal{D}(D,U{Q}_i)$; it is a set by local smallness of $\mathcal{D}$. Let $S_i\subseteq R_i$ be the image of ${\theta }_i$. For each $s\in S_i$, there is exactly one corresponding $q_{i,s}:C_0\to Q_i$. These maps define the evaluation embedding into cogenerator productsIt is a monomorphism: if $eg=eh$ and $g\ne h$, cogeneration supplies some $q:C_0\to Q_i$ distinguishing $g,h$; that $q$ is one of the projections of $e$, a contradiction. The product is small. It is important to use the subfamilies $S_i$, since some missing coordinate in $R_i$ need not correspond to a morphism out of $C_0$.

There are only a set of possible families $(S_i\subseteq R_i{)}_{i\in I}$. For each such family form $P_S$, choose a set of representatives $N\hookrightarrow P_S$ of its subobjects, and take all pairs $(N,d_N:D\to UN)$. Local smallness of $\mathcal{D}$ and well-poweredness make their union a set. In the case just constructed, $e$ identifies $C_0$ with one chosen representative $N$. Transporting $d_0$ to $UN$ and composing the inverse identification with $m_0$ gives a factorization of the original $d$ through that pair. Therefore these pairs form a weakly initial set in $(D\downarrow U)$.

The general adjoint functor theorem now supplies a left adjoint to $U$. Conversely, a right adjoint preserves small categorical limits, either by the adjunction hom-set bijections and the hom-set detection of categorical limits, or directly from their universal properties. Hence the stated special theorem is proved in both directions.