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 : cancellative semigroup
Version current Version 5
Let $S$ be a semigroup. Let $S$ be a semigroup.
$S$ is \emph{left cancellative} if, for all $a,b,c\in S$, $ab=ac\Rightarrow b=c$\\ $S$ is \emph{left cancellative} if, for all $a,b,c\in S$, $ab=ac\Rightarrow b=c$\\
$S$ is \emph{right cancellative} if, for all $a,b,c\in S$, $ba=ca\Rightarrow b=c$ $S$ is \emph{right cancellative} if, for all $a,b,c\in S$, $ba=ca\Rightarrow b=c$
$S$ is \emph{cancellative} if it is both left and right cancellative. $S$ is \emph{cancellative} if it is both left and right cancellative.
\section{Relationship to some other types of semigroup} \section{Relationship to some other types of semigroup}
This is a generalisation of groups, and in fact being cancellative is a necessary condition for a semigroup to be embeddable in a group. This is a generalisation of groups, and in fact being cancellative is a necessary condition for a semigroup to be embeddable in a group.
Note that a non-empty semigroup is a group if and only if it is cancellative and regular. Note that a non-empty semigroup is a group if and only if it is cancellative and regular.
$S$ is \emph{weakly cancellative} if, for all $a,b,c\in S$, $(ab=ac~\&~ba=ca)\Rightarrow b=c$ $S$ is \emph{weakly cancellative} if, for all $a,b,c\in S$, $(ab=ac~\&~ba=ca)\Rightarrow b=c$
A semigroup is completely simple if and only if it is weakly cancellative and regular. A semigroup is completely simple if and only if it is weakly cancellative and regular.
\section{Individual elements} \section{Individual elements}
An element $x\in S$ is called \emph{left cancellative} if, for all $b,c\in S$, $xb=xc\Rightarrow b=c$\\ An element $x\in S$ is called \emph{left cancellative} if, for all $b,c\in S$, $xb=xc\Rightarrow b=c$\\
An element $x\in S$ is called \emph{right cancellative} if, for all $b,c\in S$, $bx=cx\Rightarrow b=c$ An element $x\in S$ is called \emph{right cancellative} if, for all $b,c\in S$, $bx=cx\Rightarrow b=c$