Group theory and generalizations Definition
Free monoid
Definition
Let be a set, called the alphabet. A word over is a finite sequence with and each ; the word with is the empty word . The free monoid on is the set of all words over with the operation of concatenation, and with identity element .
Remarks
Concatenation is associative and is a two-sided identity, so is a monoid. Universal property: for every monoid and every map , there is exactly one monoid homomorphism with for , namely . A monoid is called free if it is isomorphic to some . The free semigroup is without the empty word.
Example: for , the map is an isomorphism from onto the monoid with .
Non-example: the monoid is not free. In a free monoid, forces , because lengths add; but in , with .
Reading path
To understand this page from the ground up, read these 15 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Monoid concept
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Function definition
- Free monoid definition
Further reading
About this page
| Tag | 27ZPTJP9PP |
|---|---|
| URI | m2://27ZPTJP9PP |
| Kind | definition |
| Writing | W0 stub |
| MSC | 20M05 |
| Defines | Free monoid |
| Uses | Monoid, Set, Function |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.