Scribd
Upload
22 views

MA 106: Spring 2014: Tutorial Sheet 3

This document contains 12 problems about linear algebra concepts such as subspaces, linear independence, row reduction, rank, and linear transformations. It asks the student to describe subspaces, prove statements about linear independence and row reduction, find dimensions of subspaces of matrices, determine ranks of linear transformations, and represent linear transformations with matrices with respect to different bases.

Uploaded by

Praveen Saharan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
22 views

MA 106: Spring 2014: Tutorial Sheet 3

This document contains 12 problems about linear algebra concepts such as subspaces, linear independence, row reduction, rank, and linear transformations. It asks the student to describe subspaces, prove statements about linear independence and row reduction, find dimensions of subspaces of matrices, determine ranks of linear transformations, and represent linear transformations with matrices with respect to different bases.

Uploaded by

Praveen Saharan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MA 106: Spring 2014: Tutorial Sheet 3

1. Describe all subspaces of R1×1 , R1×2 , R1×3 and R1×4 .

2. Given a set of n linearly independent vectors {v1 , v2 , . . . , vn } in a vector space V , show


that for any nonzero scalar α, the set {v1 , v2 . . . , vi−1 , vi + αvj , vi+1 , . . . , vn } with i 6= j
is linearly independent.

3. Let A be a n × n matrix. For i = 1, 2, . . . , n, let A[i, i] denote the submatrix formed by


the first i rows and first i columns of A. The matrix A is said to be strongly nonsingular
if det(A[i, i]) 6= 0, for all i. (‘Strongly nonsingular’ is a nonce word cooked up for the
purpose of this exercise.) If A is strongly nonsingular, show that A can be reduced to
a diagonal matrix by row operations of type I only.

4. (a) Let W1 and W2 be subspaces of a vector space V . Define the sum of W1 and W2 by
W1 +W2 = {w1 +w2 : w1 ∈ W1 and w2 ∈ W2 }. Show that W1 +W2 = L(W1 ∪W2 ).
(b) A sum W1 + W2 is said to be direct if W1 ∩ W2 = {0}, and we denote it by
W1 ⊕ W2 . Suppose V = W1 ⊕ W2 . Show that for every v ∈ V , there are unique
w1 ∈ W1 and w2 ∈ W2 such that v = w1 + w2 . Deduce that dim(W1 ⊕ W2 ) =
dim(W1 ) + dim(W2 ).
(c) Let V and W be finite dimensional vector spaces. The set V × W of ordered pairs
{(v, w) : v ∈ V and w ∈ W } is a vector space under componentwise operations.
Set W1 = {(v, 0) : v ∈ V } and W2 = {(0, w) : w ∈ W }. Then W1 and W2 are
subspaces of V × W . Show that V × W = W1 ⊕ W2 .

5. (a) Let A and B be n×n matrices. If A is invertible, show that rank(AB) =


rank(B) = rank(BA).
(b) Let A be an m×n matrix and let B be an n×p matrix. Show that

rank(A) + rank(B) − n ≤ rank(AB) ≤ min{ rank(A), rank(B)}.

6. Let Ax = b be a linear system, where A has m rows and n columns.


(i) Suppose a sequence of elementary row operations reduces Ax = b to R1 x = b1 ,
and suppose that another sequence of elementary row operations reduces Ax = b to
R2 x = b2 , where R1 and R2 are both in row echelon form. Show that the set of pivotal
and free columns of R1 and R2 are the same, and so the particular solution of Ax = b
as well as the basic solutions of Ax = 0 as defined in the class are also the same for
both systems.
(ii) Show that there is a unique row canonical form of A.

7. Let U be a k × n matrix in a row canonical form with pivotal columns j1 < · · · < jk
and with row vectors R1 , . . . , Rk . Let v = [α1 , .P
. . , αn ] be a row vector. Show that
v ∈ R(U ), the row space of U , if and only if v = ki=1 αji Ri .

8. Let S1 , . . . , S5 denote the subspaces of all n × n real matrices which are diagonal, upper
triangular, trace-zero, symmetric, skew-symmetric, respectively. Find the dimensions
of S1 , . . . , S5 .

1
9. Let V = {(x1 , x2 , . . .) : xn ∈ R for all n ∈ N} denote the vector space of all real
sequences. Let U denote the subspace of all real sequences converging to 0. A sequence
in V is said to be eventually zero if there is some n0 ∈ N such that xn = 0 for all
n ≥ n0 Let W denote the subspace of all eventually zero sequences. Clearly W ⊆ U ⊆
V . Show that W is infinite dimensional. Can you think of bases of U, V and W ?

10. Find the rank and the nullity of the following linear transformations.
(i) T : R1×2 −→ R1×3 defined by T ([x1 , x2 ]) = [x1 , x1 + x2 , x2 ].
(ii) T : R1×4 −→ R1×3 defined by T ([x1 , x2 , x3 , x4 ]) = [x1 − x4 , x2 + x3 , x3 − x4 ].

11. Find the matrix of the linear operator T : R3×1 → R3×1 defined by T ([x1 , x2 , x3 ])t =
[x1 + x3 , 2x1 − x2 , x3 /2]t w.r.t. the ordered basis (i) E = (e1 , e2 , e3 ) of R3×1 as well as
w.r.t. the ordered basis (ii) F = (e1 + e2 , e2 , 6e1 + 8e2 − 3e3 ) of R3×1 .

12. Find the matrix of the linear transformation T : R3×1 → R4×1 defined by T ([x1 , x2 , x3 ])t =
[x1 + x2 , x2 + x3 , x3 + x1 , x1 + x2 + x3 ]t w.r.t. the ordered bases (i) E = (e1 , e2 , e3 )
of R3×1 and F = (e1 , e2 , e3 , e4 ) of R4×1 as well as w.r.t. the ordered bases (ii) E e =
(e1 +e2 , e2 +e3 , e3 +e1 ) of R3×1 and Fe = (e1 +e2 +e3 , e2 +e3 +e4 , e3 +e4 +e1 , e4 +e1 +e2 )
of R4×1 . Also, find the transition matrices MEE , MFFe , and verify the identity MFEe (T ) =
e e

MFFe MFE (T ) MEE .


e

You might also like