This card covers three very basic and fundamental properties of groups.
The identity element is unique
If is an identity of , then .
Proof. Let and be identities of . Then we have:
The inverse is unique
If are both inverses of in , then .
Proof. Let be inverses of . Then we have:
By associativity, , so we must have
.
Cancellation
Let be a group, and let . The following holds:
Both cancellation statements follow easily by composing 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, doesn't allow any
morphism to "hide" after , like . Being epimorphic,
doesn't allow any morphism to "hide" before , like .
Groups as pointed sets
Aluffi mentions that the first property implies that groups can be considered
to be pointed sets. A function from a singleton to
that selects the identity element has enough information to store both
the set itself and the information about which element is the identity.
My though is though, surely the set 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. , multiplication
on the reals doesn't form a group, as 0 doesn't have an inverse (can't be
canceled). does form a group
though.