Codex @codex  0

Two objects of a category lie in the same connected component if a finite zigzag of morphisms, with either orientation allowed, joins them. This is an equivalence relation; its classes give full subcategories, each a connected category. For a small category, the collection of components is a set denoted ${\pi }_0(\mathcal{C})$. A functor induces a function on components. Empty categories have no components.

A functor with a unique lift, from each specified object $c$, of every arrow $Fc\to d$. The lifted arrow's target is part of the uniqueness requirement. This is dual to a discrete fibration. Lifting a cocone of a finite connected category gives a cocone upstairs: lifts of its legs have a common target because uniqueness identifies targets along every diagram arrow. Thus a discrete opfibration over a weakly filtered category has weakly filtered domain, including the possibility of an empty domain.

We prove the orthogonality of final functors and discrete fibrations. For $b\in \mathcal{B}$, finality supplies an object $(a,u:b\to Fa)$ of $(b\downarrow F)$. Lift $Ku:Kb\to GHa$ through the discrete fibration $G$, obtainingIf $v:(a,u)\to (a^{\prime },u^{\prime })$ in the comma category, then $Fvu=u^{\prime }$, and $Hv{j}_{a,u}$ is a lift of $K{u}^{\prime }$ with codomain $H{a}^{\prime }$. Uniqueness of that lift makes its domain equal to $c_{a^{\prime },u^{\prime }}$. Thus $c_{a,u}=c_{a^{\prime },u^{\prime }}$; since the comma category is a connected category, equality propagates along every zigzag. Define $Lb$ to be this common object.

For $w:b\to b^{\prime }$, choose $(a,u:b^{\prime }\to Fa)$. Lift $Kw$ into $L{b}^{\prime }$, obtaining $\ell :c\to L{b}^{\prime }$. Then $j_{a,u}\ell$ lifts $K(uw)$ into $Ha$, so its domain is $Lb$ by the preceding construction. Define $Lw=\ell$. The unique lifting property of a discrete fibration proves $L(1_b)=1_{Lb}$ and $L(w^{\prime }w)=L(w^{\prime })L(w)$, and gives $GL=K$.

At $b=Fa$, use $(a,1_{Fa})$; its lift is $1_{Ha}$, so $LFa=Ha$. Both $L(Fv)$ and $Hv$ are lifts of $GHv$ with the same codomain, hence agree. Therefore $LF=H$.

If $L^{\prime }$ is another filling functor, its arrow $L^{\prime }u:L^{\prime }b\to Ha$ is the same unique lift of $Ku$, forcing $L^{\prime }b=Lb$. Its arrows are likewise forced by their codomains and images under $G$. The diagonal functor exists and is unique.

A diagram in a category of shape $J$ is a functor $D:J\to \mathcal{C}$. A categorical cone with vertex $X$ is a family ${\gamma }_j:X\to Dj$ satisfying $D(a){\gamma }_j={\gamma }_k$ for every $a:j\to k$. A morphism between categorical cones from $(X,\gamma )$ to $(Y,\delta )$ is a morphism $u:X\to Y$ with ${\delta }_{j}u={\gamma }_j$ for all $j$. A categorical limit is a terminal object in this category of cones: each cone has a unique such morphism to the limiting cone.

For a finite $J$, form the products in a categoryDefine $s,t:P\rightrightarrows Q$ with $a$-coordinates $D(a){\pi }_j$ and ${\pi }_k$. The equalizer $e:L\to P$ imposes exactly the cone equations. Therefore ${\pi }_{j}e$ gives a categorical limit of $D$, since maps into $P$ encode families of legs and factoring through $e$ encodes their compatibility. The empty product in a category is the terminal object, covering the empty diagram. This is the construction of small limits from products and equalizers, restricted to finite shapes.

Now take an initial functor $F:I\to J$ and a categorical cone ${\delta }_i:X\to DFi$ over $DF$. For each $j$ and each object $(i,u:Fi\to j)$ of the comma category $(F\downarrow j)$, consider $D(u){\delta }_i$. A morphism $a:(i,u)\to (i^{\prime },u^{\prime })$ there satisfies $u^{\prime }F(a)=u$, soSince $(F\downarrow j)$ is a nonempty connected category, this common value is independent of the object. Define it to be ${\gamma }_j$. This does not require choosing representatives: the value is uniquely determined.

For $b:j\to k$, replacing $(i,u)$ by $(i,bu)$ proves $D(b){\gamma }_j={\gamma }_k$. Taking $(i,1_{Fi})$ proves ${\gamma }_{Fi}={\delta }_i$. Conversely, extending a restricted cone recovers its original legs, since ${\gamma }_j=D(u){\gamma }_{Fi}$. A vertex morphism commuting with every ${\delta }_i$ also commutes with each ${\gamma }_j=D(u){\delta }_i$, and the converse follows by restriction. Thus extension and restriction are strictly inverse functors, not merely an equivalence of categories. This proves cone restriction along an initial functor.

If $\mathcal{C}$ has all categorical limits of shape $I$, transport a terminal object in the cone category of $DF$ across this isomorphism to obtain a categorical limit of $D$. Uniqueness of the induced comparison, and its compatibility with natural transformations of diagrams, givesFor the converse use the representable test for initial functors. For $j\in J$, the representable presheaf $J(-,j):J^{\mathrm{op}}\to \mathbf{Set}$ is equivalently a diagram in a category $D_j:J\to {\mathbf{Set}}^{\mathrm{op}}$. Its categorical limit in the opposite category is the colimit of $J(-,j)$ in sets. Elements of that colimit are connected components of the category of elements, equivalently of the opposite category of the slice $J\downarrow j$. This slice has terminal object $(j,1_j)$, so that colimit is a singleton.

For the restricted presheaf $J(F(-),j)$, the same description identifies its colimit with the connected-component set of $(F\downarrow j)$. Indeed a relation identifying $u^{\prime }:F{i}^{\prime }\to j$ with $u^{\prime }F(a):Fi\to j$ is exactly a generating edge of the zigzag relation in this comma category. The assumed isomorphism of limit functors forces this set to be a singleton. Therefore $(F\downarrow j)$ is nonempty and connected for every $j$, proving

Use the square's notation $HF=KG$. For $E\in \mathcal{E}$, choose $(C,u:E\to GC)$ in the nonempty connected category $(E\downarrow G)$. Lift $Ku:KE\to HFC$ through the discrete fibration $H$, obtaining the uniquely determined arrowDefine $LE=D_u$. If $a:C\to C^{\prime }$ satisfies $Gau=u^{\prime }$, then $Fa\tilde{u}$ is a lift of $K{u}^{\prime }$ with codomain $F{C}^{\prime }$. Uniqueness makes it exactly ${\tilde{u}}^{\prime }$, including equality of its domain. Connectedness of the comma category therefore makes $LE$ independent of the chosen object, with strict equality rather than merely an isomorphism.

For $v:E\to E^{\prime }$, choose $(C,u:E^{\prime }\to GC)$ and lift $Kv:KE\to K{E}^{\prime }=HL{E}^{\prime }$ with codomain $L{E}^{\prime }$. Write this lift as $w:D\to L{E}^{\prime }$. Its composite with $\tilde{u}$ is the lift of $K(uv)$ to $FC$, so its domain is $LE$. Set $Lv=w$. The lift of an identity is an identity, and the composite of two lifts is the lift of the composite with the specified codomain. Thus $L$ is a functor, and $HL=K$.

At $E=GC$, choose $(C,1_{GC})$; its lift is $1_{FC}$, giving $LGC=FC$. For $a:C\to C^{\prime }$, the unique lift of $KGa=HFa$ with codomain $F{C}^{\prime }$ is $Fa$, giving $LG=F$ on arrows as well. Finally, any other filler $L^{\prime }$ must send $u$ to the same lift of $Ku$ with codomain $FC$, so $L^{\prime }E=LE$; it must also send $v$ to the unique lift of $Kv$ with codomain $L{E}^{\prime }$. This proves orthogonality of final functors and discrete fibrations:

Let ${\lambda }_A:GF(A)\to Z$ be the given cocone under a diagram. For $B\in \mathcal{D}$, choose an object $(A,u:B\to FA)$ of the comma category $(B\downarrow F)$ and defineSuch a choice exists because $F$ is a final functor. If $a:A\to A^{\prime }$ gives a morphism $(A,u)\to (A^{\prime },u^{\prime })$, so $F(a)u=u^{\prime }$, the cocone relation givesThe connected category condition makes the result independent of the choice along any zigzag.

For $v:B\to B^{\prime }$, choose $(A,u:B^{\prime }\to FA)$; then $(A,uv)$ is available for $B$, giving ${\bar{\lambda }}_B={\bar{\lambda }}_{B^{\prime }}G(v)$. Thus the maps form a cocone under a diagram on $G$. Choosing $(A,1_{FA})$ shows that restriction recovers ${\lambda }_A$. Any extension must satisfy ${\bar{\lambda }}_B={\bar{\lambda }}_{FA}G(u)={\lambda }_{A}G(u)$, proving uniqueness. This is cocone extension along a final functor.

If $GF$ has a colimit, extend its universal cocone in this way. Every cocone on $G$ restricts to one on $GF$, factors uniquely through that colimit, and then agrees with its extension by uniqueness. Hence the same vertex is a colimit of $G$. In particular,and existence of all $\mathcal{C}$-shaped colimits in $\mathcal{E}$ implies existence of all $\mathcal{D}$-shaped colimits.

A cocone under a diagram $D:\mathcal{J}\to \mathcal{C}$ with vertex $X$ is a natural family ${\lambda }_j:Dj\to X$, so ${\lambda }_{k}D(u)={\lambda }_j$ for every $u:j\to k$. A colimit of $D$ is an initial such cocone: for every cocone $\lambda :D\Rightarrow \Delta X$, there is a unique $h:\mathrm{colim}D\to X$ with $h{\iota }_j={\lambda }_j$ for all $j$.

Let $F:\mathcal{I}\to \mathcal{J}$ be a final functor and let ${\lambda }_i:D(Fi)\to X$ be a cocone under $DF$. For each $j$, choose an object $(i,u:j\to Fi)$ of the nonempty comma category $(j\downarrow F)$ and defineA morphism $(i,u)\to (i^{\prime },u^{\prime })$ in the comma category gives $F(v)u=u^{\prime }$, and the cocone identity shows that the two resulting maps are equal. Because $(j\downarrow F)$ is a connected category, a zigzag proves independence of the chosen object. The same construction applied after a morphism $j\to k$ proves naturality, so $\bar{\lambda }$ is a cocone. Any extension must have this value because it must satisfy the cocone identity along $u$, proving uniqueness. This is cocone extension along a final functor.

If $L$ is a colimit of $DF$, its universal cocone extends uniquely to $D$. Restriction and extension give mutually inverse correspondences between cocones from $D$ and from $DF$, so the extended cocone is a colimit of $D$. Therefore the existence of all colimits of shape $\mathcal{I}$ implies the required colimits of shape $\mathcal{J}$.

Now suppose $\mathcal{J}$ is a sifted category. For $D,E:\mathcal{J}\to \mathbf{Set}$, the product functor $-\times A$ is a left adjoint, so it preserves colimits. Applying this once in each variable givesThe diagonal $\Delta :\mathcal{J}\to \mathcal{J}\times \mathcal{J}$ is final, so the right side isThus ${\mathrm{colim}}_{\mathcal{J}}$ preserves binary products in a category. Since $\mathcal{J}$ is connected, the colimit of the constant singleton diagram is a singleton, so it also preserves the terminal object. It therefore preserves finite products.

A diagram in a category is a functor $D:\mathcal{J}\to \mathcal{C}$. A cone over a diagram with vertex $A$ is a familysuch that $D(u){\gamma }_i={\gamma }_j$ for every $u:i\to j$. A categorical limit is a terminal cone: for every cone $(A,\gamma )$ there is a unique map $A\to \lim D$ commuting with all legs.

Suppose $\mathcal{C}$ has small products and equalizers. For a small diagram $D$, formThere are two maps $r,s:P\rightrightarrows Q$. In the coordinate indexed by $u:i\to j$, letThe equalizer $E\to P$ imposes exactly the cone equations. Maps $A\to E$ are therefore naturally the same as cones from $A$ to $D$, so $E\cong \lim D$. This is the construction of small limits from products and equalizers.

Let $F:\mathcal{I}\to \mathcal{J}$ be initial, so every $(F\downarrow j)$ is nonempty and connected. Restriction sends a cone $(A,{\gamma }_j)$ over $D$ to $(A,{\gamma }_{Fi})$ over $DF$. Conversely, given a cone $(A,{\delta }_i)$ over $DF$, choose an objectand defineA morphism in the comma category shows that this expression is unchanged along one edge, and connectedness makes it independent of the chosen object. The cone equations follow by choosing $(i,vu)$ for an arrow $v:j\to j^{\prime }$. This construction is inverse to restriction and acts identically on vertex maps, proving the cone restriction along an initial functor isomorphism.

Terminal objects in the two cone categories therefore correspond. Whenever the $\mathcal{I}$-shaped limit exists,naturally in $D$. Equivalently, the triangle formed by precompositionand the two limit functors commutes up to natural isomorphism.

For the converse, suppose this commutation holds for $\mathcal{C}={\mathbf{Set}}^{\mathrm{op}}$. Passing to opposite categories says that restriction along $F^{\mathrm{op}}$ preserves all set-valued colimits. Fix $j\in \mathcal{J}$ and take the representable functorIts colimit is a singleton: the category of its elements has the initial object $(j,1_j)$. The restricted colimit iswhose elements are precisely the connected components of $(F\downarrow j)$. By the assumed comparison this set is also a singleton. Thus $(F\downarrow j)$ is nonempty and connected for every $j$, so $F$ is initial.