Structure

Results on subcategories

This page collects several useful results of the following form: if U:C→DU : \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:C→DU : \C \to \D is a fully faithful functor such that (1) UU is coreflective, i.e. there is a functor R:D→CR : \D \to \C right adjoint to UU, and (2) every (regular) monomorphism Y→U(X)Y \to U(X) in D\D is the image of a (regular) monomorphism X′→XX' \to X in C\C. Then R(Ω)R(\Omega) is a (regular) subobject classifier in C\C.

Proof. If X∈CX \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:C→DU : \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:C→DU : \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:Xi→Yi)(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 colim⁡iU(fi):colim⁡iU(Xi)→colim⁡iU(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(colim⁡ifi):U(colim⁡iXi)→U(colim⁡iYi)U(\colim_i f_i) : U(\colim_i X_i) \to U(\colim_i Y_i). Since U(colim⁡ifi)U(\colim_i f_i) is a monomorphism in D\D and UU is faithful, it follows that colim⁡ifi\colim_i f_i is a monomorphism in C\C. □\square

Lemma 3.

Let U:C→DU : \C \to \D be a fully faithful functor with a left adjoint L:D→CL : \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(colim⁡jU(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×J→CX : \I \times \J \to \C be a diagram, where I\I is finite and J\J is filtered. We compute:

colim⁡jlim⁡iX(i,j)≅L(colim⁡jU(lim⁡iX(i,j)))≅L(colim⁡jlim⁡iU(X(i,j)))≅L(lim⁡icolim⁡jU(X(i,j)))≅lim⁡iL(colim⁡jU(X(i,j)))≅lim⁡icolim⁡jX(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*}

It is routine to check that the composite is the natural morphism. □\square

Lemma 4.

Let U:C→DU : \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:I→CY : \I \to \C a filtered diagram. Then we have the canonical comparison map c:colim⁡i∈I(X×Yi)→X×colim⁡i∈IYic : \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 colim⁡i∈I(UX×UYi)→UX×colim⁡i∈IUYi\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:C→DU : \C \to \D be a fully faithful functor with a right adjoint R:D→CR : \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]C≅R([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

Hom⁡C(Z×X,Y)≅Hom⁡D(UZ×UX,UY)≅Hom⁡D(UZ,[UX,UY])≅Hom⁡C(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/P→C\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:C→DU : \C \to \D be a functor preserving pullbacks. Assume that D\D is regular and that C\C has finite limits and coequalizers of kernel pairs. If UU preserves and reflects regular epimorphisms, then C\C is regular. Moreover, this condition is satisfied when UU is conservative and preserves coequalizers.

Proof. Since C\C has finite limits and coequalizers of kernel pairs, it remains to prove that regular epimorphisms are stable under pullbacks in C\C. Assume first that UU preserves and reflects regular epimorphisms. If X→YX \to Y is a regular epimorphism and Z→YZ \to Y is any morphism in C\C, then U(X)→U(Y)U(X) \to U(Y) is a regular epimorphism, and therefore also U(X)×U(Y)U(Z)→U(Z)U(X) \times_{U(Y)} U(Z) \to U(Z) is a regular epimorphism. Since UU preserves pullbacks, this identifies with U(X×YZ)→U(Z)U(X \times_Y Z) \to U(Z), the image under UU of X×YZ→ZX \times_Y Z \to Z. Since UU reflects regular epimorphisms, it follows that X×YZ→ZX \times_Y Z \to Z is a regular epimorphism, finishing the proof.

Now assume that UU is conservative and preserves coequalizers. Then it clearly preserves regular epimorphisms. Conversely, suppose that f:X→Yf : X \to Y is a morphism in C\C such that U(f)U(f) is a regular epimorphism. Then in C\C we have the diagram X×YX⇉X→pim⁡(f)→iYX \times_Y X \rightrightarrows X \xrightarrow{p} \im(f) \xrightarrow{i} Y where X×YX⇉XX \times_Y X \rightrightarrows X is the kernel pair of ff, and im⁡(f)\im(f) is the coequalizer. By the assumptions on UU, its image is equivalent to the diagram in D\D: U(X)×U(Y)U(X)⇉U(X)→U(p)U(im⁡(f))→U(i)U(Y)U(X) \times_{U(Y)} U(X) \rightrightarrows U(X) \xrightarrow{U(p)} U(\im(f)) \xrightarrow{U(i)} U(Y) where U(X)×U(Y)U(X)U(X) \times_{U(Y)} U(X) is the kernel pair of U(f)U(f), and U(im⁡(f))U(\im(f)) is the coequalizer. Since U(f)U(f) is a regular epimorphism and D\D is regular, we must have that U(i)U(i) is an isomorphism. Since UU is conservative, ii is an isomorphism as well, so ff is a regular epimorphism. □\square

Lemma 8.

Let U:C→DU : \C \to \D be a fully faithful functor. Assume that C\C has pullbacks and coequalizers, that UU preserves pullbacks and coequalizers, and that UU preserves jointly monomorphic parallel pairs (which holds, for example, if C\C has binary products and UU preserves them). If D\D has effective congruences, then so does C\C.

Proof. Suppose we have a congruence E⇉XE \rightrightarrows X in C\C. We first observe that its image U(E)⇉U(X)U(E) \rightrightarrows U(X) is a congruence in D\D, and therefore effective. It is jointly monomorphic by assumption on UU; the reflexivity and symmetry morphisms for EE are easily seen to transform under UU into reflexivity and symmetry morphisms for U(E)U(E); and similarly, since UU preserves pullbacks, the transitivity morphism for EE transforms under UU into a transitivity morphism for U(E)U(E).

Now let X/EX/E be the quotient of E⇉XE \rightrightarrows X, i.e. its coequalizer. We will show that the canonical morphism E→X×X/EXE \to X \times_{X/E} X is an isomorphism. Since UU is fully faithful and preserves pullbacks, it suffices to prove that the canonical morphism U(E)→U(X)×U(X/E)U(X)U(E) \to U(X) \times_{U(X/E)} U(X) is an isomorphism, where U(X/E)U(X/E) is the coequalizer of U(E)⇉U(X)U(E) \rightrightarrows U(X) since UU preserves coequalizers. Since the congruence U(E)⇉U(X)U(E) \rightrightarrows U(X) is effective by the first part of the proof, this follows from this lemma.

Finally, to prove the parenthetical remark, assume that C\C has binary products and that UU preserves them. Then UU preserves jointly monomorphic parallel pairs, because it preserves monomorphisms (as it preserves pullbacks), and a pair A⇉BA \rightrightarrows B is jointly monomorphic if and only if the induced morphism A→B×BA \to B \times B is a monomorphism. □\square

Lemma 9.

Let LL be a functor which is left adjoint to a faithful functor UU. Then LL preserves generating collections. (Thus in particular, any reflective subcategory of a category with a generating collection also has a generating collection; and similarly for a single generator.)

Proof. If SS is a generating collection,

∏G∈SHom⁡(L(G),−)≅∏G∈SHom⁡(G,U(−))≅(∏G∈SHom⁡(G,−))∘U \begin{align*} \prod_{G\in S} \Hom(L(G),-) & \cong \prod_{G\in S} \Hom(G,U(-)) \\ & \cong \left( \prod_{G\in S} \Hom(G,-) \right) \circ U \end{align*}

is a composition of faithful functors, hence faithful. □\square

Lemma 10.

Any fully faithful functor reflects extremal generating collections (and therefore, by duality, it also reflects extremal cogenerating collections). In other words, if U:C→DU : \C \to \D is a fully faithful functor, and SS is an essentially small collection of objects such that U(S)U(S) is an extremal generating collection of D\D, then SS is an extremal generating collection of C\C.

Proof. Under the given assumptions, we can factor C→(Set+)S\C \to (\Set^+)^S, X↦(Hom⁡C(G,X))G∈SX \mapsto (\Hom_\C(G, X))_{G\in S}, as being isomorphic to the composition of U:C→DU : \C \to \D followed by Y↦(Hom⁡D(UG,Y))G∈SY \mapsto (\Hom_\D(UG, Y))_{G\in S}, using the assumption on UU to identify Hom⁡D(UG,UX)\Hom_\D(UG, UX) with Hom⁡C(G,X)\Hom_\C(G, X) naturally in XX. In this composition, the first is fully faithful and therefore also conservative; and the second is assumed to be faithful and conservative. Therefore, the composition is also faithful and conservative. □\square

Lemma 11.

Let U:C→DU : \C \to \D be a faithful conservative functor (for example, a fully faithful functor). Assume that D\D is extensive, that C\C has finite coproducts and pullbacks along coproduct inclusions, and that UU preserves both. Then C\C is extensive. A similar statement holds for infinitary extensive (and countably extensive) categories, in which case we assume that C\C has all coproducts (resp. all countable coproducts) and that UU preserves these.

Proof. This is straightforward. We need to prove that finite coproducts are disjoint and stable under pullbacks in C\C. If A,B∈CA,B \in \C, the coproduct inclusion A→A+BA \to A + B is a monomorphism: Since UU is faithful, it suffices to prove that its image under UU is a monomorphism. Since UU preserves finite coproducts, the image identifies with the coproduct inclusion U(A)→U(A)+U(B)U(A) \to U(A) + U(B), which is a monomorphism since D\D is extensive. Moreover, the unique morphism 0→A×A+BB0 \to A \times_{A + B} B is an isomorphism: Since UU is conservative, it suffices to prove that its image under UU is an isomorphism. Since UU preserves finite coproducts and pullbacks along coproduct inclusions, the image identifies with the unique morphism 0→U(A)×U(A)+U(B)U(B)0 \to U(A) \times_{U(A) + U(B)} U(B), which is an isomorphism since D\D is extensive. This proves that finite coproducts are disjoint in C\C. To prove that they are stable under pullbacks, let T→A+BT \to A + B be any morphism in C\C, and consider the pullbacks TA≔T×A+BAT_A \coloneqq T \times_{A + B} A and TB≔T×A+BBT_B \coloneqq T \times_{A + B} B. We need to show that the canonical morphism TA+TB→TT_A + T_B \to T is an isomorphism. Since UU is conservative, it suffices to prove that its image under UU is an isomorphism. Since UU preserves finite coproducts and pullbacks along coproduct inclusions, the image identifies with the canonical morphism U(T)U(A)+U(T)U(B)→U(T)U(T)_{U(A)} + U(T)_{U(B)} \to U(T) induced by the morphism U(T)→U(A)+U(B)U(T) \to U(A) + U(B) in D\D, which is an isomorphism since D\D is extensive. □\square

Lemma 12.

Let U:C→DU : \C \to \D be a fully faithful functor that preserves kernel pairs. Let f:X→Yf : X \to Y be a morphism in C\C that has a kernel pair in C\C. If U(f)U(f) is a regular epimorphism in D\D, then ff is a regular epimorphism in C\C. In particular, if UU maps epimorphisms to regular epimorphisms and C\C is not epi-regular, then C\C does not have kernel pairs.

Proof. Let p1,p2:E⇉Xp_1,p_2 : E \rightrightarrows X be the kernel pair of ff in C\C. Then U(p1),U(p2)U(p_1),U(p_2) is the kernel pair of U(f)U(f) in D\D. Since U(f)U(f) is a regular epimorphism, it is the coequalizer of U(p1),U(p2)U(p_1),U(p_2) by this lemma. Since UU is fully faithful, it reflects colimits, so ff is the coequalizer of p1,p2p_1,p_2 in C\C, i.e. a regular epimorphism.

For the second statement, assume that C\C has kernel pairs and that UU maps epimorphisms to regular epimorphisms. By the first statement, every epimorphism of C\C is regular, i.e. C\C is epi-regular. □\square

Context

This page is referenced by the following categories.

This page is referenced by the following category implications.

This page is referenced by the following functors.