Proposition 11.6.11 (Dependent sums of finite animae). Let \(B\) be an \(n\)-finite anima and let \(E\colon B\to\An\) be a family of \(n\)-finite animae. Then its total anima \[ \sum_{b:B}E(b) \] is \(n\)-finite. Consequently, \(n\)-finite maps are closed under composition. The same assertions hold with “\(n\)-finite” replaced by “\(\pi\)-finite”.
Proof
For the statement about \(n\)-finite animae, the assertion follows by induction on \(n\). At height zero it is the dependent-sum assertion of Proposition 11.6.5. At the successor step, the identity anima between \((b,e)\) and \((b',e')\) is \[ \sum_{p:b=b'}\bigl(p_*e=e'\bigr). \] It is \(n\)-finite by the induction hypothesis. The same induction also shows that decidable subanimae of \(n\)-finite animae are \(n\)-finite. To verify the remaining component condition, reduce to the finitely many components of \(B\) and merely choose a representative \(b\) of each of them, using finite choice. The components of the total anima lying over the component of \(b\) are the quotient of the finite set \(\truncation{0}{E(b)}\) by transport along loops in \(B\) at \(b\). This orbit relation is decidable: for two components of \(E(b)\), the anima of loops carrying one to the other is a decidable subanima of the \(n\)-finite anima \(b=b\), so its mere inhabitation is decidable. A quotient of a finite set by a decidable equivalence relation is finite, by the same deduplication argument as in Proposition 11.6.3. Hence the total anima has finitely many components.
Now suppose that the base and fibers are \(\pi\)-finite. There merely exists a bound for the base. Over each of its finitely many components, there merely exists a bound for the corresponding fiber. Finite choice from Proposition 11.6.5 produces, merely, finitely many bounds; their maximum is a common bound. After increasing all bounds to this maximum by Proposition 11.6.7, the fixed-height case applies.