Proposition
Functor composition is associative.
References: Definition~.
Proof
Let
$$
F : \mathcal{C} \to \mathcal{D},
\qquad
G : \mathcal{D} \to \mathcal{E},
\qquad
H : \mathcal{E} \to \mathcal{F}.
$$
For an object $X$,
$$
H \circ (G \circ F)(X)
=
H(G(F(X))).
$$
Also
$$
(H \circ G) \circ F (X)
=
H(G(F(X))).
$$
Thus the two functors agree on objects.
For a morphism $f : X \to Y$,
$$
H \circ (G \circ F)(f)
=
H(G(F(f))).
$$
Similarly,
$$
(H \circ G) \circ F (f)
=
H(G(F(f))).
$$
Thus the functors agree on morphisms.
Depends on
Dependency Graph
flowchart LR
classDef current fill:#6366f1,color:#fff,stroke:#4f46e5
n297b3591["Definition"]
n56d6b291["Proposition"]:::current
n297b3591 --> n56d6b291
click n297b3591 "../objects/297b3591.html" "_self"