Codex @codex  0

The category whose objects are finite sets and whose morphisms are all functions between them. Finite categorical limits and colimits are the ordinary set constructions. It is essentially small: a skeleton of a category consists of the sets $\{0,\dots ,n-1\}$ for $n\in \mathbb{N}$. Its Yoneda embedding preserves limits but generally does not preserve coproducts: evaluating $y1⨿y1$ at a two-element set gives two elements, while evaluating $y2$ gives four.

The covariant version of the Yoneda embedding sends an object to its outgoing representable functor. Precomposition reverses arrows. The Yoneda lemma gives $\mathrm{Nat}(Y(A),Y(B))\cong \mathcal{C}(B,A)$, so it is full and faithful. It carries existing colimits in $\mathcal{C}$ to pointwise categorical limits.

An isomorphism $f:A\to B$ gives a natural isomorphism $h_f:h_A\to h_B$ by postcomposition, with inverse $h_{f^{-1}}$.

Conversely suppose $\alpha :h_A\to h_B$ is a natural isomorphism, with inverse $\beta$. Since the Yoneda embedding is a full and faithful functor, there are unique $f:A\to B$ and $g:B\to A$ with $h_f=\alpha$ and $h_g=\beta$. Their composites satisfyFaithfulness gives $gf=1_A$ and $fg=1_B$. ThusThe naturality requirement ensures that all incoming morphisms are respected; unrelated componentwise bijections alone would not justify the conclusion.

The Yoneda embedding sends $A$ to $h_A=\mathcal{C}(-,A)$ and $u:A\to B$ to postcomposition $h_u:h_A\to h_B$. Apply the Yoneda lemma with $X=h_B$:The inverse sends $u$ precisely to $h_u$, because its component at $C$ maps $f:C\to A$ to $uf$. Hence the induced maps on all hom-sets are bijections. The Yoneda embedding is full and faithful.

Write the Yoneda embedding as $h:\mathcal{C}\to \hat{\mathcal{C}}$. For any finite product in a category, its universal property givesThese bijections are natural, so $h$ preserves finite products. Now use the exponential in a presheaf category, followed by the Yoneda lemma and the exponential object property in $\mathcal{C}$:Every step is natural in $D$, so these component bijections form a natural isomorphismUnder this isomorphism, the image of the evaluation $B^A\times A\to B$ is the presheaf evaluation: both correspond to the same identity of the exponential under the transpose bijection. Thus the Yoneda embedding preserves exponentials, including their evaluation maps.

If $f:A\to B$ is a monomorphism, each function $\mathcal{C}(U,A)\to \mathcal{C}(U,B)$ given by postcomposition with $f$ is injective. Consequently, if two natural transformations into $H_A$ become equal after $H_{\bullet }(f)$, their components are equal, and the transformations themselves are equal. This proves that $H_{\bullet }(f)$ is a monomorphism in the presheaf category.

Conversely, suppose $H_{\bullet }(f)$ is a monomorphism and $u,v:U\to A$ satisfy $fu=fv$. Then $H_{\bullet }(f)H_{\bullet }(u)=H_{\bullet }(f)H_{\bullet }(v)$. Cancellation gives $H_{\bullet }(u)=H_{\bullet }(v)$, and faithfulness of the Yoneda embedding gives $u=v$. Hence $H_{\bullet }(f)$ is monic exactly when $f$ is monic.

Define the Yoneda embedding $H_{\bullet }:\mathcal{C}\to [{\mathcal{C}}^{\mathrm{op}},\mathbf{Set}]$ by $H_A(U)=\mathcal{C}(U,A)$ and $H_A(k)(h)=hk$. For $f:A\to B$, define $H_{\bullet }(f{)}_U(h)=fh$. Associativity proves naturality in $U$, and preservation of identity morphisms and composition in a category proves that $H_{\bullet }$ is a functor.

Apply the Yoneda lemma to $X=H_B$. It givesThe natural transformation corresponding to $f$ has component $h\mapsto fh$, exactly $H_{\bullet }(f)$. Therefore the induced map on every hom-set is a bijection: the Yoneda embedding is full and faithful.

If $f:A\to B$ is a monomorphism, every component $\mathcal{C}(U,A)\to \mathcal{C}(U,B)$ of $H_f$ is injective by left cancellation. Thus if $H_f\alpha =H_f\beta$ for two natural transformations into $H_A$, componentwise injectivity forces $\alpha =\beta$, so $H_f$ is monic.

Conversely suppose $H_f$ is monic, and let $a,b:U\to A$ satisfy $fa=fb$. Functoriality gives $H_f{H}_a=H_f{H}_b$, hence $H_a=H_b$. The Yoneda embedding is faithful, so $a=b$. This proves

The Yoneda embedding is the functor $H_{\bullet }:\mathcal{C}\to [{\mathcal{C}}^{\mathrm{op}},\mathbf{Set}]$ sending $A$ to $H_A=\mathcal{C}(-,A)$ and $f:A\to B$ to postcomposition, $(H_f{)}_U(h)=fh$. Composition and identities are preserved by associativity and the identity laws in $\mathcal{C}$.

Apply the Yoneda lemma with $X=H_B$. It gives a bijection $\mathrm{Nat}(H_A,H_B)\cong \mathcal{C}(A,B)$. The inverse sends $f$ precisely to $H_f$, since $H_B(h)(f)=fh$. Hence every transformation between the representables comes from exactly one morphism of $\mathcal{C}$. This proves that $H_{\bullet }$ is a full and faithful functor.

An essay arguing against the claim. A good definition can change which mathematical questions are visible. Nevertheless, I would argue that category theory derives its explanatory force from the interaction between definitions and theorems; there is no sound general ordering in which definitions contribute more than theorems.

The strongest case for the contrary view comes from universal properties. A product in a category is characterized by maps into it, rather than by a particular construction of ordered pairs. The same definition applies to sets, groups, and topological spaces. An adjunction goes further: its natural correspondence of arrows puts free constructions, quotient constructions, and several kinds of completion into a common language. Such definitions remove irrelevant choices and expose relationships that would be difficult to recognize from separate constructions.

But a universal-property definition does not supply an object. The definition of a product in a category says what a product would accomplish; an existence theorem says whether the category actually has one. Even uniqueness up to unique isomorphism is a short proof, not an extra clause to be silently supplied by the word “universal”. Given two products, their universal properties produce maps in both directions, and uniqueness forces the two composites to be identities. This elementary theorem makes the definition usable independently of a chosen construction.

The Yoneda lemma illustrates the distinction especially clearly. A representable functor is a definition, but the lemma proves that its natural transformations into any set-valued functor are determined by one element. Its proof evaluates at the identity and reconstructs the whole transformation by functoriality. Consequently the Yoneda embedding is full and faithful: an object's pattern of incoming arrows recovers its morphisms without loss. That is a substantive explanation of why the chosen definition is powerful. Merely calling a functor representable would not establish it.

Similarly, defining a monadic adjunction gives a precise meaning to recovering structured objects as algebras for a monad. It does not decide whether a given forgetful functor is monadic. The precise monadicity theorem translates that difficult classification into a usable test involving adjoint functors, reflected isomorphisms, and specific coequalizers. For compact Hausdorff spaces, the crucial step is proving that a set-split relation is closed. The definition of a monad alone does not contain this topological argument. The theorem connects the algebraic language to an independently meaningful class of spaces.

There is also a danger in praising definitions without hypotheses. A Cartesian closed category has exponential objects, but a category of structured objects need not be cartesian closed merely because underlying sets have function sets. The correct exponential in a functor category generally involves natural transformations out of representable functors, not pointwise function sets. Its existence and universal property require an argument. Theorems also reveal when tempting definitions cannot support the intended construction.

Definitions provide the vocabulary and select the structures worth studying; proofs establish existence, consequences, and limitations. Category theory makes this partnership unusually explicit because its definitions are often expressed through universal properties. Its distinctive achievement is to turn well-chosen definitions into reusable theorems, rather than to make theorems secondary.

An alternative essay arguing for the claim. In category theory, theorems are indispensable, but a carefully chosen definition often performs the greater act of organization. It identifies what many apparently unrelated constructions have in common and makes whole families of proofs possible. In that explanatory sense, definitions can be the subject's most influential contributions.

Consider a universal property. Describing a product in a category as an object representing pairs of incoming arrows replaces several different concrete constructions by one invariant pattern. The corresponding uniqueness proof is important but short; the lasting insight is that the same pattern is the right question in every category. Once the definition is available, it becomes meaningful to ask which functors preserve products, whether the products exist in a new category, and how they interact with other universal constructions.

An adjunction is an even more striking example. The existence of free groups, free modules, and a Stone-Čech compactification can be proved separately. The definition of an adjunction recognizes their common relation to forgetful functors and explains why arrows out of a free object are determined by arrows out of its generators. It also packages the relation as a monad. A large collection of isolated existence results becomes an instance of a shared structure, with reusable consequences about composition and categorical limits.

A valuable definition also has to distinguish structures rather than merely rename them. An abelian category is not just an additive category with categorical kernels and categorical cokernels: normality of monomorphisms and epimorphisms matters. The additive example with truncated primary torsion shows why those clauses belong in the definition. The definition therefore preserves exactly the structure on which theorems about images and exact sequences depend.

This view does not make proofs dispensable. The Yoneda lemma justifies the use of representable functors, and the precise monadicity theorem tests when a proposed algebraic description is valid. Rather, it argues that the best categorical definitions have unusually broad explanatory reach: they select the invariant structures to which those proofs apply. If “matter more” means providing the reusable framework in which many theorems become instances of one idea, category-theoretic definitions have a strong claim to that role.

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:

The Yoneda embedding sends $c$ to the representable presheaf $H_c=\mathcal{C}(-,c)$. On a morphism $f:c\to d$, it sends a map $u:a\to c$ to $fu:a\to d$, giving $H_f:H_c\to H_d$.

The Yoneda lemma states that for every categorical presheaf $P$ there is a bijection, natural in both variables,Its inverse sends $x\in P(c)$ to the transformation $u:a\to c\mapsto P(u)x$. Apply it to $P=H_d$ to obtainUnder this bijection $H_f$ corresponds exactly to $f$, so the map induced by the embedding on each hom-set is bijective. Therefore the Yoneda embedding is full and faithful.

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 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 classifying topos for a coherent theory $\mathbb{T}$ is a Grothendieck topos ${\mathcal{B}}_{\mathbb{T}}$ with a generic model $U$ such that, for every Grothendieck topos $\mathcal{S}$, inverse image gives an equivalencepseudonatural in $\mathcal{S}$. The equivalence includes model homomorphisms and geometric transformations, not merely a bijection between isomorphism classes of set-based models.

Construct the coherent syntactic category ${\mathcal{C}}_{\mathbb{T}}$. Its objects are coherent formulas in finite contexts, modulo provable equivalence, and an arrow is a provably total single-valued coherent relation between their contexts. Composition existentially quantifies the intermediate tuple. Context concatenation, conjunction and equality give finite limits; existential quantification gives stable images; finite disjunction gives stable finite unions. Thus it is a small coherent category, after choosing representatives.

Equip it with the coherent topology $J$: a finite family $C_i\to C$ covers when the union of its images is the whole object, equivalently when the associated finite existential disjunction is provable from the target formula. Pullback stability and closure of covers under composition follow from the corresponding properties of images and unions. SetThe functor $ay:{\mathcal{C}}_{\mathbb{T}}\to {\mathcal{B}}_{\mathbb{T}}$, consisting of the Yoneda embedding followed by sheafification, interprets each sort, function and relation of the syntax and yields the generic model $U$. It preserves finite limits, images and finite unions: syntactic covers become epimorphic families after sheafification, and the syntactic image factorization thus becomes the image factorization of the corresponding arrow. All the axioms consequently hold in $U$.

Here is the classifying argument. A model $M$ in $\mathcal{S}$ interprets each context-formula as a subobject and each functional relation as a map. This gives a functor $F_M:{\mathcal{C}}_{\mathbb{T}}\to \mathcal{S}$ preserving finite limits, images and finite unions, so carrying covers to jointly epimorphic families. Conversely such an interpretation functor recovers exactly a model and all its formula interpretations. Because the source category has finite limits, a finite-limit-preserving functor is flat; cover preservation says that it is $J$-continuous.

For explicitness, the associated inverse image is the flat tensor extensionwhere a set of sections indexes a coproduct and the coend identifies the two actions of every arrow. Flatness makes this extension preserve finite limits. The cover condition makes it identify a presheaf with its sheafification, so it descends to a finite-limit-preserving left adjoint on $J$-sheaves. Its right adjoint sends $N\in \mathcal{S}$ to $C\mapsto {\mathrm{Hom}}_{\mathcal{S}}(F_M(C),N)$; this is a sheaf because matching maps along an interpreted covering family glue uniquely across its jointly epimorphic cover. This is the Diaconescu equivalence for geometric morphisms, with its actual functors displayed.

The resulting geometric inverse image satisfies $f^{\ast }(ayC)\cong F_M(C)$, hence $f^{\ast }U\cong M$. Conversely any inverse image preserves finite limits and colimits, hence images and unions, and its composite with $ay$ is the interpretation functor of $f^{\ast }U$. Since the sheafified representables generate the topos, these constructions recover the geometric morphism up to its unique appropriate isomorphism. Natural transformations of interpretation functors correspond to the model homomorphisms and geometric transformations. This proves the required equivalence and the construction's classifying property.

For the covariant version of the Yoneda embedding, put $Y(A)=\mathcal{C}(A,-)$. A morphism $u:A\to B$ induces the natural transformation $Y(u):Y(B)\to Y(A)$ whose component sends $v:B\to X$ to $vu$. Thus $Y$ is a functor from the opposite category ${\mathcal{C}}^{\mathrm{op}}$ to the functor category $[\mathcal{C},\mathbf{Set}]$. The locally small category hypothesis makes each value a set.

The Yoneda lemma says that, for a functor $F:\mathcal{C}\to \mathbf{Set}$, evaluation at the identity morphism gives a natural bijectionGiven $a\in F(A)$, define ${\theta }_X^a(v)=F(v)(a)$. For $w:X\to X^{\prime }$, the functor law gives $F(w){\theta }_X^a(v)=F(wv)(a)={\theta }_{X^{\prime }}^a(wv)$, proving naturality. Conversely, naturality of $\theta$ at $v:A\to X$ gives ${\theta }_X(v)=F(v){\theta }_A(1_A)$. These two constructions are inverse, because $F(1_A)(a)=a$.

The bijection is natural in both variables. A natural transformation $\beta :F\to H$ sends the element $a$ to ${\beta }_A(a)$, matching postcomposition by $\beta$. For $u:A\to B$, precomposing with $Y(u)$ sends $\theta$ to a transformation from $Y(B)$ and its distinguished element is ${\theta }_B(u)=F(u)(a)$. This is exactly the required dependence on $A$.

Taking $F=Y(B)$ gives $\mathrm{Nat}(Y(A),Y(B))\cong \mathcal{C}(B,A)$. Consequently the covariant Yoneda embedding is full and faithful, with the reversal of arrows accounted for by its opposite category domain.

Use the covariant Yoneda embedding $Y(A)=\mathcal{C}(A,-)$. An arrow $f:B\to A$, viewed as an arrow $A\to B$ in the opposite category, induces precomposition $h\mapsto hf$. Identities and composition are preserved because composition in $\mathcal{C}$ is associative.

The covariant Yoneda lemma is the bijectionIts inverse sends $x\in F(A)$ to ${\alpha }_B(h)=F(h)(x)$. This is a natural transformation: for $k:B\to C$, functoriality gives $F(k){\alpha }_B(h)=F(kh)(x)={\alpha }_C(kh)$. Conversely, naturality of an arbitrary $\alpha$ at $h:A\to B$ gives ${\alpha }_B(h)=F(h){\alpha }_A(1_A)$. Evaluation at the identity morphism therefore makes the two constructions inverse. Their formulas also prove naturality in $F$ and, contravariantly, in $A$.

Taking $F=Y(B)$ identifies natural transformations $Y(A)\to Y(B)$ with $\mathcal{C}(B,A)$. Thus $Y$ is full and faithful, and reflects isomorphisms; two image objects are isomorphic exactly when the original objects are isomorphic. It also carries existing colimits in $\mathcal{C}$ to categorical limits of covariant representable functors: maps out of a colimit are exactly compatible families of maps out of its diagram. Equivalently, this embedding preserves existing categorical limits in ${\mathcal{C}}^{\mathrm{op}}$. The direction matters: the paper uses covariant representables, rather than the more usual contravariant Yoneda embedding.

In a small regular category $\mathcal{C}$, the regular coverage has one-arrow covers: each regular epimorphism $\alpha :B\twoheadrightarrow A$ is a covering family by itself. Identity maps, composites and pullbacks of such arrows are again covers, so this is a basis for a Grothendieck topology. A presheaf is a sheaf precisely when every compatible section over a covering arrow descends uniquely along that arrow.

It is subcanonical. A section of the representable presheaf $yX=\mathcal{C}(-,X)$ over $B$ is a map $g:B\to X$. Its matching condition is $g{\pi }_1=g{\pi }_2$ on the kernel pair $B{\times }_{A}B$. Since a regular epimorphism is the coequalizer of its kernel pair, there is a unique $\bar{g}:A\to X$ with $\bar{g}\alpha =g$. This is exactly the sheaf condition for $yX$.

For a subfunctor $F^{\prime }\subseteq F$ of a regular-coverage sheaf, define local membership byThis is a subfunctor. If $t:C\to A$ and $\alpha$ witnesses membership, pull back $\alpha$ along $t$; the resulting cover of $C$ witnesses membership of $F(t)x$, because $F^{\prime }$ is stable under restriction.

It is a sheaf as well. Let $\beta :B\twoheadrightarrow A$ cover and let $y\in F^{\prime \prime }(B)$ satisfy the kernel-pair matching condition. The sheaf $F$ gives a unique $x\in F(A)$ with $F(\beta )x=y$. Choose a cover $\alpha :C\twoheadrightarrow B$ with $F(\alpha )y\in F^{\prime }(C)$. The composite $\beta \alpha$ is a cover of $A$ and witnesses $x\in F^{\prime \prime }(A)$. Uniqueness comes from $F$. Thus the inclusion $F^{\prime \prime }\hookrightarrow F$ is a mono between sheaves and is closed for the associated local operator.

Moreover, any closed subobject $S\subseteq F$ containing $F^{\prime }$ is itself a sheaf. If $x\in F^{\prime \prime }(A)$, its restriction along a witnessing cover lies in $S(B)$, and the sheaf condition for $S$ descends it to a section in $S(A)$. Its image in $F(A)$ is $x$ by uniqueness. Hence $F^{\prime \prime }$ is the least closed subobject containing $F^{\prime }$, andThis proves the local membership closure for the regular coverage, with a single regular epimorphism as witness.

Suppose $yA$ is the union, in the sheaf topos, of a family of subsheaves $F_i$. The union in presheaves is the pointwise union $F^{\prime }={\bigcup }_i{F}_i$; its closure is the union in sheaves. Thus $1_A\in F^{\prime \prime }(A)$. A witnessing cover $\alpha :B\twoheadrightarrow A$ belongs to $F_i(B)$ for one index $i$. The two restrictions of $\alpha$ to its kernel pair agree. Since $F_i$ is a subsheaf, this matching section descends in $F_i$ to $1_A\in F_i(A)$. Every map $t:C\to A$ is the restriction of $1_A$ along $t$, so $F_i=yA$. Therefore every representable sheaf is irreducible, even with respect to arbitrary unions. There are no empty covering families in this coverage, and $1_A$ also shows that the representable cannot be initial.

Finally, in the regular syntactic category of a regular theory, the context formula $\varphi$ defines an object $A$. Each formula $\varphi \wedge {\psi }_i$ defines a mono $A_i\hookrightarrow A$, and the associated representable subsheaf is its interpretation inside $yA$ in the generic model. A derivation of the coherent disjunction says that these finitely many subsheaves have union $yA$. Irreducibility gives $y{A}_i=yA$ for some $i$. The Yoneda embedding is full and faithful, since the coverage is subcanonical, and therefore reflects this isomorphism. Hence $A_i\hookrightarrow A$ is invertible in the syntactic category: $\varphi$ entails ${\psi }_i$. ThusThe disjunction is an outer coherent conclusion; the theory and all constituent formulas are regular. This disjunction property of regular theories follows from single-arrow descent, rather than from ordinary first-order compactness.

The key fact is that the extra left adjoint $f_{!}$ sends each representable $yC$ to an indecomposable projective object. Let ${\coprod }_i{B}_i\twoheadrightarrow f_{!}yC$ be epic. The inverse image $f^{\ast }$ preserves epimorphisms and coproducts, because it is a left adjoint between toposes. Apply it and lift the unit $\eta :yC\to f^{\ast }{f}_{!}yC$ through the resulting epimorphism, using projectivity of $yC$. A map from $yC$ to a coproduct selects one component, by evaluation at $C$ and the Yoneda lemma. Thus for some $i$ we obtain $t:yC\to f^{\ast }{B}_i$ with $f^{\ast }(B_i\to f_{!}yC)t=\eta$.

Transpose $t$ across $f_{!}⊣f^{\ast }$ to $\bar{t}:f_{!}yC\to B_i$. The displayed equality says that its composite back to $f_{!}yC$ is the identity. This proves the required indecomposable-projective property.

Since idempotents split in $\mathcal{D}$, part (ii) supplies objects $FC\in \mathcal{D}$ and isomorphisms $f_{!}yC\cong y(FC)$. Full faithfulness of the Yoneda embedding transports the action of $f_{!}$ on representable arrows to a functor $F:\mathcal{C}\to \mathcal{D}$. For $P\in \hat{\mathcal{D}}$,These identifications are natural in both $C$ and $P$. HenceIts right adjoint is consequently the right Kan extension from part (i), uniquely up to natural isomorphism. Thus the entire geometric morphism is induced by $F$.