free semigroup
Let be a set.We define the power of in a language-theoretical manner as
for all , and
where .Note that the set is not necessarily an alphabet,that is, it may be infinite; for example, we may choose .
We define the sets and as
and
The elements of are called words on ,and is called the empty word on .
We define the juxtaposition of two words as
where and ,with for each and .It is easy to see that the juxtaposition is associative,so if we equip and with itwe obtain respectively a semigroup and a monoid.Moreover, is the free semigroup on and is the free monoid on ,in the sense that they solve the following universal
mapping problem:given a semigroup (resp. a monoid )and a map (resp. ),a semigroup homomorphism (resp. a monoid homomorphism )exists such that the following diagram commutes:
(resp.
), where (resp. )is the inclusion map.It is well known from universal algebra
that and are unique up to isomorphism
.
References
- 1 J.M. Howie,Fundamentals of Semigroup Theory,Oxford University Press, Oxford, 1991.