Lemma 11.5.3. Let \(n\in \mathbb{Z}_{\geq -2}\) and let \(f\colon X\to Y\) be a map of animae. The following are equivalent:

  1. (1) \(f\) is \((n+1)\)-surjective.

  2. (2) For every \(n\)-truncated map \(S\to Y\), the map \begin{equation} \prod_{y:Y}S_y\to \prod_{y:Y}\Map(X_y,S_y),\quad s\mapsto (y\mapsto x\mapsto s_y) \tag{11.13}\end{equation} is an equivalence.

  3. (3) For every \(n\)-truncated map \(S\to Y\) and every \(y : Y\), the map \begin{equation} S_y \to \Map(X_y, S_y), \quad s\mapsto (x\mapsto s) \tag{11.14}\end{equation} is an equivalence.

  4. (4) For every \(n\)-truncated anima \(T\) and every \(y:Y\), the map \begin{equation} T \to \Map(X_y, T), \quad t\mapsto (x\mapsto t) \tag{11.15}\end{equation} is an equivalence.

Proof

First we prove that the three conditions 2, 3, and 4 are equivalent. The implications \(\text{4}\Rightarrow\text{3}\) and \(\text{3}\Rightarrow\text{2}\) are easy: for the first, simply choose \(T\coloneq S_y\) and for the second take the dependent product over \(y:Y\).

For the implication \(\text{2}\Rightarrow\text{4}\), fix \(y:Y\) and an \(n\)-truncated anima \(T\), and define the family \(S\to Y\) by \(S_z\coloneq \Map((y=z),T)\). Each \(S_z\) is \(n\)-truncated because \(T\) is. Moreover, we have a commutative square Commutative diagram; see the PDF for its LaTeX source identifying the desired vertical map on the right with the known equivalence on the left.

Next we prove the implication \(\text{1}\Rightarrow\text{4}\). Since both conditions are fiberwise we may assume that \(Y=*\), so that we must show that \begin{equation} c\colon T\to \Map(X,T), \quad t\mapsto (x\mapsto t) \tag{11.17}\end{equation} is an equivalence for every \((n+1)\)-surjective \(X\) and \(n\)-truncated \(T\). For \(n=-2\), both \(T\) and \(\Map(X,T)\) are contractible. For \(n=-1\), both sides are propositions; since \(X\) is merely inhabited, evaluation at a merely chosen point gives an inverse to \(c\). Now let \(n\geq 0\). By induction assume that we have proved the statement for \(n-1\). We show that \(c\) is a surjective embedding:

  • β€’ Embedding: For each \(s,t : T\) we need to show that the map \begin{equation} s=t \to \Map(X, (s=t)), \quad(p \mapsto (x\mapsto p)) \tag{11.18}\end{equation} is an equivalence. Since \(s=t\) is \((n-1)\)-truncated and \(X\) is in particular \(n\)-surjective, this follows from the induction hypothesis (in context \(s,t : T\)).

  • β€’ Surjectivity: Choose a point \(x_0 : X\) (allowed, because \(X\) is \(0\)-surjective and we are proving a proposition). Let \(r\colon X\to T\). We claim that we have an equality \(c(r(x_0))=r\), i.e., that for each \(x : X\) we have \(rx_0=rx\). For each \(x : X\) consider the map \begin{equation} (rx_0=rx) \to \Map(x_0=x, (r x_0 = rx)), \quad p \mapsto (q\mapsto p) \tag{11.19}\end{equation} Since the anima \(r x_0 = rx\) is \((n-1)\)-truncated and \(x_0=x\) is \(n\)-surjective, by induction this map is an equivalence. Since the right side has an object (the action of \(r\) on equalities), so does the left.

It remains to show that the equivalent conditions 2, 3, and 4 jointly imply 1. Since conditions 4 and 1 are fiberwise, we may assume that \(Y=*\). We again argue by induction on \(n\). The case \(n=-2\) is automatic.

For arbitrary \(n\geq-1\), take \(T\coloneqq \truncation{-1}{X}\) to obtain the equivalence \begin{equation} \truncation{-1}{X}\xrightarrow{\simeq}\Map(X,\truncation{-1}{X}) \tag{11.20}\end{equation} The canonical map \(X\to \truncation{-1}{X}\) on the right then gives a proof on the left that \(X\) is merely inhabited, i.e. \(0\)-surjective.

Now let \(n\geq 0\). We must show that all identity animae \(x=_Xz\), for \(x,z:X\), are \(n\)-surjective. We will show that for each \(x : X\), the map \(x \colon *\to X\) satisfies condition 2 for \(n-1\); by induction this implies that its fibers are \(n\)-surjective which is what we need.

Fix \(x:X\), and let \(p\colon S\to X\) be \((n-1)\)-truncated. Choose a universe in which \(p\) has small fibers and consider it as a map \(S\colon X\to \An_{\leq n-1}\). Here \(\An_{\leq n-1}\) denotes the anima of \((n-1)\)-truncated animae in the chosen universe. It is \(n\)-truncated by univalence, so we can apply condition 4 with \(T\coloneq \An_{\leq n-1}\) to obtain that the map \begin{equation} c\colon \An_{\leq n-1} \to \Map(X, \An_{\leq n-1}) \tag{11.21}\end{equation} is an equivalence. In particular, \(S\) is equivalent to a constant family \(z\mapsto S_0\) for some \((n-1)\)-type \(S_0\), i.e., \(S\simeq S_0\times X\) over \(X\).

Thus the map in (11.13), applied to \(x:*\to X\), is the restriction \(\prod_{z:X}S_z\to S_x\). Under this identification of \(S\) with the constant family \(S_0\), it becomes the evaluation map \begin{equation} \ev_x\colon \Map(X,S_0) \to S_0 \tag{11.22}\end{equation} Since evaluation is a retraction of the constant-map equivalence (11.17), supplied by condition 4 with \(T=S_0\), it is an equivalence, thus concluding the proof.

From Section 11.5, Connected and surjective functors.