E 231 Assignment # 3

Issued: September 13, 2017 Due: September 22, 2017

1 Inner products, Norms

Let V be an inner product space.

(a) Let x, y V with x orthogonal to y. Prove Pythagoras theorem:

kx + yk2 = kxk2 + kyk2

(b) Prove that in an inner product space,

kx + yk2 + kx yk2 = 2kxk2 + 2kyk2

where k k is the norm induced by the inner product. This is called the Parallelogram law.
Can you give a geometric interpretation of this law in R2 ?

2 Vector norms
Let v Cn . Show that

(a) kvk1 nkvk2 nkvk
(b) kvk kvk2 kvk1
(c) Find examples to illustrate that all inequalities above are tight.

3 Matrix computations
Find the ranks and nullities of the following matrices:

1 2 0
(a) 0 0 1
2 4 0
1 1

0 1
(b)
4 0
1 0

0 0 4 0
(c) 0 1 0 0
11 0 0 0

4 Rank
For each of the following, determine if the assertion is true or false. If true, supply a proof. If
false, supply a counterexample.

(a) rank (A) = rank (AA)

page 1 version September 12, 2017

 (b) rank (A) = rank (AA )
(c) Let A Cpm and Q Cmm . Suppose Q has rank m, then rank (AQ) = rank A
5 Range and Null Spaces
Find the Range and Null Spaces of the following:
(a) A = I Cnn
 
0 1
(b) A =
0 0
(c) A = Q 0 Cn(n+m) where Q is invertible.
 

(d) A = I R Cn(n+m)
 

6 Operators
Let A, B, C, X be matrices of appropriate size, and let x, v Cn . Which of the following maps
are linear ?
(a) f (X) = AX + XB
(b) f (X) = AX + BXC
(c) f (X) = AX + XBX
(d) f (X) = A0 XA X
(e) f (x) = kxk
(f) f (x) = hv, xi
7 Linear Matrix Equations
Let A Cmn , B C`p , C Cmp .
(a) Show that the matrix equation AX = C solvable if and only if R(C) R(A).
(b) Suppose AX = C is solvable. Show that it has a unique solution if and only if N (A) = {0}.
(c) Show that the matrix equation XB = C solvable if and only if N (B) N (C).
8 Null spaces
Let A Cnn . For k = 0, 1, , define Nk = N (Ak ). Show the following:
(a) For all k = 0, 1, , Nk Nk+1
(b) If for some integer `, it happens that N` = N`+1 then,
N` = N`+1 = N`+2 =
9 Ranks and Nullities
This is hard. Prove Sylvesters inequality: If A Cmn , B Cnr then
rank(B) nullity(A) rank(AB) min{rank(A), rank(B)}

10 Linear Matrix Equations

This is very hard. When is the matrix equation AXB = C solvable for X?

page 2 version September 12, 2017