Cancellation Theorem

Cancellation Theorem

Suppose G is a Group. Then we have left cancellation and right cancellation, defined as:

  1. If a,b,c∈G and a⋆b=a⋆c then b=c (left cancellation)
  2. If a,b,c∈G and b⋆a=c⋆a then b=c (right cancellation)
Note

We cannot say that a⋆b=c⋆a implies b=c (only when ⋆ is commutative).

Proof

Consider:

a⋆b=a⋆c

Now let α∈G be an inverse of a. Then:

α⋆(a⋆b)=α⋆(a⋆c) Apply to both sides(α⋆a)⋆b=(α⋆a)⋆c Associativity of Groupse⋆b=e⋆c Identity Elementb=c

Right cancellation is proved WLOG.

☐