Loading [MathJax]/jax/output/HTML-CSS/jax.js

Tuesday, 5 February 2013

Permutation groups: actions, orbit and stabilizer

Notation backwards notation: (123)(1324)=(14)

Notation (24)(12453)=(25), in general σπ sends iπiσπ so you can compute these by hand.

 Definition A permutation group is a finite set Ω and a group of permutations (that is, bijections ΩΩ). We'll write SΩ for the group of all permutations on a set. The degree of a permutation group is the cardinality |Ω|.

Notation Let αΩ then αg for the image of α through g. Group homomorphisms are written after elements too.

Definition If G acts on two sets Ω and Ω then the actions are equivalent if there is a bijection θ between them such that gG,αΩ,(αθ)g=(αg)θ.

Definition We write αG={αg|gG} for the orbit of G containing α.

Definition We write Gα={gG|αg=α} for the stabilizer of α.

Definition A group action is transitive if Ω is a single orbit.

Definition The kernel of the action is G(Ω)={gG|αΩ,αg=α}. Clearly GS(Ω) defined by g(ααg) is a homomorphism with kernel G(Ω), this G/G(Ω) can be identified with its image in SΩ giving a permutation group (G/G(Ω),Ω).

Definition An action is said to be faithful if the kernel is trivial.

Definition The core of H in G is HG=xGHx, this is the largest normal subgroup of G contained in H.

Examples
(i) If (G,Ω) is a permutation gp and G acts on Ω faithfully this is called the natural action.
(ii) If HG we have an action of G on the set (G:H) of right cosets of H in G by (Hx)g=H(xg). This is called a coset action and if H=1 it is the regular action. The kernel of the regular action is the core: We have gG(Ω) iff x,Hxg=Hx iff x,xgx1H iff x,gHx.
(iii) The action of G on (G:H) given by HxΩ is clearly transitive. The stabilizer of H is H while that of Hx is {gG|Hxg=Hx}=Hx.

Lemma If G acts on Ω, given gG and αΩ we have Gαg=Ggα.
proof: xGαg iff αgx=αg iff αgxg1=α iff  xGgα.

Theorem (orbit stabilizer) If G acts on Ω and αΩ then the actions of G on αG and (G:Gα) are equivalent.
proof: given g,hG, αg=αh iff gh1Gα iff Gαg=Gαh. Thus θ=αgGαg is a well defined bijection, and it respects the action since ((αg)θ)x=Gαgx=((αg)x)θ.

Corollary Any transitive action is equivalent to a coset action.

Corollary |G|=|Gα||αG|. (because |αG|=|(G:Gα)| by the theorem and |G|=|Gα||(G:Gα)| is a triviality just write it down).

No comments:

Post a Comment