We usually say that a monoid is just a category with only one object. Thus, for every monoid $M$, viewed in as a category, there corresponds a monoid $M$ in the category of monoids and vice-versa. But this a little bit vague, isn't? What machinery do we need to make this more elegant?
Is there a way to I establish that $M \in \bf{\text{Mon}}$ and $M \in \bf{\text{Cat}}$ are equivalent? My guesses:
($\Rightarrow$) I think we can define a functor $F : \bf{\text{Mon}} \to \bf{\text{Cat}}$ that takes objects to themselves and each monoid homomorphisms to a functor between those monoids viewed as categories.
($\Leftarrow$) Really have no idea. What domain would this functor have?
Also, since $\bf{\text{Mon}}$ and $\bf{\text{Cat}}$ are different categories, is an isomorphism even possible?
Thanks!