Equivalences of Group Actions

Group Action Equivalences

Both definitions in Group Action are equivalent.

Proof

(1→2): Have σ:G×X→X where (g,x)↦g⋅x with:

  1. g1⋅(g2⋅x)=(g1g2)⋅x
  2. 1G⋅x=x.

We first claim that for each fixed g∈G, the map:

σg:X→X,x↦g⋅x

is a permutation, namely a bijection.

g⋅x1=g⋅x2g−1⋅(g⋅x1)=g−1⋅(g⋅x2)(g−1g)⋅x1=(g−1g)⋅x21G⋅x1=1G⋅x2x1=x2 g⋅x=yg−1⋅(g⋅x)=g−1⋅y(g−1g)⋅x=g−1⋅y1G⋅x=g−1⋅yx=g−1⋅y

So choose x=g−1⋅y, we can use the reverse work above to get the desired result.

Say that σ:G→SX is a map where g↦σg. We first claim that this is a group Homomorphism (or Group Morphism). Take any g1,g2∈G and we want to show:

σ(g1g2)=σ(g1)σ(g2)≡σg1g2=σg1σg2

To verify this, take any x∈X and compare:

σg1g2(x)=(g1g2)⋅x

with:

(σg1σg2)(x)=σg1(σg2(x))=σg1(g2⋅x)=g1⋅(g2⋅x)=(g1g2)⋅x

so both are the same.

(2→1) is proven very similarly.

☐