Let F:CD and G:DE be functors.

  1. 1. Interaction With Composition. If F and G are full, then so is GF.
  2. 2. Interaction With Postcomposition I. If F is full, then the postcomposition functor
    F:Fun(X,C)Fun(X,D)

    can fail to be full.

  3. 3. Interaction With Postcomposition II. If, for each XObj(Cats), the postcomposition functor
    F:Fun(X,C)Fun(X,D)

    is full, then F is also full.

  4. 4. Interaction With Precomposition I. If F is full, then the precomposition functor
    F:Fun(D,X)Fun(C,X)

    can fail to be full.

  5. 5. Interaction With Precomposition II. If, for each XObj(Cats), the precomposition functor
    F:Fun(D,X)Fun(C,X)

    is full, then F can fail to be full.

  6. 6. Interaction With Precomposition III. If F is essentially surjective and full, then the precomposition functor
    F:Fun(D,X)Fun(C,X)

    is full (and also faithful by Item 4 of Proposition 9.6.1.1.2).

  7. 7. Interaction With Precomposition IV. The following conditions are equivalent:
    1. (a) For each XObj(Cats), the precomposition functor
      F:Fun(D,X)Fun(C,X)

      is full.

    2. (b) The functor F:CD is a corepresentably full morphism in Cats2 in the sense of Chapter 11: Types of Morphisms in Bicategories, Definition 11.2.1.1.1.
    3. (c) The components
      ηG:GRanF(GF)

      of the unit

      η:idFun(D,X)RanFF

      of the adjunction FRanF are all retractions/split epimorphisms.

    4. (d) The components
      ϵG:LanF(GF)G

      of the counit

      ϵ:LanFFidFun(D,X)

      of the adjunction LanFF are all sections/split monomorphisms.

    5. (e) For each BObj(D), there exist:
      • An object AB of C;
      • A morphism sB:BF(AB) of D;
      • A morphism rB:F(AB)B of D;
      satisfying the following condition:
      • For each AObj(C) and each pair of morphisms
        r:F(A)B,s:BF(A)

        of D, we have

        [(AB,sB,rB)]=[(A,s,rsBrB)]

        in AChFAB×hBFA.

Item 1: Interaction With Composition
Since the map
(GF)A,B:HomC(A,B)HomD(GFA,GFB),

defined as the composition

HomC(A,B)FA,BHomD(FA,FB)GF(A),F(B)HomD(GFA,GFB),

is a composition of surjective functions, it follows from that it is also surjective. Therefore GF is full.

Item 2: Interaction With Postcomposition I
We follow the proof (completely formalised in cubical Agda!) given by Naïm Camille Favier in [Favier, Postcompose Not Full]. Let C be the category where:
  • Objects. We have Obj(C)={A,B}.
  • Morphisms. We have
    HomC(A,A)={eA,idA},HomC(B,B)={eB,idB},HomC(A,B)={f,g},HomC(B,A)=Ø.

  • Composition. The nontrivial compositions in C are the following:

    eAeA=idA,eBeB=idB,feA=g,geA=f,eBf=f,eBg=g.

We may picture C as follows:

Next, let D be the walking arrow category 1 of Definition 9.2.5.1.1 and let F:C1 be the functor given on objects by

F(A)=0,F(B)=1

and on non-identity morphisms by

F(f)=f01,F(g)=f01,F(eA)=id0,F(eB)=id1.

Finally, let X=BZ/2 be the walking involution and let ιA,ιB:BZ/2C be the inclusion functors from BZ/2 to C with

ιA()=A,ιB()=B.

Since every morphism in 1 has a preimage in C by F, the functor F is full. Now, for F to be full, the map

would need to be surjective. However, as we will show next, we have

Nat(ιA,ιB)=Ø,Nat(FιA,FιB)pt,

so this is impossible:

  • Proof of Nat(ιA,ιB)=Ø: A natural transformation α:ιAιB consists of a morphism

    α:ιA()=AιB()=B

    in C making the diagram

    commute for each eHomBZ/2(,)Z/2. We have two cases:

    1. (a) If α=f, the naturality diagram for the unique nonidentity element of Z/2 is given by

      However, eBf=f and feA=g, so this diagram does not commute.

    2. (b) If α=g, the naturality diagram for the unique nonidentity element of Z/2 is given by

      However, eBg=g and geA=f, so this diagram does not commute.

    As a result, there are no natural transformations from ιA to ιB.

  • Proof of Nat(FιA,FιB)pt: A natural transformation

    β:FιAFιB

    consists of a morphism

    β:[FιA]()=0[FιB]()=1

    in 1 making the diagram

    commute for each eHomBZ/2(,)Z/2. Since the only morphism from 0 to 1 in 1 is f01, we must have β=f01 if such a transformation were to exist, and in fact it indeed does, as in this case the naturality diagram above becomes

    for each eZ/2, and this diagram indeed commutes, making β into a natural transformation.

This finishes the proof.
Item 3: Interaction With Postcomposition II
Taking X=pt, it follows by assumption that the functor
F:Fun(pt,C)Fun(pt,D)

is full. However, by Item 5 of Proposition 9.10.1.1.2, we have isomorphisms of categories

Fun(pt,C)C,Fun(pt,D)D

and the diagram

commutes. It then follows from Item 1 that F is full.

Item 4: Interaction With Precomposition I
Omitted.
Item 5: Interaction With Precomposition II
See p. 47 of [Baez–Shulman, Lectures on n-Categories and Cohomology].
Item 6: Interaction With Precomposition III
Omitted, but see https://unimath.github.io/doc/UniMath/d4de26f//UniMath.CategoryTheory.precomp_fully_faithful.html for a formalised proof.
Item 7: Interaction With Precomposition IV
We claim Item (a), Item (b), Item (c), Item (d), and Item (e) are equivalent: This finishes the proof.


Noticed something off, or have any comments? Feel free to reach out!


You can also use the contact form below: