Difference between revisions of "Free monoid generated by"

Revision as of 13:58, 20 July 2016

Be sure to check Discussion of the free monoid and free semigroup generated by a set, as there are some things to note

Definition

Given a set, $X$, there is a free monoid, $(F,*)$^[1].

• The elements of $F$ are all the finite tuples, $(x_1,\ldots,x_n)$ (where $x_i\in X$)
• The monoid operation ($*:F\times F\rightarrow F$) is concatenation:
  • $*:((x_1,\ldots,x_n),(y_1,\ldots,y_n))\mapsto(x_1,\ldots,x_n,y_1,\ldots,y_n)$
• The identity element of the monoid is:
  • $e=()$ - the "empty" tuple.

The proof that this is indeed a monoid is below

Examples

• This page can be considered an element of the monoid generated by the alphabet (union all the symbols too)

Proof that this is indeed a monoid

1. Associativity is trivial
2. Identity element being an identity element is trivial

(These might be good "low hanging fruit" for any newcomers)

References

1. Jump up ↑ Abstract Algebra - Pierre Antoine Grillet

Template:Monoid navbox