Construction 3.6.11 (Associativity of joins). Given categories \(C\), \(D\) and \(E\), we construct an equivalence \[ a_{C,D,E}\colon C \star (D \star E) \iso (C \star D) \star E. \] Applying the mapping-out property of joins twice shows that a functor from either parenthesization to a category \(F\) consists of the same data: functors from \(C\), \(D\), and \(E\) to \(F\); families of connecting morphisms from \(C\) to \(D\), from \(D\) to \(E\), and from \(C\) to \(E\); and a commutative triangle relating these three families over \(C\times D\times E\). The two pullback descriptions are identified using the equivalences \[ [0]\star[1]\iso[2] \inviso[1]\star[0] \] from Example 3.6.3.

The universal property therefore gives a comparison \(a_{C,D,E}\colon C\star(D\star E)\to(C\star D)\star E\) which is the identity on \(C\), \(D\), and \(E\). For every category \(F\), precomposition with \(a_{C,D,E}\) identifies the two pullback descriptions above and is consequently an equivalence of functor categories. Passing to groupoid cores and applying Proposition 1.4.11 shows that \(a_{C,D,E}\) is an equivalence.

From Section 3.6, Joins.