Remark 1.2.1. Since the operations on identifications introduced above are functors between animae, they act on identifications between identifications, and so on at every level.

We also assume various coherence laws relating these operations. For example, whiskering a composite of identifications agrees with the composite of the whiskered identifications. Similarly, whiskering an identification between functors is compatible with the unitors and associator. The unitors and associator themselves satisfy the usual triangle and pentagon identities.

These laws are themselves specified identifications. When a law takes an identification as an input, we view it as an identification between the respective two functors between identification animae. When several identifications occur as inputs, the source of both functors is a product of their identification animae. For instance, the interchange law in Axiom A.3 is an identification between the two functors \[ (g=g')\times (f=f')\longrightarrow (gf=g'f') \] obtained by composing projections, whiskering, and vertical composition according to the formulas \[ (\tau ,\sigma )\longmapsto (\tau \star f')\circ (g\star \sigma ), \qquad (\tau ,\sigma )\longmapsto (g'\star \sigma )\circ (\tau \star f). \]

For the complete list of coherence laws, we refer to Section 1.2 of [Cisinski et al. (2026)]. Throughout the book, we use these laws implicitly, usually leaving the parentheses and the necessary associativity and unit identifications unwritten.