Math4302 Modern Algebra (Lecture 10)
Groups
Group homomorphism
Recall the kernel of a group homomorphism is the set
Example
Let where .
The kernel of is the set of all multiples of .
Theorem for one-to-one group homomorphism
is one-to-one if and only if
If is one-to-one, then , is isomorphic ot (onto automatically).
If is a set, then a permutation of is a bijection .
Cayley’s Theorem
Every group is isomorphic to a subgroup of for some (and if is finite then can be taken to be finite.)
Example
, so
, (use the set of rotations) so where and
. Set , for every , let be the permutation of induced by , so ,
We want to show that this is a group homomorphism.
- (it is a homomorphism)
- Then we need to show that is one-to-one.
It is sufficient to show that .
Solve , the only choice for is the identity matrix.
Therefore .
Proof for Cayley's Theorem
Let , for every , define by .
Then is a permutation of . (not homomorphism)
- is one-to-one by cancellation on the left.
- is onto since for every .
We claim define by is a group homomorphism that is one-to-one.
First we show that is homomorphism.
This is one to one since if , then , therefore .
Odd and even permutations
Definition of transposition
A is a transposition is a two cycle
Fact: Every permutation in can be written as a product of transpositions. (may not be disjoint transpositions)
Example of a product of transpositions
Consider .
In general,
This is not the unique way.
But the parity of the number of transpositions is unique.
Theorem for parity of transpositions
If is written as a product of transposition, then the number of transpositions is either always odd or even.
Definition of odd and even permutations
is an even permutation if the number of transpositions is even.
is an odd permutation if the number of transpositions is odd.