Scribd Logo
Upload

Welcome to Scribd!

  • Abstract Algebra I N Herstein Solution

    Uploaded by

    mike dennes
    6 views131 pages
    Abstract Algebra I N Herstein Solution

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Abstract Algebra I N Herstein Solution

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    6 views131 pages

    Abstract Algebra I N Herstein Solution

    Uploaded by

    mike dennes
    Abstract Algebra I N Herstein Solution

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 131
    Herstcin Abstract Alscbra Student's Solution Mauwal hitp:\/research eyberce/~madeline/herstein h STUDE SOLUTION MANUAL, Abstract : Algebra Mace lan Publish: NewYork Collier Macmillan Publish@rs London g Company Herstcin Abstract Alecbra Student's Solution Mauna nip: research eyber ee/~medeline/herstein Preface ‘Ast teased in te book Abstract Algebra, its vey important that you ty to solve many ofthe problems fs nie to solve a given proba, butt is more portant © make an aftompt tO soe it "There ts na better way or you 1 est how much contol you have Owe the material. Ks too mich 1» expect at you wil ty, solve al or most ofthe large number of problems appearing inthe ‘book. The chit thing is that you take a stab ata good cross-section of them. In hs addendum tothe book you wil ind solutons to many of the problems. Roughly one-hal of ‘he #0-callod Easier Probloms are solved here, a slighty higher tacton of the Midle-Lovel Problems algo have tae solution given. The soluton is given for a rater largo fracton of to Harder Problems or Very Hard Probioms. Thoto is no systematic way—for instance, every socond ‘one-—ia which I chose those exereiaes for which I give slutons. The choice was made on the ‘bass of how instretve or usu a given solution would be forthe student who atomaled a given problem and aid not succeed in solving Even Hf you do solve a particular one, i might be of fntorsto you to compare your approach and mine to Pat exercise. Thee a great temptation 1 pack a he solution aftr an inital atemptat a problem tals, Doe ‘ive in to this temptation. Ony after you have thought about a problem and approached it toma ‘Variety of angles and sti didn’ gett should you 100k up the soliton in tis booklet To give in and peek prematurely salt deleating for takes away fom both the challenge and learning ‘Sxperionce tit You could have i tunking Brough the mater on your own, ‘What | have writen abowe apples partcualy to those problems designated as Harder Problems ‘or Very Hard Probloms. These problems in general, were designed lo challenge the would-be ‘solver to te uimost So dont be discouraged # you flo solve a great many of them. The fun you ‘rive should bo nthe ation and not necessary nthe success, of grappling with something ‘tic The problems are occasionally not rated as to ificully. This is deliberate on my part The aility te guess oro judgo the dificult ofa sialon can be an essental pat of the learning process. Solutions o same problems depend oa hase of other ones. There i olen some cross-reference Inicated in the statement of tho problem. Some problems come a litle before the required material ‘needed to handle them has been discussed. Ths sores two purboees. Fst it gives youa chance 1 dovelop come ofthe needed notions on your own. Second, it tonds to show you that is materiat thas some a tt and that it allows you todo things which you were unable to do witwout i “Atany rate, hope you have ftsof fun with the problems, hat they challenge you enough, aad that they dont frustrate you to often. wut Herstcin Abstract Alscbra Student's Solution Mauwal hitp\/research eyberee Contents CHAPTER 1: Things Familar and Loss Familiar mite ‘CHAPTER 2: Groups CHAPTER 9: The Symmetic Group SBR CHAPTER 4: Ring Theory Herstcin Abstract Alscbra Student's Solution Mauwal hitp:\/research eyberce/~madeline/herstein h 1 Things Familiar and Less Familiar SECTION 2. Easier Problems. 3. AnBAC is the set of all women residents of the United States who are Canadian citizens, AB is the set of all non-Canadian residents of the United States, A - C is the set of all male residents of the United States, and C ~ A is the set of all the women in the world not residing in the United States. 4 a-9 6 WACBandifuCAUC thenuEACrUEC ITUEA then ueB since AGB, hence u is certainly in uC. On the other hand, iw € C then v € But. Thus, in either case,u€ BUC, whence AUC C BUC. 8. if uts in(A- 6) u(B ~ A) then u is certainly in Au; ifuis inA-6 then u is not in B so is not in An B hence u Is in (Au B) - (AB). ‘Similarly, if u is inB - A then ts in (Au B) -(AnB) Therefore (A ~ 8B) u (8 - A) C(A UB) - (AB). On the other hand, if ue (Au B) - (ANB) then UAB and u isnot in both A andB ; thus Hf u isin A then u is got in Bhence u is in A~6, Similarly, if vis inB then u is not in 8 ~ A. Thus in all cases u is in (A - 8) u(B - A), whence (Au 6) - (AaB) C(A-B)u (G-A) We thus get the required equality of these two sets 10. Since A u (6 AC) is contained in both AuB and AuC we get that (AuB) a(AuC)> Au (BAC). For the other way, ifue(AuB)a(AuC), then u is in both Au B and A uC and, if u is not in A, then ue B andue C so 1 Herstcin Abstract Alscbra Student's Solution Mauwal hitp:\/research eyberce/~madeline/herstein h 2./ Student's Solutions Manual that u€ B nC, and sou € Au (B aC), If u should happen to be in A then certainly u is in Au (B.C). So we get that If u is in (AUB) n(AuC) then u Is in AU(B nC), hence (AUB) a(AUC)CAU(B AC). This proves the desired equality of the sets i 11, The subsets of S = (1,2,3,4) are 16 in number. They are: S, (1),(2),(3], ' (4), 1,21,(1,3),01,41,(2,3),(2,4),(3,4),(1,2,31,(1,2,4),(1,3,4),(2,3,4), and the 2 empty set. : Middle-Level Problems. 12. (a). If v (An BY then u cannot be in both A and B. If u is nat in A then UIs in A’ and if u is not in B then u is in", hence u ¢ A’ u 8”. Thus (An BY CA UB: Since AD ANB. AC (ANB), similarly BC (An BY, hence A’ vB’ < (An BY’. This proves that (An 6) = A UB’ (b) For any subset C of S, (CY = C from the very definition of C” Thus, by Part (a), (Cv D'Y =(C'Y m(D'Y = CaO. Let A=C’ andB = 0%; we get (AuB)*=(CY AY =A nB 13.(a). A+B =(A-6)u(B- A)=(B- A)U(A-B) B+ A (bd). A+O=(A-0)U(O-A)=AUO=A (cl. AA=ANAZA (At A=(A~ADULA~A) #0, (e)_ To show that A + (B + C) = (A+B) + C we first prove the Theorem A+ (B+ C) = (AUB UC) -{{(An Blu(A a Clu(6 9 C)} -(AnB aC) Prot Let D = {{(AnB) u(AnC) u(8 aC) - (An BAC) and E-(AuBuC)-0. Wf U€E and If U is not in A then u€ BUC. We claim that if uis inBac then ue A+B +C. For, If ueBAC, then, since u ts not In A, so not in A BAC, umust be in D, contradicting that it is in. Thus u isnot inBaC Herstcin Abstract Alecbra Student's Solution Mauna nip: research eyber ee/~medeline/herstein (CHAPTER 1: Things Familiar and Less Famifar / 3 and being in 8 u C we have that u€B + C, hence in A + (B + C) On the other hand, if u€ A then u then, if vis not inB * C then ue A = (B + CC Ax(B*C) Hence ueA + (B+ Cand so EC A+ (B+ CD To finish the proof we show that A+ (B* C)CE If keA+ (8 + C) andif x isnot in A then x 1s in + C, therefore x is in B uC but not mB aC, thus x 45 not in, somust be in. If x is in A then x is not In» Cf x 1s not inB UC thenx is not in D hence must be in Ef, on the other hand, x is in BUC then since it is inB + C it 1s not inBAC so Isnot in An Ba C thus not nD , hence must be in E This fintshes the proof To finish Part (e) we note that (A+B) + C=C + (A+ 8), and using the theorem above, C + (A+B) = Cu Aus - [l(CAAlu(CnB)U(ANB)] - (A ABAC)) = A+8-0) (OATASB# ASC then A+ (A+B) =A + (A+), © by Part (e) we get (A+ A) +B =(A+ A) + C. From Parts (d) and (b) we ge? that B = C. (QA (B+ C)= ANB ~C)UNC - BY =(An(B-CIN ULAR IC - BY the result of Problem 9. The analagous proof to that of Problem 9 shows that Aa(B C= (AaB) - (Aa). Thus, from the abevs, A(B + C)= (AmB) -(AC)} UAN CI -(ANBI = AnB+ An = AB AC 1S, Let 0 = BUC; then m(A UB UC) = m(A UD) = m¢A) + m0) -miAAD) = mn(A) + m(B) + m(C) ~ mB aC) ~ mA 0B) a AAD) = A) + n(B) + mC) ~ mB aC) (mA AB) (AAC) = MA AB ACD) = MGA, + MiB) + mC) ~ m(A a8) -m(AaC)- miBaC) + mA AB aCh 16 ToobtainmtA, uu A,) we form the sum of the m(A,) for {= 1,0 ‘and subtract from this the sum of the m’s of all the intersections of every m1 distinet Aj plus the sum of, the ms of all tne :ntersections of Herstcin Abstract Alscbra Student's Solution Mauwal nip: research eyber ee/~medeline/herstein 4/ Student's Solutions Manual every m - 2 distinct A,'s and so on. (The formal proof can be carried out after we have studied induction in Section 6.) 17, Let Abe the set of Americans that have gone to high-school and let 8 be the set of all Americans that read a dally newspaper. Then Aw B Consists of at,most all, Americans. If there are n Americans then ‘2. m(A UB) = m(A) + m(B) - m(A a8) = 8n + .7n-m(A.B) from the data given. Hence m(A a B)2.8n + .7n =n =.Sn, thus at least SOR of all it ‘Americans are In A a 8, that I3, have gone to high-school and read a daily newspaper. 19 J. Arguing as in the solution to Problem 17 we easily obtain that the set Of veterans who lost an eye, an ear, and an arm is at least 25% of the group 7 Of disabled veterans, Thus those who, in addition, lost a leg is at least iu 85 +25 - 100 = 10 percent 21 QB) Let s+ fay,..., as) and tet Abe a subset of 5. We assign toA a £ binary number as follows: if aj €A the i" digit of this number is 1 and if 1 aj IS not in A the i" digit is 0. Thus the subset (a),a3 a4) has the binary ‘number 101 10 assigned to It, Shas 11111 assigned to it, the empty set has 00000 assigned to It, and so on. On the other hand, given a S-digit. ! binary number It 1s the number assigned to some subset of S. For instance, 01101 wouta come from the subset (ap,a5,35). Since the number of S-digit binary numbers ts 52 there are 32 sunsets in S. (Of course we could solve the problem by enumerating all 32 subsets of S.) (©). Since there 1s only one subset of S having 4 elements wnich does Not contain a given a, and there are 5 a;’s we have exactly five 4-element Subsets of S Herstcin Abstract Alscbra Student's Solution Mauwal nip: research eyber ee/~medeline/herstein (CHAPTER 1: Things Familiar and Less Familiar / 5 (c). The number of subsets of S having 2 elements is the number of ways we can pick 2 objects out of a set of S objects without regard to order. This number 1s 10 * $.4/2 22. (a). Arguing as above in the solution to Problem 21, by assigning an n-binary number to each subset of S we see that Shas 2" subsets. (0). The number of subsets of S having exactly m elements is equal to the number of ways of picking m objects, without regard to order, out of a ‘set onn objects. This number is nl/(mXn-m)). A formal proof of this can be more readily given once we have studied induction SECTION 3. Easier Problems. 1. (2) Fis not a mapping since not every woman has a husband (0). £ is not a mapping of S into T for £(1) = 0 and 0 is not in T (©), 1s amapping from the positive integers to the nonnegative ones. (@) fis not a mapping of the nonnegative integers into themselves for (0) = =1 which ts nat in T. {@). 1s amapping on the set of all integers. (). f 1s not a mapping from the reals Into themselves since =I is not a real number: (g). { is a mapping trom the positive real numbers into themselves because every positive real number has a positive square root 3. If Fis 1-1 mapping of S onto T then f°! defines a mapping from T to S since, given t in T, there is one and only one element s in S such that t= 1(s), and s is defined to be 17 '(t). That £7! is onto and 1-1 follows. from the fact that { 13 a 1-1 mapping from S onto T; that it is onto is @ consequence of the fact that f is defined on all of S so tnat every element Herstcin Abstract Alscbra Student's Solution Mauwal nip: research eyber ee/~medeline/herstein 6 / Student's Solutions Manual 8 In Shas image t = (5) In T, nences = '¢t) It ts 1-1 because, If 1 1¢t4) Mtg) then ty et = Mtg = ty a 5. Given uinU then = f(t) for some t in T since f maps T onto U; because £ maps $ onto T, the t above is of the form t = {(s) for some s in S. Thus u #f(t) = (q(s)) = (F gXs), whence f 9 ts a mapping of S onto U a 6 If tis in T then t = f(s) for some s in $ since f ts onto. Thus g(t) = (FS)) = (g X3) = th 1s) = hits) = hit); therefore g =n. 8. (a). defines a function from S to T. (b), Since even + even 1s even, odd + odd is even, and even + odd is odd we easily verify that f(s; $9) = s)(S5) 1 (©) By the definition of f, £(3) = ~1 and (2) = 1, yet 1 = (6) = FGM(2) = -1, hence (352) 18, in general, not equal to {(S 1s) 9 (a) fs) +s? andg(s) = s+ 1 thus (f gis)=figls.)=fls 6 1)=(s+ 2 3 (b). g 1s) = g(f(s)) = o(s2)= 52 +1 (e),_ from (a) and (0) we see that f g=g f - 10 (2) (fay fe,gXs) = faplcs d= ales + d+ b= acs+ ads b= Fac,aaeb(5), Rence fay fe.g * fac agen: (0). From the result of (a) we know that fa.5 fe,g* facaden 2nd fod fap * fea,cbea. thus these two products of mappings are equal if and only if ad + b= cb + d. This does not hold, for instance,if a= b=d= 1 and 4 22 (0. Itc d= 1 then the result of (b) shows that for fay, tobe equal tofy ; fap we must have a+ D= bd, that ts, a*d. So the only Herstcin Abstract Alscbra Student's Solution Mauwal nip: research eyber ee/~medeline/herstein CHAPTER 1: Things Familiar and Less Familiar / 7 ones satisfying the condition are all the f, 3 (A), Suppose that fy.y° fap =f, . the identity mapping. By the iy’ fay “1,0 ng and xb + y= 0. Thus x= a"! andy = -a"'b are formula of Part (a) , x solutions Furthermore, for this x and y, fa. Tuy * fax.ay « p and since ax 1 and ay +b = a-a"'b) + b= Owe see that f5,p*fy.y* 1,0. Thus a’ lp 18 the required inverse for fp Middle-Level Problems. 12. (a). the f so defined Is not a mapping, since, for Instance, £1/2) = 2132 wntte (172) = 2/4) = 2254 2132, so we cannot assign a unique value to (1/2), nence f Is not a mapping (0). given a positive rational number r we can writer as m/n where 1m and n are positive integers having na common actor Then f defined on S to T by f(r) = 23" does define a legitimate function (mapping). 13. To show that f detines a function we must show that to every s in, ¢ assigns a unique element of T. if 23" = 2230 where m,n,a,b are non ~ negative integers, then m = a and n = b. For suppose m > a, say: then m. Clearly F _ 13 1-1 and from Its very definition F(t) = F(NFCQ). al 15. If Shas 3 or more elements define f: 59S by (51) = So, f(Sp) = $) and f(s) = $ for all the other s in'S. Define g $4 S by 9(5))= $3, 9(53) = Sy and g(s)=.s for all the other s in 5. Thus (tgXs,) = fKg(s,)0* f(s3) = 55, Herstcin Abstract Alecbra Student's Solution Mauna nip: research eyber ee/~medeline/herstein CHAPTER 1: Things Familiar and Less Familia 13 while (gfN(s1) = a{f(s,)) = o(sp) = 5, Thus £q * of 16. (a). Suppose that f 0 we proceed by induction on n. If n= 1 then certainly (a¥b)! = aad ‘a. Suppose that for some m we know that (a¥b)m = ab; then (amp)?! = campye(amy™ = (and)e(a™™D™) = am(o(a™*p™) AUibMaMyeb™) =aH((a™™yMd™) = amca™a(beb™)) = (axa™)™(dMb™) = v a* mp". naving made use of the fact that G is abelian and * is. 7 associative This completes the induction and proves the result for al! positive integers n By definition 2° = e for alla inGso that (ab)? =e = eve = amp Finally, if'n <0 then n ym, -m where m > 0 and a" =(a since G is abelian, (a*p)"! = a”!#p~! so (amp) = (amb) = a Carbey tym = (a Fy™*(o"1Y™ (bythe result we proved for m> 0) = ap? {In future calculations we shall not be as formal as above and will use the associative law freely, and avoid these long chains of equalities, Herstcin Abstract Alscbra Student's Solution Mauwal nip: research eyber ee/~medeline/herstein CHAPTER 2: Groups / 27 9. Suppose a2 = e for every a in the group G. If a,b are in G then (axb)? = e, thus a*b*a*b = e; multiply both sides of this relation by a to obtain a2mp*a"b = a, and since a2 = e, b¥a*b = a Multiply both sides of this relation on the left by b to obtain: b2kamy = béa, and since v2= e, we end up with a¥p = b¥a. Thus G ts abelian 11. Since the * in the example is just the composition of mappings, for ease of notation we drop it and write the product a*b simply as ab, We are considering the elements ('n! where (2 = n3 =e and th = hn“! Thus th2 = n7!th = n2r, so tht = n“%Y for all integers t, and ntr= ht Thus Celndycmnty = flim F*t = Int) an celnhiceOne = ¢lh*t; these two results can be succinctly written as (f/n!XISnt) = f@n? wnere a* i+ J and b= t+ (-1)5j, Thus G is closed under the product of mappings. Since = 2n3, eis in. Also, (f'n)! = noe“! = Ind so +s in 6. (Don't forget, the exponent of f 1s calculated mod 2 and that of hts 30d 3.) Finally, since we are talking about the product of mappings, the product 1s associative Thus G is @ grovp. That G is of order 6 is easy since, in f'n), 1 nas 2 possibilities and j nas. 3, and these give rise to 6 distinct elements (Check itt) That G is non-abelian is clear since fh * nf 13, Suppose that G has 4 elements; let e, a, and b be 3 distinct elements of G. Thus both ab and ba are in G; if they are not equal then bé2 =, 2, orb. If amb = e then we quickly get b*a = e and so a*b = b¥a If a¥b =a then =e and if a%b=b then a =e (see the next problem for this), both of which are contradictions. So we get that amb = ba and G consists of e, a,b, and 2a*b, To check that G is abelian one should also check that ala¥b) =(a*b)a and b(a*b) = (a*blb; we leave these to the reader 14. See the proof of Lemma 222 Herstcin Abstract Alscbra Student's Solution Mauwal nip: research eyber ee/~medeline/herstein 28 / Student's Solutions Manual 16. Since a2 + e for every a in G, by the definition of a”! we have that ul aa"! Thus, if a and are inG then amb = (a¥b)"! = pola ba, nence ’ G ts abelian 18. Suppose that G is a finite group of even order; if a = a! for every a : inGother than e, since a = (a"!)"! we get an even number of elements which are not e, together with e this would give 6 an odd number of ua elements, contrary to our assumption : Middle-Level Problems. 21. If G is of order 5, then for every element a in G there is a least positive integer k, depending on a, such that ak = e. If k = 5 then G must 1 consist merely of e, a, a2, 2°, and a4, so ts abelian. If k= 4andb in Is ' not a power of a then ab a! any 1 soe, a, a2, 23, and amb exhaust G; now b¥a Is in G and is not a power of a, for if b*a = a! we emmediately get that b= all, a contradiction. Thus b*a is forced to equal 2*b, and so we see {that G ts abelian. If k = 3, then e, a, 2? are already 3 distinct elements of 4 G Let b in 6 not be @ power of a; then, as above, b * aXb, so the elements of G are e, a, 22,b, and ab. what can b*a possibly be? As above we quickly arrive at a*b = bea. So we are left with the only possibilty, namely that every a in satisfies a? ~ e. By the result of Problem 9, G must be abelian {In actual fact, as we shall see in Section 4, the first case, k =5, is the i only possibility if G has order S. 24. Gis generated by 2 elements f andh satisfying {2 = n= e and fh= holt, and all the elements of G are of the unique form ('n) where i = 0 or 1 and j can be any integer 0)

    You might also like