Math 110A HW §3.

1 – Solutions

6. For a fixed positive integer n, the set of all complex numbers x such that xn = 1 with respct
to multiplication.

Proof. Fix n ∈ N. Let S = {x|xn = 1}.

Let a, b ∈ S. Then an = 1 and bn = 1. We want to show ab ∈ S. Thus we need to
show (ab)n = 1. Since multiplication of complex numbers is commutative, we have that
(ab)n = an bn . Hence we have (ab)n = an bn = (1)(1) = 1. Thus ab ∈ S. Hence multiplication
is a binary operation on S.
We already know that multiplication of complex numbers is associative.
Now 1n = 1, so 1 ∈ S. Thus S contains the multiplicative identity.
 n
n 1 1 1 1
Let a ∈ S, then a = 1 and a is the multiplicative inverse of a. Moreover, = n = = 1.
a a 1
1
Thus a ∈ S.
Hence, S is a group with respect to multiplication.

15. Let ∗ be a binary operation on Z defined by x ∗ y = x + y + 1. Determine if (Z, ∗) is an abelian

group.

Proof. Let x, y, z ∈ Z.

x ∗ (y ∗ z) = x ∗ (y + z + 1) = x + (y + z + 1) + 1 = x + y + z + 2

(x ∗ y) ∗ z = (x + y + 1) ∗ z = (x + y + 1) + z + 1 = x + y + z + 2

Thus ∗ is associative.

x ∗ −1 = x + −1 + 1 = x = −1 + x + 1 = −1 ∗ x

Thus 1 is the identity.

x ∗ (−2 − x) = x + −2 − x + 1 = −1

(−2 − x) ∗ x = −2 − x + x + 1 = −1

Thus −2 − x is the inverse of x ∈ Z.

x∗y = x+y+1= y+x+1= y∗x

Thus ∗ is commutative.
Therefore (Z, ∗) is an abelian group.
 
1 a b
33. Let G be the set of all matrices in M3 (R) that have the form  0 1 c . Prove or disprove
0 0 1
that G is a group with respect to multiplication.
    
  1 a b 

Proof. Let G = A ∈ M3 (R) A =  0 1 c  . Clearly multiplication of matrices is an
  
0 0 1
associative binary operation on M3 (R). We need only check that G is closed under this
operation.
    
1 a b 1 d f 1 a + d b + ag + f
 0 1 c  0 1 g  =  0 1 c+g ∈G
0 0 1 0 0 1 0 0 1

Thus G is closed under multiplication. In addition, I3 ∈ G. Thus G has an identity. Finally

let’s check that A−1 ∈ G.
    
1 a b 1 −a ac − b 1 0 0
 0 1 c  0 1 −c  =  0 1 0 
0 0 1 0 0 1 0 0 1
    
1 −a ac − b 1 a b 1 0 0
 0 1 −c   0 1 c  =  0 1 0 
0 0 1 0 0 1 0 0 1
 
1 −a ac − b
Thus A−1 = 0 1 −c  ∈ G. Hence (G, ·) is a group.
0 0 1

36. Proof. Let A be an arbitrary set and let X, Y ∈ P(A). Define X + Y = (X ∪ Y ) − (X ∩ Y ).

Clearly this operation is well-defined and X + Y ∈ P(A). Thus + is a binary operation on
P(A).
We need to show + is associative. Let A, B, C ∈ P(A).

A + (B + C) = A + [(B ∪ C) − (B ∩ C)]
= A ∪ [(B ∪ C) − (B ∩ C)] − A ∩ [(B ∪ C) − (B ∩ C)]
= A ∪ [(B ∪ C) ∩ (B ∪ C)] − A ∩ [(B ∪ C) ∩ (B ∪ C)]
= [(A ∪ B ∪ C) ∩ (A ∪ B ∪ C)] − [A ∩ [B ∩ C ∪ (C ∩ B)]]
= [(A ∪ B ∪ C) ∩ (A ∪ B ∪ C)] − [(A ∩ B ∩ C) ∪ (A ∩ B ∩ C)]
= [(A ∪ B ∪ C) ∩ (A ∪ B ∪ C)] ∩ [(A ∪ B ∪ C) ∩ (A ∪ B ∪ C)]
= (A ∪ B ∪ C) ∩ (A ∪ B ∪ C) ∩ (A ∪ B ∪ C) ∩ (A ∪ B ∪ C)

(A + B) + C = [(A ∪ B) − (A ∩ B)] + C
= [(A ∪ B) − (A ∩ B)] ∪ C − [(A ∪ B) − (A ∩ B)] ∩ C
= [(A ∪ B) ∩ (A ∪ B)] ∪ C − [(A ∪ B) ∩ (A ∪ B)] ∩ C
= [(A ∪ B ∪ C) ∩ (A ∪ B ∪ C)] − [(B ∩ A) ∪ (A ∩ B)] ∩ C
= [(A ∪ B ∪ C) ∩ (A ∪ B ∪ C)] − [(A ∩ B ∩ C) ∪ (A ∩ B ∩ C)]
= [(A ∪ B ∪ C) ∩ (A ∪ B ∪ C)] ∩ [(A ∪ B ∪ C) ∩ (A ∪ B ∪ C)]
= (A ∪ B ∪ C) ∩ (A ∪ B ∪ C) ∩ (A ∪ B ∪ C) ∩ (A ∪ B ∪ C)
= (A ∪ B ∪ C) ∩ (A ∪ B ∪ C) ∩ (A ∪ B ∪ C) ∩ (A ∪ B ∪ C)

Thus + is associative.
Let X ∈ P(A). Then X + ∅ = (X ∪ ∅) − (X ∩ ∅) = X − ∅ = X. Similarly ∅ + X = X. Thus
∅ is the identity for +.
Let X ∈ P(A). Then X + X = (X ∪ X) − (X ∩ X) = X − X = ∅. Thus X = X −1.
Therefore (P(A), +) is a group.