0% found this document useful (0 votes)
109 views

Assg 4

1. Show that for any inner product space Rn, the inner product of any two vectors x and y can be written as x transpose times a symmetric matrix A times y, where the entries of A are the inner products of the standard basis vectors. 2. Show that any norm on a vector space V has three properties: it is always nonnegative, equal to 0 if and only if the vector is the zero vector, and satisfies properties related to scaling vectors and adding vectors. 3. Use the Gram-Schmidt process to transform given sets of vectors into orthonormal bases for the vector spaces they span, with respect to given inner products.

Uploaded by

Ujjwal Thori
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
109 views

Assg 4

1. Show that for any inner product space Rn, the inner product of any two vectors x and y can be written as x transpose times a symmetric matrix A times y, where the entries of A are the inner products of the standard basis vectors. 2. Show that any norm on a vector space V has three properties: it is always nonnegative, equal to 0 if and only if the vector is the zero vector, and satisfies properties related to scaling vectors and adding vectors. 3. Use the Gram-Schmidt process to transform given sets of vectors into orthonormal bases for the vector spaces they span, with respect to given inner products.

Uploaded by

Ujjwal Thori
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment 4

MTH 102A Summer 2015


1. Let <, > be any inner product on Rn . Show that < x, y >= xt Ay for all vectors x, y Rn
where A is the symmetric n n matrix whose (i, j)th entry is < ei , ej >, the vector ei being the
standard basis vectors of Rn .
2. Show that the norm of a vector in a vector space V has the following three properties
(a) kvk 0 and kvk = 0 if and only if v = 0.
(b) kvk = ||kvk for all R and v V .
(c) kv + wk kvk + kwk for all v, w V .
3. Use Gram-Schmidt process to transform each of the following into an orthonormal basis;
(a) {(1, 1, 1), (1, 0, 1), (0, 1, 2)} for R3 with dot product.
(b) Same set as in (i) but using the inner product defined by < (x, y, z), (x0 , y 0 , z 0 ) >= xx0 +
2yy 0 + 3zz 0 .
4. Let U be a proper subspace of the inner product space V . Let U = {v V : < v, u >=
0 u U }. Show that U is a subspace of V ( it is called orthogonal complement of U ). Let
U = {(1, 2, 3) : R} be a subspace of R3 with scalar product. Find U . Also, show that
S is a subspace of V for any arbitary subset S of V.
5. Let U1 and U2 be subspaces of a vector space V . We say that V is the direct sum of U1 and U2 ,
notation V = U1 U2 , provided that each element of V has a unique expression in the form of
v = x + y where x U1 and y U2 .
(a) Show that V = U1 U2 if and only if U1 U2 = {0} and each element of V is expressible
in the form v = x + y where x U1 and y U2 .
(b) Show that V = U U for any subspace U of the inner product space V .
6. Let Rn and Rm be equipped with usual dot product and let A be an m n matrix with real
entries. Show that Ker A = (Im At ) and Im A = (Ker At ) .
7. Let A be an n n matrix and b be a column vector in Rn . Let x = (xi ) be a column vectors of
unknowns. Use the previous problem to show that only one of the following can have a solution
for x
(i) Ax = b
(ii) At x = 0 and xt b 6= 0
(This is referred as Fredholm Alternative)
8. Let A be an n n real matrix. Show that the following are equivalent
(a) A is orthogonal.
(b) A preserves length, i.e. kAvk = kvk v Rn .
(c) A is invertible and At = A1 .
(d) The rows of A forms and orthonormal basis of Rn .
(e) The columns of A forms an orthonormal basis of Rn .
9. (T) Let A be an n n matrix with eigenvalues 1 , . . . , n . Show that det(A) = 1 . . . n and
Tr(A) = 1 + + n . Further show that A is invertible if and only if its all eigenvalues are
non-zero.

10. Let A be an nn invertible matrix. Show that eigenvalues of A1 are reciprocal of the eigenvalues
of A, moreover, A and A1 have the same eigenvectors.
11. Let A be an n n matrix and be a scalar. Find the eigenvalues of A I in terms of
eigenvalues of A. Further show that A and A I have the same eigenvectors.
12. (T) Let A be an n n matrix. Show that AT and A have the same eigenvalues. Do they have
the same eigenvectors?
13. Let A be an n n matrix. Show that:
(a) If A is idempotent (A2 = A) then eigenvalues of A are either 0 or 1.
(b) If A is nilpotent (Am = 0 for some m 1) then all eigenvalues of A are 0.
14. (T) This question deals with the following symmetric matrix A:

1 0 1
A = 0 1 -1 .
1 -1 0
One eigenvalue is = 1 with the line of eigenvectors x = (c, c, 0).
(a) That line is the null space of what matrix constructed from A?
(b) Find the other two eigenvalues of A and two corresponding eigenvectors.
(c) The diagonalization A = SS 1 has a specially nice form because A = AT . Write all
entries in the three matrices in the nice symmetric diagonalization of A.
15. Find the eigenvalues and corresponding
eigenvectors
of matrices



1
2
2
1 1
2
2
2
(a)
(b)
4 1
3 6 6
16. Construct

0
(a) 0
2

a basisof R3 consistingof eigenvectors


of the following matrices
0 2
1 1 1
1 1
2 0
1 .
(b)
0 3
1 1
1

You might also like