School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet IV: Composition series and the Jordan Hölder Theorem (Solutions)
|
|
- Percival Knight
- 5 years ago
- Views:
Transcription
1 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. If G/N and N both have composition series, show that G has a composition series and that the set of composition factors of G equals the union of those of G/N and those of N. [Use the Correspondence Theorem to lift the terms of a composition series to a chain of subgroups between G and N.] Solution: Let G/N = G 0 /N > G 1 /N > >G r /N = {N1} = 1 be a composition series for G/N. By the Correspondence Theorem, each subgroup in this series has the form G i /N, where G i is a subgroup of G containing N. Furthermore, G i /N G i 1 /N for all i, so the Correspondence Theorem (applied to the correspondence between subgroups of G i 1 containing N and subgroups of G i 1 /N ) shows that G i G i 1. Therefore and G i G i 1 for all i. Let G = G 0 >G 1 > >G r = N, N = N 0 >N 1 > >N s = 1 be a composition series for N. Putting this together with the above chain of subgroups, we obtain Here G = G 0 >G 1 > >G r = N 0 >N 1 > >N s = 1. G i 1 /G i = G i 1 /N G i /N (by the Third Isomorphism Theorem) is a simple group since the G i /N form a composition series for G/N, while N j 1 /N j is simple since these are the factors in a composition series for N. Hence this last series is a composition series for G. 1
2 2. Let p, q and r be prime numbers with p<q<r. Let G be a group of order pqr. (a) Suppose that G does not have a unique Sylow r-subgroup. Show that it has a unique Sylow q-subgroup Q. [Hint: If there is no normal Sylow q-subgroup, then how many elements are there of order r and how many of order q?] (b) Show that G/Q has a unique Sylow r-subgroup of the form K/Q, where K G and K = qr. (c) Show that K has a unique Sylow r-subgroup and deduce that, in fact, G has a unique Sylow r-subgroup R (contrary to the assumption in (a)). [Hint: Why is a Sylow r-subgroup of K also a Sylow r-subgroup of G? Remember that all the Sylow r-subgroups of G are conjugate.] (d) Show that G/R has a unique Sylow q-subgroup. (e) Deduce that G has a composition series G = G 0 >G 1 >G 2 >G 3 =1 where G 1 = qr and G 2 = r. Up to isomorphism, what are the composition factors of G? Solution: (a) Let G have n r Sylow r-subgroups. By Sylow s Theorem, n r 1 (mod r) and n r pq. Now p<q<r,sop, q 1 (mod r). Thus if n r = 1 then n r = pq. The Sylow r-subgroups of G are cyclic of order r, so any distinct two intersect in the identity. Hence the Sylow r-subgroups contain a total of elements of order r. n r (r 1) = pq(r 1) = pqr pq Let G have n q Sylow q-subgroups. By Sylow s Theorem, n q 1 (mod q) and n q pr. Now p<q,sop 1 (mod q). Hence n q =1,r or pr. If n q = 1, then n q r. The Sylow q-subgroups of G are cyclic of order q, so any distinct two intersect in the identity and hence they contain n q (q 1) r(q 1) >qp elements of order q. There are now more than pqr pq + pq = G elements in G, a contradiction. Hence if n r = 1, then n q =1,soG has a unique, normal, Sylow q-subgroup Q. (b) Consider the quotient group G/Q. It has order pqr/q = pr. Let n r be the number of Sylow r-subgroups in G/Q. Then by Sylow s Theorem, n r 1 (mod r) and n r p. 2
3 But p<r,sop 1 (mod r) and hence n r = 1. Thus G/Q has a normal Sylow r-subgroup. The Correspondence Theorem implies that this normal subgroup is K/Q, where K is a normal subgroup of G containing Q. As K/Q = r and Q = q, we deduce that K = qr. (c) Apply Sylow s Theorem to K. LetK have n r Sylow r-subgroups. Then n r 1 (mod r) and n r q. Since q<r, we deduce that n r = 1. Thus K has a normal Sylow r-subgroup R. Now R is one of the Sylow r-subgroups of G. All n r Sylow r-subgroups of G are conjugate, so any other Sylow r-subgroup of G has the form R x for some x G. Now R K G, so R x K x = K. This means that R x is a subgroup of K of order r, that is, a Sylow r-subgroup of K. But K has a unique Sylow r-subgroup, so R x = R. Hence G has a unique Sylow r-subgroup, contrary to the assumption we made in (a). (d) We now know our assumption made in (a) was incorrect. Thus n r = 1 and G has a normal Sylow r-subgroup, R. Consider G/R, of order pq. LetG/R have ñ q Sylow q-subgroups. Sylow s Theorem gives ñ q 1 (mod q) and ñ q p, so ñ q =1(asp<q). Thus G/R has a normal Sylow q-subgroup, L/R, where R L G and L = qr. (e) Take G 0 = G, G 1 = L, G 2 = R and G 3 = 1 (with R and L as in (d)). Then G = G 0 >G 1 >G 2 >G 3 =1 with G i G i 1 for all i. (In fact, we have shown that this is a normal series: G i G for all i.) Certainly G 1 = L = qr and G 2 = R = r. The factors G 0 /G 1,G 1 /G 2,G 2 /G 3 have orders p, q and r, respectively. Consequently these are all simple, cyclic, groups. Thus this is a composition series for G. 3. Let p be a prime number and let G be a non-trivial p-group. Show that G has a chain of subgroups G = G 0 >G 1 >G 2 > >G n =1 such that G i is a normal subgroup of G and G : G i = p i for i =0,1,...,n. What are the composition factors of G? [Hint: Use the fact that Z(G) = 1toproduceanelementx Z(G) oforderp. quotient group G/K where K = x and apply induction.] Consider the 3
4 Solution: Let G = p n and induct on n. If n = 0, then G = G 0 = 1 is the required composition series. Suppose then that n>1, and that the result holds for all finite p-groups of order smaller than G. Now G is a non-trivial p-group and hence Z(G) = 1. Letx be any non-identity element in Z(G). Then the order of x is a non-trivial power of p, say x = p r with r>0. Then x pr 1 is an element in Z(G) of order p. Rename so that x is this element of Z(G) of order p. Now X = x is a subgroup of G of order p that is contained in the centre of G. Hence X G. (Ifg G and y Z(G), then g 1 yg = y.) Consider the quotient group G/X: a p-group of order G /p = p n 1. Hence by induction G/X has a composition series G/X = G 0 /X > G 1 /X > >G n 1 /X = {X1} = 1 where G/X : G i /X = p i for i =0,1,...,n 1. Each G i /X corresponds to a subgroup G i of G containing X, so we obtain a chain of subgroups G = G 0 >G 1 > >G n 1 = X>1. Here G i G i 1 for i =1,2,...,n 1 by the Correpondence Theorem. Also, G i = G i /X p, and G : G i = G/X : G i /X = p i for i =0,1,...,n 1. Defining G n = 1 produces a series for G G = G 0 >G 1 > >G n = 1 where G : G i = p i for all i. Consequently, G i = p n i and G i 1 /G i = p for all i. Hence the factors in this series are simple groups, this is a composition series for G, and the n composition factors for G are each isomorphic to C p. 4. The dihedral group D 8 has seven different composition series. Find all seven. Solution: Recall that D 8 = α, β where α has order four, β has order two, and αβ = βα 1. Since D 8 is a 2-group, the previous question tells us that its composition factors are all cyclic of order two and hence every composition series for D 8 has the form D 8 = G 0 >G 1 >G 2 >G 3 = 1 where G 1 = 4 and G 2 =2. One possibility for G 1 is that it is cyclic of order four. All elements of D 8 not in α have order two (see Tutorial Sheet I). Hence α is the only cyclic subgroup of order 4 and this has a unique subgroup of order two, namely α 2. Thus D 8 > α > α 2 > 1 is a composition series for D 8 and this is the only one with G 1 cyclic. 4
5 Consider now the other possibilities for G 1. If it is not cyclic then it must contain no elements of order four. Hence G 1 contains the identity element and three elements from the following set of elements of order two: {α 2,β,αβ,α 2 β,α 3 β}. Since α, α 3 G 1, we see that there are only two possibilities: or G 1 = {1,α 2,β,α 2 β} = α 2,β G 1 = {1,α 2,αβ,α 3 β} = α 2,αβ. Each of these is isomorphic to V 4 = C2 C 2. Picking any element of order two in them determines G 2. Hence we find six more composition series: D 8 > α 2,β > α 2 > 1 D 8 > α 2,β > β > 1 D 8 > α 2,β > α 2 β > 1 D 8 > α 2,αβ > α 2 > 1 D 8 > α 2,αβ > αβ > 1 D 8 > α 2,αβ > α 3 β > 1 Thus there are seven composition series for D How many different composition series does the quaternion group Q 8 have? Solution: Recall that Q 8 = {±1, ±i, ±j, ±k}. Since Q 8 is a 2-group, Question 3 tells us that its composition factors are all cyclic of order two and hence every composition series for Q 8 has the form Q 8 = G 0 >G 1 >G 2 >G 3 = 1 where G 1 = 4 and G 2 = 2. Now Q 8 has a unique element of order two, namely 1. Hence G 2 = 1 is immediately determined. The subgroup G 1 is cyclic of order 4 (it is not isomorphic to C 2 C 2 as there are not enough elements of order two). Thus G 1 is determined by picking a generator. There are six elements of order 4 in Q 8 and therefore three cyclic groups of order four. Hence the composition series for Q 8 are: Q 8 > i > 1 > 1 Q 8 > j > 1 > 1 Q 8 > k > 1 > 1 5
6 6. Let G be a group, N be a normal subgroup of G and suppose that G = G 0 >G 1 >G 2 > >G n =1 is a composition series for G. Define N i = N G i for i =0,1,...,n. (a) Show that N i+1 is a normal subgroup of N i for i =0,1,...,n 1. (b) Use the Second Isomorphism Theorem to show that [Hint: Note that N i+1 = G i+1 (G i N).] N i /N i+1 = (G i N)G i+1 G i+1. (c) Show that (G i N)G i+1 is a normal subgroup of G i containing G i+1. Deduce that (G i N)G i+1 /G i+1 is either equal to G i /G i+1 or to the trivial group. [Remember that G i /G i+1 is simple.] (d) Deduce that N possesses a composition series. [Hint: Delete repeats in the series (N i ).] Solution: (This is the proof of a theorem, namely that a normal subgroup of a group with a composition series also has a composition series, so we present the proof as a whole. The solution to each part can be extracted quite easily.) Let G = G 0 >G 1 > >G n = 1 be a composition series for G and let N be a normal subgroup of G. N i = N G i for each i. Then Define N = N 0 N 1 N 2 N n = 1 (3) is a descending chain of subgroups. If x N G i+1 and g N G i, then g 1 xg N as x, g N and g 1 xg G i+1 as G i+1 G i, so g 1 xg N G i+1. Hence N i+1 N i for each i. Therefore (3) is a subnormal series for N. We show that it is a composition series. Now N i /N i+1 = N G i N G i+1 = N G i (N G i ) G i+1 as G i+1 G i = (N G i )G i+1 G i+1 by the Second Isomorphism Theorem (as N G i G i and G i+1 G i ). Since N G, it follows that N G i G i, and since also G i+1 G i we deduce that (N G i )G i+1 G i. Therefore, by the Correspondence Theorem, (N G i )G i+1 G i+1 G i G i+1. 6
7 However, the latter group is simple, so either (N G i )G i+1 G i+1 = 1 or G i G i+1. The above isomorphism implies that either N i = N i+1 or N i /N i+1 ( = G i /G i+1 ) is simple. It follows that the factors in (3) are either trivial or simple. Hence, if we delete any repetitions occurring in (3), we obtain a composition series for N. 7. Let G be a group, N be a normal subgroup of G and suppose that G = G 0 >G 1 >G 2 > >G n =1 is a composition series for G. Define Q i = G i N/N for i =0,1,...,n. (a) Show that Q i is a subgroup of G/N such that Q i+1 is a normal subgroup of Q i for i =0,1,..., n 1. (b) Use Dedekind s Modular Law to show that G i+1 N G i =(G i N)G i+1. Show that Q i /Q i+1 = G i /G i+1 (G i N)G i+1 /G i+1. [Hint: Use the Third Isomorphism Theorem, the Second Isomorphism Theorem and note that G i N = G i (G i+1 N)sinceG i+1 G i.] (c) Show that (G i N)G i+1 is a normal subgroup of G i containing G i+1. Deduce that (G i N)G i+1 /G i+1 is either equal to G i /G i+1 or to the trivial group. [Remember that G i /G i+1 is simple.] Hence show that the quotient on the right hand side in (b) is either trivial or isomorphic to G i /G i+1. (d) Deduce that G/N possesses a composition series. Solution: Let (As with the previous question, we now produce a complete proof.) G = G 0 >G 1 > >G n = 1 be a composition series for G. Since N G, we obtain a collection of subgroups G = G 0 N G 1 N G n N = N and the Correspondence Theorem gives a chain of subgroups of G/N: G/N = G 0 N/N G 1 N/N G n N/N = 1. (4) Define Q i = G i N/N. Ifx G i+1 and g G i, then g 1 xg G i+1,so (Ng) 1 (Nx)(Ng) G i+1 N/N = Q i+1 and hence Q i+1 Q i. Now G i+1 G i, so Dedekind s Modular Law gives G i+1 N G i =(G i N)G i+1. 7
8 Then Q i /Q i+1 = G in/n G i+1 N/N G i N = G i+1 N = (G ig i+1 )N G i+1 N = = G i G i G i+1 N by the Third Isomorphism Theorem as G i+1 G i by the Second Isomorphism Theorem (G i G i N, G i+1 N G i N) G i (G i N)G i+1 by Dedekind s Modular Law = G i /G i+1 (G i N)G i+1 /G i+1 by the Third Isomorphism Theorem. Now G i /G i+1 is a simple group and we are factoring it by some normal subgroup. Consequently, the quotient is either trivial or is isomorphic to G i /G i+1. Thus Q i /Q i+1 = 1 or Gi /G i+1. Upon deleting repetitions from the series (4), we obtain a series whose factors are isomorphic to some of the G i /G i+1. Thus G/N has a composition series. 8. The purpose of this question is to prove the Jordan Hölder Theorem. Let G be a group and suppose that and G = G 0 >G 1 > >G n =1 G = H 0 >H 1 > >H m =1 are two composition series for G. Proceed by induction on n. (a) If n =0,showthatG =1andthattheJordan HölderTheoremholds. (b) Suppose n 1. Suppose that G 1 = H 1. Observe that the theorem holds for this case. (c) Now suppose that G 1 = H 1. Use the fact that G 0 /G 1 and H 0 /H 1 are simple to show that G 1 H 1 = G. [Hint: Observe that it is a normal subgroup containing both G 1 and H 1.] (d) Define D = G 1 H 1. Show that D is a normal subgroup of G such that G 0 /G 1 = H1 /D and H 0 /H 1 = G1 /D. (e) Use Question 6 to see that D possesses a composition series D = D 2 >D 3 > >D r =1. (f) Observe that we now have four composition series for G: G = G 0 >G 1 >G 2 > >G n =1 G = G 0 >G 1 >D= D 2 > >D r =1 G = H 0 >H 1 >D= D 2 > >D r =1 G = H 0 >H 1 >H 2 > >H m =1. Apply the case of part (b) (twice) and the isomorphisms of part (d) to complete the induction step of the proof. 8
9 Solution: Let G = G 0 >G 1 >G 2 > >G n = 1 G = H 0 >H 1 >H 2 > >H m = 1 be composition series for G. We prove the Jordan Hölder Theorem by induction on n (the length of some composition series for G). If n = 0, then G = 1, which forces m = 0 and the required correspondence between the composition factors vacuously exists (neither series has any factors!). Suppose then that n 1 and that the theorem holds for all groups possessing shorter composition series. Consider two cases: Case 1: G 1 = H 1. Then G 1 >G 2 > >G n = 1 G 1 = H 1 >H 2 > >H m = 1 are composition series for G 1 (since in both cases the factors are simple) and the first has length n 1. By induction, n 1=m 1 and there is a one-one correspondence between and {G 1 /G 2,G 2 /G 3,...,G n 1 /G n } {H 1 /H 2,H 2 /H 3,...,H m 1 /H m } such that corresponding factors are isomorphic. Since G 0 /G 1 = H 0 /H 1, this immediately extends to a one-one correspondence between and {G 0 /G 1,G 1 /G 2,...,G n 1 /G n } {H 0 /H 1,H 1 /H 2,...,H m 1 /H m } such that corresponding factors are isomorphic. Case 2: G 1 = H 1. Now G 1 G and H 1 G, sog 1 H 1 G. Now G 1 G 1 H 1 G 0 = G and G 0 /G 1 is simple, so G 1 H 1 = G or G 1. If G 1 H 1 = G 1, then H 1 G 1 H 1 = G 1 and H 1 G 1 G = H 0. Since H 0 /H 1 is simple, this implies that H 1 = G 1, contrary to assumption. Therefore G 1 H 1 = G. Let D = G 1 H 1 G. By the Second Isomorphism Theorem G 1 /(G 1 H 1 ) = G 1 H 1 /H 1 = G/H 1 = H 0 /H 1 H 1 /(G 1 H 1 ) = G 1 H 1 /G 1 = G/G 1 = G 0 /G 1. 9
10 Thus G 1 /D = H 0 /H 1 and H 1 /D = G 0 /G 1. (5) Now let D = D 2 >D 3 > >D r = 1 be a composition series for D. (This exists since D G, by Question 6.) We now have four series with simple factors, i.e., composition series, for G: G = G 0 >G 1 >G 2 > >G n = 1 (6) G = H 0 >H 1 >H 2 > >H m = 1 (7) G = G 0 >G 1 >D= D 2 >D 3 > >D r = 1 (8) G = H 0 >H 1 >D= D 2 >D 3 > >D r = 1 (9) ((5) implies that the second factors in (8) and (9) are both simple groups.) Apply Case 1 to (6) and (8). We deduce that r = n and that the composition factors occurring in the two series are in one-one correspondence such that corresponding factors are isomorphic. Now compare (8) and (9). The only composition factors which are not identical are the first two in both cases. However, (5) says that the first factor for (8) is isomorphic to the second for (9) and vice versa. Hence we obtain the required correspondence between the factors of (8) and (9) (so G 0 /G 1 corresponds to H 1 /D and G 1 /D to H 0 /H 1 ). Finally apply Case 1 to (9) and (7). (We know the former has length n(= r), so it is valid to apply Case 1.) We deduce that r = m and the composition factors are in the required one-one correspondence. Putting this all together, we deduce that n = r = m and, upon composing the sequence of three correspondences, that there is a one-one correspondence between the composition factors of (6) and (7) such that corresponding factors are isomorphic. This completes the inductive step. 9. Let G be a simple group of order 60. (a) Show that G has no proper subgroup of index less than 5. Show that if G has a subgroup of index 5, then G = A 5. [Hint for both parts: If H is a subgroup of index k, actonthesetofcosetstoproducea permutation representation. What do we know about the kernel?] (b) Let S and T be distinct Sylow 2-subgroups of G. Show that if x S T then C G (x) 12. Deduce that S T =1. [Hint: WhyareS and T abelian?] (c) Deduce that G has at most five Sylow 2-subgroups and hence that indeed G = A 5. [Hint: The number of Sylow 2-subgroups equals the index of a normaliser.] Thus there is a unique simple group of order 60 up to isomorphism. 10
11 Solution: (a) Let H be a subgroup of G of index r where 2 r 5. Act by right multiplication on the cosets of H: (Hx,g) Hxg. This determines a homomorphism ρ: G S r. The kernel of ρ is a normal subgroup of G contained in H, sokerρ = 1. Hence G = im ρ S r,so 60 = G = im ρ r!. Thus r {2, 3, 4}; that is, G has no proper subgroup of index less than 5. If r = 5, then G is isomorphic to a subgroup of S 5 of index 2 and hence im ρ = A 5 and G = A 5 (by Tutorial Sheet III, Quesion 1). (b) Suppose x S T. Since S and T have order four, they are, in particular, abelian. Thus x commutes with every element of S and with every element of T. This gives S, T C G (x) and ST C G (x). Note ST = S T / S T 4 4/2 = 8. Thus C G (x) has at least 8 elements. On the other hand, C G (x) is a subgroup of G so has order dividing 60. Furthermore, S is a subgroup of C G (x), so 4 divides the order of C G (x). This implies that C G (x) 12 (since 8 60). Therefore G :C G (x) 5. Part (a) implies that C G (x) =G or G :C G (x) =5. IfS T = 1, then there exists a non-identity element x S T.IfC G (x) =G, then x Z(G) and x is a non-trivial proper normal subgroup of G, contradicting the simplicity of G. Thus if 1 = x S T, then G :C G (x) = 5. Hence G = A 5 by part (a). The Sylow 2-subgroups of A 5 have order 4 and thus V 4 = {1, (1 2)(3 4), (1 3)(2 4), (1 4)(2 3)} is one such Sylow 2-subgroup. Also, V 4 A 4,soN A5 (V 4 ) A 4. Consequently the number of conjugates of V 4 in A 5 is A 5 :N A5 (V 4 ) A 5 : A 4 =5. We can make five Sylow 2-subgroups by changing the fixed point (V 4 corresponds to fixing the point 5). Hence A 5 has exactly five Sylow 2-subgroups and a calculation shows that any two Sylow 2-subgroups of A 5 intersect in the identity. (For example, the only element of V 4 which fixes 5 and another point is the identity.) 11
12 Thus if S T = 1, we obtain a contradiction. We have shown that either C G (x) =G which produces a non-trivial central subgroup, or G = A 5 where Sylow 2-subgroups actually intersect in the identity. Hence S T = 1. (c) We now use part (b) to count the elements in G. Let n 2 be the number of Sylow 2-subgroups of G. By Sylow s Theorem, n 2 15, so n 2 =3,5or15. (Remember that G is simple, so n 2 = 1.) If n 2 = 3, then the normaliser of a Sylow 2-subgroup would have index 3, which is impossible by part (a). Thus n 2 = 5 or 15. If n 2 = 15, then by part (b), any two distinct Sylow 2-subgroups intersect in the identity, so they contain a total of 15 3=45 non-identity elements. Let n 5 be the number of Sylow 5-subgroups. Sylow s Theorem gives n 5 1 (mod 5) and n 5 12, so n 5 = 6. Hence the Sylow 5-subgroups (any pair of which intersect trivially) account for 6 4=24 non-identity elements. We now have too many elements: the Sylow 3- and 5-subgroups account for = 69 elements. Thus n 2 =15. We deduce that n 2 = 5 and if S is a Sylow 2-subgroup, then G :N G (S) = n 2 =5. Now part (a) gives G = A 5, as required. 12
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 informationSelected 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 informationSupplementary Notes: Simple Groups and Composition Series
18.704 Supplementary Notes: Simple Groups and Composition Series Genevieve Hanlon and Rachel Lee February 23-25, 2005 Simple Groups Definition: A simple group is a group with no proper normal subgroup.
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationAlgebra 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 information1.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 information3. 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 informationMA441: 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 informationSection III.15. Factor-Group Computations and Simple Groups
III.15 Factor-Group Computations 1 Section III.15. Factor-Group Computations and Simple Groups Note. In this section, we try to extract information about a group G by considering properties of the factor
More informationits image and kernel. A subgroup of a group G is a non-empty subset K of G such that k 1 k 1
10 Chapter 1 Groups 1.1 Isomorphism theorems Throughout the chapter, we ll be studying the category of groups. Let G, H be groups. Recall that a homomorphism f : G H means a function such that f(g 1 g
More informationMath 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 informationCONSEQUENCES 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 informationAlgebra-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 informationSchool of Mathematics and Statistics. MT5824 Topics in Groups. Handout 0: Course Information
MRQ 2009 School of Mathematics and Statistics MT5824 Topics in Groups Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT4003 Groups. Lectures: Mon (odd), Wed & Fri 10am, Lecture
More informationExercises 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 informationMath 210A: Algebra, Homework 5
Math 210A: Algebra, Homework 5 Ian Coley November 5, 2013 Problem 1. Prove that two elements σ and τ in S n are conjugate if and only if type σ = type τ. Suppose first that σ and τ are cycles. Suppose
More informationSection 15 Factor-group computation and simple groups
Section 15 Factor-group computation and simple groups Instructor: Yifan Yang Fall 2006 Outline Factor-group computation Simple groups The problem Problem Given a factor group G/H, find an isomorphic group
More information[x, y] =x 1 y 1 xy. Definition 7.1 Let A and B be subgroups of a group G. Define the commutator. [A, B] = [a, b] a A, b B,
Chapter 7 Nilpotent Groups Recall the commutator is given by [x, y] =x 1 y 1 xy. Definition 7.1 Let A and B be subgroups of a group G. Define the commutator subgroup [A, B] by [A, B] = [a, b] a A, b B,
More informationJohns Hopkins University, Department of Mathematics Abstract Algebra - Spring 2009 Midterm
Johns Hopkins University, Department of Mathematics 110.401 Abstract Algebra - Spring 2009 Midterm Instructions: This exam has 8 pages. No calculators, books or notes allowed. You must answer the first
More informationSolutions 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 informationOn 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 informationCHAPTER III NORMAL SERIES
CHAPTER III NORMAL SERIES 1. Normal Series A group is called simple if it has no nontrivial, proper, normal subgroups. The only abelian simple groups are cyclic groups of prime order, but some authors
More informationSolutions 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 informationANALYSIS 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 informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationLECTURES 11-13: CAUCHY S THEOREM AND THE SYLOW THEOREMS
LECTURES 11-13: CAUCHY S THEOREM AND THE SYLOW THEOREMS Recall Lagrange s theorem says that for any finite group G, if H G, then H divides G. In these lectures we will be interested in establishing certain
More informationMath 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 informationExercises 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 informationSchool 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 informationDefinitions. 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 informationMATH 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 information1 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 informationMath 594. Solutions 5
Math 594. Solutions 5 Book problems 6.1: 7. Prove that subgroups and quotient groups of nilpotent groups are nilpotent (your proof should work for infinite groups). Give an example of a group G which possesses
More informationS11MTH 3175 Group Theory (Prof.Todorov) Quiz 6 (PracticeSolutions) Name: 1. Let G and H be two groups and G H the external direct product of G and H.
Some of the problems are very easy, some are harder. 1. Let G and H be two groups and G H the external direct product of G and H. (a) Prove that the map f : G H H G defined as f(g, h) = (h, g) is a group
More informationCLASSIFICATION 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 informationMATH 251, Handout on Sylow, Direct Products, and Finite Abelian Groups
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
More informationALGEBRA 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 informationGroup 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 informationRepresentation Theory
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 Paper 1, Section II 19I 93 (a) Define the derived subgroup, G, of a finite group G. Show that if χ is a linear character
More informationBasic 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 informationPRACTICE 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 informationDISCRETE 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 informationGroups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems
Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A non-empty set ( G,*)
More informationIntroduction to Groups
Introduction to Groups Hong-Jian Lai August 2000 1. Basic Concepts and Facts (1.1) A semigroup is an ordered pair (G, ) where G is a nonempty set and is a binary operation on G satisfying: (G1) a (b c)
More informationAlgebraic 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 informationModern 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 informationAlgebra 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 informationALGEBRA QUALIFYING EXAM PROBLEMS
ALGEBRA QUALIFYING EXAM PROBLEMS Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND MODULES General
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #3. Fill in the blanks as we finish our first pass on prerequisites of group theory.
MATH 101: ALGEBRA I WORKSHEET, DAY #3 Fill in the blanks as we finish our first pass on prerequisites of group theory 1 Subgroups, cosets Let G be a group Recall that a subgroup H G is a subset that is
More informationQUALIFYING EXAM IN ALGEBRA August 2011
QUALIFYING EXAM IN ALGEBRA August 2011 1. There are 18 problems on the exam. Work and turn in 10 problems, in the following categories. I. Linear Algebra 1 problem II. Group Theory 3 problems III. Ring
More informationMay 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 informationSUMMARY 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 informationNormal Subgroups and Factor Groups
Normal Subgroups and Factor Groups Subject: Mathematics Course Developer: Harshdeep Singh Department/ College: Assistant Professor, Department of Mathematics, Sri Venkateswara College, University of Delhi
More informationChief factors. Jack Schmidt. University of Kentucky
Chief factors Jack Schmidt University of Kentucky 2008-03-05 Chief factors allow a group to be studied by its representation theory on particularly natural irreducible modules. Outline What is a chief
More informationHomework #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 informationMAT534 Fall 2013 Practice Midterm I The actual midterm will consist of five problems.
MAT534 Fall 2013 Practice Midterm I The actual midterm will consist of five problems. Problem 1 Find all homomorphisms a) Z 6 Z 6 ; b) Z 6 Z 18 ; c) Z 18 Z 6 ; d) Z 12 Z 15 ; e) Z 6 Z 25 Proof. a)ψ(1)
More informationx 2 = xn xn = x 2 N = N = 0
Potpourri. Spring 2010 Problem 2 Let G be a finite group with commutator subgroup G. Let N be the subgroup of G generated by the set {x 2 : x G}. Then N is a normal subgroup of G and N contains G. Proof.
More information(1) Let G be a finite group and let P be a normal p-subgroup of G. Show that P is contained in every Sylow p-subgroup of G.
(1) Let G be a finite group and let P be a normal p-subgroup of G. Show that P is contained in every Sylow p-subgroup of G. (2) Determine all groups of order 21 up to isomorphism. (3) Let P be s Sylow
More informationGroups with Few Normalizer Subgroups
Irish Math. Soc. Bulletin 56 (2005), 103 113 103 Groups with Few Normalizer Subgroups FAUSTO DE MARI AND FRANCESCO DE GIOVANNI Dedicated to Martin L. Newell Abstract. The behaviour of normalizer subgroups
More informationPh.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018
Ph.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018 Do 6 problems with at least 2 in each section. Group theory problems: (1) Suppose G is a group. The
More informationStab(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 informationarxiv: v3 [math.co] 4 Apr 2011
Also available on http://amc.imfm.si ARS MATHEMATICA CONTEMPORANEA x xxxx) 1 x Hamiltonian cycles in Cayley graphs whose order has few prime factors arxiv:1009.5795v3 [math.co] 4 Apr 2011 K. Kutnar University
More informationTwo 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 informationFinitary Permutation Groups
Finitary Permutation Groups Combinatorics Study Group Notes by Chris Pinnock You wonder and you wonder until you wander out into Infinity, where - if it is to be found anywhere - Truth really exists. Marita
More informationTeddy Einstein Math 4320
Teddy Einstein Math 4320 HW4 Solutions Problem 1: 2.92 An automorphism of a group G is an isomorphism G G. i. Prove that Aut G is a group under composition. Proof. Let f, g Aut G. Then f g is a bijective
More informationAlgebra 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(5.11) (Second Isomorphism Theorem) If K G and N G, then K/(N K) = NK/N. PF: Verify N HK. Find a homomorphism f : K HK/N with ker(f) = (N K).
Lecture Note of Week 3 6. Normality, Quotients and Homomorphisms (5.7) A subgroup N satisfying any one properties of (5.6) is called a normal subgroup of G. Denote this fact by N G. The homomorphism π
More informationConnectivity of Cayley Graphs: A Special Family
Connectivity of Cayley Graphs: A Special Family Joy Morris Department of Mathematics and Statistics Trent University Peterborough, Ont. K9J 7B8 January 12, 2004 1 Introduction Taking any finite group G,
More informationSUMMARY OF GROUPS AND RINGS GROUPS AND RINGS III Week 1 Lecture 1 Tuesday 3 March.
SUMMARY OF GROUPS AND RINGS GROUPS AND RINGS III 2009 Week 1 Lecture 1 Tuesday 3 March. 1. Introduction (Background from Algebra II) 1.1. Groups and Subgroups. Definition 1.1. A binary operation on a set
More informationThe Symmetric Groups
Chapter 7 The Symmetric Groups 7. Introduction In the investigation of finite groups the symmetric groups play an important role. Often we are able to achieve a better understanding of a group if we can
More informationMath 256 (11) - Midterm Test 2
Name: Id #: Math 56 (11) - Midterm Test Spring Quarter 016 Friday May 13, 016-08:30 am to 09:0 am Instructions: Prob. Points Score possible 1 10 3 18 TOTAL 50 Read each problem carefully. Write legibly.
More informationAlgebra. Travis Dirle. December 4, 2016
Abstract Algebra 2 Algebra Travis Dirle December 4, 2016 2 Contents 1 Groups 1 1.1 Semigroups, Monoids and Groups................ 1 1.2 Homomorphisms and Subgroups................. 2 1.3 Cyclic Groups...........................
More informationCourse 311: Abstract Algebra Academic year
Course 311: Abstract Algebra Academic year 2007-08 D. R. Wilkins Copyright c David R. Wilkins 1997 2007 Contents 1 Topics in Group Theory 1 1.1 Groups............................... 1 1.2 Examples of Groups.......................
More informationSimple groups and the classification of finite groups
Simple groups and the classification of finite groups 1 Finite groups of small order How can we describe all finite groups? Before we address this question, let s write down a list of all the finite groups
More informationMAT1100HF ALGEBRA: ASSIGNMENT II. Contents 1. Problem Problem Problem Problem Problem Problem
MAT1100HF ALEBRA: ASSINMENT II J.A. MRACEK 998055704 DEPARTMENT OF MATHEMATICS UNIVERSITY OF TORONTO Contents 1. Problem 1 1 2. Problem 2 2 3. Problem 3 2 4. Problem 4 3 5. Problem 5 3 6. Problem 6 3 7.
More informationThe 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 informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is
More informationKevin 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φ(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 informationLecture 5.6: The Sylow theorems
Lecture 5.6: The Sylow theorems Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 5.6:
More informationAbstract Algebra II Groups ( )
Abstract Algebra II Groups ( ) Melchior Grützmann / melchiorgfreehostingcom/algebra October 15, 2012 Outline Group homomorphisms Free groups, free products, and presentations Free products ( ) Definition
More informationChapter 25 Finite Simple Groups. Chapter 25 Finite Simple Groups
Historical Background Definition A group is simple if it has no nontrivial proper normal subgroup. The definition was proposed by Galois; he showed that A n is simple for n 5 in 1831. It is an important
More informationSolutions of exercise sheet 4
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 4 The content of the marked exercises (*) should be known for the exam. 1. Prove the following two properties of groups: 1. Every
More informationEXERCISE SHEET 2 WITH SOLUTIONS
EXERCISE SHEET 2 WITH SOLUTIONS Some solutions are sketches only. If you want more details, ask me! (E35) Show that, for any prime power q, PG 2 (q) is an abstract projective plane. Answer. If < u > and
More informationHomework 2 /Solutions
MTH 912 Group Theory 1 F18 Homework 2 /Solutions #1. Let G be a Frobenius group with complement H and kernel K. Then K is a subgroup of G if and only if each coset of H in G contains at most one element
More informationExtra 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 informationAlgebra I: Final 2012 June 22, 2012
1 Algebra I: Final 2012 June 22, 2012 Quote the following when necessary. A. Subgroup H of a group G: H G = H G, xy H and x 1 H for all x, y H. B. Order of an Element: Let g be an element of a group G.
More informationMATH 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 informationHomework Problems, Math 200, Fall 2011 (Robert Boltje)
Homework Problems, Math 200, Fall 2011 (Robert Boltje) Due Friday, September 30: ( ) 0 a 1. Let S be the set of all matrices with entries a, b Z. Show 0 b that S is a semigroup under matrix multiplication
More informationExercises 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 informationFINITE 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 information2. The center of G, denoted by Z(G), is the abelian subgroup which commutes with every elements of G. The center always contains the unit element e.
Chapter 2 Group Structure To be able to use groups in physics, or mathematics, we need to know what are the important features distinguishing one group from another. This is under the heading of group
More informationSolutions 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 informationName: Solutions - AI FINAL EXAM
1 2 3 4 5 6 7 8 9 10 11 12 13 total Name: Solutions - AI FINAL EXAM The first 7 problems will each count 10 points. The best 3 of # 8-13 will count 10 points each. Total is 100 points. A 4th problem from
More informationBefore you begin read these instructions carefully.
MATHEMATICAL TRIPOS Part IA Tuesday, 4 June, 2013 1:30 pm to 4:30 pm PAPER 3 Before you begin read these instructions carefully. The examination paper is divided into two sections. Each question in Section
More informationABSTRACT 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 informationOn the characterization of the numbers n such that any group of order n has a given property P
On the characterization of the numbers n such that any group of order n has a given property P arxiv:1501.03170v1 [math.gr] 6 Jan 2015 Advisor: Professor Thomas Haines Honors Thesis in Mathematics University
More informationOn a subalgebra of the centre of a group ring
Journal of Algebra 295 (2006) 293 302 www.elsevier.com/locate/jalgebra On a subalgebra of the centre of a group ring Harald Meyer Universität Bayreuth, Lehrstuhl IV für Mathematik, 95440 Bayreuth, Germany
More informationGroups. Chapter 1. If ab = ba for all a, b G we call the group commutative.
Chapter 1 Groups A group G is a set of objects { a, b, c, } (not necessarily countable) together with a binary operation which associates with any ordered pair of elements a, b in G a third element ab
More informationSF2729 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