

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Solutions to problem 7 of algebra, covering topics such as group homomorphisms, subgroups, and sylow theorems. It includes detailed explanations on verifying identities, checking homomorphisms, and calculating generators and relations. The document also discusses the concept of nilpotent elements and iterating automorphisms.
Typology: Assignments
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Algebra (647), Homework 7, solutions.
(e, e)(g, h) = (eθ(e)(g), eh) = (g, h) and (g, h)(e, e) = (gθ(h)(e), he) = (ge, he) = (g, h).
Then we check for inverses. (g, h)(θ(h−^1 )(g−^1 ), h−^1 ) = (gθ(h)(θ(h−^1 )(g−^1 )), hh−^1 ) = (gg−^1 , hh−^1 ) = (e, e). Similarly,
(θ(h−^1 )(g−^1 ), h−^1 )(g, h) = (θ(h−^1 )(g−^1 )θ(h−^1 )(g), h−^1 h) = (θ(h−^1 )(g−^1 g), e) = (θ(h−^1 )(e), e) = (e, e).
Finally we check associativity!
(g, h)[(k, l)(m, n)] = (g, h)(kθ(l)(m), ln) = (gθ(h)(kθ(l)(m)), hln) = (gθ(h)(k)θ(hl)(m), hln).
Associating the other way [(g, h)(k, l)](m, n) = (gθ(h)(k), hl)(m, n) = (gθ(h)(k)θ(hl)(m), hln).
q (^) i = ai so αq^ = 1Cp. (c) The elements of the group are all (ai, bj^ ). This element can be written as (ai, e)(e, bj^ ) = aibj^ , so the elements (a, e), (e, b) are generators. As far as the relations, the rst two are clear. For the third we calculuate ba = (e, b)(a, e) = (eθ(b)(a), be) = (as, b) = asb. These three relations are sucient to prove that there are pq elements (by writing all elements in the form bj^ ai) so since that is the number of elements in the semidirect product, that must exhaust the relations!
2
To go the other way, If Cm = G, notice that (e) = γ 1 (C) < γ 1 (C 2 ) < · · · < γ 1 (G). Now since C 2 /C 1 is C(G/C 1 ) and hence is abelian, γ 1 (C 2 ) < C 1 , so γ 2 (C 2 ) = (e). Suppose γr (Cr ) = (e). Then Cr+1/Cr = C(G/Cr ). So γ(Cr+1/Cr ) = (e), so γ(Cr+1) < Cr.
γr+1(Cr+1) = γr γ(Cr+1) = (e). By induction it follows that γm(G) = (e). Then γr− 1 (Cr ) < C 1 ,
(ar^ b)(asbδ^ )(ar^ b)−^1 (asbδ^ )−^1. By checking the cases = 1, δ = 0 and = δ = 1, we see this is in Z/(m). (d) We use exercise 4. If we iterate γ we get
γr = Z/(q 2 s−r^ ) if r ≤ s where n = q 2 s, and γs = γs+k = Z/(q).
A+(B+C) = (A−(B+C))∪((B+C)−A) = (A−(B−C)−(C−B))∪((B−C)∪(C−B)−A) = (A − B − C) ∪ (A ∩ B ∩ C) ∪ (B − C − A) ∪ (C − B − A). But this is clearly symmetric in A, B, C so we'd get the same thing \adding" in the other order. Now we need to check) associativity and distributivity. The rst is (A ∩ B) ∩ C = A ∩ (B ∩ C)