Lemma 11.4.14. Let \(p\colon A\to B\) be a functor that is a cover on objects. For every poset \(P\), the induced functor \begin{equation} \Fun(B,P)\to\Fun(A,P) \tag{11.7}\end{equation} is fully faithful. Moreover a functor \(f\colon A\to P\) lies in the essential image (i.e. factors through \(p\)) if and only if it satisfies \(f(a)\leq f(a')\) whenever we have an arrow \(pa\to pa'\) in \(B\).
Proof
β’ To establish fully faithfulness, by Corollary 10.3.8, it suffices to show for all \(f,g\colon B\to P\) the logical equivalence between
β’ for all \(b:B^\simeq\) we have \(f(b)\leq g(b)\) and
β’ for all \(a:A^\simeq\) we have \(f(pa)\leq g(pa)\),
The forward direction is immediate by restriction. The converse follows from the induction principle for propositional truncation which holds because \(p^\simeq\colon A^\simeq\to B^\simeq\) is a \((-1)\)-approximation by assumption. Indeed it tells us that to show the proposition \(f(b)\leq g(b)\) for all objects \(b:B^\simeq\) it suffices to do so for those of the form \(b=pa\).
β’ Let \(f\colon A\to P\) satisfy \(fa \leq fa'\) whenever we have an arrow \(pa\to pa'\). We have to show that \(f\) factors through \(p\). Conversely, any factorization through \(p\) has this property by functoriality.
We start with the special case where \(P=S\) is a set, and where \(A=A^\simeq\) and \(B=B^\simeq\) are animae. Let \(R\to B\times S\) be the fiberwise \(-1\)-truncation of the map \((p,f)\colon A\to B\times S\); in other words, \(R\) consists of those pairs \((b,s)\) for which there merely exists an \(a:A\) with \(pa= b\) and \(fa = s\). We claim that the composite \begin{equation} R\subseteq B\times S\to B \tag{11.8}\end{equation} is an embedding. To show this we have to construct, for any \(b:B\) and any two \((b,s),(b,s') : R_b\), an equality \(s=s'\) in \(S\); but since \(S\) is a set, hence \(S(s,s')\) is a proposition, mere existence is enough. By definition of \(R\) there merely exist \(a,a' : A\) with \(fa=s\) and \(fa'=s'\) but also \(pa = b = pa'\). By the assumption on the map \(f\), we thus obtain \(s= fa = fa' = s'\) as claimed. Now we may use that every cover is a \((-1)\)-approximation (Lemma 11.4.8) to obtain the dashed filler
whose second component yields the desired factorization of \(f\) through \(p\).
β’ To prove the general case consider the commutative square
where all maps are embeddings; the horizontal ones by what we proved earlier, and the vertical ones by Lemma 10.3.7. Thus it suffices to show that \(f^\simeq \colon A^\simeq \to P^\simeq\) factors through \(p^\simeq\colon A^\simeq\to B^\simeq\) and that the resulting map \(g^\simeq\colon B^\simeq \to P^\simeq\) extends to \(g\colon B\to P\). We have the first fact by applying the step we already proved; indeed, \(P^\simeq\) is a set and \(A^\simeq,B^\simeq\) are animae. For the second step we have to show \(g(b)\leq g(b')\) whenever we have an arrow \(b\to b'\) in \(B\) (by Lemma 10.3.7). Since \(p^\simeq\) is a cover, so is \(p^\simeq\times p^\simeq\colon A^\simeq\times A^\simeq \to B^\simeq\times B^\simeq\). It is therefore a \((-1)\)-approximation, and it suffices to show this in the case where \(b=pa\) and \(b'=pa'\) for \(a,a' :A^\simeq\), in which case it is precisely the assumption on \(f\).
From Section 11.4, Truncation.