deepdream of
          a sidewalk
Show Question
Math and science::Algebra::Aluffi

Groups. 3 basic lemmas.

This card covers three very basic and fundamental properties of groups.

The identity element is unique

If hG is an identity of G, then h=eG.

Proof. Let h and eG be identities of G. Then we have:

h=eGh=eG.

The inverse is unique

If h1,h2 are both inverses of g in G, then h1=h2.

Proof. Let h1,h2 be inverses of g. Then we have:

(h1g)h2=h2h1(gh2)=h1

By associativity, (h1g)h2=h1(gh2), so we must have h1=h2.

Cancellation

Let G be a group, and let a,g,hG. The following holds:

ga=hag=h,ag=ahg=h

Both cancellation statements follow easily by composing a1 and applying associativity. To appeal to intuition, note that (I think!) a isomorphism must be both monomorphic and epimorphic (be careful to note that the inverse implication doesn't hold). Being monomorphic, a doesn't allow any morphism to "hide" after a, like ga,ha. Being epimorphic, a doesn't allow any morphism to "hide" before a, like ag,ah.


Groups as pointed sets

Aluffi mentions that the first property implies that groups can be considered to be pointed sets. A function {}G from a singleton to G that selects the identity element has enough information to store both the set G itself and the information about which element is the identity. My though is though, surely the set G is sufficient alone as a datum, as the identity will be present and doesn't need to be "pointed out".

Fail to cancel

There are many set-operation pairs that do not satisfy cancellation, and thus cannot form groups. I think this statement is equivalent to saying, not every element has an inverse. (R,×), multiplication on the reals doesn't form a group, as 0 doesn't have an inverse (can't be canceled). (R{0},×) does form a group though.


Source

p43