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 ∀g∈G,∀α∈Ω,(αθ)g=(αg)θ.
Definition We write αG={αg|g∈G} for the orbit of G containing α.
Definition We write Gα={g∈G|αg=α} for the stabilizer of α.
Definition A group action is transitive if Ω is a single orbit.
Definition The kernel of the action is G(Ω)={g∈G|∀α∈Ω,αg=α}. Clearly G→S(Ω) 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=⋂x∈GHx, 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 H≤G 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 g∈G(Ω) iff ∀x,Hxg=Hx iff ∀x,xgx−1∈H iff ∀x,g∈Hx.
(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 {g∈G|Hxg=Hx}=Hx.
Lemma If G acts on Ω, given g∈G and α∈Ω we have Gαg=Ggα.
proof: x∈Gαg iff αgx=αg iff αgxg−1=α iff x∈Ggα.
Theorem (orbit stabilizer) If G acts on Ω and α∈Ω then the actions of G on αG and (G:Gα) are equivalent.
proof: given g,h∈G, αg=αh iff gh−1∈Gα iff Gαg=Gαh. Thus θ=αg↦Gα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