TL;DR: I want to check whether a forgetful functor $F: POSET \to SET$ that 'forgets' orders i.e. $F((X, \le)) = X, F(f: (X, \le) \to (X', \le')) = f: X \to X'$ has left and right adjoint.
Let $Set$ be category of sets and functions between them as morphisms. Let $POSET$ be category of partial orders and monotone morphisms between them that preserve orders.
Left adjoint is a functor $G: Set \to POSET$ such that for all objects $A \in Set, G(A) \in POSET$ is free over $A$. Right adjoint is the same, but with cofree objects.
Then there is adjunction functor theorem that states if $K'$ is locally small complete category, then a functor $F: K' \to K$ has a left adjoint iff $F$ is continous and for each $A \in K$ there exists a set $\{ f_i: A \to F(X_i), i \in I\}$ (of objects $X_i \in K'$ with morhisms $f_i: A \to F(X_i)$) such that for each $B \in K' and h: A \to F(B)$ for some $f: X_i \to B, i \in I$ we have $h = f \circ f_i$. But I don't understand the second requirement.
From what I understand the left adjoint of $F$ would be a functor $G: Set \to POSET$ that would map sets to discrete posets, but I am unsure about this.