Monoid

From Maths
Jump to: navigation, search

Not to be confused with group

Definition

A monoid[1] is a set S and a function ×S:S×SS (called the operation) such that ×S is:

  • Associative - that is x,y,zS[(xy)z=x(yz)]
  • Has identity element - that is eSxS[ex=xe=x]

(Here xy denotes ×S(x,y) which being an operator would be written x×Sy)

Abelian monoid

A monoid is Abelian or commutative if:

  • x,yS[xy=yx]

See also

References

  1. Jump up Algebra - Serge Lang - Revised Third Edition - Graduate Texts In Mathematics