Lemma 19.4.7. Let \[ u\colon \Fin _* \simeq \Span (\Fin ,\inj ,\all ) \hookrightarrow \Span (\Fin ) \] be the inclusion, and let \(\Rr _*\) and \(\Rr \) denote the forward morphisms in \(\Fin _*\) and \(\Span (\Fin )\), respectively. For every functor \(p\colon E \to \Span (\Fin )\), there is a natural equivalence of functors over \(\Fin _*\) \[ u^*E_{\Rr }(p) \simeq E_{\Rr _*}(u^*p). \]

Proof. By the pullback formula in Construction 19.2.2, it suffices to construct a natural equivalence \[ \Fin _* \times _{\Span (\Fin ),t}\Ar _{\Rr }(\Span (\Fin )) \simeq \Ar _{\Rr _*}(\Fin _*) \] compatible with the target functors to \(\Fin _*\) and the source functors to \(\Span (\Fin )\), using \(u\circ s\) on the right. The objects on both sides are forward spans, equivalently maps of finite sets \(r\colon I \to J\). A morphism on the left is a commutative square in \(\Span (\Fin )\)

Commutative square with maps I to I' labeled f, J to J' labeled g, I to J labeled r, I' to J' labeled r'.

in which \(g\) belongs to \(\Fin _*\). The composite \(gr\) has injective backwards leg because this leg is obtained by pulling back the injective backwards leg of \(g\) along \(r\). Since \(r'\) is a forward map, the backwards leg of \(r'f\) is the backwards leg of \(f\). The equivalence \(r'f \simeq gr\) therefore shows that \(f\) also belongs to \(\Fin _*\). As \(\Fin _* \hookrightarrow \Span (\Fin )\) is a wide subcategory inclusion, its hom animae are unions of components, so the identification making the square commute also lies in the corresponding hom anima of \(\Fin _*\). Thus the displayed square is a morphism in \(\Ar _{\Rr _*}(\Fin _*)\). This identifies the two arrow categories compatibly with source and target, and pulling back along \(p\) proves the claim. β–‘