MATH 415 Lecture 25

From Notes
Jump to navigation Jump to search

« previous | Tuesday, November 26, 2013 | next »


Actions on a Set

Example

Failed to parse (unknown function "\lefttorightarrow"): {\displaystyle G \lefttorightarrow G} by left (Lg) or right (Rh) multiplication.


σ:G×X→X now becomes σ:G×G→G.

Observe that left and right multiplication commute:

Lg∘Rh=Rh∘Lg.

Example

Vector space V and fields of scalars F, ℝ, or ℂ.

Then V is a (ℝ*, ℂ*, or F*)-set, where F* is the multiplicative group of nonzero elements of a field.


Example

Let Y be the set of cosets of G formed from H<G.

Failed to parse (unknown function "\lefttorightarrow"): {\displaystyle G \lefttorightarrow Y} with g1(gH)=g1gH

If Failed to parse (unknown function "\lefttorightarrow"): {\displaystyle G \lefttorightarrow X} , then there is a bijection ψ:X→Y such that ψ(gx)=gψ(x)


Example

Let G be the dihedral group D4={ρ0,ρ1,ρ2,ρ4,μ1,μ2,δ1,δ2}, where

  • ρi is a rotation by πi2 radians (in which case ρ0 is the identity element)
  • μ1 and μ2 are mirroring on the vertical and horizontal axes, respectively
  • δ1 and δ2 are mirroring along the NW-SE and NE-SW diagonals, respectively


Define set X=1,2,3,4,s1,s2,s3,s4,m1,m2,d1,d2,c,p1,p2,p3,p4 of parts of the dihedral square:

  • 1 through 4 are vertices
  • s1 through s4 are sides
  • m1 and m2 are vertical and horizontal axes, respectively
  • d1 and d2 are the NW-SE and NE-SW diagonals, respectively
  • c is the center point
  • p1 through p4 are midpoints on each side


Failed to parse (unknown function "\lefttorightarrow"): {\displaystyle D_4 \lefttorightarrow X} .

We can fill out the operation table:

  1 2 3 4 s1 s2 s3 s4 m1 m2 d1 d2 p1 p2 p3 p4
ρ0
ρ1
ρ2
ρ3
μ1
μ2
δ1
δ2


G1 is the orbit {1,2,3,4} G1 is isotropy {ρ0,ρ2} |G|=8


Applications to Counting

  • Isotropy group: Gx={g∈G∣gx=x}
  • Fixed Points: Xg=(Fix(g))={x∈X∣gx=x}

Burnside Formula

Theorem 17.1. Let G be a finite group and X is a finite G-set. If r is a number of orbits in X under G, then

r⋅|G|=∑g∈G|Xg|⟹r=1|G|∑g∈G|Xg|


(⇒) W={(g,x)∣gx=x}

N=|W| for each g.

W is a disjoint union of Xg for each g, then N=∑g∈G|Xg|


(⇒)

|GX|=(G:Gx)=|G||Gx|

W=⨆x∈XGx

N=∑x∈X|Gx|=∑x∈X|G||Gx|=|G|∑x∈X1|Gx|


∑y∈Gx1|Gx|=1|Gx|∑y∈Gx1=|Gx||Gx|=1

N=|G|(number of orbits in X under G)=|G|⋅r