in which we meet the group axioms.
After a quick wizz-through of the flavour and some applications of group theory, we explored in this first lecture what the examples of adding mod 3 and composing symmetries of a square have in common. This lead us to define a more abstract concept based on these common properties:
A group is a set with an operation satisfying
0. Closure : for all we have .
1. Identity: There is such that for all , we have .
2. Inverses: For each there is such that .
3. Associativity: For all , we have .
If the group also satisfies
4. Commutativity: For all , we have ,
then the group is called abelian.
We looked at several examples and counterexamples, and you can find more such to do yourself on the Practice Sheet A. Remember in particular the example of a non-associative operation, such as “to the power of”: .
Understanding today’s lecture
You will have to get used to using the axioms, so I strongly suggest you go through some (or even all!) of the exercises on Practice Sheet A. Also play around a little with symmetries of a square (or a regular triangle…) to get a feel for associativity and when things commute or not. If it’s all too easy for you (perhaps you’ve met groups before), then try the last question on Sheet A.
Preparing for Lecture 2:
The idea of making an abstract definition is that we can prove results just using these properties, rather than showing them for each example separately. We will start to explore this next time. For instance, in the examples we’ve seen, we always have a unique identity element. Do you think this is coincidence or an intrinsic property of any group? Perhaps you can try already whether you can prove it. How would you start? Another thing that we will find is unique is the inverse to a given group element.
Going a little deeper
We said fairly casually that an operation is a way of combining two elements to get a new element, for example addition of integers, composition of symmetries, etc. The formal definition is this:
An operation on a set is a function .
This means that we take an ordered pair of elements in the cartesian product and send that ordered pair to another element of : . This is the reason we have given the closure axiom the number 0: it is really already contained in the fact that is an operation on the set , but we write it out explicitly so we don’t forget to check it when showing that something is a group.