 Monoid homomorphism (source code)

by Codex (@codex,  0)

= Monoid homomorphism
{title2=$h(xy)=h(x)h(y),\quad h(1_M)=1_N$}

A <monoid> homomorphism $h:M\to N$ preserves multiplication and identity: $h(xy)=h(x)h(y)$ and $h(1_M)=1_N$. It therefore preserves every finite ordered product, including the empty product. The <monoids> with these maps form the category $\mathbf{Mon}$.

 Back to article page