Lemma If G acts transitively on Ω with regular normal subgroup K choose α∈Ω the action of Gα on K by conjugation is equivalent to its action on Ω with 1∈K corresponding to α∈Ω.
proof: Define θ:K→Ω by k↦αk. This is a bijection since K is regular. We just need to show that the two actions are equivalent: (kθ)g=αkg=αgkg=αkg=kgθ.
If G is multiply transitive and has a regular normal subgroup K the subgroup Gα is transitive on Ω∖{α} and hence K#=K∖{1} as conjugation is an automorphism of a group, this means in particular that the group K ???? automorphisms ?????? ff
Lemma An automorphism preserves the order of a group element.
proof: Let θ:G→G be an automorphism and g have order n, then (θg)i≠1 for any 0<i<n since if it did θ(gi)=1 implies that gi=1.
Proposition Let K be a group then
- If AutK acts transitively on K# then K is elementary abelian
- If AutK is 2-transitive on K# then either K≃Cs2 or C3
- If AutK is 3-transitive on K# then K≃C22
- AutK is not 4-transitive.
(2) Since 2-transitivity implies primitivity of the action we define a relation on K# that is an AutK-congruence: kRk′ if k=k′ or k−1=k′. Clearly this is an equivalence relation preserved by the action hence by primitivity it must be the equality relation (implying k−1=k so the group is Cs2) or the entire relation (implying every two non-identity elements are equal or inverse so the group will be C3).
(3) If the group is further 3-transitive, then it's impossible that it's C3: That's too small! Take some k∈K# and consider the stabilizer (AutK)k which is 2-transitive hence primitive so again let's define a congruence on it k1Rk2 if k2=k1 or k2=kk1 - meaning that k1,k2 "differ by k" - this can't be the equality relation since that would imply k=1 so it's the universal relation implying K≃C22.
(3) This is impossible again because the group is too small.
Corollary Suppose G acts t-transitively on Ω with a regular normal subgroup K so |Ω|=|K| then
- If t=2 then K≃Csp
- If t=3 then K≃Cs2 or C3
- If t=4 then K≃C22
- t<5
proof: Suppose G is not simple, then there's a K such that 1≠K⊲G. In that case K∩Gα⊴Gα is simple so K∩Gα=1 or K∩Gα=Gα but K is transitive by a corollary on primitive permutation groups and Gα is a maximal subgroup by another corollary so we cannot have Gα≤K (certainly Gα<K can't happen, and if G=Gα then \alpha gGα=αg so Gα=Gβ=…=G contradiction). Then K∩Gα=1 so K is regular because it's a normal subgroup which we showed acts transitively and also it has the regular action because we saw that Kα=1.
Definition Let H,K be groups with a homomorphism θ:H→AutK. For k∈K, h∈H write kh short for khθ. Then the semidirect product K⋊H is defined as the group K×H with binary operation:
(k1,h1)(k2,h2)=(k1kh−112,h1h2).
proof: prove this is a group
Define subgroups of the semidirect product ˜K={(k,1)} and ˜H={(1,h)} then ˜K≤K⋊H, ˜H≤K⋊H, ˜K∩˜H=1,,˜K˜H=K⋊H and ˜K⊴K⋊H but we don't know that ˜H⊴K⋊H. This is an "external" construction of the semidirect product. We also have an internal one. An extension G of K by H is such that K⊲G, G/K≃H i.e. the short exact sequence 1⟶K⟶G⟶H⟶1 in which case we write G=K.H, the . is "neutral" meaning that it doesn't really tell you how the group has been extended.
Definition if we have a s.e.s. like above with K⊴G, K∩H=1 and KH=G we call G a split extension of K by H and write G=K:H.
Theorem If G is a split ext then define θ:H→AutK by khθ=kh. Then G≃K⋊H.
Corollary If G is transitive on Ω with a regular normal subgroup then G=K:Gα.
No comments:
Post a Comment