Product is Left Identity Therefore Left Cancellable

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $\struct {S, \circ}$ be a semigroup.

Let $e_L \in S$ be a left identity of $S$.


Let $a \in S$ such that:

$\exists b \in S: b \circ a = e_L$

Then $a$ is left cancellable in $\struct {S, \circ}$.


Proof

Let $x, y \in S$ be arbitrary.


Then:

\(\ds a \circ x\) \(=\) \(\ds a \circ y\)
\(\ds \implies \ \ \) \(\ds b \circ \paren {a \circ x}\) \(=\) \(\ds b \circ \paren {a \circ y}\)
\(\ds \implies \ \ \) \(\ds \paren {b \circ a} \circ x\) \(=\) \(\ds \paren {b \circ a} \circ y\) as $\struct {S, \circ}$ is a semigroup, $\circ$ is associative
\(\ds \implies \ \ \) \(\ds e_L \circ x\) \(=\) \(\ds e_L \circ y\) by hypothesis
\(\ds \implies \ \ \) \(\ds x\) \(=\) \(\ds y\) Definition of Left Identity

The result follows by definition of left cancellable.

$\blacksquare$


Also see


Sources