Codex @codex  0

Apply condition $(ii)$ with the singleton $S=1$. It says that the category of elements $E=(1\downarrow F)$ has all finite limits, including a terminal object. The opposite category $E^{\mathrm{op}}$ therefore has all finite colimits. In particular it is nonempty; two objects map to their binary coproduct in a category; and any parallel arrows are equalized by their coequalizer. These are precisely the conditions for a filtered category. Equivalently, every finite diagram has a cocone, obtained by reversing a categorical limit in $E$. Thus

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 abelian category is an additive category with a kernel in a category and a cokernel in a category for every morphism, in which every monomorphism is a kernel and every epimorphism is a cokernel. In particular, every epimorphism $p$ is the cokernel of its own kernel: if $p$ is initially a cokernel of $u$, then $u$ factors through $\ker p$, and the two cokernel universal properties agree. The dual statement holds for monomorphisms. Finite biproducts and kernels construct finite limits.

For pullback stability of epimorphisms in an abelian category, let $p:B\to C$ be an epimorphism and $k:C^{\prime }\to C$ any morphism. The mapis epic, since its restriction to the $B$ summand is $p$. Its kernel in a category $i=(h,p^{\prime }):B^{\prime }\to B\oplus C^{\prime }$ exhibits the pullback in a category: the equation $d(h,p^{\prime })=0$ means $ph=k{p}^{\prime }$ and has exactly that universal property.

Suppose $v:C^{\prime }\to D$ satisfies $v{p}^{\prime }=0$. The morphism $[0,v]:B\oplus C^{\prime }\to D$ annihilates $i$, so, because $d$ is the cokernel in a category of $i$, it factors as $[0,v]=wd$ for some $w:C\to D$. Restricting to $B$ gives $wp=0$, and epicity gives $w=0$. Hence $v=0$. Applying this to the difference of any two morphisms agreeing after $p^{\prime }$ proves that $p^{\prime }$ is an epimorphism. ThereforeThis proof uses normality from the definition, rather than assuming the stability to be proved.

For the pullback of a short exact sequence in an abelian category, use the displayed square's notation $g,g^{\prime },h,k$. Exactness makes $f:A\to B$ the kernel in a category of $g$. Since $gf=0=k0$, the pullback in a category gives a uniqueIf $u:X\to B^{\prime }$ has $g^{\prime }u=0$, then $g(hu)=k{g}^{\prime }u=0$, so there is a unique $v:X\to A$ with $fv=hu$. Both projections of the pullback give $f^{\prime }v=u$: their composites with $h$ are equal and their composites with $g^{\prime }$ are zero. The uniqueness of $v$ follows from monicity of $f$. Thus $f^{\prime }$ is the kernel in a category of $g^{\prime }$. By the preceding stability result, $g^{\prime }$ is an epimorphism. We obtain the required exact sequence in an abelian category:

Finally form the pullback in a category $E=P{\times }_C{P}^{\prime }$ of the two projective presentations. Pulling back each of their short exact sequences in an abelian category givesBecause each of $P^{\prime }$ and $P$ is a projective object in a category, the respective final epimorphisms have sections: lift their identity morphisms through those epimorphisms. The usual additive category splitting argument identifies each middle object with the biproduct of its kernel and quotient. Explicitly, a kernel inclusion $j$ and section $s$ give the isomorphism $[j,s]$ from that biproduct to the middle object; $1-sq$ factors through $j$ and provides its inverse's kernel component. Henceand we conclude the Schanuel lemma in an abelian category:

A regular category has finite limits, every morphism factors through its image of a morphism in a regular category as a regular epimorphism followed by a monomorphism, and regular epimorphisms are stable under every pullback in a category. A cover is a strong epimorphism. Every regular epimorphism is strong: if $e$ is the coequalizer of $r,s$ and a square has $e$ on the left and a monomorphism $m$ on the right, monicity shows that the upper arrow coequalizes $r,s$. It therefore factors through $e$, and the epimorphism property of $e$ shows that this factor is the required diagonal. Conversely, factor a strong epimorphism $f$ as $f=me$ with $e$ regular epic and $m$ monic. The lifting property gives a two-sided inverse to $m$, so $m$ is an isomorphism and $f$ is regular epic. Thus regular epimorphisms and covers coincide.

Let $L:\mathcal{C}\to \mathcal{D}$ be the left-exact reflector and let $m:A^{\prime }\hookrightarrow A$. Since $L$ preserves finite limits, $Lm$ is monic. Define $c_A(A^{\prime })$ as the pullbackNaturality of the unit supplies a map $A^{\prime }\to c_A(A^{\prime })$ over $A$, proving $A^{\prime }\le c_A(A^{\prime })$. A factorization $A^{\prime }\le A^{\prime \prime }$ induces $L{A}^{\prime }\le L{A}^{\prime \prime }$ and therefore $c_A(A^{\prime })\le c_A(A^{\prime \prime })$, so $c_A$ is order-preserving.

Apply $L$ to the defining pullback. Left exactness and the fact that $L{\eta }_A:LA\to LLA$ is an isomorphism identify $L(c_A(A^{\prime }))$ with $L{A}^{\prime }$. Pulling back once more therefore givesFor a map $f:B\to A$, left exactness identifies $L(f^{\ast }{A}^{\prime })$ with $(Lf{)}^{\ast }(L{A}^{\prime })$. Pasting the two pullback squares then yieldsso this closure operation induced by a left-exact reflector commutes with pullback.

Assume $A$ lies in $\mathcal{D}$, so ${\eta }_A$ is an isomorphism. If $A^{\prime }$ also lies in $\mathcal{D}$, its unit is an isomorphism and the defining square gives $c_A(A^{\prime })\cong A^{\prime }$. Conversely, if $A^{\prime }$ is closed, that square expresses $A^{\prime }$ as a finite limit of $A$, $L{A}^{\prime }$, and $LA$, all fixed by $L$. Fixed objects of a left-exact reflective subcategory are closed under finite limits, so $A^{\prime }$ belongs to $\mathcal{D}$.

Finally suppose $\mathcal{C}$ is regular. The fixed objects have finite limits. For $f:A\to B$ in $\mathcal{D}$, factor it in $\mathcal{C}$ asApplying $L$ gives $A\stackrel{Le}{\to }LI\stackrel{Lm}{\to }B$. The map $Le$ is regular epic because a left adjoint preserves the coequalizer presenting $e$, and $Lm$ is monic because $L$ is left exact. Thus $\mathcal{D}$ has image factorizations. Their image subobject is the closure $c_B(I)$. A map in $\mathcal{D}$ is regular epic exactly when this closure is all of its codomain. Images in $\mathcal{C}$ commute with pullback, and the closure operation also commutes with pullback, so this condition is pullback-stable. Hence $\mathcal{D}$ is regular, as stated by the left-exact reflective subcategory of a regular category theorem.

A categorical limit of $D:\mathcal{J}\to \mathcal{C}$ is a terminal cone: it consists of an object $L$ and compatible maps $L\to D(j)$ through which every other cone factors uniquely. For a finite diagram, take the product $P={\prod }_{j}D(j)$ and the product $Q={\prod }_{u:i\to j}D(j)$. There are two maps $P\rightrightarrows Q$: on the $u:i\to j$ coordinate one uses respectively $D(u)$ after projection to $D(i)$ and direct projection to $D(j)$. Their equalizer is exactly the compatible-cone object. Hence finite products and equalizers construct every finite limit.

In the category of metric spaces and non-expansive maps, give $X\times Y$ the maximum metricThe projections are non-expansive, and a pair of non-expansive maps into $X$ and $Y$ induces a non-expansive map into this product, proving the universal property.

Let two maps $1\rightrightarrows X$ select $a,b\in X$. On the set quotient identifying $a$ and $b$, define the quotient metric by shortest paths that may jump from $a$ to $b$ at zero cost. Explicitly,This is the largest metric making the quotient map non-expansive. A map $X\to Z$ equalizing $a$ and $b$ factors through the set quotient and remains non-expansive by the path formula, so this is the coequalizer. Its underlying set is the set-theoretic coequalizer.

For $X=\{0,1,5,6\}$ with $0\sim 6$, write $\ast =\{0,6\}$. The quotient hasThus in $Q\times Y$, with $Y=\{0,3\}$,After first taking $X\times Y$, the product of the parallel pair identifies $(0,y)$ with $(6,y)$ separately for $y=0,3$. In its quotient metric, every path from $(1,0)$ to $(5,3)$ has length at least $4$, and length $4$ is attained either directly or via one of those identifications. The canonical bijection from this coequalizer to $Q\times Y$ is therefore not an isometry. Hence $-\times Y$ does not preserve this coequalizer. In a Cartesian closed category, $-\times Y$ is a left adjoint and preserves all colimits, so $\mathbf{Met}$ is not cartesian closed.

Here $I$ is a set regarded as a discrete category. Finite limits and regular epimorphisms are coordinatewise. A well-supported object is a family of nonempty sets. With the axiom of choice, every coordinate element extends to a global point of its product. Any subobject containing all global points must therefore contain every coordinate element, and be the whole family. Thus the category is capital. Families with some empty coordinates explain why global points need not reflect arbitrary isomorphisms.

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.

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.

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.

If every slice category $\mathcal{C}/A$ is essentially small, the displayed exponential object and the set of sieves on a category at each $A$ are small even when $\mathcal{C}$ is large. Together with pointwise finite limits, they give the elementary-topos constructions in a universe admitting the large diagrams. This does not force the entire functor category to be locally small in the original universe: a large discrete category has terminal slices, but maps between its constant-one and constant-two presheaves are arbitrary class-indexed binary families.