MATH 113, Summer 2005, Homework 2 Solutions: Isomorphisms and Groups, Assignments of Abstract Algebra

Solutions to homework problems from a university-level mathematics course, specifically from math 113 during the summer 2005 semester. The problems revolve around isomorphisms and groups, including topics like one-to-one functions, onto functions, homomorphisms, and group structures. The document also covers concepts like closure, associativity, identity, and inverses.

Typology: Assignments

Pre 2010

Uploaded on 10/01/2009

koofers-user-wyj
koofers-user-wyj 🇺🇸

10 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
MATH 113, SUMMER 2005, HOMEWORK 2 SOLUTION
SOLUTIONS AUTHORED BY JOHN B. FRALEIGH
EDITED BY BENJAMIN JOHNSON
Due June 27
Assignment:
section 3; 1,2,6,10,12,15,18,21,26,34
section 4; 1,3,5,9,12,13,16,17,19,21,25,32,40,41
section 5; 7,8,10,12,13,16,18,19,26,27,29,35,39,43,45,53,54,55
Section 3
1. i) φmust be one to one.
ii) φ[S] must be all of S0.
iii) φ(ab)=φ(a)0φ(b) for all a,bS.
2. It is an isomorphism; φis one to one, onto, and φ(n+m)=(n+m)=(n)+(m)=φ(n)+φ(m)
for all m,nZ.
6. It is not an isomorphism because φdoes not map Qonto Q.φ(a),1 for all aQ.
10. It is an isomorphism. For any base a,1, the exponential function f(x)=axmaps Rone to one
onto R+, and φis the exponential map with a=0.5. We have φ(r+s)=0.5(r+s)=(0.5r)(0.5s)=
φ(r)φ(s).
12. It is not an isomorphism because φis not one to one: φ(sin x)=cos 0 =1 and φ(x)=1.
15. It is not an isomorphism because φdoes not map Fonto F. Note that φ(f)(0) =0f(0) =0. Thus
there is no element of Fthat is mapped by φinto the constant function 1.
18. a. For φto be an isomorphism, we must have ab=φa+1
3φb+1
3=φa+1
3+b+1
3=φa+b+2
3=
a+b+1. The identity element is φ(0) =1.
b. Using the fact that φ1must also be an isomorphism, we must have ab=φ1(3a1)
φ1(3b1) =φ1((3a1) +(3b1)) =φ1(3a+3b2) =a+b1
3. The identity element
is φ1(0) =1/3.
21. The definition is incorrect. It should be stated that hS,iand hS0,0iare binary structures, φ
must be one to one and onto S0, and the universal quantifier for all a,bSshould appear in an
appropriate place.
Let hS,iand hS0,0ibe binary structures. A map φ:SS0is an isomorphism if and only if
φis one to one and onto S0, and φ(ab)=φ(a)0φ(b) for all a,bS.
26. One-to-one: Suppose that φ1(a0)=φ1(b0) for a0,b0S0. Then a0=φ(φ1(a0)) =φ(φ1(b0)) =b0,
so φ1is one to one.
Onto: Let aS. Then φ1(φ(a)) =a, so φ1maps S0onto S.
Homomorphism property: Let a0,b0S0. Now φ(φ1(a00b0)) =a00b0.
Because φis an isomorphism, φ(φ1(a0)φ1(b0)) =φ(φ1(a0)) 0φ(φ1(b0)) =a00b0also.
Because φis one to one, we conclude that φ1(a0b0)=φ1(a0)0φ1(b0).
34. Let the set be {a,b}. We need to decide whether interchanging the names of the letters everywhere
in the table and then writing the table again in the order afirst and bsecond gives the same table
or a different table. The same table is obtained if and only if in the body of the table, diagonally
Date: June 27, 2005.
1
pf3
pf4

Partial preview of the text

Download MATH 113, Summer 2005, Homework 2 Solutions: Isomorphisms and Groups and more Assignments Abstract Algebra in PDF only on Docsity!

MATH 113, SUMMER 2005, HOMEWORK 2 SOLUTION

SOLUTIONS AUTHORED BY JOHN B. FRALEIGH EDITED BY BENJAMIN JOHNSON

Due June 27

Assignment: section 3; 1,2,6,10,12,15,18,21,26, section 4; 1,3,5,9,12,13,16,17,19,21,25,32,40, section 5; 7,8,10,12,13,16,18,19,26,27,29,35,39,43,45,53,54,

Section 3

  1. i) φ must be one to one. ii) φ[S ] must be all of S ′. iii) φ(a ∗ b) = φ(a) ∗′^ φ(b) for all a, b ∈ S.
  2. It is an isomorphism; φ is one to one, onto, and φ(n + m) = −(n + m) = (−n) + (−m) = φ(n) + φ(m) for all m, n ∈ Z.
  3. It is not an isomorphism because φ does not map Q onto Q. φ(a) , −1 for all a ∈ Q.
  4. It is an isomorphism. For any base a , 1, the exponential function f (x) = ax^ maps R one to one onto R+, and φ is the exponential map with a = 0 .5. We have φ(r + s) = 0. 5 (r+s)^ = (0. 5 r)(0. 5 s) = φ(r)φ(s).
  5. It is not an isomorphism because φ is not one to one: φ(sin x) = cos 0 = 1 and φ(x) = 1.
  6. It is not an isomorphism because φ does not map F onto F. Note that φ( f )(0) = 0 f (0) = 0. Thus there is no element of F that is mapped by φ into the constant function 1.
  7. a. For φ to be an isomorphism, we must have a∗b = φ

(a+ 1 3

∗φ

(b+ 1 3

= φ

(a+ 1 3 +^

b+ 1 3

= φ

(a+b+ 2 3

a + b + 1. The identity element is φ(0) = −1. b. Using the fact that φ−^1 must also be an isomorphism, we must have a ∗ b = φ−^1 (3a − 1) ∗ φ−^1 (3b − 1) = φ−^1 ((3a − 1) + (3b − 1)) = φ−^1 (3a + 3 b − 2) = a + b − 13. The identity element is φ−^1 (0) = 1 /3.

  1. The definition is incorrect. It should be stated that 〈S , ∗〉 and 〈S ′, ∗′〉 are binary structures, φ must be one to one and onto S ′, and the universal quantifier for all a, b ∈ S should appear in an appropriate place.

Let 〈S , ∗〉 and 〈S ′, ∗′〉 be binary structures. A map φ : S → S ′^ is an isomorphism if and only if φ is one to one and onto S ′, and φ(a ∗ b) = φ(a) ∗′^ φ(b) for all a, b ∈ S.

  1. One-to-one: Suppose that φ−^1 (a′) = φ−^1 (b′) for a′, b′^ ∈ S ′. Then a′^ = φ(φ−^1 (a′)) = φ(φ−^1 (b′)) = b′, so φ−^1 is one to one. Onto: Let a ∈ S. Then φ−^1 (φ(a)) = a, so φ−^1 maps S ′^ onto S. Homomorphism property: Let a′, b′^ ∈ S ′. Now φ(φ−^1 (a′^ ∗′^ b′)) = a′^ ∗′^ b′. Because φ is an isomorphism, φ(φ−^1 (a′) ∗ φ−^1 (b′)) = φ(φ−^1 (a′)) ∗′^ φ(φ−^1 (b′)) = a′^ ∗′^ b′^ also. Because φ is one to one, we conclude that φ−^1 (a′^ ∗ b′) = φ−^1 (a′) ∗′^ φ−^1 (b′).
  2. Let the set be {a, b}. We need to decide whether interchanging the names of the letters everywhere in the table and then writing the table again in the order a first and b second gives the same table or a different table. The same table is obtained if and only if in the body of the table, diagonally

Date: June 27, 2005. 1

2 SOLUTIONS AUTHORED BY JOHN B. FRALEIGH EDITED BY BENJAMIN JOHNSON

opposite entries are different. Four such tables exist, since there are four possible choices for the first row; Namely, the tables ∗ a b a a a b b b

∗ a b a a b b a b

∗ a b a b a b b a

and

∗ a b a b b b a a The other 12 tables can be paired off into tables giving the same algebraic structure. One table of each pair is listed below. The number of different algebraic structures is therefore 4+ 12 / 2 = 10. ∗ a b a a a b a a

∗ a b a a a b a b

∗ a b a a a b b a

∗ a b a a b b a a

∗ a b a b a b a a

∗ a b a a b b b a Section 4

  1. No. G 3 fails.
  2. No. G 1 fails.
  3. No. G 1 fails.
  4. Denoting the operation in each of the three groups by ∗ and the identity element by e for the moment, the equation x ∗ x ∗ x ∗ x = e has four solutions in 〈U, ·〉, one solution in 〈R, +〉, and two solutions in 〈R∗, ·〉.
  5. No, it is not a group. Multiplication of diagonal matrices amounts to muliplying in R entries in corresponding positions on the diagonals. The matrix with 1 at all places on the diagonal is the identity element, but a matrix having a diagonal entry 0 has no inverse.
  6. Yes, it is a group. See the answer to Exercise 12.
  7. Yes, it is a group. The sum of upper-triangular matrices is again upper triangular, and addition amounts to just adding entries in R in corresponding positions.
  8. Yes, it is a group. Closure: Let A and B be upper triangular with determinant 1. Then entry ci j in row i and column j in C = AB is 0 if i > j, because for each product aikbk j where i > j appearing in the computation of ci j, either k < i so that aik = 0 or k ≥ i > j so that bk j = 0. Thus the product of two upper- triangular matrices is again upper triangular. The equation det(AB) = det(A) · det(B), shows that the product of two matrices of determinant 1 again has determinant 1. Associative: We know that matrix multiplication is associative. Identity: The n × n identity matrix In has determinant 1 and is upper triangular. Inverse: The product property 1 = det(In) = det(A−^1 A) = det(A−^1 ) · det(A) shows that if det(A) = 1, then det(A−^1 ) = 1 also.
  9. a. We must show that S is closed under ∗, that is, that a + b + ab , −1 for a, b ∈ S. Now a + b + ab = −1 if and only if 0 = ab + a + b + 1 = (a + 1)(b + 1). This is the case if and only if either a = −1 or b = −1, which is not the case for a, b ∈ S. b. Associative: We have a ∗ (b ∗ c) = a ∗ (b + c + bc) = a + (b + c + bc) + a(b + c + bc) = a + b + c + ab + ac + bc + abc and (a ∗ b) ∗ c = (a + b + ab) ∗ c = (a + b + ab) + c + (a + b + ab)c = a + b + c + ab + ac + bc + abc. Identity: 0 acts as identity elemenr for ∗, for 0 ∗ a = a ∗ 0 = a. Inverses: (^) a−+a 1 acts as inverse of a, for a ∗ (^) a−+a 1 = a + (^) a−+a 1 + a (^) a−+a 1 = a(a+1)−a−a

2 a+ 1 =^

0 a+ 1 =^ 0. c. Because the operation is commutative, 2 ∗ x ∗ 3 = 2 ∗ 3 ∗ x = 11 ∗ x. Now the inverse of 11 is − 11 /12 by Part(b). From 11 ∗ x = 7, we obtain x = − 1211 ∗ 7 = − 1211 + 7 + − 1211 · 7 = −^11 + 1284 −^77 = − 4 12 =^ −

1

  1. A binary operation on a set {x, y} of two elements that produces a group is completely determined by the choice of x or y to serve as identity element, so just 2 of the 16 possible tables give groups. For a set {x, y, z} of three elements, a group binary operation is again determined by the choice x,

4 SOLUTIONS AUTHORED BY JOHN B. FRALEIGH EDITED BY BENJAMIN JOHNSON

  1. Let H be a subgroup of G. Then for a, b ∈ H, we have b−^1 ∈ H and ab−^1 ∈ H because H must be closed under the induced operation. Conversely, suppose that H is nonempty and ab−^1 ∈ H for all a, b ∈ H. Let a ∈ H. Then taking b = a, we see that aa−^1 = e is in H. Taking a = e, and b = a, we see that ea−^1 = a−^1 ∈ H. Thus H contains the identity element and the inverse of each element. For closure, note that for a, b ∈ H, we also have a, b−^1 ∈ H and thus a(b−^1 )−^1 = ab ∈ H.
  2. Reflexive: Let a ∈ G. Then aa−^1 = e and e ∈ H since H is a subgroup. Thus a ≈ a. Symmetric: Let a, b ∈ G and a ≈ b, so that ab−^1 ∈ H. Since H is a subgroup, we have (ab−^1 )−^1 = ba−^1 ∈ H, so b ≈ a. Transitive: Let a, b, c ∈ G and a ≈ b and b ≈ c. Then ab−^1 ∈ H and bc−^1 ∈ H so (ab−^1 )(bc−^1 ) = ac−^1 ∈ H, and a ≈ c.
  3. Closure: Let a, b ∈ H ∩ K. Then a, b ∈ H and a, b ∈ K. Because H and K are subgroups, we have ab ∈ H and ab ∈ K, so ab ∈ H ∩ K. Identity: Because H and K are subgroups, we have e ∈ H and e ∈ K so e ∈ H ∩ K. Inverses: Let a ∈ H ∩ K so a ∈ H and a ∈ K. Because H and K are subgroups, we have a−^1 ∈ H and a−^1 ∈ K, so a−^1 ∈ H ∩ K.
  4. Let G be cyclic and let a be a generator for G. For x, y ∈ G, there exist m, n ∈ Z such that x = am and y = bn. Then xy = ambn^ = am+n^ = an+m^ = anam^ = yx, so G is abelian.