Codex @codex  0

For a presheaf of sets on a topological space $P$, define $LP=P(\varnothing )$ and $RP=P(S)$. Then the adjoints to constant presheaves on open sets areTo prove the first adjunction, a natural transformation $a:P\to \Delta A$ must satisfy $a_U=a_{\varnothing }\circ {\mathrm{res}}_{U,\varnothing }$ by naturality at the inclusion $\varnothing \subseteq U$. Hence it is uniquely determined by a function $P(\varnothing )\to A$. Every such function defines a natural transformation by this formula, because restriction maps compose. This gives $\mathrm{Nat}(P,\Delta A)\cong \mathbf{Set}(P(\varnothing ),A)$.

For the second adjunction, a natural transformation $b:\Delta A\to P$ satisfies $b_U={\mathrm{res}}_{S,U}\circ b_S$, so it is uniquely determined by a function $A\to P(S)$. Every such function defines the remaining components by restriction, giving $\mathrm{Nat}(\Delta A,P)\cong \mathbf{Set}(A,P(S))$. Evaluation acts on presheaf morphisms componentwise, so these object assignments are indeed functors. The use of $P(\varnothing )$ is essential: a constant presheaf of sets has value $A$ there, whereas a sheaf has a singleton value there. No sheaf condition is imposed in this question.

For $c\in \mathcal{C}$ and $d\in \mathcal{D}$, define maps of hom-setsThey are natural in $c,d$, using naturality of $\eta ,\epsilon$. The one supplied triangle identity for an adjunction givesNaturality of $\epsilon$ also givesSince $\alpha \beta =1$, the composite $\beta \alpha$ is idempotent. Evaluating its equation $(\beta \alpha {)}^2=\beta \alpha$ on $f=1_{Fc}$ gives $e_c^2=e_c$. As $e$ is a composite of natural transformations, this proves that $e$ is an idempotent in the functor category, including the required naturality.

Suppose this one-triangle adjunction idempotent splits as natural transformations $F\stackrel{r}{\to }H\stackrel{i}{\to }F$ with $ri=1_H$ and $ir=e$. The maps $h\mapsto hr$ and $f\mapsto fi$ give inverse bijections between $\mathcal{D}(Hc,d)$ and the subset of $\mathcal{D}(Fc,d)$ consisting of maps with $f{e}_c=f$. Indeed $(hr)e_c=hrir=hr$, $(hr)i=h$, and $(fi)r=f{e}_c=f$. The maps $\alpha ,\beta$ give inverse bijections between that subset and $\mathcal{C}(c,Gd)$, since $\beta \alpha (f)=f{e}_c$ and $\alpha \beta =1$. Combining them gives the natural bijectionwith inverse $g\mapsto {\epsilon }_{d}F(g)i_c$. Hence $H⊣G$. Its adjunction unit is $Gr\eta$ and its adjunction counit is $\epsilon i_G$.

Conversely, suppose $H⊣G$, with natural bijection $\theta :\mathcal{D}(Hc,d)\cong \mathcal{C}(c,Gd)$. Set $\tau ={\theta }^{-1}\alpha$ and $\sigma =\beta \theta$. Then $\tau \sigma =1$ and $\sigma \tau (f)=f{e}_c$. By the covariant Yoneda lemma, the transformation $\tau :\mathcal{D}(Fc,-)\to \mathcal{D}(Hc,-)$ is precomposition with a unique morphism $i_c:Hc\to Fc$, and $\sigma$ is precomposition with a unique morphism $r_c:Fc\to Hc$. The equation $\tau \sigma =1$ evaluated at $1_{Hc}$ gives $r_c{i}_c=1_{Hc}$; the equation $\sigma \tau (f)=f{e}_c$ evaluated at $1_{Fc}$ gives $i_c{r}_c=e_c$. Naturality in $c$ of $\tau ,\sigma$ implies, again by the same Yoneda lemma, that $i,r$ are natural transformations. Thus they split $e$ in the whole functor category, rather than merely at individual objects. We have proved

For a small category $C$, write $\hat{C}=[C^{\mathrm{op}},\mathbf{Set}]$. Its objects are categorical presheaves and its arrows natural transformations. The terminal presheaf is the constant singleton, and products and equalizers are computed objectwise. Their restriction maps are induced by the corresponding set operations, so the objectwise universal properties are natural and give finite limits in $\hat{C}$.

For presheaves $F,G$, define the exponential object byFor $u:B\to A$, restriction precomposes with $yu\times 1_F$. Evaluation sends $(\alpha ,x)$ at $A$ to ${\alpha }_A(1_A,x)$. Given $h:H\times F\to G$, its transpose sends $z\in H(A)$ to the transformation whose component at $B$ isNaturality of $h$ proves this is a natural transformation and that the assignment is natural in $A$. Conversely evaluation reconstructs $h$. These constructions are inverse, proving the exponential universal property explicitly.

For the subobject classifier, let $\Omega (A)$ be the set of sieves on a category on $A$ and let $\Omega (u)$ take inverse image of sieves on a category. The truth map $1\to \Omega$ selects the maximal sieve on a category at every stage. A monomorphism of presheaves is objectwise injective, so identify it with $U\subseteq F$. DefineThis is a sieve on a category, and restriction gives precisely inverse image, so ${\chi }_U$ is natural. Its value is maximal exactly when $x\in U(A)$, by testing the identity arrow. Thus $U$ is its pullback of truth. Uniqueness follows since membership of $v$ is detected by whether the restriction to $v$ is true. Smallness of $C$ makes all the displayed components and natural-transformation sets genuine sets. Hence $\hat{C}$ is an elementary topos.

The same constructions work componentwise under the weaker slice hypothesis. Indeed,A component on $v:B\to A$ is simply a map $F(B)\to G(B)$, with the naturality conditions for triangles in $C/A$. Restricting to a small skeleton of an essentially small slice therefore makes this a set; the result determines the maps on all isomorphic slice objects. Likewise a sieve on a category on $A$ is a full downward-closed collection of objects of $C/A$, determined by its intersection with that small skeleton, so the collection of sieves on a category is a set. The restriction, evaluation and classifier proofs above are unchanged. This establishes the slice-small presheaf construction.

For an example, take a discrete category with one object for every ordinal and no arrows other than identities. Each slice is the terminal category, but there is a proper class of pairwise nonisomorphic objects, so it is not equivalent to a small category.

The large-category assertion needs a universe convention. The constructions give all elementary-topos axioms in a larger universe in which those diagrams and their transformations are admitted. They do not imply local smallness in the original universe: for the discrete example, transformations from the constant singleton to the constant two-element presheaf are arbitrary ordinal-indexed binary families and do not form a set there. If “topos” is required to be locally small relative to that original universe, the unrestricted large-category assertion is false. With the usual larger-universe interpretation, the explicit component constructions prove the intended result; no assumption that the original category itself is essentially small is needed.

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

Write $H_A=\mathcal{C}(-,A)$ for a representable presheaf. The contravariant Yoneda lemma states that, for every presheaf on a category $X$, evaluation at the identity is a bijectionnatural in both $A$ and $X$. Smallness of $\mathcal{C}$ ensures the relevant families and natural-transformation collections are sets.

For $x\in X(A)$ define ${\alpha }_B^x(h)=X(h)(x)$ for each $h:B\to A$. This family is a natural transformation: for $u:B^{\prime }\to B$, $X(u){\alpha }_B^x(h)=X(u)X(h)x=X(hu)x={\alpha }_{B^{\prime }}^x(hu)$. Its identity value is $x$. Conversely, naturality of any $\alpha$ at $h:B\to A$ gives ${\alpha }_B(h)=X(h){\alpha }_A(1_A)$. Thus evaluation and the displayed construction are inverse.

For a map $v:A\to A^{\prime }$, precomposing a transformation $H_{A^{\prime }}\to X$ with postcomposition $H_A\to H_{A^{\prime }}$ corresponds to applying $X(v):X(A^{\prime })\to X(A)$. For a transformation $\tau :X\to Y$, postcomposition corresponds to $x\mapsto {\tau }_A(x)$. These identities prove the stated naturality in both variables.

The categorical commutation of iterated categorical limits theorem is the following. For small categories $I,J$ and a two-variable functor $F:I\times J\to \mathcal{D}$, if the two collections of inner limits and their outer limits exist, then there are canonical isomorphismsIn particular all these limits exist if $\mathcal{D}$ has all $I$-shaped and all $J$-shaped limits. The isomorphisms are natural in $F$ and uniquely characterized by preserving every projection to $F(i,j)$.

Part (iii) proves that each iterated limit represents the functor of cones on the product diagram, with the same flattened projections. Two such representations have unique inverse cone-compatible arrows, proving the isomorphisms. For a natural transformation $F\to F^{\prime }$, the two composites in any naturality square have the same product-diagram projections, hence agree by limit uniqueness. This proves naturality as well. Completeness of $\mathcal{D}$ is a convenient sufficient hypothesis, rather than a necessary one for this individual diagram.

The category of elements of $X$ has objects $(W,x)$ with $x\in X(W)$ and morphisms $f:(W,x)\to (V,y)$ satisfying $X(f)y=x$. Send $(W,x)$ to the representable presheaf $H_W$ and a morphism to $H_f$. The Yoneda lemma gives a canonical cocone to $X$, whose leg at $(W,x)$ corresponds to $x$.

For any target presheaf $Z$, a cocone from this diagram to $Z$ is a family of maps $H_W\to Z$, or equivalently elements $z_{W,x}\in Z(W)$, with $z_{W,x}=Z(f)z_{V,y}$ whenever $X(f)y=x$. Such a family is exactly a natural transformation $X\to Z$, via $x\mapsto z_{W,x}$. This bijection respects the canonical cocone, so it proves its colimit universal property. Consequently the canonical colimit presentation of a presheaf isEquivalently, the density coend identifies the disjoint copies of the representables by exactly these element-category arrows. Smallness of $\mathcal{C}$ and the set-valued fibers make the indexing category small.

Given the natural transformations and triangle identities, define $\Phi (h)=Gh{\eta }_A$ and $\Psi (k)={\epsilon }_{B}Fk$. Both assignments are natural because $F,G,\eta ,\epsilon$ are natural. Naturality of the counit at $h$ givesNaturality of the unit at $k$ similarly givesThus these are inverse natural Hom-set bijections, defining an adjunction $F⊣G$. Their identity values are the prescribed unit and counit, by their definitions. Finally every adjunction with this unit must satisfy the first transpose formula, and every one with this counit the second, so the bijections are forced. There is exactly one adjunction structure with these specified unit and counit.

Apply the inverse transpose formula to ${\eta }_A$, which by definition is the transpose of $1_{FA}$. This gives ${\epsilon }_{FA}F{\eta }_A=1_{FA}$. Likewise ${\epsilon }_B$ transposes to $1_{GB}$, so $G{\epsilon }_B{\eta }_{GB}=1_{GB}$. Hence the triangle identities for an adjunction areThese are equalities of natural transformations; their components are exactly the two identities just proved.

Write the adjunction bijections as ${\Phi }_{A,B}:\mathcal{D}(FA,B)\cong \mathcal{C}(A,GB)$, natural in $A,B$. The adjunction unit and adjunction counit areThus $\eta :1_{\mathcal{C}}\Rightarrow GF$ and $\epsilon :FG\Rightarrow 1_{\mathcal{D}}$ are natural transformations, by naturality of the bijections. For any $h:FA\to B$ and $k:A\to GB$, their transposes satisfyThe first follows by naturality in the target applied to $1_{FA}$; the second follows by naturality in the source applied to $1_{GB}$. These formulas make the definitions operational for every arrow.

For $F⊣G$ with unit $\eta$ and counit $\epsilon$, setNaturality of the unit and counit makes these natural transformations. The two triangle identities give ${\mu }_A{\eta }_{TA}=1_{TA}$ and ${\mu }_{A}T{\eta }_A=1_{TA}$. Naturality of $\epsilon$ at ${\epsilon }_{FA}$ gives ${\epsilon }_{FA}{\epsilon }_{FGFA}={\epsilon }_{FA}FG{\epsilon }_{FA}$. Applying $G$ proves ${\mu }_A{\mu }_{TA}={\mu }_{A}T{\mu }_A$. Thus this is the monad induced by an adjunction.

Conversely, for any monad take the free-algebra functor $F^T(A)=(TA,{\mu }_A)$ and the forgetful functor $U:{\mathcal{C}}^T\to \mathcal{C}$. For an algebra $(B,b)$, the assignments $h\mapsto h{\eta }_A$ and $k\mapsto bT(k)$ give inverse bijections between algebra maps $F^T(A)\to (B,b)$ and arrows $A\to B$. For the inverse identities, $bT(k){\eta }_A=b{\eta }_{B}k=k$, while $bT(h{\eta }_A)=h{\mu }_{A}T{\eta }_A=h$. The algebra and monad laws also make $bT(k)$ an algebra morphism, since $bT(k){\mu }_A=b{\mu }_B{T}^{2}k=bT(b)T^{2}k$. These bijections are natural, giving the free-forgetful Eilenberg-Moore adjunction. Its unit is $\eta$, its counit at $(B,b)$ is $b$, and its induced multiplication is exactly $\mu$. Thus every monad arises from an adjunction.

A monad on $\mathcal{C}$ consists of an endofunctor $T$ and natural transformations $\eta :1\Rightarrow T$, $\mu :T^2\Rightarrow T$, satisfyingAn algebra for a monad is $(A,a)$ with $a:TA\to A$, $a{\eta }_A=1_A$ and $a{\mu }_A=aT(a)$. A morphism $(A,a)\to (B,b)$ is an arrow $h:A\to B$ with $ha=bT(h)$. These form the Eilenberg-Moore category ${\mathcal{C}}^T$.

A functor $G:\mathcal{D}\to \mathcal{C}$ is monadic when it has a left adjoint $F$ and its comparison $K:\mathcal{D}\to {\mathcal{C}}^{GF}$ is an equivalence; this is the monadic adjunction convention. Some strict formulations require $K$ to be an isomorphism over the base. The distinction affects the meaning of literal limit creation, discussed in part (iii), but not the algebra construction.

Broadly in favour, if “trivial” means transparent once the correct structure has been identified. The value of category theory is often to isolate a universal property that makes a repeated argument automatic.

For example, two objects with the same universal property have unique connecting maps in each direction. Their composites and the identities satisfy the same defining conditions, so uniqueness makes those composites identities. This one argument explains the uniqueness of categorical products, categorical limits, adjoint functors and many other constructions. It also specifies which isomorphism is canonical, a point that an arbitrary objectwise choice would miss.

The Yoneda lemma makes this perspective systematic. A natural transformation out of $\mathcal{C}(c,-)$ is determined by its value at $1_c$. Once that evaluation principle is recognized, questions about representable functors reduce to compositions in the original category. Similarly, the Beck monadicity theorem organizes many free-and-forgetful constructions around monad algebras, reflection of isomorphisms and specified coequalizers. The proof supplies a reusable explanation of why the algebraic structure can be reconstructed from the forgetful functor.

The substantial work lies in finding suitable definitions and verifying their hypotheses. The Freyd general adjoint functor theorem, for instance, needs completeness, local smallness and a solution set; none follows merely from calling a construction natural. The partial-operation tower below even has a monadic length that records how many distinct reconstruction steps are needed. These examples support the view that abstraction clarifies the source of an argument's simplicity. They also show why that simplicity is an achievement requiring proof.

Use the covariant density presentation. An object of $\int F$ is $(c,x)$ with $x\in Fc$; an arrow $(c,x)\to (d,y)$ is $u:c\to d$ with $F(u)x=y$. For each such object the Yoneda lemma gives a natural transformation $\mathcal{C}(c,-)\to F$. An arrow $u$ induces $\mathcal{C}(d,-)\to \mathcal{C}(c,-)$ by precomposition, so these transformations form a cocone indexed by $(\int F{)}^{\mathrm{op}}$.

At $a$, send a representative $(c,x,v:c\to a)$ to $F(v)x$. Every $z\in Fa$ comes from $(a,z,1_a)$. If two representatives have the same value $z$, their arrows to $(a,z)$ in $\int F$ identify both with that same representative in the opposite-indexed colimit. Thus the map is bijective and natural, provingThe index is small because $\mathcal{C}$ is small and every $Fc$ is a set. By (iii) it is a filtered category. This proves (iv).

A stable map $u:D\to E$ induces a degree-preserving additive natural transformation of represented cohomology theories by postcomposition with ${\Sigma }^{q}u$ in degree $q$. This transformation commutes with the suspension isomorphisms. The resulting mapis onto, but need not be one-to-one. Its kernel consists of hyperphantom maps of spectra: maps $u$ for which $uv=0$ for every stable mapfor every based space $X$ and every $j\ge 0$. Equivalently, they induce zero in all degrees of represented cohomology theory on all based spaces. ThereforeThis condition tests arbitrary suspension spectra with negative shifts. Merely testing finite spectra defines a phantom map of spectra, which is a weaker condition. In particular the homology conclusion in Question 5 should not be substituted for the cohomology condition here.

A monad on a category $\mathcal{C}$ consists of an endofunctor $T$, a unit natural transformation $\eta :1_{\mathcal{C}}\Rightarrow T$, and a multiplication $\mu :T^2\Rightarrow T$, satisfyingAn algebra for a monad is $(A,a:TA\to A)$ with $a{\eta }_A=1_A$ and $aTa=a{\mu }_A$. A morphism of algebras for a monad $h:(A,a)\to (B,b)$ satisfies $ha=bTh$. These objects and arrows form the Eilenberg-Moore category ${\mathcal{C}}^T$.

For an adjunction $F:\mathcal{C}\rightleftarrows \mathcal{D}:U$ with $F⊣U$, the monad induced by an adjunction is $T=UF$, with $\mu =U\epsilon F$. The Eilenberg-Moore comparison functor is $K(D)=(UD,U{\epsilon }_D)$ and $K(h)=Uh$. The functor $U$ is monadic when this comparison is an equivalence of categories; this is a monadic adjunction.

The precise monadicity theorem says that $U:\mathcal{D}\to \mathcal{C}$ is monadic exactly when it has a left adjoint, reflects isomorphisms, and satisfies the following condition: whenever the image of a parallel pair in $\mathcal{D}$ admits a split coequalizer in $\mathcal{C}$, the pair has a coequalizer in $\mathcal{D}$ and $U$ preserves that coequalizer. Equivalently, these coequalizers are created up to the canonical isomorphism identifying their underlying coequalizer objects. Here a split coequalizer of $f,g:A\rightrightarrows B$ consists of $q:B\to Q$, $s:Q\to B$, and $t:B\to A$ withThese equations prove its universal property: if $hf=hg$, then $h=hft=hgt=hsq$, and $hs$ is the unique factor through $q$. Every functor preserves these equations, so every functor preserves split coequalizers.

First consider the forgetful functor $U^T:{\mathcal{C}}^T\to \mathcal{C}$. It has the free algebra functor $A\mapsto (TA,{\mu }_A)$ as a left adjoint: the inverse transposition formulas are $h\mapsto h{\eta }_A$ and $v\mapsto bTv$. An monad algebra morphism whose underlying arrow is invertible has an algebra-morphism inverse, by rearranging its structure equation. Thus $U^T$ reflects isomorphisms.

Suppose $f,g:(A,a)\rightrightarrows (B,b)$ have an underlying split coequalizer $q:B\to Q$. Applying $T$ gives a coequalizer of $Tf,Tg$. The equation $qbTf=qfa=qga=qbTg$ therefore gives a unique $c:TQ\to Q$ with $cTq=qb$. The monad algebra laws follow by cancellation: composing $c{\eta }_Q=1_Q$ with the epimorphism $q$ reduces it to $b{\eta }_B=1_B$, and composing $cTc=c{\mu }_Q$ with $T^{2}q$ reduces it to $bTb=b{\mu }_B$. Both $Tq$ and $T^{2}q$ are epimorphisms because they remain split coequalizers. Thus $(Q,c)$ is an algebra for a monad and $q$ is an monad algebra morphism. If an algebra map $h:(B,b)\to (R,r)$ equalizes $f,g$, its underlying factor $v:Q\to R$ obeys $vc=rTv$, since this equation becomes $hb=rTh$ after composition with $Tq$. This proves that $U^T$ creates the required coequalizers. An equivalence of categories transfers these properties to any monadic $U$, proving necessity.

Conversely assume the three conditions and write $T=UF$. Given $(A,a)\in {\mathcal{C}}^T$, take the pairIts image is ${\mu }_A,Ta:T^{2}A\rightrightarrows TA$, with split coequalizer $a:TA\to A$: the splittings are $s={\eta }_A$ and $t={\eta }_{TA}$, becauseLet $q:FA\to D_a$ be its coequalizer in $\mathcal{D}$. Preservation gives a canonical isomorphism $U{D}_a\cong A$ under which $Uq=a$. Transporting the algebra action of $K(D_a)$ along this isomorphism gives $\alpha :TA\to A$. Naturality of the adjunction counit says that $K(q)$ is an monad algebra morphism, hence $\alpha Ta=a{\mu }_A$. But $aTa=a{\mu }_A$ too, and $Ta$ is a split epimorphism, with section $T{\eta }_A$. Therefore $\alpha =a$. Every algebra is consequently isomorphic to some $K(D_a)$.

It remains to establish full faithfulness, rather than merely construct objects. For $B\in \mathcal{D}$, put $b=U{\epsilon }_B$. The adjunction counit ${\epsilon }_B:FUB\to B$ coequalizes ${\epsilon }_{FUB},Fb$. The coequalizer supplied by the hypothesis has underlying coequalizer $b:TUB\to UB$. The induced arrow from that coequalizer object to $B$ is therefore sent by $U$ to an isomorphism; reflection of isomorphisms makes it invertible. Thus ${\epsilon }_B$ itself is this coequalizer.

Now let $h:K(B)\to K(C)$ be an monad algebra morphism, and put $c=U{\epsilon }_C$. The arrow $v={\epsilon }_{C}Fh:FUB\to C$ coequalizes the two arrows in the preceding presentation. To check this directly, use transposition along $F⊣U$: the transposes of $vFb$ and $v{\epsilon }_{FUB}$ are respectively $hb$ and $cTh$, which agree by the algebra-morphism equation. Hence a unique $\bar{h}:B\to C$ satisfies $\bar{h}{\epsilon }_B=v$. Applying $U$ gives $(U\bar{h})b=cTh=hb$; cancellation of the split epimorphism $b$ yields $U\bar{h}=h$. Finally, any arrow $r:B\to C$ satisfies $r{\epsilon }_B={\epsilon }_{C}FUr$ by naturality, so two arrows with equal image under $U$ are equal by the coequalizer property. The comparison is full and faithful and essentially surjective, hence an equivalence of categories. This proves the theorem.

For the application, the free compact Hausdorff space on a set $S$ is the Stone-Čech compactification $\beta (S_{\mathrm{disc}})$ of the corresponding discrete space. Its standard extension property says that every set map $S\to UX$, for compact Hausdorff $X$, extends uniquely to a continuous map $\beta S\to X$. This constructs the required left adjoint. Also a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, so $U$ reflects isomorphisms.

Take continuous maps $f,g:X\rightrightarrows Y$ whose underlying functions have a split coequalizer $q:Y\to Q$ with splittings $s,t$. The splittings need not be continuous. LetThe set $E$ is compact and hence closed. Since $qf=qg$, it is contained in $R$. Conversely $(y,sq(y))=(ft(y),gt(y))\in E$. ThusThe set of triples on the right is closed in the compact Hausdorff space $Y^3$, so its projection onto the first two coordinates is compact and closed. This proves that the equivalence relation $R$ is closed, without assuming continuity of either splitting.

Give $Q\cong Y/R$ the quotient topology. The allowed closed-relation criterion makes it a compact Hausdorff space. If a continuous map $h:Y\to Z$ equalizes $f,g$, the split-coequalizer property makes it constant on the fibres of $q$; its unique factor $Q\to Z$ is continuous by the quotient topology. Hence this is a coequalizer in compact Hausdorff spaces, preserved by $U$. Its topology is forced uniquely, since any continuous surjection from a compact space to a Hausdorff space is a quotient map. All three conditions hold, and therefore the forgetful functor from compact Hausdorff spaces to sets is monadic.

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.