22. Prove N⊴G⇒Φ(N)≤Φ(G). Give an explicit example where this containment does not hold when N⋬G.
23. Compute Φ(S3),Φ(A4),Φ(S4),Φ(A5), and Φ(S5).
24. Define x is a nongenerator ⇔∀H<G [⟨ x, H ⟩≠G]. Prove Φ(G)={x | x is a nongenerator } when G≠1.
25. Let |G|<∞. Prove Φ(G) is nilpotent. [Use Frattini's Argument to show ∀P∈Syl(Φ(G)) [P⊴Φ(G)]]
Proof: Let M={...,Hi,...} be the (potentially infinite, even uncountable) set of maximal subgroups of G, and I be its indexing set.
Lemma 1: For any φ∈Aut(G), we have φ permutes the elements of M. Proof: Pick an arbitrary Hi∈M. If φ(Hi) is not a maximal subgroup of G, then observe φ(Hi)<K<G. We have Hi=φ−1(φ(Hi))<φ−1(K), the last term of which is properly contained in G (else K=φ(G)=G), therefore Hi<φ−1(K)<G, a contradiction. Therefore φ(Hi) is a maximal subgroup, and this action of φ on M is well defined, injective by nature, and surjective since φ−1(Hi) will map to Hi. ◻
Lemma 2: φ(⋂i∈IHi)=⋂i∈Iφ(Hi) for any isomorphism φ of G, with Hi≤G for all i∈I. Proof: φ(x)∈φ(⋂i∈IHi)⇔x∈⋂i∈IHi⇔∀i∈I[x∈Hi]⇔∀i∈I[φ(x)∈φ(Hi)]⇔φ(x)∈⋂i∈Iφ(Hi) ◻
(21) Let π denote the permutation of the indices of the elements of M by φ∈Aut(G) by lemma 1. We have φ(Φ(G))=φ(⋂i∈IHi)=⋂i∈Iφ(Hi)=⋂i∈IHπ(i)=⋂i∈IHi=Φ(G)
since π(I)=I. ◻
(22) (With aid from Project Crazy Project) (Assuming G is finite) Lemma 3: Let A≤C≤G and B≤G. Then A(B∩C)=AB∩C. Proof: (⊆) x∈A(B∩C)⇒x=ad for some a∈A and d∈B∩C, so that ad∈AB and ad∈C, ergo x∈AB∩C. (⊇) x∈AB∩C⇒x=ab∧x∈C, so that b=a−1x∈C and now b∈B∩C, hence x∈A(B∩C). ◻
Lemma 4: Φ(G)H<G for any H<G. Proof: Quickly done, this is a consequence of exercise 24. Proving it otherwise is a simple feat nonetheless. ◻
Now, we have Φ(N) char N⊴G⇒Φ(N)⊴G, so that Φ(N)K is a subgroup for any K≤G. Observe the implications: Φ(N)≰Φ(G)⇒∃i∈I[Φ(N)≰Hi]⇒N≰Hi⇒Hi∩N<N⇒Φ(N)(Hi∩N)<N⇒Φ(N)Hi∩N<N⇒G∩N<N⇒N<N We proceed to constructing a counterexample when N⋬G. This lemma will be useful for the next exercise as well: Lemma 5: Φ(Sn)=Φ(An)=1 when n≥5. Proof: Φ(An)◃An, so we must have Φ(An)=1. As computed in 4.6.2, the only proper normal subgroups of Sn are An and 1. Since An is a maximal subgroup and not the only one (place ⟨ (12) ⟩ in a maximal subgroup, for instance), we must have Φ(Sn)=1. ◻
Now, associate Q8 with its isomorphic image in S8. By order considerations, it is not equal to S8,A8, or 1, so it is nonnormal. We can see Φ(Q8)=⟨ −1 ⟩ is nontrivial, and by the above lemma Φ(S8) is trivial, so the containment doesn't hold. ◻
(23) The groups of order 3 and 2 by Cauchy are maximal by their orders, and have trivial intersection, so Φ(S3)=1. By 3.5.8, ⟨ (12)(34), (13)(24) ⟩ and ⟨ (123) ⟩ are maximal subgroups, and have trivial intersection, therefore Φ(A4)=1.
For Φ(S4), take an arbitrary subgroup M of order 12 in S4. By Cauchy, M has an element of order 3, which must be a 3-cycle. Since conjugation of M by elements of S4 are automorphisms of M (since M⊴S4 by order), we have that M contains all 3-cycles, and is thus equal to A4. Now, ⟨ (12),(123) ⟩ can only contain elements of S3 due to its generators fixing 4, and indeed it does generate at least and thus exactly 6 elements. Therefore it is maximal since otherwise it is contained in a group of order 12, which must be A4 by above, a contradiction since A4 doesn't contain a subgroup of order 6 by 3.5.8. By this, Φ(S4) is either of order 1 or 3, and not the latter since Φ(S4)⊴S4 would imply Φ(S4) contains every 3-cycle.
By the lemma, Φ(A5)=Φ(S5)=1. ◻
(24) (Assuming G is finite)(⊆) Let x∈Φ(G), and for any H<G, place H in a maximal subgroup H∗. We have x∈H∗, therefore ⟨ x, H ⟩≤⟨ x, H∗ ⟩=H∗<G. (⊇) Let x be a nongenerator, so that for any maximal subgroup H∗, we must have ⟨ x, H∗ ⟩=H∗, so that x∈H∗. ◻
(25) Let P be an arbitrary Sylow subgroup of Φ(G). By Frattini, we have Φ(G)NG(P)=G. Since Φ(G)NG(P) is clearly not a proper subgroup, we must have NG(P) is not a proper subgroup by lemma 4, which is to say NG(P)=G and now P⊴G, and in particular P⊴Φ(G), so that Φ(G) is nilpotent by theorem 3(3). ◻
No comments:
Post a Comment