In abstract algebra, a branch of mathematics, a monoid is an algebraic structure with a single associative binary operation and an identity element. Monoids are studied in semigroup theory as they are semigroups with identity. Monoids occur in several branches of mathematics; for instance, they can be regarded as categories with a single object. Thus, they capture the idea of function composition within a set. Monoids are also commonly used in computer science, both in its foundational aspects and in practical programming. The set of strings built from a given set of characters is a free monoid. The transition monoid and syntactic monoid are used in describing finite state machines, whereas trace monoids and history monoids provide a foundation for process calculi and concurrent computing. Some of the more important results in the study of monoids are the Krohn–Rhodes theorem and the star height problem. The history of monoids, as well as a discussion of additional general properties, are found in the article on semigroups.
Definition
A monoid is a set, S, together with a binary operation • that satisfies the following three axioms:
 Closure
 For all a, b in S, the result of the operation a • b is also in S.
 Associativity
 For all a, b and c in S, the equation (a • b) • c = a • (b • c) holds.
 Identity element
 There exists an element e in S, such that for all elements a in S, the equation e • a = a • e = a holds.
And in mathematical notation we can write these as
 Closure: $\backslash forall\; a,b\; \backslash in\; S:\; a\; \backslash bullet\; b\; \backslash in\; S$
 Associativity: $\backslash forall\; a,b,c\; \backslash in\; S:\; (a\; \backslash bullet\; b)\; \backslash bullet\; c\; =\; a\; \backslash bullet\; (b\; \backslash bullet\; c)$
 Identity element: $\backslash exists\; e\; \backslash in\; S:\; \backslash forall\; a\; \backslash in\; S:\; e\; \backslash bullet\; a\; =\; a\; \backslash bullet\; e\; =\; a$.
More compactly, a monoid is a semigroup with an identity element. It can also be thought of as a magma with associativity and identity. A monoid with invertibility property is a group.
The symbol for the binary operation is commonly omitted; for example the monoid axioms require $(ab)c\; =\; a(bc)$ and $ea=ae=a$. This does not necessarily mean the variables are numbers being multiplied, any operation or elements may be used if they are well defined.
Monoid structures
Submonoids
A submonoid of a monoid (M, •) is a subset N of M that is closed under the monoid operation and contains the identity element e of M.^{[1]}^{[2]} Symbolically, N is a submonoid of M if N ⊆ M, x • y ∈ N whenever x, y ∈ N, and e ∈ N. N is thus a monoid under the binary operation inherited from M.
Generators
A subset S of M is said to be a generator of M if M is the smallest set containing S that is closed under the monoid operation, or equivalently M is the result of applying the finitary closure operator to S. If there is a generator of M that has finite cardinality, then M is said to be finitely generated. Not every set S will generate a monoid, as the generated structure may lack an identity element.
Commutative monoid
A monoid whose operation is commutative is called a commutative monoid (or, less commonly, an abelian monoid). Commutative monoids are often written additively. Any commutative monoid is endowed with its algebraic preordering ≤, defined by x ≤ y if there exists z such that x + z = y. An orderunit of a commutative monoid M is an element u of M such that for any element x of M, there exists a positive integer n such that x ≤ nu. This is often used in case M is the positive cone of a partially ordered abelian group G, in which case we say that u is an orderunit of G.
Partially commutative monoid
A monoid for which the operation is commutative for some, but not all elements is a trace monoid; trace monoids commonly occur in the theory of concurrent computation.
Examples
 Every singleton set {x} closed under a binary operation • forms the trivial (oneelement) monoid, which is also the trivial group.
 Every group is a monoid and every abelian group a commutative monoid.
 Every bounded semilattice is an idempotent commutative monoid.
 In particular, any bounded lattice can be endowed with both a meet and a join monoid structure. The identity elements are the lattice's top and its bottom, respectively. Being lattices, Heyting algebras and Boolean algebras are endowed with these monoid structures.
 Any semigroup S may be turned into a monoid simply by adjoining an element e not in S and defining e • s = s = s • e for all s ∈ S. This conversion of any semigroup to the monoid is done by the free functor between the category of semigroups and the category of monoids .
 Thus, an idempotent monoid (sometimes known as findfirst) may be formed by adjoining an identity element e to the left zero semigroup over a set S. The opposite monoid (sometimes called findlast) is formed from the right zero semigroup over S.
 Adjoin an identity e to the leftzero semigroup with two elements {lt; gt}. Then the resulting idempotent monoid {lt; e; gt} models the lexicographical order of a sequence given the orders of its elements, with e representing equality.
 The natural numbers, N, form a commutative monoid under addition (identity element zero), or multiplication (identity element one). A submonoid of N under addition is called a numerical monoid.
 The positive integers, N ∖ {0}, form a commutative monoid under multiplication (identity element one).
 The elements of any unital ring, with addition or multiplication as the operation.
 The set of all finite strings over some fixed alphabet Σ forms a monoid with string concatenation as the operation. The empty string serves as the identity element. This monoid is denoted Σ^{∗} and is called the free monoid over Σ.
 Given any monoid M, the opposite monoid M^{op} has the same carrier set and identity element as M, and its operation is defined by x •^{op} y = y • x. Any commutative monoid is the opposite monoid of itself.
 Given two sets M and N endowed with monoid structure (or, in general, any finite number of monoids, M_{1}, ..., M_{k}), their cartesian product M × N is also a monoid (respectively, M_{1} × ... × M_{k}). The associative operation and the identity element are defined pairwise.^{[4]}
 Fix a monoid M. The set of all functions from a given set to M is also a monoid. The identity element is a constant function mapping any value to the identity of M; the associative operation is defined pointwise.
 Fix a monoid M with the operation • and identity element e, and consider its power set P(M) consisting of all subsets of M. A binary operation for such subsets can be defined by S • T = { s • t : s ∈ S, t ∈ T }. This turns P(M) into a monoid with identity element {e}. In the same way the power set of a group G is a monoid under the product of group subsets.
 Let S be a set. The set of all functions S → S forms a monoid under function composition. The identity is just the identity function. It is also called the full transformation monoid of S. If S is finite with n elements, the monoid of functions on S is finite with n^{n} elements.
 Generalizing the previous example, let C be a category and X an object in C. The set of all endomorphisms of X, denoted End_{C}(X), forms a monoid under composition of morphisms. For more on the relationship between category theory and monoids see below.
 The set of homeomorphism classes of compact surfaces with the connected sum. Its unit element is the class of the ordinary 2sphere. Furthermore, if a denotes the class of the torus, and b denotes the class of the projective plane, then every element c of the monoid has a unique expression the form c = na + mb where n is the integer ≥ 0 and m = 0, 1, or 2. We have 3b = a + b.
 Let $\backslash langle\; f\backslash rangle$ be a cyclic monoid of order n, that is, $\backslash langle\; f\backslash rangle\; =\; \backslash \{f^0,f^1,\backslash dots,f^\{n1\}\backslash \}$. Then $f^n\; =\; f^k$ for some $0\; \backslash le\; k\; \backslash le\; n$. In fact, each such k gives a distinct monoid of order n, and every cyclic monoid is isomorphic to one of these.
Moreover, f can be considered as a function on the points $\backslash \{0,1,2,\backslash dots,n1\backslash \}$ given by
 $\backslash begin\{bmatrix\}$
0 & 1 & 2 & \dots & n2 & n1 \\
1 & 2 & 3 & \dots & n1 & k\end{bmatrix}
or, equivalently
 $f(i):=\; \backslash begin\{cases\}\; i+1,\; \backslash mbox\{if\; \}\; 0\; \backslash le\; i\; n1\; \backslash \backslash \; k,\; \backslash mbox\{if\; \}\; i\; =\; n1.\; \backslash end\{cases\}$
Multiplication of elements in $\backslash langle\; f\backslash rangle$ is then given by function composition.
Note also that when $k\; =\; 0$ then the function f is a permutation of $\backslash \{0,1,2,\backslash dots,n1\backslash \}$
and gives the unique cyclic group of order n.
Properties
In a monoid, one can define positive integer powers of an element x : x^{1} = x, and x^{n} = x • ... • x (n times) for n > 1 . The rule of powers x^{n + p} = x^{n} • x^{p} is obvious.
From the definition of a monoid, one can show that the identity element e is unique. Then, for any x, one can set x^{0} = e and the rule of powers is still true with nonnegative exponents.
It is possible to define invertible elements: an element x is called invertible if there exists an element y such that x • y = e and y • x = e. The element y is called the inverse of x. If y and z are inverses of x, then by associativity y = (zx)y = z(xy) = z. Thus inverses, if they exist, are unique.^{[5]}
If y is the inverse of x, one can define negative powers of x by setting x^{−1} = y and x^{−n} = y • ... • y (n times) for n > 1. And the rule of exponents is still verified for all n, p rational integers. This is why the inverse of x is usually written x^{−1}. The set of all invertible elements in a monoid M, together with the operation •, forms a group. In that sense, every monoid contains a group (possibly only the trivial group consisting of only the identity).
However, not every monoid sits inside a group. For instance, it is perfectly possible to have a monoid in which two elements a and b exist such that a • b = a holds even though b is not the identity element. Such a monoid cannot be embedded in a group, because in the group we could multiply both sides with the inverse of a and would get that b = e, which isn't true. A monoid (M, •) has the cancellation property (or is cancellative) if for all a, b and c in M, a • b = a • c always implies b = c and b • a = c • a always implies b = c. A commutative monoid with the cancellation property can always be embedded in a group via the Grothendieck construction. That's how the additive group of the integers (a group with operation +) is constructed from the additive monoid of natural numbers (a commutative monoid with operation + and cancellation property). However, a noncommutative cancellative monoid need not be embeddable in a group.
If a monoid has the cancellation property and is finite, then it is in fact a group. Proof: Fix an element x in the monoid. Since the monoid is finite, x^{n} = x^{m} for some m > n > 0. But then, by cancellation we have that x^{m − n} = e where e is the identity. Therefore x • x^{m − n − 1} = e, so x has an inverse.
The right and leftcancellative elements of a monoid each in turn form a submonoid (i.e. obviously include the identity and not so obviously are closed under the operation). This means that the cancellative elements of any commutative monoid can be extended to a group.
It turns out that requiring the cancellative property in a monoid is not required to perform the Grothendieck construction – commutativity is sufficient. However, if the original monoid has an absorbing element then its Grothendieck group is the trivial group. Hence the homomorphism is, in general, not injective.
An inverse monoid is a monoid where for every a in M, there exists a unique a^{−1} in M such that a = a • a^{−1} • a and a^{−1} = a^{−1} • a • a^{−1}. If an inverse monoid is cancellative, then it is a group.
Acts and operator monoids
Let M be a monoid, with the binary operation denoted by • and the identity element denoted by e. Then a (left) Mact (or left act over M) is a set X together with an operation ⋅ : M × X → X which is compatible with the monoid structure as follows:
 for all x in X: e ⋅ x = x;
 for all a, b in M and x in X: a ⋅ (b ⋅ x) = (a • b) ⋅ x.
This is the analogue in monoid theory of a (left) group action. Right Macts are defined in a similar way. A monoid with an act is also known as an operator monoid. Important examples include transition systems of semiautomata. A transformation semigroup can be made into an operator monoid by adjoining the identity transformation.
Monoid homomorphisms
File:Exponentiation as monoid homomorphism.pdf
A homomorphism between two monoids (M, ∗) and (N, •) is a function f : M → N such that
 f(x ∗ y) = f(x) • f(y) for all x, y in M
 f(e_{M}) = e_{N},
where e_{M} and e_{N} are the identities on M and N respectively. Monoid homomorphisms are sometimes simply called monoid morphisms.
Not every semigroup homomorphism is a monoid homomorphism, since it may not map the identity to the identity of the target monoid, even though the element it maps the identity to will be an identity of the image of the mapping. In contrast, a semigroup homomorphisms between groups is always a group homomorphism, as it it necessarily preserves the identity. Since for monoids this isn't always true, it is necessary to state this as a separate requirement.
A bijective monoid homomorphism is called a monoid isomorphism. Two monoids are said to be isomorphic if there is a monoid isomorphism between them.
Equational presentation
Monoids may be given a presentation, much in the same way that groups can be specified by means of a group presentation. One does this by specifying a set of generators Σ, and a set of relations on the free monoid Σ^{∗}. One does this by extending (finite) binary relations on Σ^{∗} to monoid congruences, and then constructing the quotient monoid, as above.
Given a binary relation R ⊂ Σ^{∗} × Σ^{∗}, one defines its symmetric closure as R ∪ R^{−1}. This can be extended to a symmetric relation E ⊂ Σ^{∗} × Σ^{∗} by defining x ~_{E} y if and only if x = sut and y = svt for some strings u, v, s, t ∈ Σ^{∗} with (u,v) ∈ R ∪ R^{−1}. Finally, one takes the reflexive and transitive closure of E, which is then a monoid congruence.
In the typical situation, the relation R is simply given as a set of equations, so that $R=\backslash \{u\_1=v\_1,\backslash cdots,u\_n=v\_n\backslash \}$. Thus, for example,
 $\backslash langle\; p,q\backslash ,\backslash vert\backslash ;\; pq=1\backslash rangle$
is the equational presentation for the bicyclic monoid, and
 $\backslash langle\; a,b\; \backslash ,\backslash vert\backslash ;\; aba=baa,\; bba=bab\backslash rangle$
is the plactic monoid of degree 2 (it has infinite order). Elements of this plactic monoid may be written as $a^ib^j(ba)^k$ for integers i, j, k, as the relations show that ba commutes with both a and b.
Relation to category theory
Grouplike structures


Totality* 
Associativity 
Identity 
Inverses 
Commutativity

Magma

Yes 
No 
No 
No 
No

Semigroup

Yes 
Yes 
No 
No 
No

Monoid

Yes 
Yes 
Yes 
No 
No

Group

Yes 
Yes 
Yes 
Yes 
No

Abelian Group

Yes 
Yes 
Yes 
Yes 
Yes

Loop

Yes 
No 
Yes 
Yes** 
No

Quasigroup

Yes 
No 
No 
No 
No

Groupoid

No 
Yes 
Yes 
Yes 
No

Category

No 
Yes 
Yes 
No 
No

Semicategory

No 
Yes 
No 
No 
No


*Closure, which is used in many sources to define grouplike structures, is an equivalent axiom to totality, though defined differently.


**Each element of a loop has a left and right inverse, but these need not coincide.

Monoids can be viewed as a special class of categories. Indeed, the axioms required of a monoid operation are exactly those required of morphism composition when restricted to the set of all morphisms whose source and target is a given object.^{[6]} That is,
 A monoid is, essentially, the same thing as a category with a single object.
More precisely, given a monoid (M, •), one can construct a small category with only one object and whose morphisms are the elements of M. The composition of morphisms is given by the monoid operation •.
Likewise, monoid homomorphisms are just functors between single object categories.^{[6]} So this construction gives an equivalence between the category of (small) monoids Mon and a full subcategory of the category of (small) categories Cat. Similarly, the category of groups is equivalent to another full subcategory of Cat.
In this sense, category theory can be thought of as an extension of the concept of a monoid. Many definitions and theorems about monoids can be generalised to small categories with more than one object. For example, a quotient of a category with one object is just a quotient monoid.
Monoids, just like other algebraic structures, also form their own category, Mon, whose objects are monoids and whose morphisms are monoid homomorphisms.^{[6]}
There is also a notion of monoid object which is an abstract definition of what is a monoid in a category. A monoid object in Set is just a monoid.
Monoids in computer science
In computer science, many abstract data types can be endowed with a monoid structure. In a common pattern, a sequence of elements of a monoid is "folded" or "accumulated" to produce a final value. For instance, many iterative algorithms need to update some kind of "running total" at each iteration; this pattern may be elegantly expressed by a monoid operation. Alternatively, the associativity of monoid operations ensures that the operation can be parallelized by employing a prefix sum or similar algorithm, in order to utilize multiple cores or processors efficiently.
Given a sequence of values of type M with identity element $\backslash varepsilon$ and associative operation $*$, the fold operation is defined as follows:
 $\backslash mathrm\{fold\}:\; M^\{*\}\; \backslash rarr\; M\; =\; l\; \backslash mapsto\; \backslash begin\{cases\}\; \backslash varepsilon\; \&\; \backslash mbox\{if\; \}\; l\; =\; \backslash mathrm\{nil\}\; \backslash \backslash \; m\; *\; \backslash mathrm\{fold\}\; \backslash ,\; l\text{'}\; \&\; \backslash mbox\{if\; \}\; l\; =\; \backslash mathrm\{cons\}\; \backslash ,\; m\; \backslash ,\; l\text{'}\; \backslash end\{cases\}$
In addition, any data structure can be 'folded' in a similar way, given a serialization of its elements. For instance, the result of "folding" a binary tree might differ depending on preorder vs. postorder tree traversal.
See also