Proposition (Cancellation laws). Let GG be a and let a,b,cGa,b,c\in G.

  • (Left cancellation) If ab=acab=ac, then b=cb=c.
  • (Right cancellation) If ba=caba=ca, then b=cb=c.
Equivalent characterizations

Equivalently, for each aGa\in G, the translations La(x)=axL_a(x)=ax and Ra(x)=xaR_a(x)=xa are injective.

Remarks

Cancellation follows by multiplying by a1a^{-1} on the appropriate side.