User interface language: English | Español

Date May 2015 Marks available 4 Reference code 15M.1.hl.TZ0.12
Level HL only Paper 1 Time zone TZ0
Command term Find and State Question number 12 Adapted from N/A

Question

A transformation \(T\) is a linear mapping from \({\mathbb{R}^3}\) to \({\mathbb{R}^4}\), represented by the matrix

\[M = \left( {\begin{array}{*{20}{c}} 1&2&1 \\ 2&7&5 \\ { - 3}&1&4 \\ 1&5&4 \end{array}} \right)\]

(i)     Find the row rank of \(M\).

(ii)     Hence or otherwise find the kernel of \(T\).

[8]
a.

(i)     State the column rank of \(M\).

(ii)     Find the basis for the range of this transformation.

[4]
b.

Markscheme

(i)     row reduction gives \(\left( {\begin{array}{*{20}{c}} 1&2&1 \\ 0&3&3 \\ 0&7&7 \\ 0&3&3 \end{array}} \right) \to \left( {\begin{array}{*{20}{c}} 1&2&1 \\ 0&3&3 \\ 0&0&0 \\ 0&0&0 \end{array}} \right)\left( { \to \left( {\begin{array}{*{20}{c}} 1&0&{ - 1} \\ 0&1&1 \\ 0&0&0 \\ 0&0&0 \end{array}} \right)} \right)\)     (M1)A1

hence row rank is \(2\)     A1

Note: Accept the argument that Column 2 = Column 1 + Column 3

 

(ii)     to find the kernel \(\left( {\begin{array}{*{20}{c}} 1&2&1 \\ 0&3&3 \\ 0&0&0 \\ 0&0&0 \end{array}} \right)\left( {\begin{array}{*{20}{c}} x \\ y \\ z \end{array}} \right) = \left( {\begin{array}{*{20}{c}} 0 \\ 0 \\ 0 \\ 0 \end{array}} \right)\)     M1

Note: Allow the use of the original matrix

 

\(x + 2y + z = 0\)

\(3y + 3z = 0\)     A1

let \(z = \lambda \)     M1

hence \(y =  - \lambda ,{\text{ }}x = \lambda \)

the kernel is therefore \(\left[ {\begin{array}{*{20}{c}} \lambda  \\ { - \lambda } \\ \lambda \end{array}} \right]\)     A1

a.

(i)     column rank is \(2\)     A1

(ii)     a basis for the range is defined by two independent vectors     (M1)

therefore a basis for the range is for example, \(\left[ {\begin{array}{*{20}{c}} 1 \\ 2 \\ { - 3} \\ 1 \end{array}} \right]\) and \(\left[ {\begin{array}{*{20}{c}} 2 \\ 7 \\ 1 \\ 5 \end{array}} \right]\)     A2

b.

Examiners report

Many solutions to this question suggested that the topic had not been adequately covered in many centres so that solutions were either good or virtually non existent. Most successful candidates used their calculator to perform the row reduction.

a.

Many solutions to this question suggested that the topic had not been adequately covered in many centres so that solutions were either good or virtually non existent. Most successful candidates used their calculator to perform the row reduction.

b.

Syllabus sections

Topic 1 - Linear Algebra » 1.6 » Domain, range, codomain and kernel.

View options