Difference between revisions of "Monoid"
From Encyclopedia of Mathematics
(Importing text file) |
Incnis Mrsi (talk | contribs) (wikification) |
||
| Line 1: | Line 1: | ||
| − | A term used as an abbreviation for the phrase | + | A term used as an abbreviation for the phrase "[[semi-group]] with [[identity element|identity]]" . Thus, a monoid is a set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m0647401.png" /> with an associative binary operation, usually called multiplication, in which there is an element <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m0647402.png" /> such that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m0647403.png" /> for any <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m0647404.png" />. The element <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m0647405.png" /> is called the identity (or unit) and is usually denoted by <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m0647406.png" />. In any monoid there is exactly one identity. If the operation given on the monoid is commutative, it is often called addition and the identity is called the zero and is denoted by <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m0647407.png" />. |
| − | Examples of monoids. 1) The set of all mappings of an arbitrary set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m0647408.png" /> into itself is a monoid relative to the operation of successive application (composition) of mappings. The identity mapping is the identity. 2) The set of endomorphisms of a [[ | + | Examples of monoids. 1) The set of all mappings of an arbitrary set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m0647408.png" /> into itself is a monoid relative to the operation of successive application (composition) of mappings. The identity mapping is the identity. 2) The set of endomorphisms of a [[universal algebra]] <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m0647409.png" /> is a monoid relative to composition; the identity is the identity endomorphism. 3) Every [[group]] is a monoid. |
Every semi-group <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474010.png" /> without an identity can be imbedded in a monoid. For this it suffices to take a symbol <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474011.png" /> not in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474012.png" /> and give a multiplication on the set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474013.png" /> as follows: <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474014.png" />, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474015.png" /> for any <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474016.png" />, and on elements from <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474017.png" /> the operation is as before. Every monoid can be represented as the monoid of all endomorphisms of some universal algebra. | Every semi-group <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474010.png" /> without an identity can be imbedded in a monoid. For this it suffices to take a symbol <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474011.png" /> not in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474012.png" /> and give a multiplication on the set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474013.png" /> as follows: <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474014.png" />, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474015.png" /> for any <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474016.png" />, and on elements from <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474017.png" /> the operation is as before. Every monoid can be represented as the monoid of all endomorphisms of some universal algebra. | ||
| − | An arbitrary monoid can also be considered as a [[ | + | An arbitrary monoid can also be considered as a [[category]] with one object. This allows one to associate with a monoid <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474018.png" /> its dual (opposite, adjoint) monoid <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474019.png" />. The elements of both monoids coincide, but the product of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474020.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474021.png" /> in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474022.png" /> is put equal to the product <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474023.png" /> in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474024.png" />. |
The development of the theory of monoids and adjoint functors has shown the utility of the definition of a monoid in so-called monoidal categories. Suppose given a category <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474025.png" /> equipped with a bifunctor <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474026.png" />, an object <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474027.png" /> and natural isomorphisms | The development of the theory of monoids and adjoint functors has shown the utility of the definition of a monoid in so-called monoidal categories. Suppose given a category <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474025.png" /> equipped with a bifunctor <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474026.png" />, an object <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474027.png" /> and natural isomorphisms | ||
| Line 19: | Line 19: | ||
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474035.png" /></td> </tr></table> | <table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474035.png" /></td> </tr></table> | ||
| − | If <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474036.png" /> is taken to be the | + | If <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474036.png" /> is taken to be the [[category of sets]], <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474037.png" /> the [[Cartesian product]], <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474038.png" /> a one-point set, and the isomorphisms <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474039.png" />, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474040.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474041.png" /> are chosen in the natural way (<img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474042.png" />, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064740/m06474043.png" />), then the second definition of a monoid turns out to be equivalent to the original definition. |
====References==== | ====References==== | ||
Revision as of 08:28, 17 May 2013
A term used as an abbreviation for the phrase "semi-group with identity" . Thus, a monoid is a set 
with an associative binary operation, usually called multiplication, in which there is an element 
such that 
for any 
. The element 
is called the identity (or unit) and is usually denoted by 
. In any monoid there is exactly one identity. If the operation given on the monoid is commutative, it is often called addition and the identity is called the zero and is denoted by 
.
Examples of monoids. 1) The set of all mappings of an arbitrary set 
into itself is a monoid relative to the operation of successive application (composition) of mappings. The identity mapping is the identity. 2) The set of endomorphisms of a universal algebra 
is a monoid relative to composition; the identity is the identity endomorphism. 3) Every group is a monoid.
Every semi-group 
without an identity can be imbedded in a monoid. For this it suffices to take a symbol 
not in 
and give a multiplication on the set 
as follows: 
, 
for any 
, and on elements from 
the operation is as before. Every monoid can be represented as the monoid of all endomorphisms of some universal algebra.
An arbitrary monoid can also be considered as a category with one object. This allows one to associate with a monoid 
its dual (opposite, adjoint) monoid 
. The elements of both monoids coincide, but the product of 
and 
in 
is put equal to the product 
in 
.
The development of the theory of monoids and adjoint functors has shown the utility of the definition of a monoid in so-called monoidal categories. Suppose given a category 
equipped with a bifunctor 
, an object 
and natural isomorphisms
 |
 |
satisfying coherence conditions. An object 
is called a monoid in the category 
if there are morphisms 
and 
such that the following diagrams are commutative:
 |
 |
If 
is taken to be the category of sets, 
the Cartesian product, 
a one-point set, and the isomorphisms 
, 
and 
are chosen in the natural way (
, 
), then the second definition of a monoid turns out to be equivalent to the original definition.
References
| [1] | A.H. Clifford, G.B. Preston, "Algebraic theory of semi-groups" , 1–2 , Amer. Math. Soc. (1961–1967) |
| [2] | S. MacLane, "Categories for the working mathematician" , Springer (1971) |
Comments
For monoidal categories, and particularly the coherence conditions that the isomorphisms 
, 
must satisfy cf. [1], Chapt. 7, Sects. 1-2.
How to Cite This Entry:
Monoid. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Monoid&oldid=18430
Monoid. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Monoid&oldid=18430
This article was adapted from an original article by M.Sh. Tsalenko (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article