Definition 11.4.1 (Induction principle of \(n\)-truncation). Let \(X\) be an anima. We say that a map \(t\colon X\to X'\) is an \(n\)-approximation if it satisfies the following induction principle of \(n\)-truncation:
β’ For every \(n\)-truncated map \(p\colon Y\to X'\) of animae, every section of \(X\times_{X'} Y \to X\) can be lifted to a section of \(Y\to X'\). Explicitly this means that for every commutative triangle
where \(p\) is \(n\)-truncated we have a section \(f'\colon X'\to Y\) of \(p\) and an identification \(f=f't\) over \(X'\).
If additionally \(X'\) is \(n\)-truncated, we say that \(t\) exhibits \(X'\) as the \(n\)-truncation of \(X\). If an \(n\)-truncation of \(X\) exists, we denote it by \(t\colon X\to \truncation{n}{X}\) and its action on objects by \(t\colon x\mapsto [x]\).
From Section 11.4, Truncation.