Thread: Orbits of an element and the Stabilizer of the element

I am reading Dummit and Foote Section 4.1 on Group Actions and Permutation Representations.

Proposition 2 reads:


================================================== =========
"Let G be a group acting on the non-empty set A. The relation on A defined by

a b if and only if a = g.b for some g G

is an equivalence relation.

For each a A, the number of elements in the equivalence class containing a is |G: | , the index of the stabilizer of a."

================================================== =========

The proof that a = g.b is an equivalence relation is clear to me. I am interested (and struggling with) in some elements of D&F's proof regarding the second sentence. The second part of the proof proceeds as follows:

"To prove the last statement of the proposition we exhibit a bijection between the left cosets of in G and the elements of the equivalence class of a. Let be the class of a, so

= {g.a | g G}

Suppose b = g.a . Thus g is a left coset of in G.

The map

b = g.a g

is a map from to the set of left cosets of in G. This map is surjective since for any g G the element g.a is an element of . Since g.a = h.a if and only if g if and only if g = h , the map is injective, hence is a bijection. This completes the proof."
================================================== ===

The problems I am having is with the statements:

a) This map is surjective since for any g G the element g.a is an element of .

b) Since g.a = h.a if and only if g if and only if g = h , the map is injective

Can anyone help by giving a very explicit proof or indication of why these statements are true?

Would be appreciative of help.

Peter

ok, we have a map from from the orbit of a (that is all possible images g.a) to the set of left cosets of .

that is, given b in the set A, such that b is in the equivalence class of a, then b~a, so b = g.a (g permutes A in such a way as to take a to b).

so we send b (=g.a) to the coset of that contains g, which is .

now, given an arbitrary coset of , say , we know that x.a is some element of the orbit of a,

and our mapping takes x.a to , so x.a is a pre-image of (pretty much because that's the way we defined the orbit of a).

now, suppose two elements of [a], let's call them b and c, get mapped to the same coset. we can write b = g.a, and c = h.a, so we have:

. this means that .

but what is ? it's the stabilizer of a; that is, the set of g in G such that g.a = a. so, .

therefore:




, that is, b = c.

perhaps this will be more clear if we see it "in action" (excuse the terrible pun). let's have A = {1,2,3,4}, and let G be the group D4 (where we are considering A as the set of vertices (corners) of the square).

now, just from looking at the rotations alone, we can see that the orbit of 1, is all of A. let's write the elements of D4 in permutation form:

{e, (1 2 3 4), (1 3)(2 4), (1 4 3 2), (1 2)(3 4), (1 4)(2 3), (1 3), (2 4)}.

what is Stab(1)?

well clearly e stabilizes (or "fixes") 1, and the only other element to do so is (2 4).

so Stab(1) = {e, (2 4)}. the left cosets are as follows:

Stab(1) = {e, (2 4)}
(1 2 3 4)Stab(1) = {(1 2 3 4), (1 2)(3 4)}
(1 3)(2 4)Stab(1) = {(1 3)(2 4), (1 3)}
(1 4 3 2)Stab(1) = {(1 4 3 2), (1 4)(2 3)}, and our bijection is:

1<--->Stab(1)
2<--->(1 2 3 4)Stab(1) (every element of (1 2 3 4)Stab(1) takes 1-->2)
3<--->(1 3)(2 4)Stab(1) (every element of (1 3)(2 4)Stab(1) takes 1-->3)
4<--->(1 4 3 2)Stab(1) (every element of (1 4 3 2)Stab(1) takes 1-->4).

and indeed we see that |[1]| = |A| = [D4:Stab(1)] = 4.

you can look at it this way: if g,h take a to different elements of A, then give rise to different cosets of .

Thanks for that, Deveno

Working through your post now

Peter

Quick question:

You write:

"and our mapping takes x.a to x , so x.a is a pre-image of x (pretty much because that's the way we defined the orbit of a)."

Dummit and Foote define 'orbit' as follows:

"The equivalence class {g.a | g G} is called the orbit of G contaning a."

How does this definition relate to the fact that g.a is taken to g ?

Peter

if G = {g1,g2,g3,....} then the orbit of a is {g1.a,g2.a,g3.a,....} and the cosets of are .

it's obvious we can send the elements of the orbit of a to the corresponding coset, what isn't obvious is that the duplicates in each list correspond to each other.