Further Mathematical Methods (Linear Algebra) 2002 Problem Sheet 2
Further Mathematical Methods (Linear Algebra) 2002 Problem Sheet 2
Further Mathematical Methods (Linear Algebra) 2002 Problem Sheet 2
Problem Sheet 2
(To be discussed in week 3 classes. Please submit answers to the asterisked questions only.)
This week we will look at some problems involving linear transformations. As we only covered this
material briefly in the lectures, it is vital that you read the hand-out for Lecture 3 before you attempt
these exercises. We shall also apply the two tests for linear independence which we devised in the
lectures and examine how solutions to sets of simultaneous equations can be analysed in terms of the
null space of a matrix.
1. * Prove Theorems 3.3 and 3.7 from the hand-out for Lecture 3.
Show that this transformation is linear. Find the range and null-space of the transformation T , and
use these to verify the rank-nullity theorem. Further, find
the matrix for T with respect to the standard bases in R4 and R2 , and
of R4 and R2 respectively.
Verify that the sets S and S 0 are bases of R4 and R2 .
3. Use the Wronskian to show that the set of functions {ex , ex , ex } [defined for all values of x R]
is linearly independent if , and are all different.
4. * Show that the Wronskian for the functions f (x) and g(x) defined [for all values of x R] by
2
2 x for x 0
f (x) = x and g(x) =
0 for x 0
x1 + x2 + x3 + x4 = 4
2x1 + x3 x4 = 2
2x2 + x3 + 3x4 = 6
in the form Ax = b. Find the general solution to this set of equations writing it in the form
x = v + 1 u1 + 2 u2 + + r ur
where the set of vectors {u1 , u2 , . . . , ur } is a basis for the null space of A. Find the Cartesian equation
of the affine set given by the general solution and describe it geometrically in terms of hyperplanes.
Other Problems. (These are not compulsory, they are not to be handed in, and will not be covered
in classes.)
This week, the other problems are here so that you can revise some properties of matrices which you
should have encountered in MA100. Everyone should try these as we will be using these techniques
throughout the course. Solutions for these problems will be contained in the Solution Sheet.
You should recall that the row (or column) space of a matrix is defined to be the space spanned by
the row (or column) vectors of a matrix. We shall denote the row and column spaces of a matrix A
by RS(A) and CS(A) respectively.
3 0 0 3
Hence, write down a smallest spanning set for RS(A) and CS(A).
9. Establish that for any real m n matrix, the dimension of the column space, the dimension of
the row space, and the rank of the matrix are all equal.
Harder Problems. (These are not compulsory, they are not to be handed in, and will not be
covered in classes.)
For those of you who like the more abstract stuff, here are some more difficult questions for you to
think about. Solutions for these problems will be contained in the Solution Sheet. If you want to
discuss these solutions (after they have been circulated) you should bother me and not your class
teacher.
11. Prove the rank-nullity theorem (i.e. Theorem 3.9 in the hand-out for Lecture 3) in the cases
where (T ) = 0 and (T ) = n. Why does the proof given in the hand-out not apply in these cases?
12. Prove Theorems 3.12 and 3.13 from the hand-out for Lecture 3.