nLab
final functor

Contents

Idea

A functor F:CD is final (often called cofinal), if we can restrict diagrams on D to diagrams on C along F without changing their colimit.

Dually, a functor is initial (sometimes called co-cofinal) if pulling back diagrams along it does not change the limits of these diagrams.

Beware that this property is pretty much unrelated to that of a functor being an initial object or terminal object in the functor category [C,D].

Definition

Definition

A functor F:CD is final if for every object dD the comma category (d/F) is non-empty and connected.

A functor F:CD is initial if the opposite F op:C opD op is final, i.e. if for every object dD the comma category (F/d) is non-empty and connected.

Properties

Proposition

Let F:CD be a functor

The following conditions are equivalent.

  1. F is final.

  2. For all functors G:DSet the natural function between colimits

    lim GFlim G\lim_\to G \circ F \to \lim_{\to} G

    is a bijection.

  3. For all categories E and all functors G:DE the natural morphism between colimits

    lim GFlim G\lim_\to G \circ F \to \lim_{\to} G

    is a isomorphism.

  4. For all functors G:D opSet the natural function between limits

    lim Glim GF op\lim_\leftarrow G \to \lim_\leftarrow G \circ F^{op}

    is a bijection.

  5. For all categories E and all functors G:D opE the natural morphism

    lim Glim GF op\lim_\leftarrow G \to \lim_\leftarrow G \circ F^{op}

    is an isomorphism.

  6. For all dD

    lim cCHom D(d,F(c))*.{\lim_\to}_{c \in C} Hom_D(d,F(c)) \simeq * \,.
Proposition

If F:CD is final then C is connected precisely if D is.

Proposition

If F 1 and F 2 are final, then so is their composite F 1F 2.

If F 2 and the composite F 1F 2 are final, then so is F 1.

If F 1 is a full and faithful functor and the composite is final, then both functors seperately are final.

Generalizations

The generalization of the notion of final functor from category theory to (∞,1)-higher category theory is described at

The characterization of final functors is also a special case of the characterization of exact squares.

Examples

Example

If D has a terminal object then the functor F:*D that picks that terminal object is final: for every dD the comma category d/F is equivalent to *. The converse is also true: if a functor *D is final, then its image is a terminal object.

In this case the statement about preservation of colimits states that the colimit over a category with a terminal object is the value of the diagram at that object. Which is also readily checked directly.

Example

Every right adjoint functor is final.

Proof

Let (LR):CD be a pair of adjoint functors.To see that R is final, we may for instance check that for all dD the comma category d/R is non-empty and connected:

It is non-empty because it contains the adjunction unit (L(d),dRL(d)). Similarly, for

d f g R(a) R(b)\array{ && d \\ & {}^{\mathllap{f}}\swarrow && \searrow^{\mathrlap{g}} \\ R(a) &&&& R(b) }

two objects, they are connected by a zig-zag going through the unit, by the universal factorization property of adjunctions

d R(a) Rf¯ RL(d) R(g¯) R(b).\array{ && d \\ & \swarrow &\downarrow& \searrow \\ R(a) &\stackrel{R \bar f}{\leftarrow}& R L (d)& \stackrel{R(\bar g)}{\to} & R(b) } \,.

References

Section 2.5 of

Section 2.11 of

  • Francis Borceux, Handbook of categorical algebra 1, Basic category theory

Notice that this says “final functor” for the version under which limits are invariant.