MATH 107.

01
HOMEWORK #6 SOLUTIONS

Problem 1.6.4. Use Theorem 1.21 to determine if the matrix

 
2 −1 −3
A = 1 1 3
6 0 0
is invertible.
Solution. Compute
2 −1 −3
−1 −3
det (A) = 1 1 3 =6 = 6 (−3 + 3) = 0.
1 3
6 0 0
Hence A is not invertible. 
Problem 1.6.6. Use the adjoint method to find the inverse of
 
−2 3
A= .
1 −2
Solution. Corollary 1.27 gives
   
1 1 −2 −3 −2 −3
A−1 = adj (A) = = . 
det (A) 4 − 3 −1 −2 −1 −2
Problem 1.6.10. Use Cramer’s rule to solve the system
5x − 4y + z = 2
2x − 3y − 2z = 4
3x + y + 3z = 2.
Solution. This is the system AX = B where
     
5 −4 1 x 2
A = 2 −3 −2 , X = y  , B = 4 .
3 1 3 z 2
Cramer’s rule gives
2 −4 1
1 60 5
x= 4 −3 −2 = =
det (A) 24 2
2 1 3
5 2 1
1 48
y= 2 4 −2 = =2
det (A) 24
3 2 3
5 −4 2
1 60 5
z= 2 −3 4 =− =− . 
det (A) 24 2
3 1 2
1
2 MATH 107.01 HOMEWORK #6 SOLUTIONS

Problem 1.6.11. Use Cramer’s rule to solve the system

xet sin 2t + yet cos 2t = t
2xet cos 2t − 2yet sin 2t = t2
for x and y.
Solution. This is the system
 t
et cos 2t
    
e sin 2t x t
A= , X= , .
2et cos 2t −2et sin 2t y t2
Cramer’s rule then gives
1 t et cos 2t −tet (2 sin 2t + t cos 2t)
x= =
det (A) t2 −2et sin 2t −2e2t
t
1 et sin 2t t te (t sin 2t − 2 cos 2t)
y= t 2 = . 
det A 2e cos 2t t −2e2t

Problem 1.6.15. Let

   
3 −2 1 2
A= , B= .
1 4 −2 3
(a) Find det (A) and det (B).

(b) Find det (AB), det A−1 , and det B > A−1 without finding AB, A−1 , or

B > A−1 .
(c) Show that det (A + B) 6= det (A) + det (B).
Proof. (a) Compute
3 −2
det (A) = = 12 + 2 = 14
1 4
1 2
det (B) = = 3 + 4 = 7.
−2 3
(b) Use part (a), Theorem 1.19, and Corollary 1.25 to compute
det (AB) = det (A) det (B) = (14) (7) = 98
1 1
det A−1 =


=
det (A) 14

det (B) 7 1
det B > A−1 = det B > det A−1 =



= = .
det (A) 14 2
(c) Note that
4 0
det (A + B) = = 28 6= 21 = 14 + 7 = det (A) + det (B). 
−1 7

Problem 1.6.16. Let A, B ∈ Mn×n (R). Show that det (AB) = det (BA).
Proof. Theorem 1.24 gives
det (AB) = det (A) det (B) = det (B) det (A) = det (BA). 
 MATH 107.01 HOMEWORK #6 SOLUTIONS 3

Problem 2.1.5. Let V be the collection of pairs of positive real numbers of the
form (x, y) with addition and scalar multiplication defined as
(x1 , y1 ) + (x2 , y2 ) = (x1 x2 , y1 y2 )
λ (x, y) = xλ , y λ .

Show that V is a vector space.

Solution. Verify the axioms.

Axiom 1. This holds by the computation

(x1 , y1 ) + (x1 , y2 ) = (x1 x2 , y1 y2 ) = (x2 x1 , y2 y1 ) = (x2 , y2 ) + (x1 , y1 ) . X

Axiom 2. This holds by the computation

(x1 , y1 ) + (x2 , y2 ) + (x3 , y3 ) = (x1 , y1 ) + (x2 x3 , y2 y3 )


= x1 (x2 x3 ) , y1 (y2 y3 )


= (x1 x2 ) x3 , (y1 y2 ) y3
= (x1 x2 , y1 y2 ) + (x3 , y3 )


= (x1 , y1 ) + (x2 , y2 ) + (x3 , y3 ) . X

Axiom 3. Here, 0 = (1, 1). To see this, compute

(x, y) + 0 = (x, y) + (1, 1) = (x · 1, y · 1) = (x, y) . X

Axiom 4. Here, − (x, y) = x−1 , y −1 . To see this, compute

(x, y) + − (x, y) = (x, y) + x−1 , y −1 = x · x−1 , y · y −1 = (1, 1) = 0.

X

Axiom 5. This holds by the computation

 

λ λ
λ (x1 , y1 ) + (x2 , y2 ) = λ (x1 x2 , y1 y2 ) = (x1 x2 ) , (y1 y2 )
= xλ1 xλ2 , y1λ y2λ = xλ1 , y1λ + xλ2 , y2λ

= λ (x1 , y1 ) + λ (x2 , y2 ) . X

Axiom 6. This holds by the computation

(λ1 + λ2 ) (x, y) = xλ1 +λ2 , y λ1 +λ2 = xλ1 xλ2 , y λ1 y λ2

= xλ1 , y λ1 + xλ2 , y λ2 = λ1 (x, y) + λ2 (x, y) .

X

Axiom 7. This holds by the computation


λ1
λ1 
λ1 λ2 (x, y) = λ1 xλ2 , y λ2 = xλ2 , y λ2

= xλ1 λ2 , y λ1 λ2 = (λ1 λ2 ) (x, y) .

X

Axiom 8. This holds by the computation

1 (x, y) = x1 , y 1 = (x, y) .


X

Since all the axioms hold, V is a vector space. 

4 MATH 107.01 HOMEWORK #6 SOLUTIONS

Problem 2.1.7. Let C be the collection of all convergent sequences of real numbers
{an } with addition and scalar multiplication defined by
{an } + {bn } = {an + bn }
λ {an } = {λan } .
Determine if C is a vector space.
Solution. We will show that C is a vector space.
First, note that addition and scalar multiplication is well-defined. Indeed, if
an → A and bn → B, then
lim (an + bn ) = lim an + lim bn = A + B
n→∞ n→∞ n→∞
so that addition is well-defined and
lim λan = λ lim an = λA
n→∞ n→∞
so that scalar multiplication is well-defined.
Now, we may verify the axioms.
Axiom 1. This holds by the computation
{an } + {bn } = {an + bn } = {bn + an } = {bn } + {an } . X
Axiom 2. This holds by the computation


{an } + {bn } + {cn } = {an } + {bn + cn } = an + (bn + cn )

= (an + bn ) + cn = {an + bn } + {cn }


= {an } + {bn } + {cn } . X
Axiom 3. Here, 0 = {0n } where 0n = 0. To see this, compute
{an } + 0 = {an } + {0n } = {an + 0n } = {an + 0} = {an } . X
Axiom 4. Here − {an } = {−an }. To see this, compute


{an } + − {an } = {an } + {−an } = {an − an } = {0} = {0n } = 0. X
Axiom 5. This holds by the computation


λ {an } + {bn } = λ {an + bn } = λ (an + bn )
= {λan + λbn } = {λan } + {λbn }
= λ {an } + λ {bn } . X
Axiom 6. This holds by the computation

(λ1 + λ2 ) {an } = (λ1 + λ2 ) an = {λ1 an + λ2 an }
= {λ1 an } + {λ2 an } = λ1 {an } + λ2 {an } . X
Axiom 7. This holds by the computation


λ1 λ2 {an } = λ1 {λ2 an } = λ1 (λ2 an )

= (λ1 λ2 ) an = (λ1 λ2 ) {an } . X
Axiom 8. This holds by the computation
1 {an } = {1 · an } = {an } . X
Since all the axioms hold, C is a vector space. 
 MATH 107.01 HOMEWORK #6 SOLUTIONS 5

Problem
P∞ 2.1.8. Let S denote the collection of all convergent series of real numbers
n=1 an with addition and scalar multiplication defined by
∞
X ∞
X ∞
X
an + bn = (an + bn )
n=1 n=1 n=1
X∞ X∞
λ an = λan .
n=1 n=1
Determine if S is a vector space.
Solution. We will show that S is a vector space.
P∞First, note thatP addition and scalar multiplication is well-defined. Indeed, if
∞
n=1 na = A and n=1 bn = B, then
∞
X ∞
X ∞
X
(an + bn ) = an + bn = A + B
n=1 n=1 n=1
so that addition is well-defined and
X∞ ∞
X
λan = λ an = λA
n=1 n=1
so that scalar multiplication is well-defined.
Now, we may verify the axioms.
Axiom 1. This holds by the computation
X∞ X∞ ∞
X ∞
X ∞
X ∞
X
an + bn = (an + bn ) = (bn + an ) = bn + an . X
n=1 n=1 n=1 n=1 n=1 n=1

Axiom 2. This holds by the computation

∞ ∞ ∞ ∞ ∞
!
X X X X X
an + bn + cn = an + (bn + cn )
n=1 n=1 n=1 n=1 n=1
X∞


= an + (bn + cn )
n=1
X∞ ∞
X
= (an + bn ) + cn
n=1 n=1
∞ ∞ ∞
!
X X X
= an + bn + cn . X
n=1 n=1 n=1
P∞
Axiom 3. Here, 0 = n=1 0n where 0n = 0. To see this, compute
∞
X ∞
X ∞
X ∞
X ∞
X ∞
X
an + 0 = an + 0n = (an + 0n ) = (an + 0) = an . X
n=1 n=1 n=1 n=1 n=1 n=1
P∞ P∞
Axiom 4. Here, − n=1 an = n=1 (−an ). To see this, compute
∞ ∞ ∞ ∞ ∞ ∞ ∞
!
X X X X X X X
an + − an = an + (−an ) = (an − an ) = 0= 0n = 0.
n=1 n=1 n=1 n=1 n=1 n=1 n=1
X
6 MATH 107.01 HOMEWORK #6 SOLUTIONS

Axiom 5. This holds by the computation

∞ ∞ ∞ ∞
!
X X X X
λ an + bn = λ (an + bn ) = λ (an + bn )
n=1 n=1 n=1 n=1
∞
X ∞
X ∞
X
= (λan + λbn ) = λan + λbn
n=1 n=1 n=1
X∞ ∞
X
=λ an + λ bn . X
n=1 n=1

Axiom 6. This holds by the computation

∞
X X∞ ∞
X
(λ1 + λ2 ) an = (λ1 + λ2 ) an = (λ1 an + λ2 an )
n=1 n=1 n=1
X∞ ∞
X ∞
X ∞
X
= λ1 an + λ2 an = λ1 an + λ2 an . X
n=1 n=1 n=1 n=1

Axiom 7. This holds by the computation

∞ ∞ ∞
!
X X X
λ1 λ2 an = λ1 λ2 an = λ1 (λ2 an )
n=1 n=1 n=1
∞
X ∞
X
= (λ1 λ2 ) an = (λ1 λ2 ) an . X
n=1 n=1

Axiom 8. This holds by the computation

X∞ X∞ ∞
X
1 an = 1 · an = an . X
n=1 n=1 n=1

Since all the axioms hold, S is a vector space. 

Problem 2.1.9. Let V be the collection consisting of a single element z with ad-
dition and scalar multiplication defined by
z+z =z
λz = z.
Show that V is a vector space.
Solution. Verify the axioms.
Axiom 1. This follows from the computation z + z = z = z + z. X
Axiom 2. This follows from the computation
z + (z + z) = z + z = z = (z + z) + z. X
Axiom 3. Here, 0 = z. To see this, note that z + 0 = z + z = z. X
Axiom 4. Here, −z = z. To see this, note that z + (−z) = z + z = z = 0. X
Axiom 5. This follows from the computation λ (z + z) = λz = z = λz + λz. X
Axiom 6. This follows from the computation (λ1 + λ2 ) z = z = λ1 z + λ2 z. X
Axiom 7. This follows from the computation λ1 (λ2 z) = λ1 z = z = (λ1 λ2 ) z. X
 MATH 107.01 HOMEWORK #6 SOLUTIONS 7

Axiom 8. This follows from the computation 1z = z. X

Since all the axioms hold, V is a vector space.