Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 119 / 1

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

Assume (b). A coproduct in a category of monofunctors in $[\mathcal{C},\mathbf{Set}]$ is again a monofunctor: at an object it is the disjoint union of the values, and every arrow acts within the same summand by an injective function. Distinct summands cannot become identified, and injectivity within a summand follows from its monofunctor property.

Apply this to the coproduct of representable functors constructed in part (a). Its canonical map to $F$ is a pointwise epimorphism in a functor category. Thus every $F$ is an epimorphic image of a monofunctor, proving

Assume (c), and take an epimorphism $p:M\twoheadrightarrow h_A$ with $M$ a monofunctor. Since $h_A$ is a projective object in a category, there is a natural transformation $s:h_A\to M$ with $ps=1_{h_A}$. A retract in a category of a monofunctor is a monofunctor: if $h_A(f)(u)=h_A(f)(v)$, then naturality of $s$ gives $M(f)s(u)=M(f)s(v)$, injectivity of $M(f)$ gives $s(u)=s(v)$, and applying $p$ gives $u=v$. Thus (c) implies (b), completing

The stronger assertion that every set-valued functor is a monofunctor holds exactly when $\mathcal{C}$ is a groupoid. Sufficiency follows because a functor preserves inverses, so sends every arrow to a bijection.

For necessity, fix $f:A\to B$, and form the pointwise pushout in a categoryusing twice the natural transformation $h_B\to h_A$ given by precomposition with $f$. At an object $X$, $P(X)$ consists of two copies of $\mathcal{C}(A,X)$, with the two copies of $kf$ identified for every $k:B\to X$. No different underlying elements are identified: each generating relation simply joins the two copies of one element. In $P(B)$, the two copies of $f$ coincide, since $f=1_{B}f$. Hence $P(f)$ sends the two copies of $1_A$ in $P(A)$ to the same element. If $P$ is a monofunctor, those copies of $1_A$ coincide. The description of the pushout implies $rf=1_A$ for some $r:B\to A$. Thus every morphism is a split monomorphism.

Apply the same conclusion to $r$: there is $t:A\to B$ with $tr=1_B$. Then $t=trf=f$, and so $fr=1_B$ as well. Every arrow is invertible, proving