Tour:Invertible implies cancellative in monoid

From Groupprops

This article adapts material from the main article: invertible implies cancellative in monoid

This page is part of the Groupprops guided tour for beginners (Jump to beginning of tour)
PREVIOUS: Equivalence of definitions of group| UP: Introduction two (beginners)| NEXT: Equivalence of definitions of subgroup
Expected time for this page: 5 minutes
General instructions for the tour | Pedagogical notes for the tour | Pedagogical notes for this part

WHAT YOU NEED TO DO:

  • Understand the statement below; try proving it yourself
  • Understand the proof, and the crucial way in which it relies on associativity

PONDER:

  • What happens if we remove the assumption of associativity? Can you cook up a magma (set with binary operation) having a neutral element, where an element has a left inverse but is not cancellative?


Statement

In a monoid (a set with an associative binary operation possessing a multiplicative identity element) the following are true:

Proof

We'll give here the proof for left invertible and left cancellative. An analogous proof works for right invertible and right cancellative.

Given: A monoid with binary operation , and identity element (also called neutral element) . has a left inverse (i.e. an element )

To prove: is left-cancellative: whenever are such that , then .

Proof: We start with:

Left-multiply both sides by :

Use associativity:

We now use that is the identity element, to conclude that .

This page is part of the Groupprops guided tour for beginners. Make notes of any doubts, confusions or comments you have about this page before proceeding.
PREVIOUS: Equivalence of definitions of group| UP: Introduction two (beginners)| NEXT: Equivalence of definitions of subgroup