Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Math 4441/6441 Spring 2008 Homework Set #7: Proving Properties of Groups, Assignments of Algebra

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

Pre 2010

Uploaded on 08/30/2009

koofers-user-zqv
koofers-user-zqv 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 4441/6441 (Spring 2008) Homework Set #7 (Due 03/13) Hints
Problem 1 (10 points).Let G6=be a set with a (binary) operation that is associative.
(Thus abGand (ab)c=a(bc) for all a, b, c G.) Further assume
(I) There exists a (special) element eGsuch that ae=afor all aG.
(II) For every aG, there exists a0Gsuch that aa0=e.
Show Gis a group under the operation . Show your work in detail.
Hint. It suffices to show ea=aand a0a=efor all aG, where eand a0are 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
ea=aand a0a=efor all aG. (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 xGsatisfies xx=x, then x=e(cf.
Lemma 2.44). Then use it to prove a0a=efor all aG(cf. Lemma 2.45(i)). Finally,
show ea=afor all aG(cf. Lemma 2.45(ii)). Other approaches are welcome.
Problem 2 (10 points).Let G6=be a set with a (binary) operation that is associative.
(Thus abGand (ab)c=a(bc) for all a, b, c G.) Further assume
(I) For every a, b G, there exists xGsuch that ax=b.
(II) For every a, b G, there exists yGsuch that ya=b.
Show Gis a group under the operation . Show your work in detail.
Hint. We need to do the following: (1) find a (special) element eGsuch that ea=afor
all aG; and (2) for every aG, show there exists an element a0Gsuch that a0a=e.
To accomplish (1), choose an element uG(and then fix it). Then by (II), there exists
an element, which we denote by e, such that eu=u. Then you need to show that this e
satisfies ea=afor all aGby applying (I) or (II) (which one?) to elements uand a.
To show (2), study (I) and (II) carefully. Apply one of them (which one?).
Problem 3 (6441 problem, 5 points).Let Gbe a group (under an operation ). (For
a, b G, we may write ab=ab for short.) Assume (ab)3=a3b3and (ab)5=a5b5for all
a, b G. Show Gis abelian.
Hint. Let a, b Gbe two arbitrary elements. It suffices to show ab =ba.
The equation (ab)3=a3b3expands 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=a5b5expands 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

Partial preview of the text

Download Math 4441/6441 Spring 2008 Homework Set #7: Proving Properties of Groups and more Assignments Algebra in PDF only on Docsity!

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