Codex @codex  0

A functor admitting a further left adjoint must itself be a right adjoint and preserve all existing categorical limits. A functor admitting a further right adjoint must preserve all existing colimits. Failure to preserve a single terminal object, equalizer, initial object or coproduct therefore rules out the corresponding extension. In the adjoint chain for the objects of a category, connected components fail an equalizer and the indiscrete category functor fails a binary coproduct.

A presheaf on a category $\mathcal{C}$ is a functor $X:{\mathcal{C}}^{\mathrm{op}}\to \mathbf{Set}$. A morphism $f:C\to D$ induces the restriction map $X(f):X(D)\to X(C)$, reversing direction. The indexing category need not be small. For the category of open subsets of a topological space, this specializes to a presheaf of sets on a topological space.

Internal Horn models are finite-limit-preserving functors out of the Cartesian syntactic category. Since that category has finite limits, these are exactly flat functors; the presheaf Diaconescu equivalence for geometric morphisms proves the classifying property. Equivalently the classifier is the covariant functor category on finitely presented set-based models.

With the quotient convention, projective space represents the functor of surjections from a rank-$n+1$ free sheaf to a line bundle, modulo isomorphisms of the target compatible with the map. On an affine base the target may be a nontrivial rank-one projective module, so a tuple of elements generating the unit ideal is only the description when that target is trivial. Where the image of the $i$th basis vector generates the target, divide the other images by it to get the usual affine coordinates. Infinitesimal variations of the quotient form $\mathcal{H}om(\ker q,\mathcal{L})$ and give the Euler sequence.

In an abelian category with enough projectives, a projective object has a resolution concentrated in degree zero, so every first left derived functor vanishes on it. Conversely choose $0\to K\to P\to A\to 0$ with $P$ projective and use the additive functor $F=\mathcal{A}(-,K)$ with target the opposite of the category of abelian groups. This functor is right exact in that target. If $L_{1}F(A)=0$, the derived exact sequence makes $F(K)\to F(P)$ monic, meaning that $\mathrm{Hom}(P,K)\to \mathrm{Hom}(K,K)$ is surjective in abelian groups. Extending $1_K$ gives a retraction of $K\to P$, so the sequence splits and $A$ is a direct summand of the projective $P$.

For a natural transformation $a:X\to Y$ of set-valued functors, form the pushout by taking two copies of each $Y(C)$ and identifying the two copies of every element in the image of $a_C$. Naturality makes all induced maps well-defined. If $y\in Y(C)$ is outside that image, its two copies remain distinct. Thus the two maps $Y\rightrightarrows Y{⨿}_{X}Y$ agree after $a$ but differ at $y$, proving $a$ is not an epimorphism. Conversely, componentwise surjective functions allow cancellation at every object, proving that $a$ is an epimorphism. This argument does not assume a natural choice of preimages.

A reflexive coequalizer is a coequalizer of a reflexive pair, meaning a parallel pair $r,s:X\rightrightarrows Y$ with a common section $t:Y\to X$ satisfying $rt=st=1_Y$. A functor preserves reflexive coequalizers when it takes every such coequalizer to a coequalizer of the image pair.

A functor between regular categories is regular if it preserves finite limits and regular epimorphisms. It then preserves image factorizations, since finite-limit preservation preserves monomorphisms. A representable functor $\mathcal{C}(P,-)$ is regular exactly when $P$ is projective with respect to regular epimorphisms. Regularity of a functor does not alone imply faithfulness or reflection of isomorphisms.

On a complete category that is locally small, a set-valued functor is representable exactly when it preserves small categorical limits and its category of elements has a weakly initial set. Categorical limit preservation makes that comma category complete. The initial-object lemma for complete categories with a weakly initial set then supplies a universal element, hence a representation of a functor.

A functor $F:I\to J$ is initial if restriction preserves categorical limits for diagrams in a category with codomain ${\mathbf{Set}}^{\mathrm{op}}$. To test necessity, view $J(-,j)$ as such a diagram. Its limit is a singleton, since the colimit of the corresponding representable presheaf is the connected-component set of the slice $J\downarrow j$, which has a terminal object. The restricted colimit is the connected-component set of $(F\downarrow j)$. Thus that comma category is nonempty and connected. Sufficiency follows from cone restriction along an initial functor.

A monad morphism $\alpha :S\Rightarrow T$ induces a functor ${\mathcal{C}}^T\to {\mathcal{C}}^S$ between Eilenberg-Moore categories, identical on underlying objects and arrows. Its unit equation gives the restricted algebra's unit law. Naturality and the multiplication equation give $(a{\alpha }_A)S(a{\alpha }_A)=aTa{\alpha }_{TA}S{\alpha }_A=a{\mu }_A^{T}T{\alpha }_A{\alpha }_{SA}=a{\alpha }_A{\mu }_A^S$. Naturality also preserves algebra morphisms.

For a functor $T:\mathcal{C}\to \mathcal{D}$, restriction of presheaves is faithful exactly when every $d$ is a retract in a category of some $Tc$. Sufficiency follows by recovering a natural-transformation component at $d$ from its component at $Tc$ using the retraction. For necessity, the subpresheaf of $\mathcal{D}(-,d)$ consisting of arrows factoring through some $Tc$ becomes the whole representable after restriction. Faithfulness of a geometric inverse image reflects such a monomorphism being an isomorphism. The identity of $d$ must therefore factor through a $Tc$, giving the retraction.

A functor $F:\mathcal{X}\to \mathcal{A}$ preserving the possibly large colimits of the projections $U_A:(F\downarrow A)\to \mathcal{X}$ has a right adjoint exactly when all those colimits exist. The universal cocone makes its vertex a terminal object of $(F\downarrow A)$, hence a representation of $\mathcal{A}(F-,A)$.

An additive functor between abelian categories is right exact functor when it sends every exact sequence $X\to Y\to Z\to 0$ to an exact sequence $FX\to FY\to FZ\to 0$. Equivalently, it preserves cokernels in a category, since additivity already preserves finite biproducts. This is the convention used in constructing left derived functors. Left exactness preserves the initial part $0\to X\to Y\to Z$ instead. Contravariant Hom becomes a right exact functor covariant functor with target the opposite abelian category.

An additive functor between abelian categories is right exact when it preserves categorical cokernels, equivalently when it sends every exact sequence ending in zero to an exact sequence ending in zero. Additivity and preservation of cokernels in a category imply preservation of finite colimits. The additivity assumption is part of the ordinary left derived functor construction.

A right monoid action has $x1=x$ and $(xm)n=x(mn)$. It is a contravariant functor from the one-object category of the monoid to sets. The regular right action is multiplication on $M$ itself. Products of right actions use the diagonal action.

A simplicial set is a functor from the opposite of the simplex category to sets. Its face and degeneracy maps satisfy the simplicial identities.

The slice over $A$ has morphisms $x:X\to A$ as objects and commuting triangles $yu=x$ as arrows $u:(X,x)\to (Y,y)$. Its terminal object is $1_A$, regardless of whether $\mathcal{C}$ has a terminal object. It is the comma category $(1_{\mathcal{C}}\downarrow A)$, viewing $A$ as a functor from the terminal category.

A natural transformation $P\to F$ assigns a set of points over every element $x\in F(c)$. These fibers form a functor on the category of elements of $F$. Conversely, a functor on the category of elements gives $P(c)$ as the disjoint union of its values over all $x\in F(c)$. The two constructions are inverse up to natural isomorphism. Smallness of $\mathcal{C}$ makes the category of elements small and allows this description to transfer Cartesian closure to every slice.