1 Problem 1.

3(2)
1.1 Solve the following system of equations by Gaussian elimina-
tion.
_

_
2y z = 1
4x 10y + 3z = 5
3x 3y = 6
First, create an augmented matrix from the system of equations.
_
_
0 2 1 1
4 10 3 5
3 3 0 6
_
_
Now simplify the matrix using Gaussian elimination.
_
_
0 2 1 1
4 10 3 5
3 3 0 6
_
_

R
1
R
3
_
_
3 3 0 6
4 10 3 5
0 2 1 1
_
_

R
2

4
3
R
1
R
2
_
_
3 3 0 6
0 6 3 3
0 2 1 1
_
_

R
3
+
1
3
R
2
R
3
_
_
3 3 0 6
0 6 3 3
0 0 0 0
_
_

R
1
3
R
1
_
_
1 1 0 2
0 6 3 3
0 0 0 0
_
_

R
2
6
R
2
_
_
1 1 0 2
0 1
1
2
1
2
0 0 0 0
_
_
Now that the augmented matrix is in row-echelon form, the following equations
are extracted.
_
_
_
x y = 2
y
z
2
=
1
2
=
_
x = y + 2
z = 2y 1
There are innitely many solutions.
_

_
x = t + 2
y = t
z = 2t 1
, t R
1.2 What are the pivots?
One can deduce, by observing the matrix directly after forward elimination,
that the pivots are 3 and -6.
1
2 Problem 1.5(3)
2.1 Suppose that A and 0 are the same size. Prove that A+(A) =
(A) + A = 0.
We want to show that a
ij
+(1)a
ij
= (1)a
ij
+a
ij
= 0 for every element in A.
Let us start with the left side.
a
ij
+ (1)a
ij
= a
ij
a
ij
(scalar algebra)
= 0 (scalar algebra)
Similarly,
(1)a
ij
+ a
ij
= a
ij
+ (1)a
ij
(scalar algebra)
= a
ij
a
ij
(scalar algebra)
= 0 (scalar algebra)
So every element in the resulting matrices is 0 which makes them zero matrices.
This proves that A + (A) = (A) + A = 0.
2
3 Problem 1.6
3.1 Find a matrix B such that A + B
T
= (A B)
T
, where
A =
_
_
2 3 0
4 1 3
1 0 1
_
_
.
Let us calculate what each (i, j)-entry of B will be.
[A]
ij
+ [B
T
]
ij
= [(AB)
T
]
ij
[A]
ij
+ [B]
ji
= [AB]
ji
(transpose)
[A]
ij
+ [B]
ji
= [A]
ji
[B]
ji
(sum of matrices)
2[B]
ji
= [A]
ji
[A]
ij
(scalar algebra)
[B]
ji
=
[A]
ji
[A]
ij
2
(scalar algebra)
We can now use this result to calculate each element of B.
B =
_

_
22
2
34
2
0+1
2
4+3
2
1+1
2
30
2
10
2
03
2
11
2
_

_ =
_

_
0
7
2
1
2
7
2
0
3
2

1
2

3
2
0
_

_
3
4 Exercise 1.9
A =
_
2 1 1
1 2 1
_
, B =
_
_
3
1
1
_
_
, C =
_
1 1

4.1 Compute ABC.

ABC =
_
2 1 1
1 2 1
_
_
_
3
1
1
_
_
_
1 1

=
_
4
4
_
_
1 1

=
_
4 4
4 4
_
4.2 Compute CAB.
CAB =
_
1 1

_
2 1 1
1 2 1
_
_
_
3
1
1
_
_
=
_
1 3 0

_
_
3
1
1
_
_
=
_
0

4
5 Exercise 1.14(2)
A =
_
_
1 3 4
0 2 1
0 0 3
_
_
5.1 Find the symmetric part of A.
A
s
=
1
2
(A + A
T
)
Let us calculate each individual component.
[A
s
]
ij
=
_
1
2
A + A
T
_
ij
=
1
2
[A + A
T
]
ij
(scalar multiplication)
=
1
2
_
[A]
ij
+ [A
T
]
ij
_
(matrix addition)
=
1
2
([A]
ij
+ [A]
ji
) (transpose)
If we do the calculations for each element of A
s
, we get the following.
A
s
=
_

_
1
3
2
2
3
2
2
1
2
2
1
2
3
_

_
5.2 Find the skew-symmetric part of A.
A
a
=
1
2
(AA
T
)
Let us calculate each individual component.
[A
a
]
ij
=
_
1
2
AA
T
_
ij
=
1
2
[AA
T
]
ij
(scalar multiplication)
=
1
2
_
[A]
ij
[A
T
]
ij
_
(matrix addition)
=
1
2
([A]
ij
[A]
ji
) (transpose)
5
If we do the calculations for each element of A
a
, we get the following.
A
a
=
_

_
0
3
2
2

3
2
0
1
2
2
1
2
0
_

_
6
6 Extra 1: #5
6.1 Let x
1
and x
2
be solutions to Ax = 0. Show that for any
r, s R, rx
1
+ sx
2
is also a solution.
We want to show A(rx
1
+ sx
2
) = 0. Let us approach from the left side.
A(rx
1
+ sx
2
) = A(rx
1
) + A(sx
2
) (distributive)
= r(Ax
1
) + s(Ax
2
) (scalar multiplication)
= r(0) + s(0) (Ax = 0 and x
1
, x
2
are solutions)
= 0 +0 (scalar multiplication)
= 0 (matrix addition)
So rx
1
+ sx
2
is a solution for any r, s R.
7
7 Extra 1: #6
Let A = [a
ij
] be a n n matrix. The trace of A, denoted tr(A), is dened
as the sum of the diagonal entries of A, tr(A) =

n
i=1
a
ii
. Prove that for any
A, B M
nn
(R):
7.1 tr(cA) = c tr(A) for any scalar c R
tr(cA) =
n

i=1
[cA]
ii
(denition of trace)
=
n

i=1
ca
ii
(scalar multiplication)
= c
n

i=1
a
ii
(property of sums)
= c tr(A) (denition of trace)
7.2 tr(A + B) = tr(A) + tr(B)
tr(A + B) =
n

i=1
[A + B]
ii
(denition of trace)
=
n

i=1
([A]
ii
+ [B]
ii
) (matrix addition)
=
n

i=1
[A]
ii
+
n

i=1
[B]
ii
(property of sums)
= tr(A) + tr(B) (denition of trace)
7.3 tr(AB) = tr(BA)
tr(AB) =
n

i=1
[AB]
ii
(denition of trace)
=
n

i=1
_
_
n

j=1
a
ij
b
ji
_
_
(matrix multiplication)
8
tr(BA) =
n

j=1
[BA]
jj
(denition of trace)
=
n

j=1
_
n

i=1
b
ji
a
ij
_
(matrix multiplication)
=
n

j=1
_
n

i=1
a
ij
b
ji
_
(scalar algebra)
=
n

i=1
_
_
n

j=1
a
ij
b
ji
_
_
(property of sums)
Since both sides approach the same result, the equality is proven. (Note that i
and j are dummy variables.)
7.4 tr(A
T
) = tr(A)
tr(A
T
) =
n

ii
[A
T
]
ii
(denition of trace)
=
n

ii
[A]
ii
(transpose)
= tr(A) (denition of trace)
7.5 tr(A
T
A) 0
tr(A
T
A) =
n

i=1
[A
T
A]
ii
(denition of trace)
=
n

i=1
_
_
n

j=1
[A
T
]
ij
[A]
ji
_
_
(matrix multiplication)
=
n

i=1
_
_
n

j=1
a
2
ji
_
_
(transpose)
Since a
2
ji
0 for any a
ji
R, the sum of a
2
ji
s will also always be non-negative
and the sum of the sum of a
2
ji
s will also always be non-negative. Because of
this, we know that tr(A
T
A) 0 always.
9