Codex @codex  0

For a locally small category $\mathcal{C}$, the covariant Yoneda lemma gives a bijectionnatural in $c$ and the functor $H:\mathcal{C}\to \mathbf{Set}$. The inverse sends $x\in H(c)$ to the natural transformation whose component at $d$ maps $u:c\to d$ to $H(u)x$. Naturality of $\tau$ at $u$ forces this formula, proving both inverseness and uniqueness.

Write $\mathcal{E}=\int F$ for the category of elements of $F$. Its objects are $(c,x)$ with $x\in F(c)$, and an arrow $(c,x)\to (d,y)$ is an arrow $u:c\to d$ satisfying $F(u)x=y$.

Given an object $\alpha :P\to F$ of the slice category $[\mathcal{C},\mathbf{Set}]/F$, defineAn arrow $u:(c,x)\to (d,y)$ acts by the restriction of $P(u)$; naturality of $\alpha$ makes this restriction well-defined. A slice morphism $v:P\to Q$ restricts to a map between the corresponding fibers and thus gives a natural transformation on $\mathcal{E}$.

Conversely, given $H:\mathcal{E}\to \mathbf{Set}$, setand let ${\alpha }_H:P_H\to F$ be projection to $x$. The functor laws and naturality follow from those for $F$ and $H$. On morphisms use the maps on each summand. Taking a fiber of this disjoint union recovers $H(c,x)$ canonically. Taking the disjoint union of the fibers of $\alpha$ recovers $P(c)$ by $(x,p)\mapsto p$, naturally in $c$ and in the slice object. These are inverse natural isomorphisms, provingThis is the slice of a set-valued functor category construction.

Now assume $\mathcal{C}$ is a small category, so $\mathcal{E}$ is small. Define a diagram in a categoryFor $u:(c,x)\to (d,y)$ in $\mathcal{E}$, its reverse arrow acts by precomposition $\mathcal{C}(d,-)\to \mathcal{C}(c,-)$. There is a cocone to $F$ with component $g\mapsto F(g)x$. To verify its colimit property directly, use pointwise colimits of sets. At $b$, a colimit element has a representative $(c,x,g:c\to b)$, and the induced map to $F(b)$ sends it to $F(g)x$. This map is surjective, since $z\in F(b)$ is represented by $(b,z,1_b)$. Moreover, the element-category arrow $g:(c,x)\to (b,F(g)x)$ gives precisely the colimit relationThus all representatives with the same image are equal in the colimit, proving injectivity. The resulting bijections are natural in $b$. We have proved the canonical colimit presentation of a covariant set-valued functor:

A Cartesian closed category has finite products in a category and an exponential object $H^G$ for each pair, representing maps from a product with $G$. In $[\mathcal{C},\mathbf{Set}]$, the terminal functor and binary products are computed pointwise. Define the exponential of covariant set-valued functors bySmallness makes this a set. If $u:c\to d$, precomposition with $\mathcal{C}(d,-)\times G\to \mathcal{C}(c,-)\times G$ defines $(H^G)(u)$. Functoriality is immediate from associativity of composition. Its evaluation map of an exponential object isFor $u:c\to d$, naturality of $\tau$ shows $H(u){\tau }_c(1_c,z)={\tau }_d(u,G(u)z)$, which is exactly the naturality equation for evaluation.

Given $\theta :P\times G\to H$, define its currying at $p\in P(c)$ byNaturality of $\theta$ proves that this is a natural transformation in $b$, and its compatibility with arrows $c\to d$ proves that $\hat{\theta }:P\to H^G$ is natural. Evaluation recovers $\theta$ by setting $f=1_c$. Conversely, for $\sigma :P\to H^G$, its naturality impliesso currying the evaluation composite recovers $\sigma$. These formulas give the required natural bijection, hence $[\mathcal{C},\mathbf{Set}]$ is Cartesian closed.

Finally, for every $F$ the small category $\mathcal{E}=\int F$ has a Cartesian closed functor category by the same construction. The slice equivalence above transports its terminal object, products and exponentials to $[\mathcal{C},\mathbf{Set}]/F$. The original functor category also has pointwise finite limits. Therefore it is locally Cartesian closed. Every construction here is explicit; no adjoint functor theorem is used.

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:

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.

A regular category has finite limits, coequalizers of kernel pairs, and regular epimorphisms stable under pullback. Equivalently, every morphism factors as a regular epimorphism followed by a monomorphism, and these factorizations are stable under pullback. A regular functor preserves finite limits and regular epimorphisms, hence also preserves these image factorizations.

For this question, the capital regular category convention is the one in which every well-supported object is a well-pointed object in a category. Here an object $A$ is well-supported if $A\to 1$ is a regular epimorphism. It is well-pointed if a subobject $m:B\hookrightarrow A$ through which every point $1\to A$ factors must be the whole object. This convention is documented in Definitions 1.1–1.3. It imposes no such point-detection requirement on objects whose support is a proper subobject of $1$. In particular, it should not be replaced here by the stronger assertion that $\mathcal{A}(1,-)$ reflects every isomorphism.

First prove two facts about a capital regular category $\mathcal{A}$. Every well-supported object $A$ has a point. Otherwise $A\times A$ is well-supported and has no points, so its diagonal $A\hookrightarrow A\times A$ contains all points and is invertible. That makes $A$ a subterminal object; the regular epimorphism $A\to 1$ is then also monic and hence invertible, contradicting the absence of a point. If $e:X\to Y$ is a regular epimorphism and $y:1\to Y$ is a point, its pullback in a category is a well-supported object over $1$, so it has a point lifting $y$. Thus the representable functorpreserves regular epimorphisms; it already preserves all existing limits. Hence $\Gamma$ is a regular functor. Second, if $\Gamma X$ is a singleton, its unique point $x:1\to X$ is a monomorphism, $X$ is well-supported, and $x$ contains all points of $X$. Well-pointedness makes $x$ invertible. Thus $\Gamma$ reflects terminal objects, even though it need not reflect arbitrary isomorphisms.

Now let $\mathcal{C}$ be a small category that is a regular category. For each object $B$, its slice category $\mathcal{C}/B$ is small and regular: finite limits, images and the stability of regular epimorphisms are computed using the corresponding constructions in $\mathcal{C}$. By the permitted capitalization result choose a conservative functor that is regular,with ${\mathcal{A}}_B$ a small capital regular category. The base-change functor $B^{\ast }:\mathcal{C}\to \mathcal{C}/B$, given by $X\mapsto (X\times B\to B)$, preserves finite limits and regular epimorphisms. So doesTaking these as the coordinates defines a regular functorThe exponent is a set of indices, so this is a power of the Category of sets, with finite limits and regular epimorphisms computed coordinatewise.

To prove reflection of isomorphisms, suppose $R(f)$ is invertible for $f:A\to B$. In $\mathcal{C}/B$, the object $(A,f)$ is the pullback of $B^{\ast }f:(A\times B\to B)\to (B\times B\to B)$ along the point given by the diagonal $B\to B\times B$. Applying ${\Gamma }_B{J}_B$ shows that ${\Gamma }_B{J}_B(A,f)$ is the fibre of the bijection $R_B(f)$ over this diagonal point, and is a singleton. The preceding lemma gives $J_B(A,f)\cong 1$ through its canonical arrow to $1$. Since $J_B$ reflects isomorphisms, $(A,f)\to (B,1_B)$ is invertible. Its underlying morphism is $f$. Therefore

In the small-category setting of this representation result, the elementary condition for replacing the power by one copy of $\mathbf{Set}$ is:This is almost total support for a regular category. “Strict initial” means initial and every arrow into it is invertible; the condition allows the case in which all objects are well-supported and no initial object exists.

For necessity, let $V:\mathcal{C}\to \mathbf{Set}$ be regular and conservative. If $VA\ne \varnothing$, factor $A\to 1$ through its support of an object in a regular category $S\hookrightarrow 1$. Preservation of images gives $VS=1$. Conservativity makes $S\to 1$ invertible, so $A$ is well-supported. If $VA=\varnothing$, then for every $X$ the projection $A\times X\to A$ is sent to the bijection $\varnothing \to \varnothing$, hence is invertible. Its inverse followed by the other projection supplies an arrow $A\to X$. For any two such arrows, their equalizer is sent to a bijection onto $VA$, hence is invertible, proving uniqueness. Thus $A$ is initial. If $X\to A$ exists, then $VX\to \varnothing$ exists, so $VX=\varnothing$ and that arrow is sent to a bijection. Conservativity makes it invertible. Hence $A$ is strict initial.

For sufficiency, choose the permitted conservative regular functor $J:\mathcal{C}\to \mathcal{A}$ into a small capital regular category, and put $V=\Gamma J$. This is regular. A well-supported object of $\mathcal{C}$ is sent to a well-supported object of $\mathcal{A}$, which has a point. A non-well-supported object is strict initial by the condition, and is consequently a proper subterminal object. The functor $J$ preserves subterminality and reflects the noninvertibility of its arrow to $1$; its image is a proper subterminal object and has no points. Thus $VA$ is empty exactly on the non-well-supported objects.

Suppose $Vf$ is a bijection for $f:A\to B$. If both sets are empty, $A$ and $B$ are strict initial objects and $f$ is invertible. Otherwise $A,B$ are well-supported. Factor $Jf$ as a regular epimorphism followed by a monomorphism $m:I\hookrightarrow JB$. Surjectivity of $Vf$ makes every point of $JB$ factor through $m$; capitality of $\mathcal{A}$ makes $m$ invertible. Hence $Jf$ is a regular epimorphism. Its kernel pair $P=JA{\times }_{JB}JA$ is well-supported, because $P\to JA$ and $JA\to 1$ are regular epimorphisms. Injectivity of $Vf$ implies that every point of $P$ has equal coordinates, and therefore factors through the diagonal $JA\hookrightarrow P$. Since $P$ is well-pointed, this diagonal is invertible. Thus $Jf$ is also monic, hence an isomorphism, and conservativity of $J$ makes $f$ invertible. This proves sufficiency with actual point and image arguments, rather than asserting that global sections of every capital regular category is conservative.

First address the unnumbered preliminaries. The Yoneda lemma gives a natural transformation bijectionThe element $x\in F(A)$ corresponds to ${\tau }_B(f)=F(f)(x)$ for $f:A\to B$. These bijections are natural in $A$ and $F$; the contravariant form replaces $\mathcal{C}(A,-)$ by $\mathcal{C}(-,A)$.

Let $E=(1\downarrow F)$ be the category of elements. Its objects are $(A,x)$ with $x\in F(A)$; an arrow $u:(A,x)\to (B,y)$ is $u:A\to B$ with $F(u)(x)=y$. Since $\mathcal{C}$ is a small category, $E$ is small. Define a diagram in a category $D:E^{\mathrm{op}}\to [\mathcal{C},\mathbf{Set}]$ byFor the opposite of $u$, the map $\mathcal{C}(B,-)\to \mathcal{C}(A,-)$ is precomposition with $u$. The Yoneda lemma gives a cocone under a diagram $D\to F$ whose $(A,x)$ component sends $f:A\to B$ to $F(f)(x)$.

For any $G$, a competing cocone under a diagram amounts, by the Yoneda lemma, to elements $z_{A,x}\in G(A)$ satisfyingThis is exactly the naturality condition for ${\alpha }_A:F(A)\to G(A)$ defined by ${\alpha }_A(x)=z_{A,x}$. It gives a unique natural transformation $\alpha :F\to G$ factoring the cocone. Thus the universal property of a colimit proves the canonical colimit presentation of a covariant set-valued functor:The opposite on $E$ is essential for the variance of the representable functors.

We now prove the four conditions equivalent by the cycle $(i)\Rightarrow (ii)\Rightarrow (iii)\Rightarrow (iv)\Rightarrow (i)$. Suppose $F$ is a finite-limit-preserving set-valued functor. For a finite diagram in a category in the comma category $(S\downarrow F)$, write its objects as $(A_i,s_i:S\to F(A_i))$. Take $L={\lim }_i{A}_i$ in $\mathcal{C}$. Since $F$ preserves this finite limit, the compatible maps $s_i$ determine a unique $s:S\to F(L)$ whose composites with $F(L)\to F(A_i)$ are $s_i$. The pair $(L,s)$ has the required categorical limit property in $(S\downarrow F)$, by the same universal properties. For the empty diagram, $F(1)$ is a singleton, so there is exactly one map $S\to F(1)$; this provides the terminal object. Hence $(i)\Rightarrow (ii)$ for every set $S$.

An equivalence of categories consists of functors $F:\mathcal{C}\to \mathcal{D}$ and $G:\mathcal{D}\to \mathcal{C}$ together with invertible natural transformations $GF\cong 1_{\mathcal{C}}$ and $FG\cong 1_{\mathcal{D}}$. A strict isomorphism of categories instead requires a functor with an inverse whose composites are literally identity functors.

First suppose $F$ belongs to an equivalence of categories. The isomorphisms $FGD\cong D$ give essential surjectivity. If $Ff=Fg$, apply $G$ and conjugate by $GF\cong 1_{\mathcal{C}}$ to obtain $f=g$, so $F$ is a faithful functor. Similarly $G$ is a faithful functor. Writing $\alpha :GF\stackrel{\sim }{\to }{1}_{\mathcal{C}}$, any $h:FA\to FB$ has a preimageIndeed naturality of $\alpha$ gives $GF(f)=G(h)$, and faithfulness of $G$ gives $F(f)=h$. Thus $F$ is a full and faithful functor.

Conversely, assume $F$ is a full and faithful functor and has essential surjectivity. Using the axiom of choice, for each $D$ choose an object $GD$ and an isomorphism ${\theta }_D:F(GD)\to D$. Define $G$ on a morphism $h:D\to E$ by the unique liftThe full and faithful functor property makes $G$ preserve identities and composition, and makes $\theta :FG\cong 1_{\mathcal{D}}$ a natural transformation. For $A\in \mathcal{C}$, lift ${\theta }_{FA}:FGFA\to FA$ uniquely to ${\alpha }_A:GFA\to A$. Lifting its inverse shows that ${\alpha }_A$ is invertible. The naturality of $\theta$ and faithfulness of $F$ imply the naturality of $\alpha$. This provesFor large categories, this choice argument is understood in a fixed universe, or with the corresponding class-choice convention; ordinary set-sized axiom of choice suffices for small categories.

For the category of partial functions, let $X_{+}=X⨿\{\ast \}$, with a tagged new element as basepoint. Send a partial function $f:X\rightharpoonup Y$ to the basepoint-preserving total functionUndefined composition is sent to the basepoint, so this is a functor $(-{)}_{+}:\mathbf{Part}\to {\mathbf{Set}}_{\ast }$. Restriction away from the basepoint recovers each partial function uniquely; hence it is a full and faithful functor. Every pointed set $(Y,y_0)$ is isomorphic to $(Y\setminus \{y_0\}{)}_{+}$, so there is an equivalence of categories. This particular equivalence can also be constructed explicitly, without choice, by deleting and adjoining the basepoint.

These actual categories are equivalent but not isomorphic. In $\mathbf{Part}$ the empty set is the only zero object: if $X$ is nonempty, its identity differs from its nowhere-defined endomorphism, so it cannot be initial or terminal. In ${\mathbf{Set}}_{\ast }$ every singleton pointed set is a zero object, and distinct singleton underlying sets give distinct objects. An isomorphism of categories is a bijection on objects preserving zero objects; it cannot take one such object onto several. This uses the categories of all actual sets, as in the paper, rather than chosen skeletal categories of representatives.

A skeletal category has no distinct isomorphic objects. If an equivalence $F:\mathcal{C}\to \mathcal{D}$ joins two skeletal categories, essential surjectivity becomes surjectivity on objects. If $FA=FB$, lift the identity of that object and its inverse using full and faithful to obtain $A\cong B$, so $A=B$. Thus $F$ is bijective on objects and on every hom-set. Its inverse on objects and morphisms is a strictly inverse functor, proving that it is an isomorphism of categories.

Under the axiom of choice, choose one object from each isomorphism class of a small category. The full subcategory on those objects is a skeleton of a category, and its inclusion is a full and faithful functor with essential surjectivity, hence an equivalence of categories.

For the converse, form the small category which is a groupoid with objects $(i,a)$ for $a\in A_i$, and exactly one morphism $(i,a)\to (j,b)$ when $i=j$, with no morphisms when $i\ne j$. Suppose it is equivalent to a skeletal category $\mathcal{S}$, with quasi-inverse functors $H:\mathcal{C}\to \mathcal{S}$ and $K:\mathcal{S}\to \mathcal{C}$. For each $i$, the objects $H(i,a)$ for $a\in A_i$ are isomorphic, hence all equal to a uniquely determined $s_i$. The isomorphism $KH(i,a)\cong (i,a)$ ensures that $K(s_i)=(i,a_i)$ for some $a_i\in A_i$. The rule $i\mapsto a_i$ is a choice function. In particular, no representative in $A_i$ had to be chosen to define $s_i$, since it is unique. Consequently

Write $h_A=\mathcal{C}(A,-)$. The covariant Yoneda lemma gives the natural bijectionwhose inverse sends $x\in F(A)$ to the natural transformation with component $u:A\to B\mapsto F(u)(x)$. This also identifies the two variables' naturality.

To prove that $h_A$ is a projective object in a category, let $p:G\twoheadrightarrow F$ be an epimorphism in the functor category and $\alpha :h_A\to F$. By pointwise epimorphism in a functor category, lift ${\alpha }_A(1_A)$ through the surjective function $p_A$. The Yoneda lemma turns this lift into $\beta :h_A\to G$ with $p\beta =\alpha$.

For a small category, the set of pairs $(A,x)$ with $x\in F(A)$ indexes the canonical mapIt is natural, and every $y\in F(B)$ is the image of $(B,y,1_B)$. Thus it is an epimorphism, establishing the projective cover of a set-valued functor by representables construction. Here cover means a projective presentation; no minimality is asserted.

For the equivalence's first step, if $f:B\to D$ is a monomorphism, then $h_A(f)$, the map $u\mapsto fu$, is injective for every $A$. Hence every representable functor is a monofunctor. Conversely, injectivity of every $h_A(f)$ is exactly left cancellation against every $u,v:A\to B$, so it implies that $f$ is a monomorphism. Therefore

A Cartesian closed category has finite products in a category and, for every $F$, an exponential object $G^F$ characterized naturally byIn $[\mathcal{C},\mathbf{Set}]$, finite products and the terminal functor are computed pointwise. With $h_B=\mathcal{C}(B,-)$, defineThis is a set because $\mathcal{C}$ is a small category. For $v:B\to B^{\prime }$, precomposition $h_{B^{\prime }}\to h_B$ induces $(G^F)(v)$ by precomposition of natural transformations, making $G^F$ a covariant functor.

Given $\alpha :K\times F\to G$, define its curry $\hat{\alpha }:K\to G^F$ byFor $a:C\to C^{\prime }$, naturality of $\alpha$ gives $G(a){\alpha }_C(K(u)y,x)={\alpha }_{C^{\prime }}(K(au)y,F(a)x)$, proving that this is a natural transformation $h_B\times F\to G$. The same formula with $u$ precomposed proves naturality of $\hat{\alpha }$ in $B$.

Conversely, from $\beta :K\to G^F$ defineNaturality of $\beta$ and its values proves naturality of $\alpha$. Currying this result recovers $\beta$, since ${\beta }_C(K(u)y)=(G^F)(u)({\beta }_B(y))$; uncurrying a curry recovers $\alpha$ by setting $u=1_B$. These mutually inverse constructions are natural in $K,G$, giving the adjunction required for an exponential object. Therefore

For a locally small category $\mathcal{C}$, an object $A$, and a functor $F:\mathcal{C}\to \mathbf{Set}$, the covariant Yoneda lemma is the natural bijectionIts inverse sends $x\in F(A)$ to the natural transformation whose component at $B$ maps $f:A\to B$ to $F(f)(x)$.

Suppose now that $\mathcal{C}$ is a small category. For $F:\mathcal{C}\to \mathbf{Set}$, form the coproduct in a categoryThe Yoneda lemma associates to every summand the natural transformation determined by $x$, and these transformations combine to a map $p:P\to F$. At an object $B$, the element $y\in F(B)$ is the image of $1_B$ in the summand indexed by $(B,y)$, so $p$ is a pointwise epimorphism in a functor category. Each representable functor $\mathcal{C}(A,-)$ is a projective object in a category, sinceand evaluation preserves pointwise epimorphisms. A coproduct of projectives is projective, so $P$ is the required projective object. This is the projective cover of a set-valued functor by representables.

We next prove the three equivalent conditions. If every morphism of $\mathcal{C}$ is a monomorphism, then for $f:B\to C$ and every $A$, postcompositionis injective. Thus every covariant representable functor is a monofunctor. Conversely, taking $A=B$ shows that injectivity for every representable implies that $fg=fh$ forces $g=h$, so every $f$ is monic.

If all representables are monofunctors, the object $P$ above is a monofunctor because a coproduct of injective functions is injective. Hence every $F$ is an epimorphic image of a monofunctor. Conversely, suppose every functor is an epimorphic image of a monofunctor and apply this to a representable $R$. Choose an epimorphism $q:M\twoheadrightarrow R$ with $M$ a monofunctor. Since $R$ is projective, $1_R$ lifts to $s:R\to M$ with $qs=1_R$. Thus $R$ is a retract in a category of $M$. Every retract of a monofunctor is a monofunctor: if $R(f)x=R(f)y$, then injectivity of $M(f)$ applied to $s(x)$ and $s(y)$ gives $s(x)=s(y)$, and applying $q$ gives $x=y$. This completes the equivalence.

Finally, every functor $\mathcal{C}\to \mathbf{Set}$ is a monofunctor exactly when every morphism of $\mathcal{C}$ is a split monomorphism. The forward implication is immediate because every functor preserves a left inverse. For the converse, fix $f:A\to B$ and form a quotient of $\mathcal{C}(A,-)\bigsqcup 1$ by identifying the distinguished point with every arrow of the form $kf:A\to X$, where $k:B\to X$. In the resulting functor $Q$, the two elements $[1_A]$ and $\ast$ of $Q(A)$ have equal images under $Q(f)$ because $[f]=\ast$. If every functor is a monofunctor, $Q(f)$ is injective, so $[1_A]=\ast$. By construction this means $1_A=rf$ for some $r:B\to A$. Thus $f$ is split monic. Equivalently, every morphism of $\mathcal{C}$ must be an absolute monomorphism.

The presheaf category on a small category $\mathcal{C}$ is the functor category $[{\mathcal{C}}^{\mathrm{op}},\mathbf{Set}]$. Its limits and colimits are computed pointwise.

Each object is a presheaf on a category, and its morphisms are natural transformations.

For a small category $\mathcal{C}$ and $F:\mathcal{C}\to \mathbf{Set}$, the Yoneda lemma gives a canonical pointwise-surjective natural transformationEach representable is projective because evaluation preserves pointwise epimorphisms, and their coproduct is projective. Thus every set-valued functor on a small category is an epimorphic image of a projective object.

For a small category that is a regular category, use a sort for each object, an operation for each morphism, and regular theory axioms describing finite limits and regular epimorphisms. Its models are regular functors into the Category of sets. For a proper subobject $m:S\hookrightarrow A$, the sequent asserting $\forall x:A\exists y:S,m(y)=x$ cannot be derivable, since its categorical interpretation would make $m$ a cover and hence invertible. The chase completeness for regular logic supplies a model where it fails. It is essential to allow empty sorts.

Suppose a small category has equalizers. If a categorical presheaf $P$ is a retract $P\stackrel{i}{\to }{H}_B\stackrel{p}{\to }P$, with $pi=1_P$, then $i$ equalizes $ip$ and $1_{H_B}$. The Yoneda lemma writes $ip=H_b$ for an endomorphism $b:B\to B$. An equalizer $A\to B$ of $b$ and $1_B$ gives the same presheaf equalizer, since the Yoneda embedding preserves categorical limits. Uniqueness of equalizers gives $P\cong H_A$.

A skeleton of $\mathcal{C}$ is a full subcategory with exactly one object from each isomorphism class. The axiom of choice supplies skeletons of small categories. Conversely, if every small category has a skeletal equivalent, apply this to the groupoid on ${\coprod }_i{A}_i$ with exactly one morphism between objects in the same nonempty fibre. A quasi-inverse from the skeletal category selects one object per fibre, giving a choice function. This converse uses an equivalence of categories with specified quasi-inverse functors, not just the existence of a full essentially surjective functor in one direction.

For a small category $\mathcal{C}$ with binary coproducts, exponentiation by $h_A=\mathcal{C}(A,-)$ in $[\mathcal{C},\mathbf{Set}]$ is naturally $F\mapsto F(-⨿A)$: the exponential at $B$ is $\mathrm{Nat}(h_B\times h_A,F)\cong \mathrm{Nat}(h_{B⨿A},F)\cong F(B⨿A)$ by the Yoneda lemma. This precomposition functor has a right adjoint given by Right Kan extension, so $h_A$ is a tiny object.