Algebra Homework 7 Solutions: Group Homomorphisms, Subgroups, and Sylow Theorems, Assignments of Abstract Algebra

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

Pre 2010

Uploaded on 07/29/2009

koofers-user-ml8
koofers-user-ml8 🇺🇸

9 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Algebra (647), Homework 7, solutions.
1. II.6: 1.
First we verify the identity element.
(e, e)(g, h) = ((e)(g), eh) = (g , h) and (g, h)(e, e) = ((h)(e), he) = (ge, he) = (g , h).
Then we check for inverses.
(g, h)(θ(h1)(g1), h1) = ((h)(θ(h1)(g1)), hh1) = (gg1, hh1) = (e, e).
Similarly,
(θ(h1)(g1), h1)(g, h) = (θ(h1)(g1)θ(h1)(g), h1h) = (θ(h1)(g1g), e) = (θ(h1)(e), e) = (e, e).
Finally we check associativity!
(g, h)[(k, l)(m, n)] = (g , h)((l)(m), ln) = ((h)((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).
2. II.6: 2.
(a)
We check
α(ai)α(aj) = asiasj =as(i+j)=α(ai+j).
So
α
is a homomorphism. If
α(ai) = e
, then
asi =e
so
p
divides
si
.
Since
s
is prime to
p
,
p
divides
i
, so
ai=e
. This shows
α
is injective,
hence it is an isomorphism since
Cp
is nite.
(b)
The map is clearly a homomorphism if it is well-dened. We need to
check that
bq
goes to the identity homomorphism.
αq(ai) = asqi=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) = ((b)(a), be) = (as, b) = asb.
These three relations are sucient to prove that there are
pq
elements
(by writing all elements in the form
bjai
) so since that is the number of
elements in the semidirect product, that must exhaust the relations!
3. II.7: 4.
You have to look back on p. 100 at the denition of \nilpotent."
Suppose
γr
is eventually
(e)
. Let
m
be the smallest
m
so that
γm= (e)
.
Then
(e)6=γm1< C(G)< G
.
This gives
G/γm1G/C(G)
. Now the same argument tells us that
γm2m1< C(G/γm1)) C(G/C (G))
so
γm2< C2(G)
.
Now assume
γmi< Ci(G)
. This gives
γmi1mi< C(G/γmi)C(G/Ci(G)).
It follows that
γmi1< Ci+1
. Now since
G/γ1
is abelian, so is
G/Cm1.
So
Cm=G
.
1
pf3

Partial preview of the text

Download Algebra Homework 7 Solutions: Group Homomorphisms, Subgroups, and Sylow Theorems and more Assignments Abstract Algebra in PDF only on Docsity!

Algebra (647), Homework 7, solutions.

  1. II.6: 1. First we verify the identity element.

(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).

  1. II.6: 2. (a) We check α(ai)α(aj^ ) = asiasj^ = as(i+j)^ = α(ai+j^ ). So α is a homomorphism. If α(ai) = e, then asi^ = e so p divides si. Since s is prime to p, p divides i, so ai^ = e. This shows α is injective, hence it is an isomorphism since Cp is nite. (b) The map is clearly a homomorphism if it is well-de ned. We need to check that bq^ goes to the identity homomorphism. αq^ (ai) = as

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!

  1. II.7: 4. You have to look back on p. 100 at the de nition of \nilpotent." Suppose γr is eventually (e). Let m be the smallest m so that γm = (e). Then (e) 6 = γm− 1 < C(G) < G. This gives G/γm− 1 → G/C(G). Now the same argument tells us that γm− 2 /γm− 1 < C(G/γm− 1 )) → C(G/C(G)) so γm− 2 < C 2 (G). Now assume γm−i < Ci(G). This gives γm−i− 1 /γm−i < C(G/γm−i) → C(G/Ci(G)). It follows that γm−i− 1 < Ci+1. Now since G/γ 1 is abelian, so is G/Cm− 1. So Cm = G. 1

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 ,

  1. II.7: 8. (a) aba−^1 b−^1 = a^2 if we interpret a as rotation by 2 π/n counterclockwise, and b as re ection through the y-axis. (b) a^2 generates Z/(n) since n is odd. Further, any commutator is in Z/(n) since it has an even number of re ections (so is just some rotation). (c) a^2 generates Z/m. We examine the commutator

(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).

  1. II.8: 4. Since any subnormal series can be re ned to a comp. series, if a subnormal series has maximal length it is already a comp. series.
  2. II.8: 9. We count the p-Sylows and q-Sylows. There must be kp + 1 of the former, and kp + 1 must divide p^2 q, so kp + 1 must divide q. If k > 0 then p < q. There are lq + 1 q-Sylows, and lq + 1 divides p^2 q, so divides p^2. So if l > 1 then either lq + 1 = p and q < p or lq + 1 = p^2. In any case, the q-Sylow subgroups are all cyclic, and hence are disjoint except for e. So in the last case, there are p^2 (q − 1) + 1 elements in some q-Sylow subgroup. This leaves precisely p^2 elements that aren’t of order q, so these elements must make up the only p-Sylow subgroup. The conclusion is that at least one of the Sylow subgroups is normal. The quotient is either a group of order q or of order p^2. In either case it must be abelian. This gives a (sub) normal series with abelian factors, so the group is solvable.
  3. III.1: 1b. We need to know that \ +" is commutative, which is obvious. We need an additive identity, ∅. To check associativity of \ +" we look at

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)