Lemma 10.3.7 (Characterizations of posets). Let \(P\) be a category. The following assertions are logically equivalent.
(1) \(P\) is a poset, i.e., for each \(p,q:P^\simeq\), the mapping anima \(P(p,q)\) is a proposition.
(2) The map \begin{equation} \Map([1],P) \to P^\simeq\times P^\simeq \tag{10.4}\end{equation} is an embedding of animae.
(3) The functor \begin{equation} \Fun([1],P) \to P\times P \tag{10.5}\end{equation} is fully faithful.
(4) For every category \(A\), the induced map \begin{equation} \Fun(A,P)\to \Fun(A^\simeq, P) \tag{10.6}\end{equation} is fully faithful.
(5) For every category \(A\), the induced map (10.6) is an embedding.
(6) For any object \(x : P^\simeq\), the canonical projection
is fully faithful.
(7) For any object \(x : P^\simeq\), the canonical projection (10.7) is an embedding.
(8) \(P\catop\) is a poset.
Moreover, if \(P\) is a poset, then the essential image of the map (10.6) consists of those collections \((p_a)_{a:A^\simeq}\) for which \(p_a\leq p_{b}\) whenever we have an arrow \(a\to b\) in \(A\).
Proof
Reversing all morphisms proves the equivalence between (1) and (8). The equivalence between (1) and (2) is precisely the fiberwise characterization of embeddings.
We next prove that (1) implies (3). Assume that \(P\) is a poset and fix objects \(f= (f_0\to f_1)\) and \(g=(g_0\to g_1)\) of \(\Fun([1],P)\). We have to show that the map \[ \Fun([1],P)(f,g) \to P(f_0,g_0)\times P(f_1,g_1) \] of animae is an equivalence. But the fiber over some pair \((\alpha_0,\alpha_1)\) in the target is identified with the anima \(P(f_0,g_1)(g\circ \alpha_0, \alpha_1\circ f)\) which is contractible by the assumption that \(P(f_0,g_1)\) is a proposition.
We now assume (3) and prove
(4).
If the functor (10.5) is fully faithful,
then we may identify \(\Fun([1],P)\) as a full subcategory
of \(P\times P\),
which means that the following square is cartesian
Note that we may replace
\(\Fun([1],P)^\simeq\)
by
\(\Fun([1],P)\) in the upper right because \(A^\simeq\) is an anima,
so that this square is identified with the square
after curry-uncurry.
This cartesian square expresses precisely that
the functor (10.6) is fully faithful.
It remains to compute the essential image of the functor \(\Fun(A,P)\to\Fun(A^\simeq, P)\). If \(f^\simeq\colon A^\simeq \to P\) is obtained from a functor \(f\colon A\to P\), then it satisfies \(f(a)\leq f(a')\) for each arrow \(a\to a'\). To prove the converse, assume that we have a functor \(f^\simeq\colon A^\simeq\to P^\simeq\), written \(a \mapsto f_a\), satisfying \(f_a\leq f_{a'}\) whenever there is an arrow \(a\to a'\) in \(A\). Our task is to extend this objectwise functor to a functor \(f\colon A\to P\).
Note that since \(P\) is a poset, we have the subanima \[ \Gamma\coloneqq \{(p,a)\mid p\leq f_a\} \subseteq P^\simeq\times A^\simeq, \] If \(p\leq f_a\) and \(a\to a'\), then \(p\leq f_a\leq f_{a'}\). Hence \(\Gamma\) satisfies the condition of Lemma 10.3.6, so that the projection \[ \langle (p,a) \mid p \leq f_a \rangle\subseteq P\times A\to A \] is a cocartesian fibration. The fiber over \(a\) is the slice poset \(P_{/f_a}\), whose terminal object is \(\id_{f_a}\). Thus the object \((f_a, a)\) is terminal in its fiber, so that by functoriality of universals they assemble to a functor \(f\colon A\to P\) extending the original family \((f_a)_{a:A^\simeq}\).
A fully faithful functor induces an embedding on groupoid cores by Corollary 6.4.2; equivalently, its object map has proposition-valued fibers, so the functor is an embedding. Thus (4) implies (5). Specializing the latter condition to \(A=[1]\), and then passing to groupoid cores and using \([1]^\simeq = \{0\}\sqcup\{1\}\) proves (2).
The implication from (3) to (6) follows by pulling back the fully faithful source-target functor along \(P\times\{x\}\to P\times P\). Since every fully faithful functor is an embedding, (6) implies (7). Finally, assume (7). If \(P_{/x}\to P\) is an embedding, then, for each object \(y\) of \(P\), we get by pullback an embedding of the form \[ P(y,x)\hookrightarrow *\, . \] Doing this for all \(x : P^\simeq\) proves (1).
From Section 10.3, Posets.