Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

MAT 444 Instructor: Helene Barcelo May 6, 2004 Final Exam: N Be The Number of Sylow P P

Download as pdf or txt
Download as pdf or txt
You are on page 1of 6

MAT 444 Final Exam

Instructor: Helene Barcelo

May 6, 2004

Question: 1. (10 points) Prove that if G is a group of order 385, then G contains a normal cyclic subgroup of order 77. Solution: 385 = 5 7 11 . Let n p be the number of Sylow p-subgroups of G for p = 5, 7, 11 . By the

third Sylow Theorem, n11 1(mod 11) and n11 |35 n11 = 1 . Similarly n7 1(mod 7) and n7 |55 n7 = 1 . Let K be the Sylow-7 subgroup and L the Sylow-11 subgroup. Both K , L G since they are the only Sylow-7, 11 subgroups. Moreover, K L = {1} since (7, 11) = 1 , and K C7 and L C11 . Hence K L = {1} , and | KL | = 77 then KL K L C7 C11 C77 . Thus G contains a cyclic subgroup KL of order 77. It remains to show that KL is normal. i.e.: g G gKLg 1 = KL . Let k , KL gk g 1 = gkg 1 g g 1 = k KL since both K , L G . Hence KL is normal in G.

MAT 444 Barcelo Final Exam

Page 2

Question: 2. (10 points) Prove that there is a non-trivial group homomorphism

iff (n, m) 1 .

Solution: Assume there exists a non-trivial group homomorphism :


n

n
n

. We know that

= ker (

) (
n

) / n . But (
n

) / m since is non-trivial

(i.e.: ( x) 0 x

) (

) > 1 (m, n) 1 .

Next, assume (n, m) 1; let d = (n, m) > 1 let k = m / d . Define

by (1) = k (note k 0 ), then (a ) = ak . We must show that is well-

defined: i.e. if a = b (a ) = (b ) . If

a = b a b = 0 a b = ng for some g
=

(a b) = (ng ) = n g . k

ngm ng n = . m = 0 , since d d d

Typeset by Georgeann Lorentz

MAT 444 Barcelo Final Exam

Page 3

Question: 3. (30 points) Let R = m

and {a + b m | a, b }. Let d : R
2 2

be given by

(a)

d (a + b m ) = a b m . Show that R is an integral domain.

Solution: (a) It is straightforward to show that R is a subring of . Thus R is an integral domain since is. Question: (b) What subfield of is isomorphic to the field of fractions for R? Just give a brief justification for this. Solution: (b) Let F = { p + q m / p, q } . This is the field of fractions of R, since if a + b m
1 1 ab m 1 we have = a+b m ab m a+b m a+b m a b a b = 2 2 m and 2 2 . 2 2 2 a bm a bm a b m a b2m Question: (c) Prove or disprove that d is a ring homomorphism.

has an inverse

Solution: (c) For d to be a ring homomorphism it must preserve both operations. Note that d (a + b m ) = a 2 b 2 m and d (c + d m ) = c 2 d 2 m , but

d (a + b m + c + d m ) = d ((a + c) + (b + d ) m ) = (a + c) 2 (b + d ) 2 m (a 2 + c 2 ) (b 2 + d 2 )m . On the other hand, it is easy to check that d ( . ) = d ( ) d ( ) . Hence, while d is not a ring homomorphism, it is a homomorphism that preserves multiplication. Question: (d) Prove that for R , is a unit iff d ( ) = 1 .
Solution: (d) It is straightforward to show that R, d ( ) = d ( ) d ( ) . Thus is a unit 1 1 R such that 1 = 1 d ( 1 ) = 1 = d ( ) d ( 1 ) d ( 1 ) = . d ( ) 1 d ( ) = 1 . But d ( x) , x R . Hence, d ( 1 ) = d ( )

Typeset by Georgeann Lorentz

MAT 444 Barcelo Final Exam

Page 4

Question: (e) Prove that if m < 0 , then R * is finite, where R * is the group of units of R. Solution: (e) If m < 0, let n = m . We have d (a + b m ) = a 2 b 2 m = a 2 + b 2 n = 1 (from d) a 2 = 0 and b 2 n = 1 b = 1 and n = 1 or a 2 = 1 and b 2 n = 0 a = 1 . So in all cases R * is finite. Question: (f) Prove that if m = 6, then 2, 3, and

6 are all irreducible elements of R.

Solution: (f) Prove that 2, 3, 6 are irreducible in R. Note that when

m = 6, d (a + b m ) = a 2 + 6b 2 and d (2) = 4, d ( 3) = 9 and d ( 6) = 6 , so for 2 to be irreducible we must find two elements , s.t. d ( ) = d ( ) d ( ) = 4 with d ( ), d ( ) 1 . So d ( ) = d ( ) = 2 . But clearly there are no integers a, b such that a 2 + 6b 2 = 2 . Similarly, since d ( 3) = 9 we are looking for elements such that d ( ) = 3 . But again there are no integers such that a 2 + 6b 2 = 3 . Lastly, if 6 was reducible we would find elements , such that d ( ) = 2 and d ( ) = 3 , which we just showed was impossible.

Typeset by Georgeann Lorentz

MAT 444 Barcelo Final Exam

Page 5

Question: 4. (20 points) Remember to prove/justify all of your assertions. (a) What is the degree of 3 over ? Solution: (a) Let f ( x) = x 2 3, f ( 3) = 0, and x 2 3 is irreducible over

since 3 is also a . Hence

root of f ( x) f ( x) = ( x 3) ( x + 3 ) is irreducible over [ ( 3) : ] = 2.

Question: (b) Find [ ( 2), 3 ) : Solution: (b) [ ( 2, 3) :

( 2)] .

( 2 )] = the degree of

3 over

( 2 ) . But x 2 3 is irreducible over 3 = a + b 2 , a, b

( 2) since if it was reducible this would mean that

3 = a 2 + 2b 2 + ab 2 ab = 0 a = 0 or b = 0 . But if a = 0 then 3 = 2b 2 has no rational solution, and if b = 0 then 3 = a 2 which also does not have any rational

solution. Hence [ ( 2, 3 ): ( 2)] = 2 . Question: (c) Find the degree of [ ( 2, 3) : ] .


Solution: (c) [ ( 2, 3) :

] = [ ( 2, 3) :

( 2)][ ( 2) :

= 2.2 = 4.
Question: (d) Find a basis for

( 2, 3) as a vector space over

Typeset by Georgeann Lorentz

MAT 444 Barcelo Final Exam

Page 6

Solution: (d) From c we are looking for a basis with 4 elements. Let B = {1, 2, 3, 6} . Clearly

each element of B ( 2, 3) . We are left to show that 1, 2, 3 and linearly independent over

6 are

. Let a + b 2 + c 3 + d 6 = 0 , then we must have that

a = 0 and b 2 + c 3 + d 6 = 0
2b + c 2 3 + d 2 6 = 0 2b + c 6 + 2d 3 = 0 b = 0 and c 6 + 2d 3 = 0 b = 0 and c 6 + 2d 3 = 0 c 18 + 6d = 0 3c 2 + 6d = 0 d = 0 and c = 0. Note, there are several ways to show that B is a linearly independent set. In particular, from (b) and (c) we already know that 1, 2, and 3 are linearly independent.

Typeset by Georgeann Lorentz

You might also like