
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Three problem statements and hints for homework assignments in a university-level abstract algebra course. Students are asked to prove that given sets with binary operations satisfying certain conditions are indeed groups. The problems require detailed workings and refer to lemmas from the textbook 'a first course in abstract algebra with applications'.
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!
Math 4441/6441 (Spring 2008) Homework Set #7 (Due 03/13) Hints
Problem 1 (10 points). Let G 6 = ∅ be a set with a (binary) operation ∗ that is associative. (Thus a ∗ b ∈ G and (a ∗ b) ∗ c = a ∗ (b ∗ c) for all a, b, c ∈ G.) Further assume
(I) There exists a (special) element e ∈ G such that a ∗ e = a for all a ∈ G. (II) For every a ∈ G, there exists a′^ ∈ G such that a ∗ a′^ = e.
Show G is a group under the operation ∗. Show your work in detail.
Hint. It suffices to show e ∗ a = a and a′^ ∗ a = e for all a ∈ G, where e and a′^ are the same as described in (I) and (II) above. You may mimic the proofs of Lemma 2.44 and Lemma 2.45(i)(ii) on page 127 to show e ∗ a = a and a′^ ∗ a = e for all a ∈ G. (It won’t work if you simply copy the proofs of Lemma 2.44 and Lemma 2.45(i)(ii) verbatim. The reason is that the assumption and conclusion in this problem differ from those in Lemma 2.44 and Lemma 2.45(i)(ii).) To be specific, first show that if an element x ∈ G satisfies x ∗ x = x, then x = e (cf. Lemma 2.44). Then use it to prove a′^ ∗ a = e for all a ∈ G (cf. Lemma 2.45(i)). Finally, show e ∗ a = a for all a ∈ G (cf. Lemma 2.45(ii)). Other approaches are welcome.
Problem 2 (10 points). Let G 6 = ∅ be a set with a (binary) operation ∗ that is associative. (Thus a ∗ b ∈ G and (a ∗ b) ∗ c = a ∗ (b ∗ c) for all a, b, c ∈ G.) Further assume
(I) For every a, b ∈ G, there exists x ∈ G such that a ∗ x = b. (II) For every a, b ∈ G, there exists y ∈ G such that y ∗ a = b.
Show G is a group under the operation ∗. Show your work in detail.
Hint. We need to do the following: (1) find a (special) element e ∈ G such that e ∗ a = a for all a ∈ G; and (2) for every a ∈ G, show there exists an element a′^ ∈ G such that a′^ ∗ a = e. To accomplish (1), choose an element u ∈ G (and then fix it). Then by (II), there exists an element, which we denote by e, such that e ∗ u = u. Then you need to show that this e satisfies e ∗ a = a for all a ∈ G by applying (I) or (II) (which one?) to elements u and a. To show (2), study (I) and (II) carefully. Apply one of them (which one?).
Problem 3 (6441 problem, 5 points). Let G be a group (under an operation ∗). (For a, b ∈ G, we may write a ∗ b = ab for short.) Assume (ab)^3 = a^3 b^3 and (ab)^5 = a^5 b^5 for all a, b ∈ G. Show G is abelian.
Hint. Let a, b ∈ G be two arbitrary elements. It suffices to show ab = ba. The equation (ab)^3 = a^3 b^3 expands to ababab = aaabbb, i.e., a(baba)b = a(aabb)b. By cancellation, what can you get? That is, baba =? Similarly, the equation (ab)^5 = a^5 b^5 expands to ababababab = aaaaabbbbb. By cancellation, what can you get? That is, babababa =? Now, what is the relation between babababa and baba? What will this relation translate to in light of what you have got above? “Play” with the derived equations (according to the rules) and be ready to use the rule of cancellation over and over again (if applicable). You goal is to show ab = ba (according to the rules). Other approaches are available and welcome.
For solutions, click here.
Notice. All quoted results, such as Theorem x.y, are from the textbook A First Course in Abstract Algebra with Applications (3rd Ed.) by J. J. Rotman, Pearson Prentice Hall. 1