MATH 251, Handout on Sylow, Direct Products, and Finite Abelian Groups

Size: px
Start display at page:

Download "MATH 251, Handout on Sylow, Direct Products, and Finite Abelian Groups"

Transcription

1 MATH 251, Handout on Sylow, Direct Products, and Finite Abelian Groups 1. Let G be a group with 56 elements. Show that G always has a normal subgroup. Solution: Our candidates for normal subgroup are the p-sylow subgroups of G. Since G =2 3 7 then n 2 1 (mod 2) and n 2 7, and n 7 1 (mod 7) and n 7 8. So, the possible values for n 2 and n 7 are n 2 =1, 7 and n 7 =1, 8. Note that if any of these values is one then we obtain a normal subgroup. However, if n 2 = 7 and n 7 = 8 none of the p-sylow subgroups would be no normal subgroup. Let us see that this situation is impossible. Assume n 2 = 7 and n 7 = 8. Note that a 7 Sylow subgroup has order 7 and therefore it is cyclic so, two distinct 7-Sylow subgroups intersect trivially. We are assuming n 7 = 8 then the number of elements in the union of the 8 7-Sylow subgroups is = 49. The group has 56 elements and 49 of them are in the 7 Sylows so we have only 7 elements to distribute in all the 2-Sylows (they are 7!!!!). Since each 2-Sylow has 8 elements we get a contradiction (we do not have enough number of elements in G). So, either n 2 = 1 or n 7 = 1 or both are equal to one. Anyway, there is a normal subgroup. 2. Classify all groups of order 21 up to isomorphism. Solution: G =3 7. First of all we compute the possible values for the number of p-sylow subgroups: n 3 =1, 7 and n 7 = 1. Then, the 7 Sylow is normal and (because of its order) it is isomorphic to Z 7. Also, we can easily check that the 3-Sylow subgroups are isomorphic to Z 3. Moreover, the Sylow subgroups intersect trivially. Since Z 7 is normal in G and G = Z 3 Z 7 then G is the semidirect product of Z 3 and Z 7. Recall that the direct product is a particular case of the semidirect product. In order to see all the possibilities for the group G we have to see all the possibilities for the function (the one that defines the semidirect product). Let s do that. Since : Z 3! Aut(Z 7 ) we need to figure out what Aut(Z 7 )is. Let g be the generator of Z 7 ( I am using multiplicative notation here, so the elements of Z 7 look like g i and g 7 = e). Then, an automorphism of Z 7 is defined by its action on g, which means that it is defined by g 7! g i some i. Since the function has to be bijective then g i has to generate Z 7. This happens whenever i and 7 are relatively prime so, i can be 1, 2,, 6. It might take some time to prove (DO IT!!!), but Aut(Z 7 ) = Z 6 is generated by : g 7! g 3. We need to find all the possible isomorphisms : Z 3! Z 6. As usual, we have to define in the generator of Z 3 (call it y). Since the order of y is three then the order of (y) can be 1 or 3. Then, (y) can be e (g 7! g) or 2 (g 7! g 9 = g 2 ). Finally, we see what the products are and we find the two non-isomorphic groups of order 21. One per each of the s. i G 1 = Z 3 n Z 7 where (y) =e. Another way to write this is G 1 = Z 3 Z 7 where ygy 1 = e(g) =g. That is, G 1 = Z3 Z 7 = Z21. ii G 2 = Z 3 n Z 7 where (y) = 2. Another way to write this is G 2 = Z 3 Z 7 where ygy 1 = 2 (g) = g Describe all Abelian groups of order 63. Prove or disprove that all groups of order 63 are Abelian. Solution: G = 63 = We use (again) the classification theorem of finite Abelian groups to get that G is isomorphic to either Z 63 or Z 3 Z 21. Now consider any G of order 63. We use one of Sylow s theorems to get that n 7 1 mod 7 and that n 7 divides 9, thus n 7 = 1. It follows that there exists a unique 7-Sylow subgroup P 7, which is normal in G. 1

2 On the other hand, n 3 1 mod 3 and that n 3 divides 7, so n 3 could be equal to 1 or 7. If n 3 =1then there is a unique 3-Sylow subgroup P 3, which is normal. It follows that G is the direct product of its Sylow subgroups, as groups of order 7 and 3 2 are Abelian, then G is abelian. If n 3 = 7, then there exists the possibility of a semi-direct product (as P 7 is normal). In order to see whether or not this actually happen, we have to see if we can construct a homomorphism : P 3! Aut(P 7 ), or equivalently : P 3! Z 6. Since we are looking for an example, consider P 3 = Z9 and the homomorphism by (1) = 2. It follows that there is at least one non-abelian group of order 63. : Z 9! Z 6 defined 4. Let G be a group of order 231. Show that G has subgroups of every possible order dividing 231. Solution: G = 231 = By Cauchy s theorem, there are elements of order 3, 7, 11 in G, therefore there are subgroups of G having those orders. We use one of Sylow s theorems to find the number of p-sylow subgroups of G for p =3, 7, 11, we get: n 3 =1, 7, 77, n 7 = n 11 = 1, so the p-sylow subgroups P 7 and P 11 are normal in G. Let P 3 be a 3-Sylow subgroup of G (there might be one or more, we do not know). Since P 7 and P 11 are normal in G then P 7 P 3, P 11 P 3 and P 7 P 11 are subgroups of G, thus we obtain subgroups of G having orders 21, 77 and 33. We are done. 5. Any group of order 45 is Abelian. Solution: Let G have order 45. In G, a 3-Sylow subgroup has order 9 and a 5-Sylow subgroup has size 5. Using one of the Sylow theorems, n 3 5, n 3 1 (mod 3), thus n 3 = 1 and n 5 9, n 5 1 (mod 5) implies n 5 = 1. Therefore G has normal 3-Sylow and 5-Sylow subgroups. Denote them by P 3 and P 5 respectively, so P 3 = 9 and P 5 = 5. Then P 3 is Abelian (group of order p 2!!) and P 5 is cyclic (thus Abelian). Since P 3 and P 5 intersect trivially, then G = P 3 P 5, and thus G is Abelian. 6. Let G be a group of order p 2 q,wherep and q are distinct prime numbers. Show that G must contain a proper non-trivial normal subgroup. Solution: We know that n p 1 mod p and that n p q, soifq<pthen n p must be equal to one. Now consider the case when q>p. We know that n q p 2, which implies that n q =1,p, or p 2, but as n q 1 mod q and q>p,theneithern q = 1 or tq +1=p 2 for some t<q. If we assume that n q 6=1 then tq = p 2 1=(p 1)(p + 1) so, q divides (p 1)(p + 1). Hence, using that q is prime we have that q divides p 1 or p + 1. The only possibility (as q>p) is that q = p + 1, this forces q = 3 and p = 2, which means that G = 12. Let G be a group of order 12, then n 2 can be 1 or 3, and n 3 can be 1 or 4. If n 2 = 3, and n 3 = 4, then the number of elements in the Sylow 3-subgroups is = 9, which leaves exactly 3 elements to be distributed among three groups of order 4, that is impossible. Contradiction. 7. Prove that if p is a prime number and Z p a = G1 G 2 then, either G 1 = Zp a or G 2 = Zp a. Solution: The easiest way to see this is to use that the representation of a finite abelian group into a product of cyclic p-groups is unique up to re-ordering of the factors. So, if Z p a = G1 G 2, then the groups G 1 and G 2 are cyclic p-groups themselves. Thus, this would yield two di erent representations for the same group (Z p a)intocyclicp-groups. 2

3 8. Using that a group of order 2p, for p a prime number, is either abelian or isomorphic to D p, and that there are exactly two non-abelian groups of order 8. List all non-isomorphic groups of orders less than 12. Solution: Using the hints, the non-abelian groups of order less than 12 are S 3,D 4,Q 8, and D 5. So, now we just have to list all the Abelian ones. Order 2 = Z2 Order 3 = Z3 Order 4 = Z4 = Z 2 Z 2 Order 5 = Z5 Order 6 = Z2 Z 3 = Z6 Order 7 = Z7 Order 8 = Z8 = Z 4 Z 2 = Z 2 Z 2 Z 2 Order 9 = Z9 = Z 3 Z 3 Order 10 = Z 2 Z 5 = Z10 Order 11 = Z Find all Abelian groups of order 108. Solution: G = 108 = , then we can write 108 using powers of primes as 108 = = = = = = It follows that G is isomorphic to exactly ONE of the following groups G = Z 2 2 Z 3 3 = Z 2 2 Z 3 2 Z 3 = Z 2 2 Z 3 Z 3 Z 3 = Z 2 Z 2 Z 3 3 = Z 2 Z 2 Z 3 2 Z 3 = Z 2 Z 2 Z 3 Z 3 Z 3 We know get the other form by collecting largest p-groups available for all primes (in this case 2 and 3). We obtain that G is isomorphic to exactly ONE of the following groups G = Z 108 = Z 36 Z 3 = Z 12 Z 3 Z 3 = Z 54 Z 2 = Z 18 Z 6 = Z 6 Z 6 Z Find all Abelian groups of order 900. Solution: G = 900 = We repeat the process above to get 900 = = = =

4 900 = = = = So, G is isomorphic to exactly ONE of the following groups G = Z 2 2 Z 3 2 Z 5 2 = Z 2 2 Z 3 2 Z 5 Z 5 = Z 2 2 Z 3 Z 3 Z 5 Z 5 = Z 2 2 Z 3 Z 3 Z 5 2 = Z 2 Z 2 Z 3 2 Z 5 2 = Z 2 Z 2 Z 3 2 Z 5 Z 5 = Z 2 Z 2 Z 3 Z 3 Z 5 Z 5 = Z 2 Z 2 Z 3 Z 3 Z 5 2 or G is isomorphic to exactly ONE of the following groups G = Z 900 = Z 180 Z 5 = Z 60 Z 15 = Z 300 Z 3 = Z 450 Z 2 = Z 90 Z 10 = Z 30 Z 30 = Z 150 Z Find all Abelian groups of order 5 6. Solution: We get 5 6 = 5 5 5= = = = = = = = = So, G is isomorphic to exactly ONE of the following groups G = Z 5 6 = Z 5 5 Z 5 = Z 5 4 Z 5 2 = Z 5 4 Z 5 Z 5 = Z 5 3 Z 5 3 = Z 5 3 Z 5 2 Z 5 = Z 5 3 Z 5 Z 5 Z 5 = Z 5 2 Z 5 2 Z 5 2 = Z 5 2 Z 5 2 Z 5 Z 5 = Z 5 2 Z 5 Z 5 Z 5 Z 5 = Z 5 Z 5 Z 5 Z 5 Z 5 Z Let p > q be prime numbers such that q divides p 1. Let and be two injective homomorphisms of Z q into Aut(Z p ) = Z p 1. Prove that Z p o Z q = Zp o Z q Solution: In order for all to make better sense I will use only multiplicative notation... but let us not forget that both Z p and Z q are additive. I will not use [] p, nor [] q for elements, so let a, b 2 Z p and s, t 2 Z q. 4

5 We want to show that : Z p o Z q! Z p o Z q defines an isomorphism, where ((a, t) )=(a, t r ), and (t) = (t r ). Also note that this last equation means that t = t r. Since is a function between sets having the same number of elements, then the only thing we need to check is that it is a homomorphism. ((a, t) (b, s) ) = ((a t (b),ts) ) = (a t (b), (ts) r ) = (a t r(b), (ts) r ) = (a t r(b),t r s r ) = (a, t r ) (b, s r ) = ((a, t) ) ((b, s) ) Done. Note that from line 3 to line 4 we used that Z q is Abelian. 13. Show that the groups Z 30,D 30, Z 3 D 10, and Z 5 D 6 are mutually nonisomorphic. Solution: First of all, Z 30 is abelian and the other three groups are not. Let G be any of the groups Z 3 D 10, Z 5 D 6 or D 30. Note that an element of order 2 in any of the first two groups looks like (a, b) then, since 2 divides neither 5 nor 3, then the element has to have the form (0,b). We know that D 2n has n subgroups of order 2 (one per flip) then: Z 3 D 10 has 5 subgroups of order 2, Z 5 D 6 has 3 and D 30 has 15. Then, the groups are not isomorphic to each other. Other way to see this is to use that Z(A B) =Z(A) Z(B). Then it is easy to see that the centers of the four groups we are working with are all distinct. 14. Verify the following isomorphisms: (a) (Z 5 Z 3 ) o '1 Z 2 = D10 Z 3 (b) (Z 5 Z 3 ) o '1 Z 2 = Z5 D 6 (c) (Z 5 Z 3 ) o '1 Z 2 = D15 Solution: In the previous problem we found 4 non-isomorphic groups of order 30. In this problem we are given the only three non-abelian ones (this is something you should prove... there are no more possible ' s to consider). So, each of the groups we found in the previous problem has to be isomorphic to one of the ones given in this problem. I will give two di erent proofs for this problem: Proof 1. An element of order 2 in (Z 5 Z 3 ) o ' Z 2 looks like x =(a, b) wherea 2 Z 5 Z 3 and b 2 Z 2. Let s see what x 2 looks like. x 2 =(a, b) (a, b) =(a' b (a),b 2 ). Since x has order 2 then (e, e) =(a' b (a),b 2 ). We can see from here that b 2 = b, this holds always for b 2 Z 2. In order to analyze the first component we need to see what ' is... the first components tells us that a = a' b (a). Clearly the only interesting case to check is when b is not trivial. Let a =(x, y) wherex 2 Z 5 and y 2 Z 3. If ' = ' 1 : e = a' b (a) implies(0, 0) = (x, y)+( x, y) (Note that the operation in Z 5 Z 3 is addition). Then, x is free of condition and 2y = 0 forces y = 0. So, any element of the form [(x, 0),b] has order 2. These are 5. Then, the group corresponding to ' 1 is D 10 Z 3. If ' = ' 2 : Similarly, the number of groups of order 2 is 3. So, the group of ' 2 is D 6 Z 5. Since there is only one group left, ' 3 corresponds to D 30. Proof 2. Consider the first isomorphism (Z 5 Z 3 ) o ' Z 2 = D10 Z 3 where '(a, b) =( write D 10 = Z 5 o Z 2, then we need to define a homomorphism: a, b). If we :(Z 5 Z 3 ) o ' Z 2! (Z 5 o Z 2 ) Z 3 5

6 Since the same groups (Z 5, Z 2, Z 3 ) appear with di erent types of products in the domain and range, we try the obvious function: ((a, b),c) =((a, c),b). We need to show that is a homomorphism, then is when the way the semidirect products are defined will become important. [((a, b),c)((a 0,b 0 ),c 0 )] = [((a, b)+'(a 0,b 0 ),c+ c 0 )] read note below = [((a, b)+( a 0,b 0 ),c+ c 0 )] = [((a a 0,b+ b 0 ),c+ c 0 )] because of the sum in direct product = ((a(a 0 ) 1,cc 0 ),bb 0 ) definition of and switching to multiplicative = ((a, c)(a 0,c 0 ),bb 0 ) using ar = r 1 a (product in D 10 ) = ((a, c),b)((a 0,c 0 ),b 0 ) because of the product in direct product = [((a, b),c)] [((a 0,b 0 ),c 0 )] Note: At this point I am abusing that the group used for the semidirect product is Z 2 to simplify notation. The function is clearly onto, just look at the definition. Since the orders of the groups are the same, then the function has to be bijective. The other isomorphisms follow similarly. 15. Show that an abelian group is the direct product of its Sylow p-subgroups for primes p dividing G. Solution: We know this already, because we know that if G is abelian then G = Q Z p j where all the i p i s are, not necessarily distinct, prime numbers and the j s are positive integers... collect all the Z p j s i of order powers of the same prime number, let s say, p. That is a Sylow p-subgroup of G (just check the order). So, G is the direct product of these subgroups. 16. Let be the unique non-trivial homomorphism from Z 4 onto< j> Aut(Z 7 ). Show that Z 7 o Z 4 is generated by elements a and b satisfying a 7 = b 4 = 1 and bab 1 = a 1, and conversely, a group generated by elements a and b satisfying these relations is isomorphic to Z 7 o Z 4. Solution: Let : Z 4! Aut(Z 7 ), since Aut(Z 7 ) = Z 6,then (1) could be either 0 (which gives us the trivial homomorphism) or 3 (which is the only element of order dividing 4 in Z 6. It follows that, (x) =3x for all x 2 Z 7. Now switching to multiplicative notation, thus Z 4 =<b>and Z 7 =<a>we realize that the only element of order two in Aut(Z 7 )isdefinedbya 7! a 1 (here using that the group is Abelian). It follows that the group is generated by (a, e) and (e, b), which we can identify with a and b, and thus (e, b)(a, e)(e, b) 1 = (e, b)(a, e)(e, b 1 ) Since (e, b) 4 =(e, e) and (a, e) 7 =(e, e) we are done. = (e b (a),b)(e, b 1 ) = (a 1,b)(e, b 1 ) = (a 1 b (e),bb 1 ) = (a 1,e) = (a, e) Show that D 28 and D 14 Z 2 are both groups of order 28 with Sylow 2-subgroups isomorphic to Z 2 Z 2. Give an explicit isomorphism D 28 = D14 Z 2. Solution: We know D 28 has 14 flips (order 2) and the rest are rotations, of the 13 non-trivial rotations there is one of order 2 but none may have order 4 because 4 does not divide 14. So D 14 does not have elements of order 4. Hence, the 2-Sylow subgroup of D 28 must be Z 2 Z 2. 6

7 Similarly, we can see that D 14 has elements of order 2 but no elements of order 4. Since all elements in Z 2 have order dividing two, then there are no elements of order 4 in D 14 Z 2. In order to define the isomorphism we use that D 28 = Z14 o Z 2 = (Z7 Z 2 ) o Z 2 and that D 14 Z 2 = (Z7 o Z 2 ) Z 2. Then, the function :(Z 7 Z 2 ) o Z 2! (Z 7 o Z 2 ) Z 2 is defined by: ((a, b),c)=((a, c),b) We need to show that is a homomorphism, then is when the way the semidirect products are defined will become important. Assume b, c non-trivial [((a, b),c)((a 0,b 0 ),c 0 )] = [((a, b) (a 0,b 0 ),c+ c 0 )] = [((a a 0,b b 0 ),c+ c 0 )] = ((a a 0,c+ c 0 ),b b 0 ) = ((a, c)(a 0,c 0 ),b+ b 0 ) = ((a, c),b)((a 0,c 0 ),b 0 ) = [((a, b),c)] [((a 0,b 0 ),c 0 )] If either b or c is trivial, the proof is even easier. So, is a homomorphism. It is clearly onto and since both groups have the same order, then must be bijective. 18. Let N and A be groups, : A! Aut(N) a homomorphism and ' 2 Aut(A). Show that N o A = A o ' A. Solution: Define the function : N o A! N o ' A by: (n, a) =(n, ' 1 (a)) We need to show that is a homomorphism, as usual, this is when the way the semidirect products are defined will become important. Assume b, c non-trivial on the other hand [(n, a)(n 0,a 0 )] = [(n a (n 0 ),aa 0 )] = (n a (n 0 ), ' 1 (aa 0 )) = (n a (n 0 ), ' 1 (a)' 1 (a 0 )) [(n, a)] [(n 0,a 0 )] = (n, ' 1 (a))(n 0, ' 1 (a 0 )) = (n( ') ' 1 (a)(n 0 ), ' 1 (a)' 1 (a 0 )) = (n a (n 0 ), ' 1 (a)' 1 (a 0 )) So, is a homomorphism. It is clearly onto and since both groups have the same order, then must be bijective. 19. Classify the non-abelian group(s) of order 20. Solution: We easily see that n 5 = 1 and that n 2 =1or 5. So, P 5 is normal, and isomorphic to Z 5 because it has 5 elements. The Sylow 2-subgroups could be isomorphic to either Z 2 Z 2 or Z 4. Let s study the case when there are 5 Sylow 2-subgroups. This subdivides in two cases. In any case Aut(Z 5 ) = Z 4. Consider f 2 Aut(Z 5 )definedbyf(1) = 2. We note that (f f)(1) = 4, so f does not have order 2, then it must have order 4. So, Aut(Z 5 )=<f>={id,f,f 2,f 3 }. Now we analyze the cases. 7

8 I If P 2 = Z2 Z 2. Then G = (Z 2 Z 2 ) n Z 5. We need to analyze all homomorphisms : Z 2 Z 2! Aut(Z 5 ) = Z 4. Since the elements of Z 2 Z 2 have all order 2, then their images have order 1 or 2. That is, the image of is (isomorphic to) Z 2... we have done this case before in part d of the previous problem. So, all (non-trivial) semidirect products are isomorphic to each other. We know D 20 has a Sylow 2-subgroup that is isomorphic to Z 2 Z 2. So, that is the group we were looking for. II We need to analyze homomorphisms : Z 4!<f>= Aut(Z 5 ). Since goes from Z 4 to itself, we don t have any restrictions besides that 1 has to be sent to a non-trivial element in <f>. Hence, we have the functions: (i) : Z 4!<f> defined by (i) (1) = f i for i =1, 2, 3 Let '(1) = 3, note that (3) (1) = f 3 = f f f = (1) (3) = ( (1) ')(1). Since these functions are all homomorphisms, it follows that (3) = (1) '. Hence, the semidirect product induced by (1) and (3) yield isomorphic groups. Remark 1 Note that ' has to be bijective. Be careful with that. For example, ' defined by '(1) = 2 does not work because it is not bijective. So, trying to mimic what we did above with (1) and (2) or (3) and (2) is not going to work. So, it seems there are two di erent non-abelian group of order 20 with 2-Sylow subgroups isomorphic to Z 4, one corresponding to (1) and the other corresponding to (2). Note that, using (1),(a, b) 2 =(a(1 + 2 b ), 2b) and, using (2),(a, b) 2 =(a( b ), 2b). It follows that there is only one element of order 2 using (2) and 5 using (1). Thus, the groups are non-isomorphic to each other. 20. Classify the non-abelian group(s) of order 18. Solution: Let G = 18 = n 2 1 (mod 2) and n 2 9, so, n 2 =1, 3, 9. Also, we know that P 2 = Z2. n 3 1 (mod 3) and n 3 2, so, n 3 = 1. It follows that P 3 / G. So, we have a semi-direct product here. We need to analyze all the homomorphisms : Z 2! Aut(P 3 ) We will take two cases, as P 3 = Z9 or P 3 = Z3 Z 3. Case P 3 = Z9. We know that Aut(Z 9 ) = Z 9, which has 6 elements. Thus Aut(Z 9 )iseitherz 6 or S 3. But, since the elements in Aut(Z 9 ) are of the form : g 7! g i then Aut(Z 9 ) is Abelian, forcing it to be isomorphic to Z 6. So, we are looking for : Z 2! Z 6 It follows that (1) = 0, 3, since the former case yields an Abelian group then we will stick to (1) = 3. Since we are in the case P 2 = Z2 and P 3 = Z9,thenthisunique non-abelian group must be D 18. Case P 3 = Z3 Z 3. We know that Aut(Z 3 Z 3 ) = GL(2, 3), which has (3 2 1)(3 2 3) = 48 elements. So, we are looking for : Z 2! GL(2, 3) It follows that (1) could be zero (yielding an Abelian group) or any of the many elements of order two in GL(2, 3). Moreover, since Aut(Z 2 ) is trivial then we will not have any isomorphism of the associated 8

9 semi-direct products. Thus there are as many groups as elements of order 2 in GL(3, 2). Just using apple 2 apple a b a = 2 + bc b(a + d) c d c(a + d) d 2 + bc and assuming such a matrix has order two we get the equations in Z 3 b(a + d) =c(a + d) =0 a 2 + bc = d 2 + bd =1 which, taking cases, yields the fourteen elements of order 2 in GL(2, 3), they are all the matrices in the following four sets apple a 0 ; a, d 2 Z 0 d apple a 0 ; a, c 2 Z c 3 a apple 0 b ; b 2 Z b 0 apple a b ; a, b 2 Z 0 3 a So, there should be fourteen non-abelian groups of order well, in fact there are only three, two of them coming out of these 14 (recall that D 18 was already found). 21. Exercise Solution: We know that G = 105 = Then n 3 1 (mod 3) and n 3 35 =) n 3 =1, 7 n 5 1 (mod 5) and n 5 21 =) n 5 =1, 21 n 7 1 (mod 7) and n 7 15 =) n 7 =1, 15 If we assume that n 5 = 21 and n 7 = 15 then the Sylow 5-subgroups contain 4 21 = 84 non-identity elements. Similarly, the Sylow 7-subgroups contain 6 15 = 90 non-identity elements. Since all these elements must be distinct, then the union of all these Sylow subgroups contain > 105 elements. Contradiction. It follows that n 5 or n 7 must be equal to one. Assume assume one of them is equal to 1, and let P 5 and P 7 be a Sylow 5-subgroup and a Sylow 7-subgroup respectively. Since one of these groups is normal then P 5 P 7 apple G. Moreover, since 5 does not divide 7 1 then P 5 P 7 = Z35. We notice that [G : P 5 P 7 ] = 3, which is the least prime dividing G, and thus P 5 P 7 E G. It follows that gp i g 1 apple P 5 P 7, for i =5, 7. But, since P 5 P 7 is cyclic there is exactly one subgroup of order 5 in P 5 P 7, and exactly one subgroup of order 7 in P 5 P 7. Hence, there is a unique Sylow p-subgroup, for both p =5, Exercise Solution: The phrasing of this problem is just awkward (to me). Anyway, G = 231 = We look at the n p s: n 3 1 (mod 3) and n 3 77 n 7 1 (mod 7) and n 7 44 n 11 1 (mod 11) and n Hence the options for these values are n 3 =1, 7, n 7 = n 11 = 1. So, there is a unique Sylow p-subgroup for p =7, 11. Let us say that P 7 2 Syl 7 (G) and P 11 2 Syl 11 (G). Note that both P 7 and P 11 are normal 9

10 in G. Now we look at P 11. Since P 11 E G then G/C G (P 11 ) =apple Aut(P 11 ). Moreover, we can use that P 11 = Z11 to get G/C G (P 11 ) =apple Z 10, which implies that G/C G (P 11 ) divides 10. Now, we know that P 11 is Abelian, and so P 11 apple C G (P 11 ). It follows that G/C G (P 11 ) =1, 3, 7, 3 7. The only one of these numbers dividing 10 is 1, and thus G = C G (P 11, which means that P 11 Z(G). 23. Exercise Solution: Let P 2 Syl p (G), H apple G, and Q 2 Syl p (H). Since H is a p-subgroup of H then it is a p-subgroup of G. It follows (from Sylow II) that there is a g 2 G such that Q apple gpg 1. Hence, (gpg 1 ) \ H = Q 2 Syl p (H). For the counterexample consider G = S 3, p = 2, P =< (12) > and H =< (13) >. 24. Exercise Solution: We know that N G (P )/C G (P ) =apple Aut(P ). Since P is cyclic then Aut(P ) = Aut(Z p a). It follows that N G (P )/C G (P ) divides p a 1 (p 1). Moreover, since P is Abelian, then P apple C G (P ), then p does not divide N G (P )/C G (P ). Hence, N G (P )/C G (P ) divides p 1. However, p is the smallest prime dividing G, and thus it is the smallest prime that could possibly divide N G (P )/C G (P )... which divides p 1. Impossible unless N G (P )/C G (P ) is equal to 1, and thus N G (P )=C G (P ). 25. Exercise Solution: The group we are looking for cannot be of the form P Q, as this will definitely yield a normal subgroup. So, we look at H =< (i, 1) >= {(i, 1), ( 1, 2), ( i, 3), (1, 0)}. We notice that which is not in H. (k, 0)(i, 1)(k, 0) 1 =( i, 1) 26. Exercise Solution: Let G be a finite Abelian group with Sylow subgroups P 1,P 2,...,P k. We know that P 1 E G, for all i, and that P 1 P 2 E G, implying that (P 1 P 2 )P 3 apple G, and thus normal. Continuing this way we get that P 1 P i E G, for all i. Similarly, the orders of the Sylow subgroups of G being pairwise relatively prime, and some inductive argument prove that P 1 P i = P 1 P i for all i. Moreover, then again, similar arguments prove that (P 1 P i 1 ) \ P i = 1. It follows that G = (((((P 1 P 2 ) P 3 ) P k ) = P 1 P 2 P k 27. Exercise Solution: Let 2 Aut(H K). H and K being characteristic means that H 2 Aut(H) and K 2 Aut(K). We define the function : Aut(H K)! Aut(H) Aut(K) by ( )=( H, K). This function is well-define because of the comment before the definition. Note that ( ) =(( ) H, ( ) K )=( H H, K K )=( H, K)( H, K )= ( ) ( ) 10

11 Also, if were the identity for both H and K then must be the identity automorphism, which means that is injective. Also, for any 2 Aut(H) and 2 Aut(K) welet (x, y) =( (x), (y)), for all (x, y) 2 H K. It is easy to show that is in Aut(H K, and that ( )=(, ), implying that is onto. The result for products is obtained by induction on the number of factors and Exercise

12

13 5.3 Applications of Sylow s Theorems One of the standard applications of Sylow s Theorems is to prove that there are no simple groups of a certain order. We illustrate a couple of techniques. If G is a finite group and p is a prime dividing G, weputn p = Syl p (G). By Sylow s Theorems, we get that n p divides G and n p 1 mod p. So we can easily calculate the possible candidates for n p. We assume that G is not a p-group (if G is a p-group then G is simple if and only if G = p). (1) n p = 1 immediately (without counting) If n p =1thenP G by Proposition 5.11 where P 2 Syl p (G) andsog is not simple. (2) small index argument Let P 2 Syl p (G). Then n p =[G : N G (P )]. So if G is simple and G does not divide n p!, then by Proposition 5.12, N G (P )=G; so P G, a contradiction. +1X apple n Note that if p is a prime, then ord p (n!) =. p i (3) counting elements whose order is a prime power i=1 If n p 6=1,wemightbeabletocountthenumberofelementsin[{S 2 Syl p (G)}. This is particularly easy if ord p ( G ) =1: ifp, Q 2 Syl p (G) withp 6= Q, then P \ Q =1and so [ {S 2 Syl p (G)} =1+n p (p 1). Sometimes it is possible this way to establish that n p =1forsomeprimep and so G is not simple. (4) playing p-subgroups o against each other Let P 2 Syl p (G). Then n p = G : N G (P ) and so N G (P ) = G n p. Suppose that q 6= p is aprimewithq dividing N G (P ). Sometimes we can find a q-subgroup of G with a big normalizer. Then by the small index argument, G is not simple. A candidate for this q-subgroup is a Sylow-q-subgroup of N G (P ). (5) studying normalizers of intersections of Sylow-p-subgroups Again, we try to find a subgroup of G with a big normalizer but this time, a candidate is the intersection of two Sylow-p-subgroups (the method in 4. doesn t work if N G (P ) = P ). Iftheintersection ofany two Sylow-p-subgroups is trivial, we typically try a counting argument to deduce that G is not simple. So suppose that P and Q are two di erent Sylow-p-subgroups with P \ Q 6= 1. Sometimes,P \ Q P, Q (because [P : P \ Q] =p). P Q Then P, Q apple N G (P \ Q). So N G (P \ Q) PQ = P \ Q. Since N G(P \ Q) divides G and is divisible by P, this often leads to N G (P \ Q) =G (using the small index argument) and so G is not simple. 28

14 We illustrate these methods with the following exercises (the numbering of the exercises corresponds to the numbering of the methods). Examples : Prove that there are no simple groups of the following orders : (1) 200 Let G be a group of order 200 = n2 2 {1, 5, 25}. We get n 5 =1 So G is not simple since n 5 =1. (2) 5103 Let G be a simple group of order 5103 = We get n3 2 {1, 7} n 7 2 {1, 729} Suppose that G is simple. Then n 3 =7andn 7 = 729. By the Small Index Argument, 5103 divides 7!, a contradiction since 7! = 5040 (or since ord 3 (7!) = 2). (3) < n 2 2 {1, 5, 19, 95} Let G be a group of order 380 = We get n 5 2 {1, 76} : n 19 2 {1, 20} Suppose that n 5 6=1andn 19 6=1. ThenG contains 76 (5 1) = 304 elements of order 5and20 (19 1) = 360 elements of order 19, a contradiction since > 380. Hence n 5 =1orn 19 =1. SoG is not simple. (4) a) n 3 2 {1, 7, 19, 133} >< n Let G be a group of order 4389 = We get 7 2 {1, 57} n 11 2 {1, 133} >: n 19 2 {1, 77} Suppose that G is simple. Then n p 6=1forp =3, 7, 11, 19. So n 7 =57andn 11 =133. Hence N G (P 7 ) =77foranyP 7 2 Syl 7 (G) and N G (P 11 ) =33foranyP 11 2 Syl 11 (G). Let P 2 Syl 7 (G). Since 11 divides N G (P ), we can pick Q 2 Syl 11 (N G (P )). Then Q =11. SoQ 2 Syl 11 (G). However, a group of order 77 has a unique Sylow-11-subgroup (n 11 =1forsuchagroup). SoQ N G (P ). Hence N G (P ) apple N G (Q), a contradiction since N G (P ) =77doesnotdivide N G (Q) =33. SoG is not simple. b) < n 3 2 {1, 7, 25, 49, 175, 1225} Let G be a group of order 3675 = We get n 5 2 {1, 21} : n 7 2 {1, 15} Suppose that G is simple. Then n p 6=1forp =3, 5, 7. So n 5 =21andn 7 =15. Let P 2 Syl 5 (G). Then N G (P ) =175= Let Q 2 Syl 7 (N G (P )). Then Q N G (P ) since a group of order 175 has only one Sylow-7-subgroup. So P apple N G (P ) apple N G (Q). 29

15 Pick Q 2 Syl 7 (G) withq apple Q. Since Q =5and Q =25,wehavethat[Q : Q] =5 and so Q Q. Hence Q apple N G (Q). So PQ N G (Q). But PQ = P Q P \ Q = Hence [G : N G (Q)] apple 3. By the Small Index Argument, G = N G (Q). So Q G, a contradiction. (5) 144 Let G be a group of order 144 = We get n2 2 {1, 3, 9} n 3 2 {1, 4, 16} Suppose that G is simple. Then n 2 6=1andn 3 6= 1. By the Small Index Argument, n 2 6=3andn 3 6=4. Son 2 =9andn 3 =16. Then N G (P 2 ) =16foranyP 2 2 Syl 2 (G) and N G (P 3 ) =9foranyP 3 2 Syl 3 (G). Suppose that P \ Q =1foranyP, Q 2 Syl 3 (G) with P 6= Q. Then G has 16 (9 1) = 128 elements of order a power of three. Since G 128 = 16, we see that G has only one Sylow-2-subgroup (so n 2 =1),acontradiction. Hence there exist P, Q 2 Syl 3 (G) withp 6= Q and P \ Q 6= 1. Since P = Q =3 2, we get that P \ Q =3. So[P : P \ Q] =3=[Q : P \ Q]. Hence P \ Q P and P Q P \ Q Q. So PQ N G (P \ Q). But PQ = P \ Q =27. SoN G(P \ Q) apple G, 9 divides N G (P \ Q) and N G (P \ Q) 27. So [G : N G (P \ Q)] 2 {1, 2, 4}. By the Small Index Argument, G = N G (P \ Q). So P \ Q G, a contradiction. 30

16

17

18

19

CONSEQUENCES OF THE SYLOW THEOREMS

CONSEQUENCES OF THE SYLOW THEOREMS CONSEQUENCES OF THE SYLOW THEOREMS KEITH CONRAD For a group theorist, Sylow s Theorem is such a basic tool, and so fundamental, that it is used almost without thinking, like breathing. Geoff Robinson 1.

More information

CLASSIFICATION OF GROUPS OF ORDER 60 Alfonso Gracia Saz

CLASSIFICATION OF GROUPS OF ORDER 60 Alfonso Gracia Saz CLASSIFICATION OF GROUPS OF ORDER 60 Alfonso Gracia Saz Remark: This is a long problem, and there are many ways to attack various of the steps. I am not claiming this is the best way to proceed, nor the

More information

FINITE GROUP THEORY: SOLUTIONS FALL MORNING 5. Stab G (l) =.

FINITE GROUP THEORY: SOLUTIONS FALL MORNING 5. Stab G (l) =. FINITE GROUP THEORY: SOLUTIONS TONY FENG These are hints/solutions/commentary on the problems. They are not a model for what to actually write on the quals. 1. 2010 FALL MORNING 5 (i) Note that G acts

More information

Extra exercises for algebra

Extra exercises for algebra Extra exercises for algebra These are extra exercises for the course algebra. They are meant for those students who tend to have already solved all the exercises at the beginning of the exercise session

More information

ANALYSIS OF SMALL GROUPS

ANALYSIS OF SMALL GROUPS ANALYSIS OF SMALL GROUPS 1. Big Enough Subgroups are Normal Proposition 1.1. Let G be a finite group, and let q be the smallest prime divisor of G. Let N G be a subgroup of index q. Then N is a normal

More information

Exercises on chapter 1

Exercises on chapter 1 Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G

More information

Algebra SEP Solutions

Algebra SEP Solutions Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since

More information

3. G. Groups, as men, will be known by their actions. - Guillermo Moreno

3. G. Groups, as men, will be known by their actions. - Guillermo Moreno 3.1. The denition. 3. G Groups, as men, will be known by their actions. - Guillermo Moreno D 3.1. An action of a group G on a set X is a function from : G X! X such that the following hold for all g, h

More information

Math 120: Homework 6 Solutions

Math 120: Homework 6 Solutions Math 120: Homewor 6 Solutions November 18, 2018 Problem 4.4 # 2. Prove that if G is an abelian group of order pq, where p and q are distinct primes then G is cyclic. Solution. By Cauchy s theorem, G has

More information

Problem 1.1. Classify all groups of order 385 up to isomorphism.

Problem 1.1. Classify all groups of order 385 up to isomorphism. Math 504: Modern Algebra, Fall Quarter 2017 Jarod Alper Midterm Solutions Problem 1.1. Classify all groups of order 385 up to isomorphism. Solution: Let G be a group of order 385. Factor 385 as 385 = 5

More information

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition).

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Selected exercises from Abstract Algebra by Dummit Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 4.1 Exercise 1. Let G act on the set A. Prove that if a, b A b = ga for some g G, then G b = gg

More information

Exercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups

Exercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups Exercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups This Ark concerns the weeks No. (Mar ) and No. (Mar ). Plans until Eastern vacations: In the book the group theory included in the curriculum

More information

Algebra Exercises in group theory

Algebra Exercises in group theory Algebra 3 2010 Exercises in group theory February 2010 Exercise 1*: Discuss the Exercises in the sections 1.1-1.3 in Chapter I of the notes. Exercise 2: Show that an infinite group G has to contain a non-trivial

More information

GROUPS OF ORDER p 3 KEITH CONRAD

GROUPS OF ORDER p 3 KEITH CONRAD GROUPS OF ORDER p 3 KEITH CONRAD For any prime p, we want to describe the groups of order p 3 up to isomorphism. From the cyclic decomposition of finite abelian groups, there are three abelian groups of

More information

MA441: Algebraic Structures I. Lecture 26

MA441: Algebraic Structures I. Lecture 26 MA441: Algebraic Structures I Lecture 26 10 December 2003 1 (page 179) Example 13: A 4 has no subgroup of order 6. BWOC, suppose H < A 4 has order 6. Then H A 4, since it has index 2. Thus A 4 /H has order

More information

7 Semidirect product. Notes 7 Autumn Definition and properties

7 Semidirect product. Notes 7 Autumn Definition and properties MTHM024/MTH74U Group Theory Notes 7 Autumn 20 7 Semidirect product 7. Definition and properties Let A be a normal subgroup of the group G. A complement for A in G is a subgroup H of G satisfying HA = G;

More information

Frank Moore Algebra 901 Notes Professor: Tom Marley Direct Products of Groups:

Frank Moore Algebra 901 Notes Professor: Tom Marley Direct Products of Groups: Frank Moore Algebra 901 Notes Professor: Tom Marley Direct Products of Groups: Definition: The external direct product is defined to be the following: Let H 1,..., H n be groups. H 1 H 2 H n := {(h 1,...,

More information

Two subgroups and semi-direct products

Two subgroups and semi-direct products Two subgroups and semi-direct products 1 First remarks Throughout, we shall keep the following notation: G is a group, written multiplicatively, and H and K are two subgroups of G. We define the subset

More information

Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall Midterm Exam Review Solutions

Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall Midterm Exam Review Solutions Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall 2015 Midterm Exam Review Solutions Practice exam questions: 1. Let V 1 R 2 be the subset of all vectors whose slope

More information

Algebra-I, Fall Solutions to Midterm #1

Algebra-I, Fall Solutions to Midterm #1 Algebra-I, Fall 2018. Solutions to Midterm #1 1. Let G be a group, H, K subgroups of G and a, b G. (a) (6 pts) Suppose that ah = bk. Prove that H = K. Solution: (a) Multiplying both sides by b 1 on the

More information

A SIMPLE PROOF OF BURNSIDE S CRITERION FOR ALL GROUPS OF ORDER n TO BE CYCLIC

A SIMPLE PROOF OF BURNSIDE S CRITERION FOR ALL GROUPS OF ORDER n TO BE CYCLIC A SIMPLE PROOF OF BURNSIDE S CRITERION FOR ALL GROUPS OF ORDER n TO BE CYCLIC SIDDHI PATHAK Abstract. This note gives a simple proof of a famous theorem of Burnside, namely, all groups of order n are cyclic

More information

School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet V: Direct and semidirect products (Solutions)

School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet V: Direct and semidirect products (Solutions) CMRD 2010 School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet V: Direct and semidirect products (Solutions) 1. Give an example of two groups G and H and a subgroup of the direct

More information

φ(xy) = (xy) n = x n y n = φ(x)φ(y)

φ(xy) = (xy) n = x n y n = φ(x)φ(y) Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =

More information

DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents

DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3 T.K.SUBRAHMONIAN MOOTHATHU Contents 1. Cayley s Theorem 1 2. The permutation group S n 2 3. Center of a group, and centralizers 4 4. Group actions

More information

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is

More information

Math 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I.

Math 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I. Math 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I. 24. We basically know already that groups of order p 2 are abelian. Indeed, p-groups have non-trivial

More information

School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet IV: Composition series and the Jordan Hölder Theorem (Solutions)

School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet IV: Composition series and the Jordan Hölder Theorem (Solutions) CMRD 2010 School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet IV: Composition series and the Jordan Hölder Theorem (Solutions) 1. Let G be a group and N be a normal subgroup of G.

More information

GENERALIZED QUATERNIONS

GENERALIZED QUATERNIONS GENERALIZED QUATERNIONS KEITH CONRAD 1. introduction The quaternion group Q 8 is one of the two non-abelian groups of size 8 (up to isomorphism). The other one, D 4, can be constructed as a semi-direct

More information

Isomorphisms and Well-definedness

Isomorphisms and Well-definedness Isomorphisms and Well-definedness Jonathan Love October 30, 2016 Suppose you want to show that two groups G and H are isomorphic. There are a couple of ways to go about doing this depending on the situation,

More information

Math 451, 01, Exam #2 Answer Key

Math 451, 01, Exam #2 Answer Key Math 451, 01, Exam #2 Answer Key 1. (25 points): If the statement is always true, circle True and prove it. If the statement is never true, circle False and prove that it can never be true. If the statement

More information

Solutions to Assignment 4

Solutions to Assignment 4 1. Let G be a finite, abelian group written additively. Let x = g G g, and let G 2 be the subgroup of G defined by G 2 = {g G 2g = 0}. (a) Show that x = g G 2 g. (b) Show that x = 0 if G 2 = 2. If G 2

More information

Solutions of Assignment 10 Basic Algebra I

Solutions of Assignment 10 Basic Algebra I Solutions of Assignment 10 Basic Algebra I November 25, 2004 Solution of the problem 1. Let a = m, bab 1 = n. Since (bab 1 ) m = (bab 1 )(bab 1 ) (bab 1 ) = ba m b 1 = b1b 1 = 1, we have n m. Conversely,

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

Abstract Algebra: Supplementary Lecture Notes

Abstract Algebra: Supplementary Lecture Notes Abstract Algebra: Supplementary Lecture Notes JOHN A. BEACHY Northern Illinois University 1995 Revised, 1999, 2006 ii To accompany Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

More information

Section II.6. Classification of Finite Groups

Section II.6. Classification of Finite Groups II.6. Classification of Finite Groups 1 Section II.6. Classification of Finite Groups Note. In this section, based largely on Sylow s three theorems, we classify all groups of order up to 15. First, we

More information

1 Chapter 6 - Exercise 1.8.cf

1 Chapter 6 - Exercise 1.8.cf 1 CHAPTER 6 - EXERCISE 1.8.CF 1 1 Chapter 6 - Exercise 1.8.cf Determine 1 The Class Equation of the dihedral group D 5. Note first that D 5 = 10 = 5 2. Hence every conjugacy class will have order 1, 2

More information

Algebraic Structures Exam File Fall 2013 Exam #1

Algebraic Structures Exam File Fall 2013 Exam #1 Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write

More information

Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3

Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 3. (a) Yes; (b) No; (c) No; (d) No; (e) Yes; (f) Yes; (g) Yes; (h) No; (i) Yes. Comments: (a) is the additive group

More information

SF2729 GROUPS AND RINGS LECTURE NOTES

SF2729 GROUPS AND RINGS LECTURE NOTES SF2729 GROUPS AND RINGS LECTURE NOTES 2011-03-01 MATS BOIJ 6. THE SIXTH LECTURE - GROUP ACTIONS In the sixth lecture we study what happens when groups acts on sets. 1 Recall that we have already when looking

More information

II. Products of Groups

II. Products of Groups II. Products of Groups Hong-Jian Lai October 2002 1. Direct Products (1.1) The direct product (also refereed as complete direct sum) of a collection of groups G i, i I consists of the Cartesian product

More information

To hand in: (a) Prove that a group G is abelian (= commutative) if and only if (xy) 2 = x 2 y 2 for all x, y G.

To hand in: (a) Prove that a group G is abelian (= commutative) if and only if (xy) 2 = x 2 y 2 for all x, y G. Homework #6. Due Thursday, October 14th Reading: For this homework assignment: Sections 3.3 and 3.4 (up to page 167) Before the class next Thursday: Sections 3.5 and 3.4 (pp. 168-171). Also review the

More information

Kevin James. p-groups, Nilpotent groups and Solvable groups

Kevin James. p-groups, Nilpotent groups and Solvable groups p-groups, Nilpotent groups and Solvable groups Definition A maximal subgroup of a group G is a proper subgroup M G such that there are no subgroups H with M < H < G. Definition A maximal subgroup of a

More information

5 Group theory. 5.1 Binary operations

5 Group theory. 5.1 Binary operations 5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1

More information

School of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation

School of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation MRQ 2009 School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet I: Revision and Re-Activation 1. Let H and K be subgroups of a group G. Define HK = {hk h H, k K }. (a) Show that HK

More information

Tutorial on Groups of finite Morley rank

Tutorial on Groups of finite Morley rank Tutorial on Groups of finite Morley rank adeloro@math.rutgers.edu Manchester, 14-18 July 2008 First tutorial Groups of finite Morley rank first arose in a very model-theoretic context, the study of ℵ 1

More information

Lecture 4.1: Homomorphisms and isomorphisms

Lecture 4.1: Homomorphisms and isomorphisms Lecture 4.: Homomorphisms and isomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4, Modern Algebra M. Macauley (Clemson) Lecture

More information

May 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work.

May 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work. Math 236H May 6, 2008 Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work. 1. (15 points) Prove that the symmetric group S 4 is generated

More information

The Outer Automorphism of S 6

The Outer Automorphism of S 6 Meena Jagadeesan 1 Karthik Karnik 2 Mentor: Akhil Mathew 1 Phillips Exeter Academy 2 Massachusetts Academy of Math and Science PRIMES Conference, May 2016 What is a Group? A group G is a set of elements

More information

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.

More information

Modern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

Modern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1 2 3 style total Math 415 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. Every group of order 6

More information

Quiz 2 Practice Problems

Quiz 2 Practice Problems Quiz 2 Practice Problems Math 332, Spring 2010 Isomorphisms and Automorphisms 1. Let C be the group of complex numbers under the operation of addition, and define a function ϕ: C C by ϕ(a + bi) = a bi.

More information

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed. Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply

More information

Locally maximal product-free sets of size 3

Locally maximal product-free sets of size 3 Locally maximal product-free sets of size 3 By Chimere S. Anabanti and Sarah B. Hart Birkbeck Pure Mathematics Preprint Series Preprint Number 10 www.bbk.ac.uk/ems/research/pure/preprints Locally maximal

More information

Connectivity of Intersection Graphs of Finite Groups

Connectivity of Intersection Graphs of Finite Groups Connectivity of Intersection Graphs of Finite Groups Selçuk Kayacan arxiv:1512.00361v2 [math.gr] 2 Aug 2016 Department of Mathematics, Istanbul Technical University, 34469 Maslak, Istanbul, Turkey. e-mail:

More information

( ) 3 = ab 3 a!1. ( ) 3 = aba!1 a ( ) = 4 " 5 3 " 4 = ( )! 2 3 ( ) =! 5 4. Math 546 Problem Set 15

( ) 3 = ab 3 a!1. ( ) 3 = aba!1 a ( ) = 4  5 3  4 = ( )! 2 3 ( ) =! 5 4. Math 546 Problem Set 15 Math 546 Problem Set 15 1. Let G be a finite group. (a). Suppose that H is a subgroup of G and o(h) = 4. Suppose that K is a subgroup of G and o(k) = 5. What is H! K (and why)? Solution: H! K = {e} since

More information

Math 3140 Fall 2012 Assignment #3

Math 3140 Fall 2012 Assignment #3 Math 3140 Fall 2012 Assignment #3 Due Fri., Sept. 21. Remember to cite your sources, including the people you talk to. My solutions will repeatedly use the following proposition from class: Proposition

More information

1.5 Applications Of The Sylow Theorems

1.5 Applications Of The Sylow Theorems 14 CHAPTER1. GROUP THEORY 8. The Sylow theorems are about subgroups whose order is a power of a prime p. Here is a result about subgroups of index p. Let H be a subgroup of the finite group G, and assume

More information

Homework #11 Solutions

Homework #11 Solutions Homework #11 Solutions p 166, #18 We start by counting the elements in D m and D n, respectively, of order 2. If x D m and x 2 then either x is a flip or x is a rotation of order 2. The subgroup of rotations

More information

ISOMORPHISMS KEITH CONRAD

ISOMORPHISMS KEITH CONRAD ISOMORPHISMS KEITH CONRAD 1. Introduction Groups that are not literally the same may be structurally the same. An example of this idea from high school math is the relation between multiplication and addition

More information

Algebra Exam, Spring 2017

Algebra Exam, Spring 2017 Algebra Exam, Spring 2017 There are 5 problems, some with several parts. Easier parts count for less than harder ones, but each part counts. Each part may be assumed in later parts and problems. Unjustified

More information

Stab(t) = {h G h t = t} = {h G h (g s) = g s} = {h G (g 1 hg) s = s} = g{k G k s = s} g 1 = g Stab(s)g 1.

Stab(t) = {h G h t = t} = {h G h (g s) = g s} = {h G (g 1 hg) s = s} = g{k G k s = s} g 1 = g Stab(s)g 1. 1. Group Theory II In this section we consider groups operating on sets. This is not particularly new. For example, the permutation group S n acts on the subset N n = {1, 2,...,n} of N. Also the group

More information

Homework #5 Solutions

Homework #5 Solutions Homework #5 Solutions p 83, #16. In order to find a chain a 1 a 2 a n of subgroups of Z 240 with n as large as possible, we start at the top with a n = 1 so that a n = Z 240. In general, given a i we will

More information

Selected Solutions to Math 4107, Set 4

Selected Solutions to Math 4107, Set 4 Selected Solutions to Math 4107, Set 4 November 9, 2005 Page 90. 1. There are 3 different classes: {e}, {(1 2), (1 3), (2 3)}, {(1 2 3), (1 3 2)}. We have that c e = 1, c (1 2) = 3, and c (1 2 3) = 2.

More information

12. Projective modules The blanket assumptions about the base ring k, the k-algebra A, and A-modules enumerated at the start of 11 continue to hold.

12. Projective modules The blanket assumptions about the base ring k, the k-algebra A, and A-modules enumerated at the start of 11 continue to hold. 12. Projective modules The blanket assumptions about the base ring k, the k-algebra A, and A-modules enumerated at the start of 11 continue to hold. 12.1. Indecomposability of M and the localness of End

More information

Exercises MAT2200 spring 2014 Ark 4 Homomorphisms and factor groups

Exercises MAT2200 spring 2014 Ark 4 Homomorphisms and factor groups Exercises MAT2200 spring 2014 Ark 4 Homomorphisms and factor groups This Ark concerns the weeks No. (Mar ) and No. (Mar ). It is not very logical to have lectures on Fridays and problem solving in plenum

More information

IUPUI Qualifying Exam Abstract Algebra

IUPUI Qualifying Exam Abstract Algebra IUPUI Qualifying Exam Abstract Algebra January 2017 Daniel Ramras (1) a) Prove that if G is a group of order 2 2 5 2 11, then G contains either a normal subgroup of order 11, or a normal subgroup of order

More information

Finite groups with planar subgroup lattices

Finite groups with planar subgroup lattices J Algebr Comb (2006) 23: 207 223 DOI 10.1007/s10801-006-7392-8 Finite groups with planar subgroup lattices Joseph P. Bohanon Les Reid Received: July 8, 2004 / Revised: June 30, 2005 / Accepted: July 25,

More information

Group Theory

Group Theory Group Theory 2014 2015 Solutions to the exam of 4 November 2014 13 November 2014 Question 1 (a) For every number n in the set {1, 2,..., 2013} there is exactly one transposition (n n + 1) in σ, so σ is

More information

DIHEDRAL GROUPS II KEITH CONRAD

DIHEDRAL GROUPS II KEITH CONRAD DIHEDRAL GROUPS II KEITH CONRAD We will characterize dihedral groups in terms of generators and relations, and describe the subgroups of D n, including the normal subgroups. We will also introduce an infinite

More information

Pseudo Sylow numbers

Pseudo Sylow numbers Pseudo Sylow numbers Benjamin Sambale May 16, 2018 Abstract One part of Sylow s famous theorem in group theory states that the number of Sylow p- subgroups of a finite group is always congruent to 1 modulo

More information

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.

More information

Written Homework # 2 Solution

Written Homework # 2 Solution Math 516 Fall 2006 Radford Written Homework # 2 Solution 10/09/06 Let G be a non-empty set with binary operation. For non-empty subsets S, T G we define the product of the sets S and T by If S = {s} is

More information

HOMEWORK 3 LOUIS-PHILIPPE THIBAULT

HOMEWORK 3 LOUIS-PHILIPPE THIBAULT HOMEWORK 3 LOUIS-PHILIPPE THIBAULT Problem 1 Let G be a group of order 56. We have that 56 = 2 3 7. Then, using Sylow s theorem, we have that the only possibilities for the number of Sylow-p subgroups

More information

3 Galois Theory. 3.1 Definitions and Examples

3 Galois Theory. 3.1 Definitions and Examples 3 Galois Theory 3.1 Definitions and Examples This section of notes roughly follows Section 14.1 in Dummit and Foote. Let F be a field and let f (x) 2 F[x]. In the previous chapter, we proved that there

More information

Properties of Generating Sets of Finite Groups

Properties of Generating Sets of Finite Groups Cornell SPUR 2018 1 Group Theory Properties of Generating Sets of Finite Groups by R. Keith Dennis We now provide a few more details about the prerequisites for the REU in group theory, where to find additional

More information

Math 120 HW 9 Solutions

Math 120 HW 9 Solutions Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z

More information

ABSTRACT ALGEBRA 1 COURSE NOTES, LECTURE 11: SYLOW THEORY.

ABSTRACT ALGEBRA 1 COURSE NOTES, LECTURE 11: SYLOW THEORY. ABSTRACT ALGEBRA 1 COURSE NOTES, LECTURE 11: SYLOW THEORY. ANDREW SALCH Here s a quick definition we could have introduced a long time ago: Definition 0.1. If n is a positive integer, we often write C

More information

Solutions of exercise sheet 8

Solutions of exercise sheet 8 D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra

More information

Math 594, HW2 - Solutions

Math 594, HW2 - Solutions Math 594, HW2 - Solutions Gilad Pagi, Feng Zhu February 8, 2015 1 a). It suffices to check that NA is closed under the group operation, and contains identities and inverses: NA is closed under the group

More information

PRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators.

PRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators. PRACTICE FINAL MATH 18.703, MIT, SPRING 13 You have three hours. This test is closed book, closed notes, no calculators. There are 11 problems, and the total number of points is 180. Show all your work.

More information

Spanning, linear dependence, dimension

Spanning, linear dependence, dimension Spanning, linear dependence, dimension In the crudest possible measure of these things, the real line R and the plane R have the same size (and so does 3-space, R 3 ) That is, there is a function between

More information

CHAPTER 3: THE INTEGERS Z

CHAPTER 3: THE INTEGERS Z CHAPTER 3: THE INTEGERS Z MATH 378, CSUSM. SPRING 2009. AITKEN 1. Introduction The natural numbers are designed for measuring the size of finite sets, but what if you want to compare the sizes of two sets?

More information

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary

More information

120A LECTURE OUTLINES

120A LECTURE OUTLINES 120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication

More information

PERMUTABILITY GRAPH OF CYCLIC SUBGROUPS

PERMUTABILITY GRAPH OF CYCLIC SUBGROUPS Palestine Journal of Mathematics Vol. 5(2) (2016), 228 239 Palestine Polytechnic University-PPU 2016 PERMUTABILITY GRAPH OF CYCLIC SUBGROUPS R. Rajkumar and P. Devi Communicated by Ayman Badawi MSC 2010

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

UMASS AMHERST MATH 411 SECTION 2, FALL 2009, F. HAJIR

UMASS AMHERST MATH 411 SECTION 2, FALL 2009, F. HAJIR UMASS AMHERST MATH 411 SECTION 2, FALL 2009, F. HAJIR HOMEWORK 2: DUE TH. OCT. 1 READINGS: These notes are intended as a supplement to the textbook, not a replacement for it. 1. Elements of a group, their

More information

A characterisation of p-soluble groups

A characterisation of p-soluble groups A characterisation of p-soluble groups Paul Flavell The School of Mathematics and Statistics The University of Birmingham Birmingham B15 2TT United Kingdom e-mail: p.j.flavell@bham.ac.uk If p is a prime

More information

MATH 28A MIDTERM 2 INSTRUCTOR: HAROLD SULTAN

MATH 28A MIDTERM 2 INSTRUCTOR: HAROLD SULTAN NAME: MATH 28A MIDTERM 2 INSTRUCTOR: HAROLD SULTAN 1. INSTRUCTIONS (1) Timing: You have 80 minutes for this midterm. (2) Partial Credit will be awarded. Please show your work and provide full solutions,

More information

Practice Algebra Qualifying Exam Solutions

Practice Algebra Qualifying Exam Solutions Practice Algebra Qualifying Exam Solutions 1. Let A be an n n matrix with complex coefficients. Define tr A to be the sum of the diagonal elements. Show that tr A is invariant under conjugation, i.e.,

More information

Lecture 7 Cyclic groups and subgroups

Lecture 7 Cyclic groups and subgroups Lecture 7 Cyclic groups and subgroups Review Types of groups we know Numbers: Z, Q, R, C, Q, R, C Matrices: (M n (F ), +), GL n (F ), where F = Q, R, or C. Modular groups: Z/nZ and (Z/nZ) Dihedral groups:

More information

On Maximal Subgroups of a Group with Unique Order

On Maximal Subgroups of a Group with Unique Order Available online at wwwscholarsresearchlibrarycom European Journal of Applied Engineering and Scientific Research, 208, 6():2-3 On Maximal Subgroups of a Group with Unique Order ISSN: 2278-004 M Bello

More information

Groups. s t or s t or even st rather than f(s,t).

Groups. s t or s t or even st rather than f(s,t). Groups Definition. A binary operation on a set S is a function which takes a pair of elements s,t S and produces another element f(s,t) S. That is, a binary operation is a function f : S S S. Binary operations

More information

A Simple Classification of Finite Groups of Order p 2 q 2

A Simple Classification of Finite Groups of Order p 2 q 2 Mathematics Interdisciplinary Research (017, xx yy A Simple Classification of Finite Groups of Order p Aziz Seyyed Hadi, Modjtaba Ghorbani and Farzaneh Nowroozi Larki Abstract Suppose G is a group of order

More information

ALGEBRA HOMEWORK SET 2. Due by class time on Wednesday 14 September. Homework must be typeset and submitted by as a PDF file.

ALGEBRA HOMEWORK SET 2. Due by class time on Wednesday 14 September. Homework must be typeset and submitted by  as a PDF file. ALGEBRA HOMEWORK SET 2 JAMES CUMMINGS (JCUMMING@ANDREW.CMU.EDU) Due by class time on Wednesday 14 September. Homework must be typeset and submitted by email as a PDF file. (1) Let H and N be groups and

More information

Solutions I.N. Herstein- Second Edition

Solutions I.N. Herstein- Second Edition Solutions I.N. Herstein- Second Edition Sadiah Zahoor 25, July 2016 Please email me if any corrections at sadiahzahoor@cantab.net. Problem 0.1. In the following determine whether the systems described

More information

AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS

AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS The integers are the set 1. Groups, Rings, and Fields: Basic Examples Z := {..., 3, 2, 1, 0, 1, 2, 3,...}, and we can add, subtract, and multiply

More information

Math 4320, Spring 2011

Math 4320, Spring 2011 Math 4320, Spring 2011 Prelim 2 with solutions 1. For n =16, 17, 18, 19 or 20, express Z n (A product can have one or more factors.) as a product of cyclic groups. Solution. For n = 16, G = Z n = {[1],

More information

Algebra Qualifying Exam, Fall 2018

Algebra Qualifying Exam, Fall 2018 Algebra Qualifying Exam, Fall 2018 Name: Student ID: Instructions: Show all work clearly and in order. Use full sentences in your proofs and solutions. All answers count. In this exam, you may use the

More information

EXERCISES ON THE OUTER AUTOMORPHISMS OF S 6

EXERCISES ON THE OUTER AUTOMORPHISMS OF S 6 EXERCISES ON THE OUTER AUTOMORPHISMS OF S 6 AARON LANDESMAN 1. INTRODUCTION In this class, we investigate the outer automorphism of S 6. Let s recall some definitions, so that we can state what an outer

More information