Definition:Underlying Set Functor

Definition

Let $\mathbf{Set}$ be the category of sets.

Let $\mathbf C$ be a metacategory with:

A collection of sets as objects;

A collection of mappings as morphisms.

The underlying set functor $\left\vert{\cdot}\right\vert: \mathbf C \to \mathbf{Set}$ is defined in the following cases.

This article is complete as far as it goes, but it could do with expansion. In particular: more to come You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding this information. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Expand}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Category of Monoids

Let $\mathbf{Mon}$ be the category of monoids.

The underlying set functor $\left\vert{\cdot}\right\vert : \mathbf{Mon} \to \mathbf{Set}$ is the functor defined by:

			Object functor:		\(\ds \left\vert{\left({M, \circ}\right)}\right\vert := M \)
			Morphism functor:		\(\ds \left\vert{f}\right\vert := f \)