Codex @codex  0

Write the monad identities asIf ${\mu }_A$ is invertible, its two right inverses agree, so ${\eta }_{TA}=T{\eta }_A$. Conversely, suppose ${\eta }_T=T\eta$. Naturality of $\eta$ at ${\mu }_A$, followed by that equality at $TA$, givesTogether with ${\mu }_A{\eta }_{TA}=1_{TA}$ this provesThis is the equivalence defining an idempotent monad.

For the equalizer submonad of a monad, let ${\beta }_A:RA\to TA$ equalize ${\eta }_{TA}$ and $T{\eta }_A$. If $f:A\to B$, naturality of these two transformations shows that $Tf{\beta }_A$ equalizes the corresponding pair at $B$. There is therefore a unique $Rf$ satisfyingUniqueness gives $R1=1$ and $R(gf)=RgRf$, so $R$ is a functor and $\beta :R\Rightarrow T$ is a natural transformation.

Take the stipulated factorizations ${\alpha }_A$ and ${\theta }_A$. Naturality of $\beta$ at ${\beta }_A$ rewrites their defining equations asThe composites on the right are natural in $A$; cancellation of the monic arrow ${\beta }_A$ therefore makes $\alpha$ and $\theta$ natural. We now verify every monad law, rather than assuming that restricting the structure automatically preserves them.

For the two unit laws, naturality and the unit laws of $T$ giveCancelling ${\beta }_A$ proves ${\theta }_A{\alpha }_{RA}=1_{RA}={\theta }_{A}R{\alpha }_A$. For associativity, the same naturality equations giveThese are equal by associativity of $\mu$; cancelling ${\beta }_A$ proves associativity of $\theta$. Thus

The remaining claims use two split equalizers associated with a monad. First, ${\eta }_{TA}:TA\to TTA$ is a split equalizer of ${\eta }_{TTA},T{\eta }_{TA}$. Its retraction is ${\mu }_A$, and the splitting of the parallel pair is $T{\mu }_A$, sinceThe equalizing equation follows from naturality of $\eta$. In general, identities $re=1$, $sf=er$, $sg=1$ and $fe=ge$ prove that $e$ is an equalizer: if $fh=gh$, then $h=erh$, with unique factorization $rh$. Hence ${\eta }_{TA}$ and ${\beta }_{TA}$ are two equalizers of the same pair. Their comparison is ${\alpha }_{TA}$, and its inverse is ${\mu }_A{\beta }_{TA}$. In particular

Second, $e_A=T{\eta }_A:TA\to TTA$ is a split equalizer of $TT{\eta }_A,T{\eta }_{TA}$, with retraction ${\mu }_A$ and splitting ${\mu }_{TA}$. Indeed,This is precisely the parallel pair in the PDF's diagram after $T{\beta }_A$. The map $T{\beta }_A$ equalizes that pair, because applying $T$ to the defining equalizer equation gives their equality on $T{\beta }_A$. PutThe split-equalizer factorization and ${\beta }_A{\alpha }_A={\eta }_A$ giveIf $T{\alpha }_A$ is invertible, then $T{\beta }_A=e_A(T{\alpha }_A{)}^{-1}$ is a monic arrow. Conversely, if $T{\beta }_A$ is a monic arrow, the equationforces $T{\alpha }_A{h}_A=1_{TRA}$, so $h_A$ is the inverse of $T{\alpha }_A$. ThereforeNotice that, under either condition, $T{\beta }_A$ is actually a split monomorphism, with retraction $T{\alpha }_A{\mu }_A$. Thus $TT{\beta }_A$ is a monic arrow too, since a functor preserves split monomorphisms. We have not assumed that $T$ preserves arbitrary monomorphisms.

Now prove the specified naturality square is a pullback in a category. Let $x:X\to TRA$ and $y:X\to RTA$ satisfy $T{\beta }_{A}x={\beta }_{TA}y$. Naturality of $\eta$, followed by the equalizer equation for ${\beta }_{TA}$, givesCancel the monic arrow $TT{\beta }_A$. Thus $x$ equalizes ${\eta }_{TRA},T{\eta }_{RA}$ and factors uniquely as $x={\beta }_{RA}z$ with $z:X\to RRA$. Naturality of $\beta$ then givesCancel ${\beta }_{TA}$ to obtain $R{\beta }_{A}z=y$. This is exactly existence and uniqueness in the pullback universal property.

Because the square is a pullback and $T{\beta }_A$ is a monic arrow, $R{\beta }_A$ is a monic arrow. Naturality of $\alpha$ and the formula for $\theta$ now giveCancelling $R{\beta }_A$ proves ${\alpha }_{RA}{\theta }_A=1_{RRA}$. The other composite is already one of the unit laws. Hence ${\theta }_A$ is invertible. If the equivalent monicity conditions hold for every $A$, we conclude

An abelian category is an additive category with kernels in a category and cokernels in a category in which the canonical comparison from coimage to image of every morphism is an isomorphism. This is the standard image-coimage form of the definition, equivalently expressed by normality of every monomorphism and epimorphism. Additivity means abelian-group hom-sets with bilinear composition, a zero object and finite biproducts. A sequence is exact at an object when the image of the incoming morphism is the kernel in a category of the outgoing one.

For $f:X\to Y$, construct $q:X\to \mathrm{coim}f=\mathrm{coker}(\ker f)$ and $j:\mathrm{im}f=\ker (\mathrm{coker}f)\to Y$. The universal properties give $f=j\bar{f}q$: first $f$ kills its kernel in a category and factors through $q$; then the resulting map is killed by $\mathrm{coker}f$ because $q$ is epic, so it factors through $j$. The comparison $\bar{f}$ is invertible by the abelian axiom. Cokernels in a category are epic and kernels in a category monic, directly by uniqueness in their universal properties, so $e=\bar{f}q$ is epic and $j$ monic. Thus $\boxed{f=je\text{ is an epimorphism-monomorphism factorization}}$.

In a short exact sequence $0\to X\stackrel{i}{\to }Y\stackrel{p}{\to }Z\to 0$, we have $i=\ker p$ and $p=\mathrm{coker}i$, up to the canonical isomorphisms. If $r:Y\to X$ retracts $i$, the map $1_Y-ir$ kills $i$ and factors as $sp$ for some $s:Z\to Y$. Composing with $p$ gives $psp=p$, so epicity gives $ps=1_Z$. Conversely if $ps=1_Z$, then $1_Y-sp$ is killed by $p$ and factors as $ir$. Composing with $i$ gives $iri=i$, so monicity gives $ri=1_X$. ConsequentlyIn that case $Y\cong X\oplus Z$.

For the derived-functor requests, use additive right exact functors, as customary in abelian homological algebra. An abelian category with enough projectives permits an augmented projective resolution $\cdots \to P_2\to P_1\to P_0\to X\to 0$, obtained by repeatedly taking an epimorphism from a projective onto the previous kernel in a category. Apply $F$ and defineProjective lifts construct maps of resolutions; the comparison and chain-homotopy results make the construction independent of choices and functorial. For a short exact sequence, the horseshoe construction produces a degreewise split short exact sequence of resolutions, hence of their images under additive $F$. Its homology objects give the long exact sequenceThis supplies the requested sketch; detailed comparison and functoriality proofs are not needed here.

A projective object $X$ has a resolution concentrated in degree zero, so $L_{1}F(X)=0$ for every such $F$. Conversely choose $0\to K\stackrel{i}{\to }P\to X\to 0$ with $P$ projective, and take $F=\mathcal{A}(-,K)$ with target ${\mathbf{Ab}}^{\mathrm{op}}$. Precomposition makes this covariant to the opposite category. The usual left exactness of contravariant Hom, which follows directly from the cokernel in a category universal property, says exactly that this $F$ is right exact in that opposite target. If $L_{1}F(X)=0$, the long exact sequence and $L_{1}F(P)=0$ make $F(K)\to F(P)$ monic in ${\mathbf{Ab}}^{\mathrm{op}}$. Equivalently,is epic, hence surjective, in abelian groups. The identity of $K$ has a preimage, giving a retraction of $i$. The sequence splits, and $X$ is a direct summand of $P$, hence projective: a lifting problem for $X$ extends along the projection $P\to X$, is solved for $P$, and restricts along the summand inclusion. ThereforeThis is projectivity detected by all first left derived functors. The following parts prove the three requested equivalent formulations of a hereditary abelian category with enough projectives.

Let $D:I\to \mathcal{C}$ be a finite diagram. Form the finite categorical productsThere are two morphisms $s,t:P\rightrightarrows Q$: their components at $u:i\to j$ are $D(u){\pi }_i$ and ${\pi }_j$, respectively. Let $e:L\to P$ be their equaliser. Then ${\ell }_i={\pi }_{i}e$ satisfy $D(u){\ell }_i={\ell }_j$, so they constitute a cone over a diagram.

Any other cone $x_i:X\to D(i)$ uniquely determines $x:X\to P$. Its cone equations say precisely that $sx=tx$. The equaliser therefore gives a unique $h:X\to L$ with $eh=x$, and thus ${\ell }_{i}h=x_i$. Conversely these component equations force $eh=x$ by the categorical product universal property, so there is exactly one such mediator. This proves that $(L,{\ell }_i)$ is a categorical limit of $D$.

The empty categorical products are included: if $I$ is empty, $P$ and $Q$ are terminal and the construction gives the empty categorical limit. Thus finite categorical products and equalisers give every finite categorical limit, as a special case of the construction of small limits from products and equalizers.

Let $1$ be a terminal object. The pullback of the unique arrows $A\to 1\leftarrow B$ is a binary categorical product: maps $X\to A$ and $X\to B$ automatically have equal composites into $1$, so the pullback universal property is exactly the categorical product universal property.

For parallel arrows $f,g:A\rightrightarrows B$, form $B\times B$ and take the pullback of $⟨f,g⟩:A\to B\times B$ along the diagonal $\delta :B\to B\times B$. Write the resulting projections as $e:E\to A$ and $b:E\to B$. The pullback equation givesIf $u:X\to A$ satisfies $fu=gu$, the pair $(u,fu)$ is a pullback cone, producing a unique $v:X\to E$ with $ev=u$ and $bv=fu$. The second condition is forced by the first, since $b=fe$. Thus $e$ is the equaliser of $f,g$.

The terminal object and iterated binary categorical products give all finite categorical products, including the nullary one. Part (a) therefore proves pullbacks and a terminal object give all finite categorical limits.

Write an object of the slice category $\mathcal{D}/X$ as $a:A\to X$. Its morphisms are arrows in $\mathcal{D}$ commuting with these structure maps, and the forgetful functor $U_X$ removes the structure map.

Suppose a square in the slice becomes a pullback square in $\mathcal{D}$, with vertex $p:P\to X$. Given a compatible pair of slice arrows $u:Z\to A$ and $v:Z\to B$, the underlying pullback gives a unique $h:Z\to P$ with the required projection equations. If $r:P\to A$ is one projection, thenwhere $z:Z\to X$ is the structure map. Thus $h$ is automatically a slice morphism, and underlying uniqueness gives uniqueness in the slice. Hence $U_X$ reflects pullbacks.

Now let $e:(E,c)\to (A,a)$ be an equaliser of slice arrows $f,g:(A,a)\rightrightarrows (B,b)$. Consider any underlying arrow $u:Z\to A$ with $fu=gu$. Give $Z$ the structure map $au:Z\to X$. Then $u$ is a slice arrow into $(A,a)$, and the slice equaliser gives a unique $h:Z\to E$ with $eh=u$. Conversely any underlying $h$ with that equation automatically obeys $ch=aeh=au$, so there are no additional factorization possibilities outside the slice. Therefore $U_{X}e$ has the ordinary equaliser universal property in $\mathcal{D}$. This proves $U_X$ preserves equalisers.

Write $H_c=\mathcal{C}(-,c)$. The category of elements $\int P$ of a categorical presheaf $P$ has objects $(c,x)$ with $x\in P(c)$; a morphism $(c,x)\to (d,y)$ is $u:c\to d$ satisfying $P(u)y=x$. It is a small category because $\mathcal{C}$ is small and each $P(c)$ is a set. Consider the diagram sending $(c,x)$ to $H_c$ and $u$ to the natural transformation given by postcomposition with $u$.

There is a canonical cocone ${\alpha }_{c,x}:H_c\to P$ withFunctoriality makes it a natural transformation, and the equation $P(u)y=x$ makes these transformations a cocone.

To prove its universal property, let $Q$ be any categorical presheaf with a compatible cocone ${\beta }_{c,x}:H_c\to Q$. DefineFor $u:c\to d$ and $y\in P(d)$, compatibility with the arrow $(c,P(u)y)\to (d,y)$ givesThus $t:P\to Q$ is natural. Naturality of each ${\beta }_{c,x}$ shows $t{\alpha }_{c,x}={\beta }_{c,x}$. Conversely any transformation with these equations must have the displayed values $t_c(x)$, so it is unique. We have proved the canonical colimit presentation of a presheaf:

A Cartesian closed category has finite categorical products and, for every $P,Q$, an exponential object $Q^P$ with an evaluation morphism $\mathrm{ev}:Q^P\times P\to Q$ such that composition with evaluation gives natural bijectionsFinite categorical products in the presheaf category are pointwise; in particular its terminal object is the constant singleton categorical presheaf. For categorical presheaves $P,Q$ defineFor $u:d\to c$, restriction sends $\alpha$ to $\alpha \circ (H_u\times 1_P)$. Composition and identity laws follow from those of the Yoneda embedding, so this is a categorical presheaf.

Define evaluation at $c$ by ${\mathrm{ev}}_c(\alpha ,x)={\alpha }_c(1_c,x)$. For $u:d\to c$, naturality of $\alpha$ gives $Q(u){\alpha }_c(1_c,x)={\alpha }_d(u,P(u)x)$, which is the evaluation of the restricted pair. Hence evaluation is a natural transformation.

Given $t:R\times P\to Q$, its currying sends $z\in R(c)$ to the transformation whose component at $a$ isNaturality in $a$ follows from that of $t$, and naturality in $c$ follows by composing $v$ with the relevant arrow. Evaluating $\hat{t}$ at $(1_c,x)$ recovers $t_c(z,x)$. Conversely, if $s:R\to Q^P$, naturality of $s$ along $v:a\to c$ says that evaluating $s_a(R(v)z)$ at $(1_a,x)$ gives $(s_c(z){)}_a(v,x)$. Thus currying the evaluation of $s$ recovers $s$. These constructions are inverse and natural, proving the universal property. This is the exponential in a presheaf category, and proves the presheaf category is Cartesian closed.

The Yoneda embedding preserves categorical products: for any $a$, maps $a\to c\times Y$ correspond naturally to pairs of maps $a\to c$ and $a\to Y$. Hence $H_{c\times Y}\cong H_c\times H_Y$. Using the exponential in a presheaf category, the Yoneda lemma and the exponential universal property in $\mathcal{C}$ givesEvery bijection is natural in $c$, since it is given by precomposition or the natural exponential adjunction. Thus these component bijections are a natural isomorphism of categorical presheaves:

By part (b), $i:P\to H_B$ is the equaliser of $ip$ and $1_{H_B}$. Full faithfulness of the Yoneda embedding writes $ip=H_b$ for a unique endomorphism $b:B\to B$. Choose an equaliser $e:A\to B$ of $b$ and $1_B$ in $\mathcal{C}$.

For each $c$, the maps $c\to A$ are precisely the maps $u:c\to B$ with $bu=u$. Thus $H_e:H_A\to H_B$ is the pointwise equaliser of $H_b$ and $1_{H_B}$, hence their equaliser in the presheaf category. Both $i$ and $H_e$ have the same universal property, so their vertices are isomorphic. This proves the representable retract criterion:

The Freyd general adjoint functor theorem is as follows. Let $G:\mathcal{D}\to \mathcal{C}$, with $\mathcal{D}$ a complete category which is locally small. Then $G$ has a left adjoint if and only if it preserves all small categorical limits and satisfies the solution-set condition: for each $c\in \mathcal{C}$, there is a set-indexed familysuch that every $u:c\to Gd$ can be written $u=G(h)u_i$ for some $i$ and some $h:d_i\to d$. The target category need not be complete. We prove all the existence steps.

First establish the initial-object lemma for complete categories with a weakly initial set. Let $\mathcal{E}$ be locally small and complete, with a weakly initial set $\{w_i\}$, meaning every object receives a map from at least one $w_i$. Its categorical product $w={\prod }_i{w}_i$ is weakly initial: compose a categorical product projection with the map from the appropriate $w_i$. Local smallness makes $\mathcal{E}(w,w)$ a set. Let $e:v\to w$ be the simultaneous equaliser of every endomorphism of $w$ and the identity. Explicitly it is the equaliser of the two arrowswith components $k$ and $1_w$. Thus $ke=e$ for every endomorphism $k$, and $e$ is monic.

Every object $x$ receives a morphism from $v$, by composing $e$ with a map $w\to x$. To prove uniqueness, take parallel maps $a,b:v\to x$ and their equaliser $m:y\to v$. Weak initiality of $w$ gives $t:w\to y$. The composite $emt$ is an endomorphism of $w$, so $(emt)e=e$. Cancelling the monomorphism $e$ gives $mte=1_v$. Hence $m$ is both monic and a split epimorphism, and is therefore invertible. Since $am=bm$, this forces $a=b$. We have proved $v$ is initial, without using a class-sized categorical product or equaliser.

For sufficiency in the theorem, fix $c$ and consider the comma category $(c\downarrow G)$. Its objects are pairs $(d,u:c\to Gd)$; a morphism $h:(d,u)\to (d^{\prime },u^{\prime })$ satisfies $G(h)u=u^{\prime }$. This category is locally small because each hom-set is a subset of $\mathcal{D}(d,d^{\prime })$. It is complete: for a small diagram of such pairs, take the underlying categorical limit $d$ in $\mathcal{D}$. The arrows from $c$ form a cone to its image under $G$, and preservation of the categorical limit gives a unique $u:c\to Gd$ inducing them. The same universal property gives all mediators in the comma category. The solution-set family is a weakly initial set in this comma category, so the lemma supplies an initial pairFor $f:c\to c^{\prime }$, initiality defines a unique $Ff:Fc\to F{c}^{\prime }$ satisfying $G(Ff){\eta }_c={\eta }_{c^{\prime }}f$. Uniqueness proves the identity and composition laws, making $F$ a functor. Initiality also gives bijectionsThe definition of $Ff$ proves naturality in $c$, and postcomposition proves naturality in $d$. These bijections are the required adjunction $F⊣G$.

For necessity, if $F⊣G$, the single arrow ${\eta }_c:c\to GFc$ is a solution set: the transpose of any $u:c\to Gd$ gives its factorization through ${\eta }_c$. If $d$ is a limiting cone vertex of a small diagram $D_j$ in $\mathcal{D}$, then, naturally in $c$,These are the canonical cone-factorization bijections, so $Gd$ with its image projections is a categorical limit of $G{D}_j$. Thus $G$ preserves all small categorical limits, completing both directions of the theorem.

For each algebra for a monad $(A,a)$, consider the specific pair in $\mathcal{D}$Then the exact condition isEach pair is reflexive, with common section $F{\eta }_A$: the two composite identities follow from $a{\eta }_A=1_A$ and ${\epsilon }_{FA}F{\eta }_A=1_{FA}$. Thus existence of all reflexive coequalizers is sufficient, but the displayed specified pairs give the necessary-and-sufficient condition.

To prove it, take $h:FA\to d$ and its adjoint transpose $x=Gh{\eta }_A:A\to Gd$. The transpose of $hFa$ is $xa$, by naturality of $\eta$. The transpose of $h{\epsilon }_{FA}$ isMoreover counit naturality and a triangle identity giveBecause transposition is bijective, the coequalizing equation is therefore equivalent toThe right side says exactly that $x:(A,a)\to Kd$ is a monad algebra morphism.

For sufficiency, choose a coequalizer $q_a:FA\to L(A,a)$ for every monad algebra. Its universal property and the equivalence just proved give natural bijectionsTo see explicitly that the chosen objects form a functor, an monad algebra morphism $u:(A,a)\to (B,b)$ makes $q_{b}Fu$ coequalize the pair for $a$: use $ua=bTu$ and naturality of the counit. Hence there is a unique $Lu$ with $Lu{q}_a=q_{b}Fu$. Uniqueness proves its identity and composition laws and the naturality of the displayed bijections. Thus $L⊣K$.

Conversely, suppose $L⊣K$ with unit ${\lambda }_{(A,a)}:(A,a)\to KL(A,a)$. Transpose its underlying arrow $A\to GL(A,a)$ through $F⊣G$ to obtain $q_a:FA\to L(A,a)$. Since the unit is an monad algebra morphism, the equivalence above shows that $q_a$ coequalizes the specified pair. Any coequalizing $h:FA\to d$ transposes to an monad algebra map $(A,a)\to Kd$, which factors uniquely through the unit by $L⊣K$. Transposing back gives a unique factorization of $h$ through $q_a$. Thus $q_a$ is the required coequalizer. This proves both directions of the Left adjoint to the Eilenberg-Moore comparison functor criterion.

A topological group module $A$ is a topological abelian group with a jointly continuous action of $G$ by group automorphisms. Its continuous cochains with topological coefficients arewith pointwise addition. The inhomogeneous differential isFor $n=0$, this means $(da)(g)=ga-a$. Continuity of multiplication and of the action ensures that $d$ preserves continuous cochains. Expanding $d(dc)$ gives cancellation in pairs: the two orders of multiplying neighbouring arguments agree by associativity, and the two ways of applying the action agree by its action law. Thus $d^2=0$. The cocycles are $Z^n=\ker (d:C^n\to C^{n+1})$ and the coboundaries are $B^n=\mathrm{im}(d:C^{n-1}\to C^n)$, with $B^0=0$. DefineFor general topological coefficients this is an algebraic quotient of the continuous cochains; its optional quotient topology need not be Hausdorff. For discrete coefficients it is the usual continuous cohomology of a profinite group. In degree zero it is the subgroup of invariant elements.

Give the discrete prime field ${\mathbb{F}}_p$ its trivial $G$-action. The one-cocycle condition becomes $c(gh)=c(g)+c(h)$ and every one-coboundary is zero. HenceEvery such group homomorphism kills powers and group commutators, hence their closure $\Phi (G)$, and every continuous functional on the quotient pulls back. If $G$ is topologically finitely generated, $V=G/\Phi (G)$ is a finite elementary abelian group. To verify finiteness without assuming it, the closure of a subgroup generated by $r$ elements of this abelian exponent-$p$ quotient has at most $p^r$ elements; a finite subgroup is already closed. Thus $V$ is a finite-dimensional vector space. Question 2 says that a generating family of $G$ is minimal precisely when its images give a basis of $V$. The dual space has the same finite dimension. This proves

There is a genuine missing hypothesis if the printed assertion is read for arbitrary pro-p groups and $d(G)$ means the least cardinality of any dense generating family. Here is an explicit infinite-rank failure of the first-cohomology generator formula. Let $I=\{0,1{\}}^{\mathbb{N}}$ and $G={\prod }_{r\in I}{\mathbb{F}}_p$. Enumerate the finite binary strings as $s_1,s_2,\dots$ and define $g_n(r)=1$ if $s_n$ is a prefix of $r$, and $0$ otherwise. For finitely many distinct sequences $r_1,\dots ,r_k$, choose long enough prefixes to distinguish each individually. The corresponding $g_n$ project onto the coordinate unit vectors of ${\mathbb{F}}_p^k$, so $⟨g_n:n\ge 1⟩$ surjects onto every finite coordinate projection and is dense in the product topology. No finite family can generate densely, since a finitely generated abelian exponent-$p$ subgroup is finite and closed. Thus $d(G)={\aleph }_0$. On the other hand, continuity of a linear functional to ${\mathbb{F}}_p$ means its kernel contains a basic neighbourhood, so it depends on finitely many coordinates. The coordinate projections are consequently a basis of the continuous dual space, givingThe unrestricted infinite-rank formula is false. A convention requiring a generating basis tending to the identity is different from the printed unrestricted topological generator count; the finite-rank identity proved above has no such ambiguity.

For finite $X$, a free pro-p group $F_p(X)$ is characterized by the universal property that every map $X\to P$ to a pro-p group extends uniquely to a continuous group homomorphism $F_p(X)\to P$. It is the pro-p completion of the abstract free group on $X$: each map to a finite $p$-group factors through one of the defining finite quotients, and passing to the inverse limit gives the extension to any pro-p group; uniqueness follows from density. This unrestricted universal property can also define the completion on an arbitrary set $X$. When using an infinite basis required to tend to the identity, one instead imposes the universal property only for maps tending to the identity. Only the finite-rank version is needed for the following argument.

A finite pro-p presentation is an isomorphismThere are finitely many generators and finitely many relators, and the denominator is their closed normal closure. The relators are elements of the free pro-p group; they may be limits of ordinary words. That distinction is important when writing conjugation relations below.

Now suppose $K{⊴}_{o}G$ has a finite pro-p presentation with generators $k_1,\dots ,k_a$ and relators $R_1,\dots ,R_t$. The quotient $Q=G/K$ is a finite p-group. Choose a finite finite pro-p presentation $Q=⟨{\bar{y}}_1,\dots ,{\bar{y}}_b\mid S_1,\dots ,S_c⟩$. Such a presentation exists, for example by using its entire finite multiplication table. Lift the quotient generators to $y_j\in G$. For every $i,j$, choose elements $W_{ij},V_{ij}$ of the free pro-p group on the $x_i$ that map respectively to $y_j^{-1}{k}_i{y}_j$ and $y_j{k}_i{y}_j^{-1}$ in $K$. Choose $U_{\ell }(x)$ mapping to $S_{\ell }(y)$, which lies in $K$. Form the finite finite pro-p presentationAll listed relations hold in $G$, giving a continuous surjective group homomorphism $P\to G$: its compact image contains $K$ and maps onto $Q$.

Let $X$ be the closed subgroup of $P$ topologically generated by the $x_i$. Both conjugation directions were included, so each $y_j$ normalizes $X$. The $x_i$ also normalize it, and its closed normalizer contains the generators of $P$. Thus $X⊴P$. The relations $R_h$ give a continuous surjection $K\to X$. Its composite with $X\to K$ induced by $P\to G$ fixes every $k_i$, and hence is the identity. Therefore the surjection $K\to X$ is injective as well, so $X\cong K$. On quotienting by $X$, the conjugation and kernel relations disappear, and the remaining presentation is exactly $⟨y_1,\dots ,y_b\mid S_1,\dots ,S_c{⟩}_{\mathrm{pro}\text{-}p}=Q$. Thus $P/X\to G/K$ is an isomorphism. The kernel of $P\to G$ lies in $X$ and meets $X$ trivially, so is trivial. Consequently $P\cong G$, proving

The Yoneda embedding is an exact representation of a category, but does not by itself reduce the subject to the study of arbitrary functor categories. There are both a size issue and a structure issue.

Let $\mathcal{A}$ be a locally small category and set $yA=\mathcal{A}(-,A)$. For a categorical presheaf $P:{\mathcal{A}}^{\mathrm{op}}\to \mathbf{Set}$, a natural transformation $\theta :yA\to P$ is determined by $x={\theta }_A(1_A)$. Indeed, naturality along $f:B\to A$ forcesConversely this formula defines a natural transformation for each $x\in P(A)$, since functoriality gives naturality along every $g:C\to B$. Taking $P=y{A}^{\prime }$ givesThus the Yoneda embedding is full and faithful, and $\mathcal{A}$ is equivalent to its full subcategory of representable presheaves. The indexing category in the usual version is ${\mathcal{A}}^{\mathrm{op}}$, not necessarily a small category chosen independently of $\mathcal{A}$.

Local smallness makes the values $\mathcal{A}(B,A)$ sets; it does not make the collection of objects a set. For a large indexing category, the collection of natural transformations between arbitrary set-valued functors can itself be a proper class. For example, take the discrete category on the class of ordinals and the constant two-element functor. Its endomorphisms include an independently chosen function $\{0,1\}\to \{0,1\}$ at each ordinal. A small functor category cannot encode this collection without changing universes. The Yoneda lemma remains meaningful when the source is representable because the displayed bijection identifies its natural transformations with a set. It does not make the entire large functor category locally small.

Even for a small category, the representable image is usually a very special part of its presheaf category. If $\mathcal{A}$ is the terminal category, its presheaf category is $\mathbf{Set}$, but its representable image consists only of a singleton. The presheaf category has all small categorical limits and colimits, whereas an arbitrary full subcategory need have almost none. The Yoneda embedding preserves existing limits because representable functors preserve limits. It generally does not preserve colimits. For example, the coproduct of two singleton sets in category of finite sets is a two-element set, but evaluating the proposed presheaf coproduct at a two-element set givesThe pointwise coproduct therefore leaves the representable image. Identifying which presheaves are representable, and which ambient constructions return to the original category, is precisely substantive category theory.

The representation is nonetheless powerful. The Yoneda lemma replaces a morphism by all its probes, converts a universal property into a representation of a functor, and makes the presheaf category a natural place to add formal colimits. A small presheaf category is the free free cocompletion under small colimits: every presheaf is a colimit of representables indexed by its category of elements. But this is a controlled enlargement of the category, not an identification of its original objects with all functors. The stronger conclusion in the proposed assertion therefore does not follow from the full-faithfulness statement.

For a diagram $D:\mathcal{J}\to \mathcal{C}$, a limit-preserving functor carries every limiting cone over a diagram to a limiting categorical cone. A limit-reflecting functor has the converse property: a categorical cone is limiting whenever its image is limiting. A limit-creating functor uniquely lifts every specified limiting categorical cone over the image diagram to a categorical cone over $D$, and the lift is limiting. These definitions concern diagrams of the stipulated shape; creation includes the lifting requirement, not merely reflection.

Let $(L,(p_j))$ be a categorical limit of $D$. The mapis a bijection: the right side consists exactly of compatible families of arrows from $A$, and the categorical limit's universal property gives their unique factorization through $L$. The bijection is induced by the categorical limit projections, so it proves that covariant representables preserve limits, including the empty diagram and its terminal object.

Construct pointwise limits in a functor category. For $H:\mathcal{J}\to [\mathcal{D},\mathcal{C}]$, choose at each object $d$ a categorical limit $L(d)$ of $j\mapsto H_j(d)$, with projections $p_j(d)$. For $u:d\to d^{\prime }$, the family $H_j(u)p_j(d)$ is compatible; define $L(u)$ uniquely byThe universal property gives $L(1_d)=1_{L(d)}$ and $L(vu)=L(v)L(u)$, since those equalities hold after every projection. Thus $L$ is a functor, and each $p_j:L\Rightarrow H_j$ is a natural transformation.

For any categorical cone $(M,(a_j))$, the pointwise categorical limits give unique maps $a(d):M(d)\to L(d)$. To check naturality, compose $L(u)a(d)$ and $a(d^{\prime })M(u)$ with every $p_j(d^{\prime })$; both become $H_j(u)a_j(d)=a_j(d^{\prime })M(u)$. The projections distinguish arrows into their categorical limit, so the two maps agree. Componentwise uniqueness gives uniqueness of the natural transformation $a$. This proves that $(L,p_j)$ really is the required categorical limit, rather than merely a family of objectwise candidates.

A specified categorical limit categorical cone in ${\mathcal{C}}^{\mathrm{ob}\mathcal{D}}$ fixes these objectwise vertices and projections. The displayed equation forces every arrow $L(u)$, and the argument forces every categorical cone factorization. Hence the forgetful functor uniquely lifts that categorical cone and is a limit-creating functor. The construction only takes small categorical limits in $\mathcal{C}$; it does not require $\mathcal{D}$ to be small. As usual, the functor categories are understood in a universe where their collections of transformations are meaningful.