Functors between sets, posets, and groups I found the following statements in some lecture notes in category theory:

A functor between sets $S$ and $T$ is a function from $S$ to $T$
A functor between two groups $G$ and $H$ is a group homomorphism from $G$ to $H$
A functor between two posets $P$ and $Q$ is a monotone function from $P$ to $Q$


*

*Consider the second statement. A group was defined as a category with one object in which every arrow is an isomorphism. Then what is the definition of a group homomorphism in this setting? What exactly do I need to check to establish the claim?
Here is what I have. Suppose $G$ is the category with object $\ast$ and $H$ is a category with object $\clubsuit$ and let $\alpha:G\to H$ be a functor. By the definition of a functor, $\alpha(\ast)=\clubsuit$, and if $g:\ast\to \ast$ is an arrow in $G$, then $\alpha(g):\clubsuit\to \clubsuit$ is an arrow in $H$. The remaining conditions on $\alpha $ are: $\alpha(g_1\circ g_2)=\alpha(g_1)\circ \alpha(g_2)$ and $\alpha(id_\ast)=id_\clubsuit$.  But without knowing the definition of a group homomorphism when a group is defined as a category, I don't know how to proceed.


*A poset can also be considered as a skeletal preorder. (A preorder is a category in which there is at most one arrow between any two objects.) In this definition, what is the definition of a monotone map between such categories?


*A set is a category where the objects are the elements of a set and the only arrows are the identity arrows. What is a function between such categories?
 A: A category $\mathbf{C}$ is a collection of objects, $Ob(\mathbf{C})$, and for each $x,y\in Ob(\mathbf{C})$, a collection of arrows $\mathbf{C}(x,y)$ satisfying a number of conditions (existence of identity arrows, a partially defined associative operation of composition, etc). 
A functor $\mathcal{F}$ between two categories $\mathbf{C}$ and $\mathbf{D}$ is a function $\mathcal{F}\colon Ob(\mathbf{C})\to
Ob(\mathbf{D})$, and for each $x,y\in Ob(\mathbf{C})$ a function $\mathcal{F}\colon\mathbf{C}(x,y)\to \mathbf{D}(\mathcal{F}(x),\mathcal{F}(y))$ that maps the identity arrows to the identity arrows and respects composition (so $\mathcal{F}(g\circ f) = \mathcal{F}(g)\circ\mathcal{F}(h)$).


*

*Given a set $S$ (in the usual sense of “set”), we can define a category associated to set $S$, call it $\mathbf{S}$, in which $Ob(\mathbf{S}) = S$ (so the objects of the category are the elements of $S$), and where the arrow collection is defined by letting $\mathbf{S}(x,y)=\varnothing$ if $x\neq y$, and $\mathbf{S}(x,x) = \{\mathrm{id}_x\}$.
Now suppose that $S$ and $T$ are sets. If $f\colon S\to T$ is a function as we usually understand it, then we can use $f$ to define a functor between the categories $\mathbf{S}$ and $\mathbf{T}$ associated to $S$ and $T$: use $f$ to maps $Ob(\mathbf{S})$ to $Ob(\mathbf{T})$; when $x\neq y$, the empty map sends $\mathbf{S}(x,y)$ to $\mathbf{T}(f(x),f(y))$; and we map the identity arrow $\mathrm{id}_x\in \mathbf{S}(x,x)$ to the identity arrow in $\mathbf{T}(f(x),f(x))$. Verify that this is a functor.
Conversely, suppose we have a functor $\mathcal{F}$ from the category $\mathbf{S}$ associated to $S$ to the category $\mathbf{T}$ associated to $T$. This means a function $\mathcal{F}\colon Ob(\mathbf{S})\to Ob(\mathbf{T})$ (which amounts to a function from $S$ to $T$), and a map of arrow sets; since the arrow sets are either empty or the identity, the part on arrows is obvious. 
Thus, to every set function $f\colon S\to T$ we get a functor $\mathcal{F}\colon\mathbf{S}\to\mathbf{T}$, and to every functor $\mathcal{F}\colon\mathbf{S}\to\mathbf{T}$ you get a set function $\mathcal{F}\colon S=Ob(\mathbf{S}) \to Ob(\mathbf{T})=T$. Verify that in fact these two associations are inverses of each other: if you start with a function, get the functor from it, and then the function from the functor, you get back the original function. If you start with a functor, get the function from it, and then the functor from the function, you get the original functor. Thus, the functors between $\mathbf{S}$ and $\mathbf{T}$ are really the same thing as the set maps between $S$ and $T$.

*Similarly for groups-as-a-category. If $G$ is a group, you associate to it a category $\mathbf{G}$ whose object set is a single element $\star$, and whose only arrow set, $\mathbf{G}(\star,\star)$ has one arrow for each element of $G$, with composition given by multiplication in $G$: if $a_g,a_h$ are arrows, corresponding to the elements $g$ and $h$ in $G$, then the composition $a_g\circ a_h$ is the arrow corresponding to the element $gh$, that is, $a_g\circ a_h = a_{gh}$. Here, $a_e=\mathrm{id}_{\star}$.
If $f\colon G\to H$ is a group homomorphism, you get a functor between the categories $\mathbf{G}$ and $\mathbf{H}$ by mapping the obect of $\mathbf{G}$ to the object of $\mathbf{H}$, and mapping the arrow $a_g$ in $\mathbf{G}$ to the arrow $a_{f(g)}$ of $\mathbf{H}$. Verify that this association respects composition, so that you get a functor from $\mathbf{G}$ to $\mathbf{H}$.
Conversely, given a functor $\mathcal{F}\colon\mathbf{G}\to\mathbf{H}$, you get a map from the arrow of $\mathbf{G}$ to the arrows of $\mathbf{H}$, which must satisfy $\mathcal{F}(a_{gh}) = \mathcal{F}(a_g\circ a_h) = \mathcal{F}(a_g)\circ\mathcal{F}(a_h)$. Suppose that this map sends the arrow $a_g$ to an arrow in $\mathbf{H}$, which corresponds to some element of $H$; call this element $f(g)$, so that we get a (set theoretic) function from $G$ ot $H$. Verify that this function $f\colon G\to H$ defined by $f$ is in fact a group morphism. 
Finally, verify that these assignments (morphism to functor, functor to morphism) are inverses to each other, so that defining functors between the categories $\mathbf{G}$ and $\mathbf{H}$ amounts to the same thing as defining a group homomorphism from $G$ to $H$.

*If $P$ is a poset, then we can define a category $\mathbf{P}$ associated to $P$ by letting $Ob(\mathbf{P}) = P$, and for $x,y\in P$, letting $\mathbf{P}(x,y)$ be the empty set if $x\not\leq_P y$, and letting $\mathbf{P}(x,y)$ be a singleton if $x\leq y$. With this definition, every monotone function $f\colon P\to Q$ of posets defines a functor between the categories $\mathbf{P}$ and $\mathbf{Q}$: you use $f$ to define the map between objects of $\mathbf{P}$ and $\mathbf{Q}$. When $x\not\leq_P y$, then you need a map from the empty set $\mathbf{P}(x,y)$ to the set $\mathbf{Q}(f(x),f(y))$, which is the empty map. When $x\leq_P y$, since $f$ is monotone we have $f(x)\leq_Q f(y)$, so you need a map from the singleton set $\mathbf{P}(x,y)$ to the singleton set $\mathbf{Q}(f(x),f(y))$, which is just the only possible function: sends the single element of the first to the single element of the latter.
And every functor $\mathcal{F}\colon\mathbf{P}\to\mathbf{Q}$ defines a function between $P$ and $Q$ (by looking at what it does to objects); you need to verify that this function is monotone. This will follow from the fact that $\mathcal{F}$ is a functor: if $x\leq_P y$, then you must have a map from the singleton set $\mathbf{P}(x,y)$ to the set $\mathbf{Q}(\mathcal{F}(x),\mathcal{F}(y))$. Therefore, the latter cannot be empty, which means that we must have $\mathcal{F}(x)\leq_Q\mathcal{F}(y)$. Thus, the function is in fact monotone: if $x\leq_P y$, then $\mathcal{F}(x)\leq_Q \mathcal{F}(y)$.
These assignments (monotone function to functor, functor to monotone function) are inverses of each other, so that functors between $\mathbf{P}$ and $\mathbf{Q}$ are essentially the same thing as monotone functions between $P$ and $Q$.
That is what those comments are saying.
A: The point is that these three statements cannot be read literally. Classically, sets, groups and posets are not categories. They have their own definitions in the framework of set theory, which are different from those you can find in introductory texts on category theory. 
The standard meaning of the cliché "[things of the type $X$] are [things of the type $Y$]" in category theory is that the category of all things of the type $X$ and the category of all things of the type $Y$ are equivalent. Therefore, in order to check these statements, one should construct equivalences between some categories. 
Example 1. The category of sets and mappings (functions) between them $\mathbf{Set}$ is equivalent to the category of discrete categories and functors between them $\mathbf{DiskCat}$, hence we can say "sets are discrete categories", "mappings (functions) are functors between discrete categories".
Example 2. The category of groups and homomorphisms between them $\mathbf{Grp}$ is equivalent to the category of groupoids with one object (groupoid=category, where all morphisms are isomorphisms) and functors between them $\mathbf{OneObjGrpd}$, hence we can say "groups are groupoids with one object", "group homomorphisms are functors between groupoids with one object". See, for example, my answer about the same construction for monoids (if we consider the category of groupoids with fixed single object, then it will be even isomorphic to $\mathbf{Grp}$ with set-theoretic (universal-algebraic) definition of groups and group homomorphisms).
Example 3. The category of posets and monotonic mappings between them $\mathbf{Poset}$ is equivalent to the category of skeletal preorders and functors between them $\mathbf{SkPreord}$, hence we can say "posets are skeletal preorders", "monotonic mappings are functors between skeletal preorders". See, for example, the part of description of the same construction for prosets in another answer.
