Group
group
A group is a set
must be associative - There must be some identity element
such that for any other element then:
- Every element
has some inverse such that:
Why not name the inverse?
Normally we denote
There is some new notation that we'll use temporarily:
Write
for . Then the properties above become:
Example
For instance, all the sets and their associated operations:
Are all valid groups. That's because:- They are all associative (easy to show)
- The identity is
- The inverse is
for each since
Another example is all the sets and their associated operations:
None of these are valid groups. That's because:- They are all associative
- The identity is
for all of them doesn't have an inverse here!
What we do here is just "throw away" the dud which is. If we only consider those sets with removed then: is not a group where each has its inverse - The other groups follow a similar patter (other than
obviously)
Another example is the set of functions from
- Associativity comes from associativity of
- The identity is the zero function
- The inverse of some
is just since
Another example is doing compositions, namely
Here:
- Associativity is definitely here
- Identity is just
- The inverse is the problem! There isn't always an inverse. Namely
has an inverse iff where .