TheoremBase

Cancellation multiplies by an inverse and uses associativity; the two inverse identities are the corresponding facts about units of a monoid; the equations are solved by the displayed elements and the solutions are unique by cancellation.

Proof

Throughout, the operation of GG is associative (Semigroups (i)) and ee is its neutral element (Monoids (i)).

For (i), suppose ga=gbga=gb. Multiplying on the left by gβˆ’1g^{-1} and using associativity gives (gβˆ’1g)a=(gβˆ’1g)b(g^{-1}g)a=(g^{-1}g)b, that is, ea=ebea=eb, since gβˆ’1g=eg^{-1}g=e (Uniqueness of the Identity Element and of Inverses in a Group (ii)). Because ee is a neutral element of the operation (Uniqueness of the Identity Element and of Inverses in a Group (i)), this says a=ba=b. The right cancellation law is the mirror image: if ag=bgag=bg, multiplying on the right by gβˆ’1g^{-1} gives

a=ae=a(ggβˆ’1)=(ag)gβˆ’1=(bg)gβˆ’1=b(ggβˆ’1)=be=b.a=ae=a(gg^{-1})=(ag)g^{-1}=(bg)g^{-1}=b(gg^{-1})=be=b.

For (ii), the equation ee=eee=e says that ee is an inverse of ee, and by Uniqueness of the Identity Element and of Inverses in a Group (ii) it is the only one; that is, eβˆ’1=ee^{-1}=e.

For (iii), recall that every element of GG is a unit of the monoid (G,β‹…)(G,\cdot) (Groups and Abelian Groups (i)), and that by Uniqueness of the Identity Element and of Inverses in a Group (ii), applied to gg and to gβˆ’1g^{-1}, the group inverses of gg and of gβˆ’1g^{-1} are their inverses as units in the sense of Units of a Monoid (i). Hence (gβˆ’1)βˆ’1=g(g^{-1})^{-1}=g by Units of a Monoid: Unique Inverses, Products, and the Group of Units (iv).

For (iv), regard gg and hh as units of (G,β‹…)(G,\cdot) in the same way; then Units of a Monoid: Unique Inverses, Products, and the Group of Units (iii) gives (gh)βˆ’1=hβˆ’1gβˆ’1(gh)^{-1}=h^{-1}g^{-1}.

For (v), the element x=aβˆ’1bx=a^{-1}b solves ax=bax=b, since by associativity and Uniqueness of the Identity Element and of Inverses in a Group (ii)

a(aβˆ’1b)=(aaβˆ’1)b=eb=b.a(a^{-1}b)=(aa^{-1})b=eb=b.

If xx and xβ€²x' both solve ax=bax=b, then ax=axβ€²ax=ax', and x=xβ€²x=x' by (i). Symmetrically,

(baβˆ’1)a=b(aβˆ’1a)=be=b,(ba^{-1})a=b(a^{-1}a)=be=b,

and two solutions of xa=bxa=b agree by the right cancellation law of (i).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…