nLab
twisted arrow category

Twisted arrow categories

Terminology

A twisted arrow category is an alternative name for a category of factorisations. That latter name is applied when discussing natural systems and Baues-Wirsching cohomology, whilst the name twisted arrow category is more often used in discussing Kan extensions and within the categorical literature.

Definition

The twisted arrow category Tw(C) of C a category is the category of elements of its hom-functor:

(1)Tw(C)=el(hom)=*/homTw(C) = el(hom) = * / hom

Explicit description

Unpacking the well-known explicit construction of comma objects in Cat as comma categories, we get that Tw(C) has

  • objects: f an arrow in C, and

  • morphisms: between f and g are pairs of arrows (p,q) such that the following diagram commutes:

    (2)A p C f g B q D\begin{matrix} A & \overset{p}{\leftarrow} & C \\ f \downarrow & & \downarrow g \\ B & \underset{q}{\to} & D \end{matrix}

    you could view then morphisms from f to g as factorizations of g through f.

Origin of the name

From the description above, Tw(C) is the same as Arr(C) the arrow category of C, but with the direction of p above in the def of morphism reversed, hence the twist.

Properties

From its definition as a comma category, there’s a functor (a discrete opfibration, in fact)

(3)π C:tw(C)C op×C\pi_C \colon tw(C) \to C^{op} \times C

which at the level of objects forgets the arrows:

(4)π C(f:AB)=(A,B)\pi_C(f \colon A \to B) = (A,B)

and keeps everything at the morphisms level.

tw(C) and wedges

One could say that tw(C) classifies wedges?, in the sense that for any functor F:C op×CB,

are the same as

This can be used to give a proof of the reduction of ends to conical limits in the Set-enriched case, and is used in the construction of ends in a derivator.

References

The statement above is Ex. IX.6.3 in

  • MacLane, Categories for the working mathematician - 2nd Edition

Revised on March 21, 2012 15:32:11 by Mike Shulman (71.136.234.110)