free semigroup
Let X be a set. We define the power of X in a language-theoretical manner as
Xn={x1x2…xn∣xj∈X for all j∈{1,…,n}} |
for all n∈ℕ∖{0}, and
X0={ε}, |
where ε∉X.
Note that the set X is not necessarily an alphabet,
that is, it may be infinite; for example, we may choose X=ℝ.
We define the sets X+ and X* as
X+=⋃n∈ℕ∖{0}Xn |
and
X*=⋃n∈ℕXn=X+∪{ε}. |
The elements of X* are called words on X,
and ε is called the empty word on X.
We define the juxtaposition of two words v,w∈X* as
vw=v1v2…vnw1w2…wm, |
where v=v1v2…vn and w=w1w2…wm,
with vi,wj∈X for each i and j.
It is easy to see that the juxtaposition is associative,
so if we equip X+ and X* with it
we obtain respectively a semigroup and a monoid.
Moreover, X+ is the free semigroup on X and X*
is the free monoid on X,
in the sense that they solve the following universal
mapping problem:
given a semigroup S (resp. a monoid M)
and a map Φ:X→S (resp. Φ:X→M),
a semigroup homomorphism ˉΦ:X+→S
(resp. a monoid homomorphism ˉΦ:X*→M)
exists such that the following diagram commutes:
\xymatrix&X\ar[r]ι\ar[d]Φ&X+\ar[dl]ˉΦ&S& |
(resp.
\xymatrix&X\ar[r]ι\ar[d]Φ&X*\ar[dl]ˉΦ&M& |
), where ι:X→X+ (resp. ι:X→X*)
is the inclusion map.
It is well known from universal algebra
that X+ and X* are unique up to isomorphism
.
References
- 1 J.M. Howie, Fundamentals of Semigroup Theory, Oxford University Press, Oxford, 1991.
Title | free semigroup |
Canonical name | FreeSemigroup |
Date of creation | 2013-03-22 16:11:41 |
Last modified on | 2013-03-22 16:11:41 |
Owner | yark (2760) |
Last modified by | yark (2760) |
Numerical id | 15 |
Author | yark (2760) |
Entry type | Definition |
Classification | msc 20M10 |
Classification | msc 20M05 |
Related topic | Word |
Defines | word |
Defines | empty word |
Defines | free semigroup |
Defines | free monoid |