Theorem 10.3.10. The functor \begin{equation} F\colon \Poset \to \int_{S:\Set}\Set_{/S\times S} \tag{10.10}\end{equation} that maps \begin{equation} P\mapsto (P^\simeq, \Map([1],P)\to P^\simeq \times P^\simeq) \tag{10.11}\end{equation} is fully faithful; its essential image is the category of sets with partial order.

Proof

Abbreviate the codomain of \(F\) by \(\mathcal{R}\). To prove fully faithfulness, fix two posets \(P,Q\). We have a commutative triangle Commutative diagram; see the PDF for its LaTeX source of animae coming from the fact that the first component of \(F\) is just \((-)^\simeq\). We claim that for each \(g : \Set(P^\simeq,Q^\simeq)\) the respective fibers of the diagonal maps are logically equivalent propositions, and hence \(F_{P,Q}\) is an equivalence.

Using the characterization of posets (Lemma 10.3.7) the fiber on the left is the proposition \begin{equation} \prod_{p,p':P^\simeq} P(p,p') \to Q(gp,gp') \tag{10.13}\end{equation} and the fiber on the right is the anima of dashed lifs Commutative diagram; see the PDF for its LaTeX source which is a proposition because the right vertical map is an embedding. The two propositions (10.13) and (10.14) are equivalent by currying and uncurrying because \(\Map([1],P)\simeq\Sigma_{p,p':P^\simeq}P(p,p')\).

Clearly if \(P\) is a poset, then \(P(-,-)\) is a partial order on \(P^\simeq\). It remains to show that every partial order can be obtained this way. Let \((S,\leq)\) be a set with a partial order. We need to find a poset \(P\) with \((P^\simeq,\leq)\cong (S,\leq)\). Concretely, let \(P\subseteq \Fun(S,\Prop)\) be the full subcategory of those predicates \(U\colon S\to \Prop\) that are represented, i.e., satisfy the following property: \begin{equation} \sum_{u \in S} \prod_{s \in S} U(s) = (s\leq u) \tag{10.15}\end{equation} (A priori, this anima does not look like a property; but note that any two \(u,u'\in S\) representing \(U\) must satisfy \(u\leq u'\) (because \(U(u)\)) and \(u'\leq u\) (because \(U(u')\)), hence \(u=u'\) by antisymmetry.)

Since \(\Prop\) is a poset, so is \(P\). Moreover, we have a map of sets \begin{equation} S \to \Fun(S,\Prop),\quad s\mapsto (-\leq s) \tag{10.16}\end{equation} which tautologically factors through \(P\), hence yields a map \(S\to P^\simeq\). We claim that \(U\) is a poset isomorphism.

  • • The underlying map of sets is a bijection; the inverse maps a predicate \(U\) to its unique representing element.

  • • To show that this map is an isomorphism, it suffices to observe that for all \(s,t : S\) we have a logical equivalence \begin{equation} (s\leq t) \leftrightarrow \left(\prod_{x : S}\Prop((x\leq s), (x\leq t))\right) \simeq \Fun(S,\Prop)((-\leq s),(-\leq t)) \tag{10.17}\end{equation} of propositions; this is just a reformulation of reflexivity and transitivity of \(\leq\).

From Section 10.3, Posets.