0% found this document useful (0 votes)
23 views

some extension problem in group theory

Uploaded by

bourbaki120205
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views

some extension problem in group theory

Uploaded by

bourbaki120205
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Some extension problems in groups

Chengyan Hu
Department of Mathematics

Before we start M onomorphismφ : H → G Corollary: Hall Theorem for solvable groups


Theorem1(Schur-Zassenhaus) For groups A, B st.(|A|, |B|) = 1, every extension of A by B split. Suppose that a set map c : H → A satisfies Theorem2(Hall’s Theorem) Let π be a set of primes, and G a finite solvable group. Write |G| =
We are going to prove Theorem1 as the first part of the poster. f (h1, h2) = c(h1h2)c(h1)−1c(h2)−1 , ∀h1, h2 ∈ H (8) mn,where n is a π-number and m a π’-number. Then G has a subgroup of order n.
h 1
Lemma1(Frattini Argument) If N / G and P ∈ Sylp(N ),Then G = NG(P )N . Proof We prove by induction on the order of G. The result is trivial for |G| = 1, so assume |G|1.
Then we would have:
Proof By Sylow IV, we know all Sylow-p subgroups of N conjugates in N. ∀g ∈ G,g −1P g ≤ c(h1h2)th1h2 = c(h1)c(h2)h1f (h1h2)th1h2 (9) Let M is minimal normal subgroup of G. By induction hypothesis, the group G/M has a Hall π
g −1N g = N , hence g −1P g ∈ Sylp(G). Hence,∀g ∈ G, ∃n ∈ N st. g −1P g = n−1P n. Then -subgroup H/M .Hence H/M is a π-group and |(G/M ) : (H/M )| = |G/H| is a π ’-number. By
= c(h1)th1c(h2)t−1 t t
h 1 h1 h2
(10) lemma2, M is a p-group form some prime p. If p ∈ π,then clearly H is a Hall π -subgroup of G,
ng −1P gn−1 = P , so gn−1 = x ∈ NG(P ), g = xn ∈ NG(P )N . That is, G = NG(P )N . = c(h1)thc(h2)th2 (11) we are done.
∀h1, h2 ∈ H.
Reduce to a good case If p ∈
/ π ,then (|M |, |H/M |) = 1.By Theorem1, H splits as an extension of M .So ∃K ≤ H st.|K| =
Clearly, the map φ : H → G defined by φ(h) = c(h)th would be a group homomorphism. If |H/M |.As |K| is a π − number and |G : K| = |G : H||H : K| = |G : H||M | is a π ’-number.Hence,
Let’s start by prove by contradiction. For A, B mentioned in Theorem1, assume the exact se- 1 6= h ∈ H , then th ∈
/ A and hence c(h)th 6= 1. That is, Ker(φ) is trivial. K is a Hall π -subgroup,as we expected.
quence 1 → A → G → B → 1 doesn’t split, and G the object of least order with such property.
Hence it suffice to show such set map c does exists.
That is, any group of order less than |G| will satisfy Theorem1. The other direction: Burnside transfer Theorem
Claim1 A is a minimal normal subgroup of G. Construct map c satisfies (8) During our proof of Theorem1, we proved that if G is an extension of abelian p-group A,the
Proof Suppose ∃A0 / G st. {e} ( A0 ( A. Say |A| = a, |B| = b, consider the group G/A0, whose Q extension must split. How about the other direction? That is, what can we talk about G if G is an
order less than |G|. Since A/A0 / G/A0, |G/A0| = |A/A0||G/A| = |A/A0|b ∧ (|A/A0|, b) = 1, by our Define a function e : H → A by e(h) = k∈H f (h, k) for h ∈ H. extension of some group B by an abelian p-group A.The following theorem answered a special
assumption, G/A0 is a split extension of A/A0 by some group K ∼ = G/A. As K=C/A0 for some By the cocycle identity, we have: case of the question.
C ≤ G, |C| = |A0|b < ab,there is a subgroup of order b in C and hence in G by the minimality of Y
G, the extension 1 → A → G → B → 1 hence split. This is a contradiction. f (h1, h2)ne(h1h2) = (f (h1, h2), f (h1h2, h3)) (12) Theorem3(Burnside Transfer) Let P ∈ Sylp(G), and suppose that P ≤ CG(P ) = NG(P ).Then G is
h3∈H
a split extension of some N / G by P .
Claim2 A is an abelian p-group.
Defination For P ≤ G, the focal subgroup of P in G is: FG(P ) =< xy −1|x, y ∈ P , x and y
Y
= (f (h2, h3)h1f (h1, h2h3)) (13)
Proof Let P ∈ Sylp(A), by Lemma1 we have G = ANG(P ). Then G/A ∼ = NG(P )/(A ∩ conjugates in G >
NG(P ).|NG(P )|=|A ∩ NG(P )|b ∧ |A ∩ NG(P )| divides a. Since A ∩ NG(P ) / NG(P ), if NG(P ) h3∈H
Y Y Due to the limitation of pages, I skipped the defination of tranfer homomorphism and proof of
is a proper subgroup of G then by minimality of G there is a subgroup of order b in NG(P ), and =( (f (h2, k)))h1 f (h1, k) (14)
lemma3.Those can be found in reference[3],chapter9.
hence in G. This is a contradiction, so NG(P ) = G.By Claim1, P = A. Since p-groups has non- k∈H k∈H
trivial centre, /e/ ( Z(A) / A . Again, by Claim1, A = Z(A),A is an abelian p-group. = e(h2)h1e(h1) (15) Lemma3(Focal subgroup Theorem) Let P ∈ Sylp(G),and let τ : G → P/P 0 be the transfer homo-
morphism. Then FG(P ) = P 0 ∩ G0 = P ∩ Ker(τ ).
Where n is the order of H.Hence we have f (h1, h2)ne(h1h2) = e(h1h2)−1e(h1)e(h2)h1,∀h1, h2 ∈ H.
New tool for the good case: 2-cocyle As A abelian, l : A → A st. l(x) = xn is an endomorphism of A. Moreover, since (n, |A|) = 1,l ∈ Lemma4 Let P ∈ Sylp(G).Then ∀x, y ∈ CG(P ),x,y conjugates in G =⇒ x,y conjugates in NG(P ).
1 1 1 1
0 0 0
Aut(A).Therefore, ∀x ∈ A,∃!x ∈ A st. l(x ) = x. We denote this x as x n . Clearly,(x, y) n = x n y n Proof Let x, y ∈ CG(P ). Then P ≤ CG(x) ∩ CG(y), P ∈ Sylp(CG(x)), Sylp(CG(y)). Then P ≤
Say H = G/A,view h ∈ H as coset of A in G. For t, u ∈ h, t−1u ∈ A. Since A abelian,txt−1 =
uxu−1 for any x ∈ A. Define xh := txt−1 ,t ∈ h. Clearly, xh is well-defined as t1ht−1 = t ht−1, −1 1 − 1
∧ (x ) n = x n ,∀x, y ∈ A. CG(x) =⇒ gP g −1 ≤ CG(gxg −1) = CG(y) for some g ∈ G. Hence P , gP g −1 ∈ Sylp(CG(y)).
1 2 2
∀t1, t2 ∈ h. This gives a homomorphism from H to Aut(A). 1
By SylowIV , ∃c ∈ CG(y) st. P = cgP (cg)−1. Then cg ∈ NG(P ), cgx(cg)−1 = cyc−1 = y. x, y
We define c : H → A st.c(h) = e(h) n . It follows that: conjugates in NG(P )
Choose a representation th for every h ∈ H, this gives a n-element set {th|h ∈ H}. t−1 h1h2 A = 1
f (h1, h2) = (e(h1)e(h2)h1e(h1h2) ) = c(h1h2)c(h1)−1c(h2)−1
−1 n (16) Proof of Theorem3 Let x, y ∈ P st. x, y conjugates in G. Then by lemma4, ∃n ∈ NG(P )st.y =
(t(h1h2))−1 = (h1h2)−1 = h−1
2 1h−1,∀h , h ∈ H. Hence, t t t−1 ∈ A. Define function f :
1 2 h1 h2 h1h2
h 1
nxn−1. But NG(P ) = CG(P ),so y = nxn−1 = x,that is, xy −1. Hence, we have FG(P ) = {e}.
H × H ⇒ A be such that th1th2 = f (h1, h2)th1h2 . The assosiativity of group multiplication induces As required in (8).Hence, G has a subgroup of order |G/A| = b.G hence a split extension of A
the following identity: by B,which is a contradiction with our previous assumption.We can conclude that such G with Let τ : G → P be the transfer homomorphism. By Lemma3, P ∩ Ker(τ ) = FG(P ) = {e}. Let
property exact sequence 1 → A → G → B → 1 doesn’t split cannot exist. That is, every extension N = Ker(τ ),clearly, as P ∈ Sylp(G) and G/N ∼ = Im(τ ) ≤ P , N is a p0-group and G/N is a
th1(th2th3) (1) of such A by B splits.Theorem1 is now proved. p-group. Hence G = P N and P ∩ N = 1. G is a split extension of N by P as expected.
= th1f (h2, h3)th2h3 = th1f (h2h3)t−1
h 1th1th2h3 (2)
= f (h1h2)h1f (h1, h2h3)th1h2h3 (3) A short lemma for next corollary References
= (th1th2)th3 (4)
= f (h1, h2)th1h2 th3 (5) Lemma2 For a finite group G,let N its minimal normal subgroup. If N is solvable, then N is 1.J.L.Alperin, Rowen B.Bell,GTM162 Groups and Representations,pages = 81,84,
= f (h1, h2)f (h1h2, h3)th1h2h3 (6) elementary abelian. 2.Martin Lieback, Group Theory MATH 60036(22-23),pages=22,46
We conclude that the function f satisfies the cocycle identity: Proof As N solvable, N 0 N . Since N 0charN ,we have N 0 / G. As N minimal normal,N 0 must 3.Keith Conrad, The Schur-Zassenhaus Theorem
equal to {e},so N is abelian. Let p a prime divisor of |N |,consider A := {x ∈ N |xp = 1}. Clearly,
f (h2, h3)h1f (h1, h2h3) = f (h1,h2)f (h1h2, h3) (7) as N abelian, AcharN ,hence A / G. Hence A = N , N is elementary abelian.
∀h1, h2, h3 ∈ H.

https://www.example.com ABC Conference 2025, London — XYZ-1234 john.doe@example.com

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy