I has been given the definition of having a left adjoint:

A functor $U:\mathbf{C}\to\mathbf{D}$ has a left adjoint if for all $\mathbf{X} \in \mathbf{D}$, there exist $\mathbf{FX} \in \mathbf{C}$ and unit $\mathbf{ηx}: \mathbf{X}\to \mathbf{UFX}$ in $\mathbf{D}$ such that for all $\mathbf{A} \in \mathbf{C}$ and for all $\mathbf{f}: \mathbf{X}\to \mathbf{UA}$, there exists a unique map $\mathbf{g}: \mathbf{FX}\to \mathbf{A}$. such that the diagram commutes.

C is the category Monoid of monoids, D is the category Set and U is the forgetful functor.


What will be $\mathbf{FX}$, $\mathbf{ηx}$ and $\mathbf{g}$ in this case?

  • 1
    $\begingroup$ Hint: left adjoint to forgetful functor = free functor. So, what is a free monoid? $\endgroup$ – Ennar Feb 27 '17 at 21:09
  • 1
    $\begingroup$ so FX is the free monoid (set of lists of elements of the set X with monoid operation concatenation). What will ηx be? $\endgroup$ – F. Zhao Feb 27 '17 at 21:42
  • 1
    $\begingroup$ Well, what is the most natural list to assign to some element $x\in X$? $\endgroup$ – Ennar Feb 27 '17 at 21:44
  • $\begingroup$ Is it ηx: x -> {x}? $\endgroup$ – F. Zhao Feb 27 '17 at 21:47
  • 2
    $\begingroup$ Precisely. Now just prove everything checks out. $\endgroup$ – Ennar Feb 27 '17 at 21:48

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.