A monoid is a set 
equipped with an associative binary operation and an identity
element 
such that for all 
,
. Note that unlike a group,
its elements need not have inverses. It can also be thought of as a semigroup
with an identity element.
A monoid must contain at least one element.
A monoid whose binary operation is commutative
is called a commutative monoid.
See also
Binary Operator,
Commutative Monoid,
Free Idempotent Monoid,
Group,
Kiselman Monoid,
Semigroup,
Submonoid,
Word Morphism
Explore with Wolfram|Alpha
References
Lallement, G. Semigroups and Combinatorial Applications. New York: Wiley, 1979.Rosenfeld,
A. An
Introduction to Algebraic Structures. New York: Holden-Day, 1968.Sloane,
N. J. A. Sequence A005345/M1820
in "The On-Line Encyclopedia of Integer Sequences."Referenced
on Wolfram|Alpha
Monoid
Cite this as:
Weisstein, Eric W. "Monoid." From MathWorld--A
Wolfram Resource. https://mathworld.wolfram.com/Monoid.html
Subject classifications
