CatDat

Results on subcategories

This page collects several useful results of the following form: if U:CDU : \C \to \D is a faithful functor (perhaps even fully faithful, or satisfying additional assumptions) and D\D has a certain property, then C\C has this property as well.

Lemma 1.

Let D\D be a category with a (regular) subobject classifier Ω\Omega. Assume that U:CDU : \C \to \D is a fully faithful functor such that (1) UU is coreflective, i.e. there is a functor R:DCR : \D \to \C right adjoint to UU, and (2) every (regular) monomorphism YU(X)Y \to U(X) in D\D is the image of a (regular) monomorphism XXX' \to X in C\C. Then R(Ω)R(\Omega) is a (regular) subobject classifier in C\C.

Proof. If XCX \in \C, then Hom(X,R(Ω))Hom(U(X),Ω)Sub(U(X))Sub(X).\Hom(X,R(\Omega)) \cong \Hom(U(X),\Omega) \cong \Sub(U(X)) \cong \Sub(X). The same proof works for regular subobjects. \square

Lemma 2.

Let C\C be a category with filtered colimits. Assume that U:CDU : \C \to \D is a faithful functor that preserves monomorphisms and filtered colimits. If monomorphisms in D\D are stable under filtered colimits, then the same is true in C\C.

For the record, here is the dual statement: let C\C be a category with cofiltered limits. Assume that U:CDU : \C \to \D is a faithful functor that preserves epimorphisms and cofiltered limits. If epimorphisms in D\D are stable under cofiltered limits, then the same is true in C\C.

Proof. If (fi:XiYi)(f_i : X_i \to Y_i) is a filtered diagram of monomorphisms in C\C, it induces a filtered diagram (U(fi):U(Xi)U(Yi))(U(f_i) : U(X_i) \to U(Y_i)) of monomorphisms in D\D. Hence, its colimit colimiU(fi):colimiU(Xi)colimiU(Yi)\colim_i U(f_i) : \colim_i U(X_i) \to \colim_i U(Y_i) is a monomorphism in D\D. This morphism is isomorphic to U(colimifi):U(colimiXi)U(colimiYi)U(\colim_i f_i) : U(\colim_i X_i) \to U(\colim_i Y_i). Since U(colimifi)U(\colim_i f_i) is a monomorphism in D\D and UU is faithful, it follows that colimifi\colim_i f_i is a monomorphism in C\C. \square

Lemma 3.

Let U:CDU : \C \to \D be a fully faithful functor with a left adjoint L:DCL : \D \to \C (i.e. C\C is equivalent to a reflective subcategory of D\D). Assume that D\D has exact filtered colimits, that C\C has finite limits, and that LL preserves finite limits. Then C\C also has exact filtered colimits.

Proof. It is well known (and easy to prove) that the colimit of a diagram (Xj)(X_j) in C\C is given by L(colimjU(Xj))L(\colim_j U(X_j)), provided that the colimit in D\D exists. In particular, C\C has filtered colimits. By assumption, it also has finite limits, and UU preserves them since it is a right adjoint. Now let X:I×JCX : \I \times \J \to \C be a diagram, where I\I is finite and J\J is filtered. We compute:

colimjlimiX(i,j)L(colimjU(limiX(i,j)))L(colimjlimiU(X(i,j)))L(limicolimjU(X(i,j)))limiL(colimjU(X(i,j)))limicolimjX(i,j) \begin{align*} \colim_j {\lim}_i X(i,j) & \cong L(\colim_j U({\lim}_i X(i,j))) \\ & \cong L(\colim_j {\lim}_i U(X(i,j))) \\ & \cong L({\lim}_i \colim_j U(X(i,j))) \\ & \cong {\lim}_i L(\colim_j U(X(i,j))) \\ & \cong {\lim}_i \colim_j X(i,j) \end{align*}

\square

Lemma 4.

Let U:CDU : \C \to \D be a fully faithful functor. Assume that C\C has finite products and filtered colimits, and that UU preserves binary products and filtered colimits. If D\D has cartesian filtered colimits, then so does C\C.

Proof. Let XX be an object of C\C and Y:ICY : \I \to \C a filtered diagram. Then we have the canonical comparison map c:colimiI(X×Yi)X×colimiIYic : \colim_{i\in\I} (X \times Y_i) \to X \times \colim_{i\in\I} Y_i. By the assumptions, UcUc is equivalent to the comparison map colimiI(UX×UYi)UX×colimiIUYi\colim_{i\in\I} (UX \times UY_i) \to UX \times \colim_{i\in\I} UY_i, which is an isomorphism. Since UU is fully faithful and therefore conservative, we conclude that cc is an isomorphism. \square

Lemma 5.

Let U:CDU : \C \to \D be a fully faithful functor with a right adjoint R:DCR : \D \to \C (i.e. C\C is equivalent to a coreflective subcategory of D\D). Assume that C\C has binary products, and that UU preserves these binary products. If D\D is cartesian closed, then so is C\C, with exponentials in C\C given by [X,Y]CR([UX,UY]D).[X, Y]_{\C} \cong R([UX, UY]_{\D}).

Proof. For any objects X,Y,ZX, Y, Z of C\C we have natural isomorphisms

HomC(Z×X,Y)HomD(UZ×UX,UY)HomD(UZ,[UX,UY])HomC(Z,R([UX,UY])). \begin{align*} \Hom_\C(Z\times X, Y) & \cong \Hom_\D(UZ \times UX, UY) \\ & \cong \Hom_\D(UZ, [UX,UY]) \\ & \cong \Hom_\C\bigl(Z, R([UX,UY])\bigr). \end{align*}

\square

Corollary 6.

If C\C is a cartesian closed category and PP is a subterminal object of C\C, then the slice category C/P\C / P is also cartesian closed, with exponentials in C/P\C / P given by [X,Y]C/P[X,Y]C×P.[X, Y]_{\C / P} \cong [X, Y]_{\C} \times P.

Proof. The forgetful functor C/PC\C / P \to \C is fully faithful; it has right adjoint ×P{-} \times P; and it preserves binary products (in fact all inhabited limits). Hence, Lemma 5 applies. \square

Lemma 7.

Let U:CDU : \C \to \D be a fully faithful functor. Assume that C\C has finite limits and coequalizers, and that UU preserves pullbacks and coequalizers. If D\D is regular, then so is C\C.

Proof. Since C\C has finite limits and coequalizers, the only nontrivial part of proving C\C is regular is to check that regular epimorphisms are stable under pullback in C\C. Since UU preserves pullbacks and regular epimorphisms, it suffices to show that UU reflects regular epimorphisms. Thus, suppose f:XYf : X \to Y is a morphism in C\C with UfUf a regular epimorphism. Then in C\C we have the diagram X×YXXim(f)iYX \times_Y X \rightrightarrows X \to \im(f) \xrightarrow{i} Y where X×YXX \times_Y X is the kernel pair of ff, and im(f)\im(f) is the coequalizer. By the assumptions, the image under UU is equivalent to the diagram in D\D: UX×UYUXUXim(Uf)UiUYUX \times_{UY} UX \rightrightarrows UX \to \im(Uf) \xrightarrow{Ui} UY where UX×UYUXUX \times_{UY} UX is the kernel pair of UfUf, and im(Uf)\im(Uf) is the coequalizer. Since UfUf is a regular epimorphism, we must have UiUi is an isomorphism. Since UU is fully faithful and therefore conservative, we get ii is an isomorphism as well, so ff is a regular epimorphism. \square

Lemma 8.

Let U:CDU : \C \to \D be a fully faithful functor. Assume that C\C has finite limits and coequalizers, and that UU preserves inhabited finite limits and coequalizers. If D\D has effective congruences, then so does C\C.

Proof. Suppose we have a congruence EX×XE \hookrightarrow X\times X in C\C. We can then form the quotient XX/EX \to X/E as a coequalizer, along with the kernel pair X×X/EXX \times_{X/E} X and the comparison map ii in the diagram below: EiX×X/EXXX/E.E \xrightarrow{i} X \times_{X/E} X \rightrightarrows X \to X/E. By the assumptions, the image under UU is equivalent to the diagram in D\D: UEUiUX×U(X/E)UXUXU(X/E).UE \xrightarrow{Ui} UX \times_{U(X/E)} UX \rightrightarrows UX \to U(X/E). Here, UEUXUE \rightrightarrows UX is a congruence: the map UEUX×UXUE \to UX \times UX is a monomorphism since UU preserves pullbacks and therefore preserves monomorphisms; the reflexivity and symmetry morphisms for EE are easily seen to transform under UU to reflexivity and symmetry morphisms for UEUE; and similarly, since UU preserves pullbacks, the transitivity morphism for EE transforms under UU to a transitivity morphism for UEUE. This congruence UEUE of D\D is effective, so we must have UiUi is an isomorphism. Since UU is fully faithful and therefore conservative, we get ii is an isomorphism as well, so EE is effective. \square

Authors: Martin Brandenburg, Daniel Schepler

Context

This page is referenced by the following categories.

This page is referenced by the following implications.