Link Search Menu Expand Document

Definition of functors

A functor F:CDF: \mathcal C \to \mathcal D is a

  • function F:ObCObDF : \operatorname{Ob} \mathcal C \to \operatorname{Ob} \mathcal D on objects and
  • for each X,YCX, Y \in \mathcal C a function FX,Y:HomC(X,Y)HomD(FX,FY)F_{X,Y} : \operatorname{Hom}_{\mathcal C}(X,Y) \to \operatorname{Hom}_{\mathcal D}(FX,FY)

which we will often also just write as FF using the context to disambiguiate.

These are required to satisfy F(fg)=F(f)F(g)F( f \circ g ) = F(f) \circ F(g) for any pair of morphisms f,gf,g and F(1X)=1FXF(1_X) = 1_{FX}

Examples

  • For any category C\mathcal C, there is the identity function Id:CC\operatorname{Id} : \mathcal C \to \mathcal C which is the identity functor on objects and morphisms.
  • Given a homomorphism f:RSf : R \to S of rings, there is a pushforward (or restriction of scalars) functor f:ModSModRf_\ast : \operatorname{Mod} S \to \operatorname{Mod} R which on the underlying abelian group is fN:=Nf_\ast N := N with the RR-action given by rn:=f(r)n.r \cdot n := f(r) n. For a morphism of ϕ:NN\phi : N \to N^\prime in ModS\operatorname{Mod} S, we set fϕ:=ϕf_\ast \phi := \phi Let’s quickly see that we have a module homomorphism fϕ(rn)=ϕ(f(r)n)=f(r)ϕ(n)=rfϕ(n)f_\ast \phi( r \cdot n ) = \phi(f(r) n) = f(r) \phi(n) = r \cdot f_\ast \phi(n) where we can extract f(r)f(r) since ϕ\phi is assumed to be a SS-module homomorphism.

    Thus ff_\ast is well-defined and it is immediate that it preserves composition and identity maps.

  • Another important functor starts from a RR-SS bimodule PP. I claim that HomR(P,):ModRModS\operatorname{Hom}_R(P,-) : \operatorname{Mod} R \to \operatorname{Mod} S is a well-defined functor.

    First we need to give the set HomR(P,)\operatorname{Hom}_R(P,-) the structure a SS-module. As an abelian group, we set (f+g)(p):=f(p)+f(p)(f+g)(p) := f(p) + f(p)
    and for the SS-module structure we let sf(p):=f(ps).s \cdot f(p) := f(ps).

    For morphisms, we take HomR(P,f)(ϕ):=fϕ.\operatorname{Hom}_R(P,f)(\phi) := f \circ \phi.

As the Hom-functor HomR(P,)\operatorname{Hom}_R(P,-) will be quite central to our investigation, let’s work through a couple sub-examples.

  • Take R=S=PR = S = P. This bimodule is usually called the diagonal of RR and denoted by ΔR\Delta_R. We already saw that evaluation at 11 is a bijection HomR(Δ,M)ev1Mϕϕ(1)\operatorname{Hom}_R(\Delta,M) \overset{ev_1}{\to} M \\ \phi \mapsto \phi(1) for any RR-module MM. This is in fact an isomorphism of RR-modules since (rϕ)(1)=ϕ(r)=rϕ(1).(r \cdot \phi)(1) = \phi(r) = r \phi(1). Thus, for each MM, application of HomR(Δ,M)\operatorname{Hom}_R(\Delta, M) is “naturally” isomorphic to MM. We will make this precise in a moment.

  • Take R=S=k[x]R = S = k[x] and P=k[y,z]P = k[y,z] with the bimodule structure given by xyx \mapsto y and xzx \mapsto z. To compute Homk[x](k[y,z],)\operatorname{Hom}_{k[x]}(k[y,z],-) we will write a presentation for k[y,z]k[y,z] as a k[x]k[x]-module.

    As k[x]k[x]-module, k[y,z]k[y,z] has a infinite basis given by ziz^i for 0i<0 \leq i < \infty. Since it is a free module, Homk[x](k[y,z],)Homk(k[z],).\operatorname{Hom}_{k[x]}(k[y,z],-) \cong \operatorname{Hom}_k(k[z],-). We can specify the k[x]k[x]-module homomorphism by providing a kk-linear map from k[z]k[z]. Let’s specialize to M=k[x]/(x)=kM = k[x]/(x) = k. Then any linear map k[z]kk[z] \to k can be written as an infinite sum i=0ajδj\sum_{i = 0}^\infty a_j \delta_j where δj(zi)={1j=i0 else \delta_j (z^i) = \begin{cases} 1 & j = i \\ 0 & \text{ else } \end{cases} The k[x]k[x] module structure is given by xδi=δi1x \delta_i = \delta_{i-1} for i>0i > 0 and xδ0=0x \delta_0 = 0.

Natural transformations

Given two functors F,G:CDF,G : \mathcal C \to \mathcal D, a natural transformation ν:FG\nu : F \to G is a collection of morphisms νX:FXGX\nu_X : FX \to GX for each object XCX \in \mathcal C. For any f:XYf: X \to Y in C\mathcal C, we require the diagram

commutes.

Examples

  • If F=GF = G, then we can take νX=1FX\nu_X = 1_{FX}. This is the identity natural transformation.
  • If F=G=IdF = G = \operatorname{Id}, then saying that ν:FG\nu: F \to G is a natural transformation is requiring that

is requiring that νXf=fνY\nu_X \circ f = f \circ \nu_Y for any morphism f:XYf: X \to Y. In particular, if f:XXf : X \to X, then νX\nu_X must be in the center of End(X)\operatorname{End}(X).

  • We have the free abelian group functor Z:SetAb\mathbb{Z}^\bullet : \operatorname{Set} \to \operatorname{Ab} and the forgetful functor forget:AbSetAA.\operatorname{forget}: \operatorname{Ab} \to \operatorname{Set} \\ A \mapsto A. There is a natural transformation Idforget(Z)\operatorname{Id} \to \operatorname{forget}(\mathbb{Z}^\bullet) given by νU:UZUueu\nu_U : U \to \mathbb{Z}^U \\ u \mapsto e_u Indeed, since Zf(aueu):=auef(u)\mathbb{Z}^f\left(\sum a_u e_u\right) := \sum a_u e_{f(u)} we see that for f:UVf: U \to V ZfνU=ef(u)=νVf.\mathbb{Z}^f \circ \nu_U = e_{f(u)} = \nu_V \circ f.
  • Given an RR-SS bimodule morphism ψ:PQ\psi : P \to Q, we have a natural transformation HomR(Q,)HomR(P,)ϕϕψ\operatorname{Hom}_R(Q,-) \to \operatorname{Hom}_R(P,-) \\ \phi \mapsto \phi \circ \psi

Functor categories

Using natural transformations, we can put functors into a category. (Remember the Caution). The objects of Func(C,D)\operatorname{Func}(\mathcal C, \mathcal D) are functors F:CDF : \mathcal C \to \mathcal D while HomFunc(C,D)(F,G):={ν:FGν a natural transformation }\operatorname{Hom}_{\operatorname{Func}(\mathcal C, \mathcal D)}(F,G) := \lbrace \nu : F \to G \mid \nu \text{ a natural transformation } \rbrace Composition of natural transformation is given object-wise (νμ)X=νXμX(\nu \circ \mu)_X = \nu_X \circ \mu_X and the identity is the identity natural transformation.

Each object of C\mathcal C gives two functors. hX:CSetYHomC(X,Y)h_X : \mathcal C \to \operatorname{Set} \\ Y \mapsto \operatorname{Hom}_{\mathcal C}(X,Y) and hX:CopSetYHomC(Y,X)h^X : \mathcal C^{op} \to \operatorname{Set} \\ Y \mapsto \operatorname{Hom}_{\mathcal C}(Y,X)

A map f:XXf : X \to X^\prime gives a natural transformation fY:HomC(X,Y)HomC(X,Y)ϕϕf.f_Y : \operatorname{Hom}_{\mathcal C}(X^\prime,Y) \to \operatorname{Hom}_{\mathcal C}(X,Y) \\ \phi \mapsto \phi \circ f. and similarly fY:hXhXf_Y : h^X \to h^{X^\prime}.

Taking everything together, we have two functors h:CopFunc(C,Set)h_\bullet : \mathcal C^{op} \to \operatorname{Func}(\mathcal C, \operatorname{Set}) and h:CFunc(Cop,Set).h^\bullet : \mathcal C \to \operatorname{Func}(\mathcal C^{op}, \operatorname{Set}).

Faithful, full, essentially surjective, equivalences

  • A functor FF is faithful if it is injective on morphism sets F(f)=F(g)f=gF(f) = F(g) \Rightarrow f = g
  • FF is full if it surjective on morphism sets g=F(f)g = F(f) for some ff.

One can of course make the analogous definition on the level of objects but it turns out that having a natural flexibility is useful in practice.

Two objects X,YCX,Y \in \mathcal C are isomorphic if there exists morphisms f:XY f : X \to Y and g:YX g : Y \to X such that gf=1Xgf = 1_X and fg=1Yfg = 1_Y.

Since being isomorphic is an equivalence relation, we form the quotient ObC/iso\operatorname{Ob} \mathcal C/ \sim_{iso} by it.

A functor FF is essentially surjective if the induced map F:ObCObD/isoF : \operatorname{Ob} \mathcal C \to \operatorname{Ob} \mathcal D/ \sim_{iso} is surjective. In other words, every object of D\mathcal D is isomorphic to an object in the image of FF.

A functor F:CDF : \mathcal C \to \mathcal D is an equivalence there is a functor G:DCG : \mathcal D \to \mathcal C and natural isomorphisms FGIdDGFIdCF \circ G \cong \operatorname{Id}_{\mathcal D} \\ G \circ F \cong \operatorname{Id}_{\mathcal C} We will often call GG the inverse functor and denote it by F1F^{-1}. Note this is misleading. In general, F1F^{-1} is only determined up to natural isomorphism.

All these definitions are tied closely together by the following fundamental result.

Theorem. FF is an equivalence if and only if it is full, faithful, and essentially surjective.

Proof. Let’s first assume that FF is an equivalence. Let ν:F1FId\nu : F^{-1} F \to \operatorname{Id} denote the natural isomorphism. We have the following diagram

and we want to check that φ\varphi is actually the identity function. Note that, since νX\nu_X and νY\nu_Y are isomorphisms themselves, the conjugation νYνX1\nu_Y \circ - \circ \nu_X^{-1} is a bijection. Since ν\nu is natural transformation, we know that

commutes. Thus, φ(f)=νYF1F(f)νX1=f\varphi(f) = \nu_Y \circ F^{-1}F(f) \circ \nu^{-1}_X = f So FF is injective and F1F^{-1} is surjective. Reversing the roles of FF and F1F^{-1}, we see that both are bijective.

Since XFF1XX \cong FF^{-1}X, XX is isomorphic to FF applied to F1XF^{-1}X. Hence, FF is essentially surjective.

Now assume that FF is full, faithful, and essentially surjective. For each YDY \in \mathcal D, pick some XCX \in \mathcal C and isomorphism ϕY:FXY\phi_Y : FX \to Y.

Define G:DCG : \mathcal D \to \mathcal C by GY:=XGY := X and HomD(Y,Y)HomC(X,X)ψFX,X1(ϕYψϕY1)\operatorname{Hom}_{\mathcal D}(Y,Y^\prime) \to \operatorname{Hom}_{\mathcal C}(X,X^\prime) \\ \psi \mapsto F_{X,X^\prime}^{-1} \left( \phi_{Y^\prime} \circ \psi \circ \phi_Y^{-1} \right) We leave it as an exercise to check that GG is

  • well-defined and
  • an inverse to FF.