Group Actions

Group Actions

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

Department of Mathematics
University of Wisconsin, Madison
Madison, WI 53706 USA
ram@math.wisc.edu

Last updates: 20 April 2010

Group Actions

An action of a group G on a set S is a mapping α:G×SS (the convention is to write gs for α gs ) such that

  1. g hs = gh s for all g,hG,sS.
  2. 1s=s for all sS.

Examples of group actions are given below in this section and in the Exercises.

Suppose a group G , a set S and an action of G on S are given.

The stabiliser of an element sS under the action of G is the set G s = gG| gs=s .

The orbit of an element sS under the action of G is the set Gs= s' S | gs=s'   for some  gG .

g 1 s= g 1 g 4 s g 3 s= g 3 g 4 s s= g 4 s g 4 g 3 g 2 g 2 s= g 2 g 4 s g 1 S

Suppose G is a group acting on a set S and let sS and gG. Then

  1. G s is a subgroup of G.
  2. G gs =g G s g -1

Proof.

  1. To show:
    1. If h1 , h2 Gs then h1 h2 Gs .
    2. 1 Gs .
    3. If h Gs then h -1 Gs .
    4. (Proof) Assume h1 , h2 Gs . Then h1 h2 s= h1 h2 s = h1 s=s. So h1 , h 2 Gs .
    5. (Proof) Since 1s =s,1 Gs .
    6. (Proof) Assume h Gs . Then h -1 s= h -1 hs = h -1 h s =1s=s. So h -1 Gs .
    So Gs is a subgroup of G.
  2. To show:
    1. G gs g Gs g -1 .
    2. g Gs g -1 G gs .
    3. (Proof) Assume h G gs .
    4. Then hgs=hs .
    5. So g -1 hgs =s
    6. So g -1 hg Gs .
    7. Since h=g g -1 hg g -1 ,h g Gs g -1 .
    8. So G gs g Gs g -1 .
    9. (Proof) Assume h g Gs g -1 .
    10. So h=ga g -1 for some a Gs .
    11. Then hgs= ga g -1 gs=gas=gs
    12. So h G gs g Gs g -1 .
    So G gs =g Gs g -1 .

The following is an analogue of Proposition 1.1.3

Let G be a group which acts on a set S. Then the orbits partition the set S.

Proof.
To show:
  1. If s S then s Gt for some t S.
  2. If s1 , s2 S and G s1 G s2 then G s1 =G s2 .
  3. (Proof) Assume s S.
  4. Then, since s=1s,s Gs.
  5. (Proof) Assume s1 , s2 S and that G s1 G s2 .
  6. Then let t G s1 G s2 .
  7. So t= g1 s1 and t= g2 s2 for some elements g1 , g2 G.
  8. So s1 = g1 -1 g2 s2 and s2 = g2 -1 g1 s1 .
  9. To show: G s1 =G s2 .
    1. To show:
    2. G s 1 G s2 .
    3. G s 2 G s1 .
    4. (Proof) Let t1 G s1 .
    5. So t1 = h1 s1 for some h1 G.
    6. Then t1 = h1 s1 = h1 g1 -1 g2 s2 G s 2 . So G s1 G s2 .
    7. (Proof) Let t2 G s2 .
    8. So t2 = h2 s2 for some h2 G.
    9. Then t2 = h2 s2 = h2 g2 -1 g1 s1 G s 1 So G s2 G s1 .
    So G s 1 =G s2 .
So the orbits partition S.

If G is a group acting on a set S and G s i denote the orbits of the action of G on S then Card S = distinct orbits Card G s i .

Proof.

By Proposition 1.2, S is a disjoint union of orbits.
So Card S is the sum of the cardinalities of the orbits.

It is possible to view the stabiliser G s of an element sS as an analogue of the kernel of a homomorphism and the orbit Gs of an element sS as an analogue of the image of a homomorphism. One might say group actions  α:G×S S are to group homomorphisms  f:GH   as   stabilisers   G s are to kernels  kerf   as   orbits   G s are to images  imf.    

From this point of view the following corollary is an analogue of Corollary 1.1.5.

Let G be a group acting on a set S and let sS. If G s is the orbit containing s and G s is the stabiliser of s then G: G s =Card G s where G: G s is the index of G s G.

Proof.

Recall that G: Gs =Card G/ Gs .
To show: There is a bijective map φ :G/ Gs. Let us define φ : G/ Gs Gs g Gs gs. To show:

  1. φ is well defined.
  2. φ is bijective.
  3. (Proof) To show
    1. φ g Gs Gs for every g G.
    2. If g1 Gs = g2 Gs then φ g1 G s =φ g2 Gs .
    3. (Proof) Is clear from the definition of φ ,φ g Gs =gs Gs.
    4. (Proof) Assume g1 , g2 G and g1 Gs = g2 Gs .
    5. Then g1 = g2 h for some h Gs .
    6. To show: g1 s= g2 s.
      1. Then g1 s = g2 hs = g2 s, since h Gs .
      So φ g1 Gs =φ g2 Gs .
    So φ is well defined.
  4. To show:
    1. φ is injective, ie if φ g1 Gs =φ g2 G2 then g1 Gs = g 2 Gs .
    2. φ is surjective, ie if g s Gs then there exists h Gs G/ Gs such that φ h Gs =gs.
    3. (Proof) Assume φ g1 G s =φ g2 Gs .
    4. Then g1 s = g2 s .
    5. So s = g1 -1 g2 s and g 2 -1 g1 s=s .
    6. So g1 -1 g2 Gs and g2 -1 g1 Gs .
    7. To show: φ is injective.
      1. To show: g1 Gs = g2 Gs
        1. To show:
        2. baa) g1 Gs g2 Gs .
        3. bab) g2 Gs g1 Gs .
        4. baa) (Proof) Let k1 g1 Gs .
        5. So k1 = g1 h1 for some h1 Gs .
        6. Then k1 = g1 h1 = g1 g1 -1 g2 g2 -1 g1 h1 = g2 g2 -1 g1 h1 g2 Gs . So g1 Gs g1 Gs .
        7. bab) (Proof) Let k2 g2 Gs .
        8. So k2 = g2 h2 for some h2 Gs .
        9. Then k2 = g2 h2 = g2 g2 -1 g1 g1 -1 g2 h2 = g2 g2 -1 g1 h1 g1 Gs . So g2 Gs g1 Gs .
        So g1 Gs = g2 Gs .
      So φ is injective.
    8. To show: φ is surjective.
      1. Assume t Gs .
      2. Then t=gs for some g G.
      3. Thus φ g Gs =gs =t.
      So φ is surjective.
    9. So φ is bijective.

Let G be a group acting on a set S. Let G s denote the stabiliser of s and let Gs denote the orbit of s. Then Card G =Card Gs Card G s .

Proof.
Multiply both sides of the identity in Proposition 1.4 by Card Gs and use Corollary 2.3 from 'Groups, Basic Definitions and Cosets'.

Conjugation

Let S be a subset of a group G. The normaliser of S in G is the set N S = xG | xS x -1 =S , where xS x -1 = xs x -1 | sS .

Let H be a subgroup of G and let N H be the normaliser of H in G. Then

  1. H is a normal subgroup of N H .
  2. If K is a subgroup of G such that HKG and H is a normal subgroup of K then K N H .

Proof.
  1. Let k K.
  2. To show: k NH .
    1. kh k -1 H for all h H.
    2. This is true since H is normal in K .
  3. So K NH .
  4. This is the special case of b) when K=H.

This proposition says that N H is the largest subgroup of G such that H is normal in this subgroup.

Let G be a group and let 𝒮 be the set of subsets of G. Then

  1. G acts on 𝒮 by G×𝒮 𝒮 gS gS g -1 where gS g -1 = gs g -1 | sS . We say that G acts on 𝒮 by conjugation.
  2. If S is a subset of G then N S is the stabiliser of S under the action of G on 𝒮 by conjugation.

Proof.

  1. To show:
    1. α is well defined.
    2. α 1S =S for all S 𝒮 .
    3. α g α hS =α gh S for all g,h G , and S 𝒮 .
    4. (Proof) To show:
      1. aaa) gS g -1 𝒮 .
      2. aab) If S=T and g=h then gS g -1 =hT h -1 .
      Both of these are clear from the definitions.
    5. (Proof) Let S 𝒮 .
    6. Then α 1S =1S 1 -1 =S.
    7. (Proof) Let g,h G and S 𝒮 .
    8. Then α g α hS =α g hS h -1 =g hS h -1 g -1 = gh S h -1 g -1 = gh S gh -1 =α gh S .
  2. This follows immediately from the definitions of NS and of stabiliser.

Two elements g 1 , g 2 G are said to be conjugate if g 1 =h g 2 h -1 for some hG.

Let G be a group and let gG. The conjugacy class 𝒞 g of g is the set of all conjugates of g.

Let g be an element of a group G. The centraliser or normaliser of g is the set Z g = xG| xg x -1 =g .

Let G be a group. Then

  1. G acts on G by G×G G gs gs g -1 . We say that G acts on itself by conjugation.
  2. Two elements g 1 , g 2 G are conjugate iff they are in the same orbit under the action of G on itself via conjugation.
  3. The conjugacy class 𝒞 g of gG is the orbit of g under the action of G on itself via conjugation.
  4. The centraliser Z g of gG is the stabiliser of gG under the action of G on itself via conjugation.

Proof.
  1. The proof is exactly the same as in the proof of a. in Proposition 2.2. One simply replaces all the capital S 's by lower case s 's.
  2. and c. and d. follow easily from the definitions.

Let S be a subset of a group G. The centraliser of S in G is the set Z S = xG | xs x -1   for all  sS .

Let G s be the stabiliser of sG under the action of G on itself by conjugation. Then

  1. For each subset SG, Z S = sS G s .
  2. Z G = Z G , where Z G denotes the center of G.
  3. sZ G iff Z s =G.
  4. sZ G iff 𝒞 s = s .

Proof.
    1. Assume s Z s .
    2. Then sx s -1 =s for all s S.
    3. So x Gs for all s S.
    4. So x s S Gs .
    5. So Zs s S Gs .
    6. Assume x s S Gs .
    7. Then xs x -1 =s for all s S.
    8. So x Zs .
    9. So s S Gs .
  1. This is clear from the definitions of ZG and Z G .
  2. : Let s Z G .
    To show: ZS =G.
    1. By definition ZS G.
    2. To show: G ZS .
      1. Let g G.
      2. Then gs g -1 =s since s Z G .
      3. So g ZS .
    3. So G ZS .
    So ZS =G.
    Assume ZS =G.
    Then gs g -1 =s for all g G.
    So sg=gs for all g G.
    So s Z G .
  3. : Assume s Z G .
    Then gs g -1 =s for all s G.
    So 𝒞 s = gs g -1 | g G = s .
    : Assume 𝒞 s = s .
    Then gs g -1 =s for all g G.
    So s Z g .

(The Class Equation) Let 𝒞 g i denote the conjugacy classes in a group G and let 𝒞 g i denote Card 𝒞 g i . Then G = Z G + Z G > 1 Card 𝒞 g i .

Proof.
By Corollary 1.3 and the fact that 𝒞 gi are the orbits of G acting on itself by conjugation we know that G = 𝒞 gi Card 𝒞 gi . By Lemma 2.4 d) we know that Z G = 𝒞 gi =1 𝒞 gi . So G = 𝒞 gi =1 Card 𝒞 gi + 𝒞 gi >1 Card 𝒞 gi =Card Z G + 𝒞 gi >1 Card 𝒞 gi .

References [PLACEHOLDER]

[BG] A. Braverman and D. Gaitsgory, Crystals via the affine Grassmanian, Duke Math. J. 107 no. 3, (2001), 561-575; arXiv:math/9909077v2, MR1828302 (2002e:20083)

page history