Monoid
From Maths
Not to be confused with group
Definition
A monoid[1] is a set S and a function ×S:S×S→S (called the operation) such that ×S is:
- Associative - that is ∀x,y,z∈S[(xy)z=x(yz)]
- Has identity element - that is ∃e∈S∀x∈S[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,y∈S[xy=yx]
See also
References
- Jump up ↑ Algebra - Serge Lang - Revised Third Edition - Graduate Texts In Mathematics