PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Revision difference : presentation of inverse monoids and inverse semigroups
Version 5 Version 4
\newcommand{\e}{\mathrm{e}} \newcommand{\e}{\mathrm{e}}
\newcommand{\co}{\mathrm{c}} \newcommand{\co}{\mathrm{c}}
\newcommand{\cbra}[1]{\left( #1 \right)} \newcommand{\cbra}[1]{\left( #1 \right)}
\newcommand{\qbra}[1]{\left[ #1 \right]} \newcommand{\qbra}[1]{\left[ #1 \right]}
\newcommand{\gbra}[1]{\left\{ #1 \right\}} \newcommand{\gbra}[1]{\left\{ #1 \right\}}
\newcommand{\abra}[1]{\left\langle #1 \right\rangle} \newcommand{\abra}[1]{\left\langle #1 \right\rangle}
\newcommand{\mipres}[2]{\mathrm{Inv}^1\abra{#1 | #2}} \newcommand{\mipres}[2]{\mathrm{Inv}^1\abra{#1 | #2}}
\newcommand{\sipres}[2]{\mathrm{Inv}\abra{#1 | #2}} \newcommand{\sipres}[2]{\mathrm{Inv}\abra{#1 | #2}}
\newcommand{\double}[1]{\cbra{#1\cup #1^{-1}}} \newcommand{\double}[1]{\cbra{#1\cup #1^{-1}}}
\newcommand{\doubles}[1]{\cbra{#1\cup #1^{-1}}^\ast} \newcommand{\doubles}[1]{\cbra{#1\cup #1^{-1}}^\ast}
\newcommand{\doublep}[1]{\cbra{#1\cup #1^{-1}}^+} \newcommand{\doublep}[1]{\cbra{#1\cup #1^{-1}}^+}
\newcommand{\fim}{\mathrm{FIM}} \newcommand{\fim}{\mathrm{FIM}}
\newcommand{\fis}{\mathrm{FIS}} \newcommand{\fis}{\mathrm{FIS}}
Let $\doubles{X}$ be the free monoid Let $\doubles{X}$ be the free monoid
with involution on $X$, and $T\subseteq \doubles X\times \doubles X$ be a binary relation between words. We denote by $T^\e$ [resp. $T^\co$] the equivalence relation [resp. congruence] generated by $T$. with involution on $X$, and $T\subseteq \doubles X\times \doubles X$ be a binary relation between words. We denote by $T^\e$ [resp. $T^\co$] the equivalence relation [resp. congruence] generated by $T$.
A \emph{presentation (for an inverse monoid)} is a couple $(X;T)$. We use this couple of objects to define an inverse monoid $\mipres{X}{T}$. Let $\rho_X$ be the Wagner congruence on $X$, we define the inverse monoid $\mipres{X}{T}$ \emph{presented} by $(X;T)$ as $$\mipres{X}{T}=\doubles{X}/(T\cup\rho_X)^\co.$$ A \emph{presentation (for an inverse monoid)} is a couple $(X;T)$. We use this couple of objects to define an inverse monoid $\mipres{X}{T}$. Let $\rho_X$ be the Wagner congruence on $X$, we define the inverse monoid $\mipres{X}{T}$ \emph{presented} by $(X;T)$ as $$\mipres{X}{T}=\doubles{X}/(T\cup\rho_X)^\co.$$
In the previous dicussion, if we replace everywhere $\doubles X$ with $\doublep X$ we obtain a \emph{presentation (for an inverse semigroup)} $(X;T)$ and an inverse semigroup $\sipres{X}{T}$ \emph{presented} by $(X;T)$. In the previous dicussion, if we replace everywhere $\doubles X$ with $\doublep X$ we obtain a \emph{presentation (for an inverse semigroup)} $(X;T)$ and an inverse semigroup $\sipres{X}{T}$ \emph{presented} by $(X;T)$.
A trivial but important example is the Free Inverse Monoid [resp. Free Inverse Semigroup] on $X$, that is usually denoted by $\fim(X)$ [resp. $\fis(X)$] and is defined by $$\fim(X)=\mipres{X}{\varnothing}=\doubles{X}/\rho_X,\ \ \mbox{[resp. $\fis(X)=\sipres{X}{\varnothing}=\doublep{X}/\rho_X$]}.$$ A trivial but important example is the Free Inverse Monoid [resp. Free Inverse Semigroup] on $X$, that is usually denoted by $\fim(X)$ [resp. $\fis(X)$] and is defined by $$\fim(X)=\mipres{X}{\varnothing}=\doubles{X}/\rho_X,\ \ \mbox{[resp. $\fis(X)=\sipres{X}{\varnothing}=\doublep{X}/\rho_X$]}.$$
\begin{thebibliography}{9} \begin{thebibliography}{9}
\bibitem{b:petrich} N. Petrich, \emph{Inverse Semigroups}, Wiley, New York, 1984. \bibitem{b:petrich} N. Petrich, \emph{Inverse Semigroups}, Wiley, New York, 1984.
\bibitem{b:steph} J.B. Stephen, \emph{Presentation of inverse monoids}, J. Pure Appl. Algebra 63 (1990) 81-112. \bibitem{b:steph} J.B. Stephen, \emph{Presentation of inverse monoids}, J. Pure Appl. Algebra 63 (1990) 81-112.
\end{thebibliography} \end{thebibliography}