Math 546 Homework 1
Math 546 Homework 1
Math 546 Homework 1
Homework 1
Due Wednesday, January 25.
• 701I Problems. Only students enrolled in 701I are required to turn these in. Students not
enrolled in 701I are welcome to turn these in as well. I especially welcome students looking
for a challenge to attempt these.
Note: Part 3 below contains solutions to some of the unassigned problems from Sections 1 and 2
of Saracino’s text. I am providing these as examples of how to write solutions. Please have a look
at these, and make sure to read Sections 1 and 2 of the text.
1 546 Problems.
1.3 and 1.6. For each of the following sets S and functions ∗ on S×S, determine whether ∗ is
a binary operation on S. If ∗ is a binary operation on S, determine whether it is commutative
and whether it is associative.
a) S = Z, a ∗ b = a + b2 .
e) S = Z, a ∗ b = a + b − ab.
f) S = R, a ∗ b = b.
g) S = {1, −2, 3, 2, −4}, a ∗ b = |b|.
1.9. Let S = {a, b, c, d}. The following table defines a binary operation ∗ on S.
Is ∗ commutative? Is it associative?
* a b c d
a a c b d
b c a d b
c b d a c
d d b c a
Note: For s1 , s2 ∈ S, we define s1 ∗ s2 to the be the element in the row that contains s1 and
the column that contains s2 . For example, we have c ∗ b = d.
2.1. Which of the following are groups? Why or why not?
2.5. Let S = {a, b, c}. The following table defines a binary operation ∗ on S.
* a b c
a a b c
b b b c
c c c c
2 701I Problems.
1.10. How many binary operations are there on a set S with n elements? How many of these
are commutative?
√
2.1 e) Let S = {q ∈ Q+ : q ∈ Q}, ∗ is ×. Is (S, ∗) a group? Why or why not?
2.6. Let S = {a, b, c}. The following table defines a binary operation ∗ on S.
* a b c
a a b c
b b a c
c c b a
2.10. Let
a b 2 2
G= M = : a, b ∈ R, det M = a + b 6= 0 ⊂ GL(2, R).
−b a
Let × denote ordinary matrix multiplication. Show that (G, ×) is a group.
3 Examples.
1.3 and 1.6. For each of the following sets S and functions ∗ on S×S, determine whether ∗ is
a binary operation on S. If ∗ is a binary operation on S, determine whether it is commutative
and whether it is associative.
b) S = Z, a ∗ b = a ∗ b = a2 b3 .
Claim: ∗ is a binary operation on S.
Proof: For all a, b ∈ Z, we have a ∗ b = a2 b3 ∈ Z, so ∗ is a binary operation.
Claim: ∗ is not commutative on S.
Proof: We note that b ∗ a = b2 a3 . Therefore, we have a ∗ b = b ∗ a if and only if
a2 b3 = a3 b2 , which holds if and only if a = b or either of a, b = 0. We observe that
1 ∗ 2 = 12 23 = 8 6= 4 = 22 13 = 2 ∗ 1.
Hence, ∗ is not commutative.
Claim: ∗ is not associative on S.
Proof: We compute
(a ∗ b) ∗ c = (a2 b3 ) ∗ c = (a2 b3 )2 c3 = a4 b6 c3 ,
a ∗ (b ∗ c) = a ∗ (b2 c3 ) = a2 (b2 c3 )3 = a2 b6 c9 .
Therefore, we have (a ∗ b) ∗ c = a ∗ (b ∗ c) if and only if a4 b6 c3 = a2 b6 c9 , which holds
for a, b, c 6= 0 if only if a2 = c6 . Taking square roots, we see that associativity follows
if and only if a = c3 . We note that
(2 ∗ 1) ∗ 1 = 24 16 13 = 16 6= 4 = 22 16 19 = 2 ∗ (1 ∗ 1).
Hence, ∗ is not associative.
h) S = {1, 6, 3, 2, 18}, a ∗ b = ab.
Claim: ∗ is not a binary operation on S.
Proof: We note that 6, 2 ∈ S, but that 6 ∗ 2 = 12 6∈ S. Therefore, ∗ is not a binary
operation.
Since ∗ is not a binary operation, we do not consider whether or not ∗ is commutative
or associative.
a ∗ 1 = a + 1 − 1 = a = 1 + a − 1 = 1 ∗ a,
a ∗ (2 − a) = a + (2 − a) − 1 = 1 = (2 − a) + a − 1 = (2 − a) ∗ a,
so 2 − a is an inverse for a.
It follows that (S, ∗) is a group. Furthermore, for all a, b ∈ Z, we have
a∗b=a+b−1=b+a−1=b∗a