Group Theory and Linear Algebra

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au

Last updated: 23 September 2014

Lecture 20: Symmetric groups and subgroups generated by a subset

Let G be a group and gG. The order of G is Card(G) and the order of g is the smallest k>0 such that gk=1.

The symmetric group Sn

S1 = { } with Card(S1)=1 S2 = { , } with Card(S2)=2 S3 = { , , , , , } with since · = = · = = · = = · = = Then Card(S3)=6.

The order of is 3 and the order of is 2.

The symmetric group Sn is the set Sn = { 12n ···· ···· 12n | each top dot is connected to a unique bottom dot, each bottom dot is connected to some top dot, no two top dots are connected to the same bottom dot } = { bijective function from 12n ··· to 12n ··· } with product given by w1 · w2 = w1 w2

Different representations of the same permutation

A permutation is an element of Sn. Say w = (diagram notation) = ( 12345678 45731268 ) (two line notation) = (1437625)(8)(cycle notation) = ( 00001000 00000100 00010000 10000000 01000000 00000010 00100000 00000001 ) (matrix notation)

Let G be a group. Let S be a subset of G. The subgroup generated by S is the subgroup SG such that

(a) SS,
(b) If H is a subgroup of G and SH then SH.
So S is the smallest subgroup of G containing S.

G=S3, S= { } .

Then S= { , , } with .

G=S3, S= { } .

Then S= { , with } .

Note: 2 = {0,1}with +01 001 110 3 = {0,1,2}with +012 0012 1120 2201 The function f: 3 { , , } 0 0 2 is an isomorphism.

The subgroups of S3 are S3 {,} {,} {,} {,,} {}

Notes and References

These are a typed copy of Lecture 20 from a series of handwritten lecture notes for the class Group Theory and Linear Algebra given on September 7, 2011.

page history