Math 3124 - Third Sample Test Solutions for Group Theory - Prof. Peter A. Linnell, Exams of Algebra

Solutions to the third sample test for the math 3124 course focusing on group theory. It covers topics such as normal subgroups, lagrange's theorem, homomorphisms, and subrings. The document also includes information about the test schedule and excluded sections.

Typology: Exams

Pre 2010

Uploaded on 02/13/2009

koofers-user-iv3
koofers-user-iv3 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 3124 Friday, November 14
Third Sample Test Solutions
1. (a) h(123)i={(1),(123),(132)}and
((1 2)(3 4))(123)((1 2)(3 4))1= (214)/ h(123)i.
Therefore h(123)iis not normal in H.
(b) If |H|=6, then [H:h(1 2 3)i] = 2, consequently h(1 2 3)iH(remember, sub-
groups of index 2 are always normal) contradicting the above. Therefore |H| 6=6.
(c) Note that o((1 2 3)) = 3 and o((1 2)(3 4)) = 2. Therefore by Lagrange’s theorem,
|H|is a multiple of 3 and 2, consequently |H|is a multiple of 6. Also |H| 6=6 by
the above, and |H||24, again by Lagrange’s theorem. The only possibilities left
are |H|=12 and |H|=24. But |H|=24 tells us that H=S4, which is certainly
normal in S4, while |H|=12 tells us that [S4:H] = 2 and again HS4.
Remark Actually one can show that |H|=12.
2. The general element of G/His of the form Hg where gG. Then (Hg)5=H(g5) =
H. Therefore the order of Hg divides 5, so must be 1 or 5. But if the order is 1, then
Hg must be the identity element of G/H. It follows that every nonidentity element of
G/Hhas order 5.
3. The right cosets are a:=H([0],[0]) ={([0],[0]), ([0],[2]), ([2],[0]), ([2],[2]) }
b:=H([0],[1]) ={([0],[1]), ([0],[3]), ([2],[1]), ([2],[3]) }
c:=H([1],[0]) ={([1],[0]), ([1],[2]), ([3],[0]), ([3],[2]) }
d:=H([1],[1]) ={([1],[1]), ([1],[3]), ([3],[1]), ([3],[3]) }
The Cayley table is a b c d
a a b c d
b b a d c
c c d a b
d d c b a
4. (a) Let A,BG. Using det(AB) = det(A)det(B), we obtain θ(AB) = det(AB)2=
det(AB)det(AB) = det(A)det(B)det(A)det(B) = det(A)2det(B)2=θ(A)θ(B), so
θis a homomorphism. If xP, then we may write x=y2for some yP. We
now have
x=θy0
0 1,
and the above matrix is in G, hence θis onto.
(b) Akerθ det(A2) = 1 det(A)2=1 det A=±1 AN. There-
fore kerθ=N.
(c) This now follows from the fundamental homomorphism theorem.
pf2

Partial preview of the text

Download Math 3124 - Third Sample Test Solutions for Group Theory - Prof. Peter A. Linnell and more Exams Algebra in PDF only on Docsity!

Math 3124 Friday, November 14

Third Sample Test Solutions

  1. (a) 〈(1 2 3)〉 = {( 1 ), (1 2 3), (1 3 2)} and

((1 2)(3 4))(1 2 3)((1 2)(3 4))−^1 = (2 1 4) ∈ 〈/ (1 2 3)〉.

Therefore 〈(1 2 3)〉 is not normal in H. (b) If |H| = 6, then [H : 〈(1 2 3)〉] = 2, consequently 〈(1 2 3)〉  H (remember, sub- groups of index 2 are always normal) contradicting the above. Therefore |H| 6 = 6. (c) Note that o((1 2 3)) = 3 and o((1 2)(3 4)) = 2. Therefore by Lagrange’s theorem, |H| is a multiple of 3 and 2, consequently |H| is a multiple of 6. Also |H| 6 = 6 by the above, and |H||24, again by Lagrange’s theorem. The only possibilities left are |H| = 12 and |H| = 24. But |H| = 24 tells us that H = S 4 , which is certainly normal in S 4 , while |H| = 12 tells us that [S 4 : H] = 2 and again H  S 4. Remark Actually one can show that |H| = 12.

  1. The general element of G/H is of the form Hg where g ∈ G. Then (Hg)^5 = H(g^5 ) = H. Therefore the order of Hg divides 5, so must be 1 or 5. But if the order is 1, then Hg must be the identity element of G/H. It follows that every nonidentity element of G/H has order 5.
  2. The right cosets are a := H([ 0 ], [ 0 ]) = {([0],[0]), ([0],[2]), ([2],[0]), ([2],[2]) } b := H([ 0 ], [ 1 ]) = {([0],[1]), ([0],[3]), ([2],[1]), ([2],[3]) } c := H([ 1 ], [ 0 ]) = {([1],[0]), ([1],[2]), ([3],[0]), ([3],[2]) } d := H([ 1 ], [ 1 ]) = {([1],[1]), ([1],[3]), ([3],[1]), ([3],[3]) } The Cayley table is ⊕ a b c d a a b c d b b a d c c c d a b d d c b a
  3. (a) Let A, B ∈ G. Using det(AB) = det(A) det(B), we obtain θ (AB) = det(AB)^2 = det(AB) det(AB) = det(A) det(B) det(A) det(B) = det(A)^2 det(B)^2 = θ (A)θ (B), so θ is a homomorphism. If x ∈ P, then we may write x = y^2 for some y ∈ P. We now have x = θ

y 0 0 1

and the above matrix is in G, hence θ is onto. (b) A ∈ ker θ ⇐⇒ det(A^2 ) = 1 ⇐⇒ det(A)^2 = 1 ⇐⇒ det A = ± 1 ⇐⇒ A ∈ N. There- fore ker θ = N. (c) This now follows from the fundamental homomorphism theorem.

  1. Let a, b ∈ C, so ar = ra and br = rb for all r ∈ R. We check the conditions required for a subring.

(i) C 6 = 0 because 0/ ∈ C. (ii) (a + b)r = ar + br = ra + rb = r(a + b) for all r ∈ R, so a + b ∈ C. (iii) (−a)r = −(ar) = −(ra) = r(−a) for all r ∈ R, so −a ∈ C. (iv) (ab)r = abr = arb = r(ab) for all r ∈ R, so ab ∈ C.

  1. Remember that R is an abelian group under addition. Since |R| = 3 and e 6 = 0, the order of e is 3, which tells us that e + e = x. Therefore x^2 = (e + e)^2 = 4 e = e, the last equality coming from the fact that the order of e under addition is 3.

Test on Wednesday, November 19. Material sections 18–25 excluding 20, approximately. Also problem 8 on sample second test. RSA encryption will not be examined. Review session on Tuesday November 18 at 5 p.m. in McBryde 226.