Matrix Theory Homework 1

Problem1
Problem: Show if A M
mn
, and B M
np
, then for each i {1, ..., m}, R
i
(AB) =
R
i
(A)B by assuming for all matricies K, L for which KL is dened, C
j
(KL) =
KC
j
(L) (property 1) and (KL)

= L

(property 2).
Proof -It follows from the denition of transpose, C
i
(A), and R
i
(A) that
R
i
(A) = C
i
(A

Hence
R
i
(AB) = C
i

(AB)

Using property 2 we obtain:

R
i
(AB) = C
i

And by property 1 we have:

R
i
(AB) =

C
i

Finally, by the denitions of R

i
(A) and transpose, we show
R
i
(AB) = C
i

B
R
i
(AB) = R
i
(A)B
1
Problem 4 2
Problem2
Problem: Show that if P = [c
1
... c
n
] M
n
is invertible, then its columns are linearly
independent. Assume P is invertible if and only if for all x F
n
, Px = 0 implies
x = 0. Recall, vectors v
1
, ..., v
m
are linearly independent over F if for all scalars

1
, ..., a
m
F,
1
v
1
+ ... +
m
v
m
= 0 implies
1
= 0, ...,
m
= 0.
Proof - Assume P = [c
1
... c
n
] M
n
is invertible and let
1
, ..., a
n
F be arbi-
trary. Next, dene
=

1
.
.
.

Therefore we have:
P =
1
C
1
(P) + ... +
n
C
n
(P)
=
1
c
1
+ ... +
n
c
n
Since P is invertible, P = 0 implies = 0. By the equation above, this is equivalent
to showing that if
1
c
1
+ ... +
n
c
n
= 0 then = 0, hence
1
= 0, ...,
n
= 0. This
shows that c
1
, ..., c
n
are linearly independent.
Problem3
Problem: For all A M
mn
and B M
np
, show (AB)
*
= B
*
A
*
. Assume
(AB)

= B

(property 1) and AB = A B (property 2).

Proof - Assume A M
mn
and B M
np
. By denition, G

= [g
ji
] = [g
ij
] = G
*
and G

= [g
ij
]

= [g
ji
] = G
*
for any matrix G M
st
. Therefore (AB)
*
= (AB)

=
(AB)

. Then by property 1, we have:

(AB)
*
= (AB)

= B

And by property 2 we obtain:

(AB)
*
= B

= B

Now we see from the statement G

*
= G

,
(AB)
*
= B

= B
*
A
*
Matrix Theory
Problem 6 3
Problem4
Problem: Show for all A, B M
mn
(F), A = B if and only if for all x F
n
, Ax = Bx.
Proof Assume A, B M
mn
(F) with A = B. Let x F
n
be arbitrary. Then
Ax = x
1
C
1
(A) + ... + x
n
C
n
(A)
Since A = B, C
i
(A) = C
i
(B) for 1 i n. Then
Ax = x
1
C
1
(B) + ... + x
n
C
n
(B)
= Bx
Assume A, B M
mn
(F) with Ax = Bx for all x F
n
. We wish to show A = B.
It will suce to show C
i
(A) = C
i
(B) for 1 i n. Let x = e
i
for 1 i n. Since
Ax = Bx we have:
Ax = Bx = Be
i
= C
i
(B)
Bx = Ax = Ae
i
= C
i
(A)
C
i
(A) = C
i
(B)
Therefore A = B. Hence A = B if and only if Ax = Bx for all x F
n
.
Problem5
Problem: Assume A, B M
n
(F). Show that if AB = I, then the columns of A are
linearly independent.
Proof - Assume A, B M
n
(F) with AB = I. Notice that
I = I

= (AB)

= B

Next, let x F
n
. Then A

x = 0 if and only if x = 0, otherwise we would have the

contradiction x = 0, x = 0, from:
B

(A

x) = (B

)x = Ix = x
Now assume that A

x = [ 0 ]
n1
, then
(A

x)

= x

(A

= x

A = [ 0 ]
1n
But this is such if and only if x = 0. Hence x

A = x
1
C
1
(A) + ... + x
n
C
n
(A) = 0 if
and only if x
1
= 0, ..., x
n
= 0. Therefore the columns of A are linearly independent.
Matrix Theory
Problem 7 4
Problem6
Problem: For each n N let e =

1
.
.
.
1

n1
Show if A M
n
(F) has constant row
sums c, then e is an eigenvector of A. What is the corresponding eigenvalue.
Proof - Suppose n N, e =

1
.
.
.
1

n1
, and A M
n
(F) has constant row sums
c. Then let B = Ax. Notice that by denition, B is an n 1 matrix with entries
given by:
b
ij
=
n

j
a
ij
x
j
Since each x
i
= 1 we have
b
ij
=
n

j
a
ij
= c
Hence Ax = B =

c
.
.
.
c

n1
= c

1
.
.
.
1

n1
= cx. Therefore x is an eigenvector of A
with corresponding eigenvalue c.
Problem7
Problem: If A M
n
, tr(A) = a
11
+ ... + a
nn
. Show that if A, B M
n
(F), Then
tr(AB) = tr(BA) (even when A, B do not commute). Assume for all functions f on
{1, ..., n} {1, ..., M},
m

k=1
n

l=1
f(k.l) =
n

l=1
m

k=1
f(k.l)
and
e

i
ABe
j
= a
i1
b
1j
+ a
i2
b
2j
+ ... + a
in
b
nj
=
n

t=1
a
it
b
tj
Proof - Assume A, B M
n
(F), and let C = AB. Then c
ii
= e

i
Ce
i
= e

i
ABe
i
=

n
j=1
a
ij
b
ji
. Therefore
tr(C) =
n

i=1
n

j=1
a
ij
b
ji
Matrix Theory
Problem 8 5
Now let D = BA. Then by the same argument above,
tr(D) =
n

j=1
n

i=1
b
ji
a
ij
=
n

j=1
n

i=1
a
ij
b
ji
By the assumption stated in the problem,
n

i=1
n

j=1
a
ij
b
ji
=
n

j=1
n

i=1
a
ij
b
ji
Therefore
tr(AB) = tr(C) = tr(D) = tr(BA)
This is the result as desired.
Problem8
Use (7) to show for all A, P M
n
, if P is invertible, then tr(P
1
AP) = tr(A).Hinttr(AB)
= tr(BA) allows us to commute producets before we nd the trace, P
1
AP = P
1
AP.
Proof - Assume A, P M
n
, and P is invertible. Then by problem 7 and the as-
sociativity of matrix multiplication, tr(P
1
AP) = tr(P

1(AP)) = tr((P
1
P)A) =
tr(IA) = tr(A).
Matrix Theory