11.9.5 Horizontal Composition of Natural Transformations

The horizontal composition1,2 of two natural transformations $\alpha \colon F\Longrightarrow G$ and $\beta \colon H\Longrightarrow K$ as in the diagram

of $\alpha $ and $\beta $ is the natural transformation

\[ \beta \mathbin {\star }\alpha \colon \webleft (H\circ F\webright )\Longrightarrow \webleft (K\circ G\webright ), \]

as in the diagram

consisting of the collection

\[ \left\{ \webleft (\beta \mathbin {\star }\alpha \webright )_{A} \colon H\webleft (F\webleft (A\webright )\webright ) \to K\webleft (G\webleft (A\webright )\webright ) \right\} _{A\in \operatorname {\mathrm{Obj}}\webleft (\mathcal{C}\webright )}, \]

of morphisms of $\mathcal{E}$ with


  1. 1Further Terminology: Also called the Godement product of $\alpha $ and $\beta $.
  2. 2Horizontal composition forms a map
    \[ \mathbin {\star }_{\webleft (F,H\webright ),\webleft (G,K\webright )}\colon \operatorname {\mathrm{Nat}}\webleft (H,K\webright )\times \operatorname {\mathrm{Nat}}\webleft (F,G\webright )\to \operatorname {\mathrm{Nat}}\webleft (H\circ F,K\circ G\webright ). \]

First, we claim that we indeed have

This is, however, simply the naturality square for $\beta $ applied to the morphism $\alpha _{A}\colon F\webleft (A\webright )\to G\webleft (A\webright )$. Next, we check the naturality condition for $\beta \mathbin {\star }\alpha $, which is the requirement that the boundary of the diagram
commutes. Since

  • Subdiagram (1) commutes by the naturality of $\alpha $.

  • Subdiagram (2) commutes by the naturality of $\beta $.

so does the boundary diagram. Hence $\beta \circ \alpha $ is a natural transformation.1


  1. 1Reference: Proposition 1.3.4 of [Borceux, Handbook of Categorical Algebra I].

Let

be a diagram in $\mathsf{Cats}_{\mathsf{2}}$.

  1. 1.

    The left whiskering of $\alpha $ with $G$ is the natural transformation1

    \[ \operatorname {\mathrm{id}}_{G}\star \alpha \colon G\circ \phi \Longrightarrow G\circ \psi . \]
  2. 2.

    The right whiskering of $\alpha $ with $F$ is the natural transformation2

    \[ \alpha \star \operatorname {\mathrm{id}}_{F}\colon \phi \circ F\Longrightarrow \psi \circ F. \]


  1. 1Further Notation: Also written $G\alpha $ or $G\mathbin {\star }\alpha $, although we won’t use either of these notations in this work.
  2. 2Further Notation: Also written $\alpha F$ or $\alpha \mathbin {\star }F$, although we won’t use either of these notations in this work.

Let $\mathcal{C}$, $\mathcal{D}$, and $\mathcal{E}$ be categories.

  1. 1.

    Functionality. The assignment $\webleft (\beta ,\alpha \webright )\mapsto \beta \mathbin {\star }\alpha $ defines a function

    \[ \mathbin {\star }_{\webleft (F,G\webright ),\webleft (H,K\webright )}\colon \operatorname {\mathrm{Nat}}\webleft (H,K\webright )\times \operatorname {\mathrm{Nat}}\webleft (F,G\webright )\to \operatorname {\mathrm{Nat}}\webleft (H\circ F,K\circ G\webright ). \]
  2. 2.

    Associativity. Let

    be a diagram in $\mathsf{Cats}_{\mathsf{2}}$. The diagram
    commutes, i.e. given natural transformations
    we have

    \[ \webleft (\gamma \mathbin {\star }\beta \webright )\mathbin {\star }\alpha =\gamma \mathbin {\star }\webleft (\beta \mathbin {\star }\alpha \webright ). \]
  3. 3.

    Interaction With Identities. Let $F\colon \mathcal{C}\to \mathcal{D}$ and $G\colon \mathcal{D}\to \mathcal{E}$ be functors. The diagram

    commutes, i.e. we have

    \[ \operatorname {\mathrm{id}}_{G}\mathbin {\star }\operatorname {\mathrm{id}}_{F}=\operatorname {\mathrm{id}}_{G\circ F}. \]
  4. 4.

    Middle Four Exchange. Let $F_{1},F_{2},F_{3}\colon \mathcal{C}\to \mathcal{D}$ and $G_{1},G_{2},G_{3}\colon \mathcal{D}\to \mathcal{E}$ be functors. The diagram

    commutes, i.e. given a diagram
    in $\mathsf{Cats}_{\mathsf{2}}$, we have

    \[ \webleft (\beta '\mathbin {\star }\alpha '\webright )\circ \webleft (\beta \mathbin {\star }\alpha \webright )=\webleft (\beta '\circ \beta \webright )\mathbin {\star }\webleft (\alpha '\circ \alpha \webright ). \]

Item 1: Functionality
Clear.

Item 2: Associativity
Omitted.

Item 3: Interaction With Identities
We have

\begin{align*} \webleft (\operatorname {\mathrm{id}}_{G}\mathbin {\star }\operatorname {\mathrm{id}}_{F}\webright )_{A} & \mathrel {\smash {\overset {\mathclap {\scriptscriptstyle \text{def}}}=}}\webleft (\operatorname {\mathrm{id}}_{G}\webright )_{F_{A}}\circ G_{\webleft (\operatorname {\mathrm{id}}_{F}\webright )_{A}}\\ & \mathrel {\smash {\overset {\mathclap {\scriptscriptstyle \text{def}}}=}}\operatorname {\mathrm{id}}_{G_{F_{A}}}\circ G_{\operatorname {\mathrm{id}}_{F_{A}}}\\ & = \operatorname {\mathrm{id}}_{G_{F_{A}}}\circ \operatorname {\mathrm{id}}_{G_{F_{A}}}\\ & = \operatorname {\mathrm{id}}_{G_{F_{A}}}\\ & \mathrel {\smash {\overset {\mathclap {\scriptscriptstyle \text{def}}}=}}\webleft (\operatorname {\mathrm{id}}_{G\circ F}\webright )_{A} \end{align*}

for each $A\in \operatorname {\mathrm{Obj}}\webleft (\mathcal{C}\webright )$, showing the desired equality.

Item 4: Middle Four Exchange
Let $A\in \operatorname {\mathrm{Obj}}\webleft (\mathcal{C}\webright )$ and consider the diagram
The top composition
is given by $\webleft (\webleft (\beta '\circ \beta \webright )\mathbin {\star }\webleft (\alpha '\circ \alpha \webright )\webright )_{A}$, while the bottom composition
is given by $\webleft (\webleft (\beta '\mathbin {\star }\alpha '\webright )\circ \webleft (\beta \mathbin {\star }\alpha \webright )\webright )_{A}$. Now, Subdiagram (1) corresponds to the naturality condition
for $\beta \colon G_{1}\Longrightarrow G_{2}$ at $\alpha '_{A}\colon F_{2}\webleft (A\webright )\to F_{3}\webleft (A\webright )$, and thus commutes. Thus we have

\[ \webleft (\webleft (\beta '\circ \beta \webright )\mathbin {\star }\webleft (\alpha '\circ \alpha \webright )\webright )_{A} = \webleft (\webleft (\beta '\mathbin {\star }\alpha '\webright )\circ \webleft (\beta \mathbin {\star }\alpha \webright )\webright )_{A} \]

for each $A\in \operatorname {\mathrm{Obj}}\webleft (\mathcal{C}\webright )$ and therefore

\[ \webleft (\beta '\mathbin {\star }\alpha '\webright )\circ \webleft (\beta \mathbin {\star }\alpha \webright )=\webleft (\beta '\circ \beta \webright )\mathbin {\star }\webleft (\alpha '\circ \alpha \webright ). \]

This finishes the proof.


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


You can also use the contact form below: