Processing math: 100%

Commutative monoids

Abbreviation: CMon

Definition

A \emph{commutative monoid} is a monoids M=M,,e such that

is commutative: xy=yx

Definition

A \emph{commutative monoid} is a structure M=M,,e, where is an infix binary operation, called the \emph{monoid product}, and e is a constant (nullary operation), called the \emph{identity element}, such that

is commutative: xy=yx

is associative: (xy)z=x(yz)

e is an identity for : ex=x

Morphisms

Let M and N be commutative monoids. A morphism from M to N is a function h:MN that is a homomorphism:

h(xy)=h(x)h(y), h(e)=e

Examples

Example 1: N,+,0, the natural numbers, with addition and zero. The finitely generated free commutative monoids are direct products of this one.

Basic results

Properties

Finite members

f(1)=1f(2)=2f(3)=5f(4)=19f(5)=78f(6)=421f(7)=2637

Subclasses

Superclasses

References


QR Code
QR Code commutative_monoids (generated for current page)