<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>6575</id>
  <path>/www/nrich/html/content/id/6575/</path>
  <resourceTypeID>1</resourceTypeID>
  <last_published>2011-02-01T00:00:01</last_published>
  <indexXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
&lt;p&gt;Imagine that you have a pair of vectors ${\bf F}$ and ${\bf Z}$&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
{\bf F}=\pmatrix{1\cr 1 \cr 0}\quad {\bf Z}=\pmatrix{0\cr 1 \cr 1}&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
Can you construct an example of a matrix $M$, other than the identity, which leaves ${\bf F}$ fixed, in that $M{\bf F}={\bf F}$? How many such matrices can you find? Which is the simplest? Which is the most complicated?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Can you construct an example of a matrix $N$, other than the zero matrix, which crushes ${\bf Z}$ to the zero vector ${\bf 0}$, in that $N{\bf Z}={\bf 0}$? How many such matrices can you find? Which is the simplest? Which is the most complicated?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Can you find a matrix which leaves ${\bf F}$ fixed and also crushes ${\bf Z}$?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Can you find any (many?) vectors fixed or crushed by the following matrices? Give examples or convincing arguments if no such vectors exist.&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
M = \begin{pmatrix} 1&amp;amp;0&amp;amp;0\\ 0&amp;amp;1&amp;amp;0\\ 0&amp;amp;0&amp;amp;1\\ \end{pmatrix}, \begin{pmatrix} 1&amp;amp;2&amp;amp;3\\ 2&amp;amp;3&amp;amp;4\\ 3&amp;amp;4&amp;amp;5\\ \end{pmatrix}, \begin{pmatrix} 1&amp;amp;-2&amp;amp;1\\ 1&amp;amp;1&amp;amp;0\\ -2&amp;amp;1&amp;amp;-2\\ \end{pmatrix}&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-style: italic;&quot;&gt;Very hard extension:&lt;/span&gt; Imagine that you are given a vector ${\bf F}$ and a vector ${\bf Z}$. Investigate whether you will be able to make a matrix $M$ which both fixes ${\bf F}$ and crushes ${\bf Z}$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
 &lt;/p&gt;
&lt;div class=&quot;framework&quot;&gt;&lt;br&gt;&lt;/br&gt;
NOTES AND BACKGROUND&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Matrices are used to represent transformations of vectors; vectors and matrices are usually studied together as an inseparable pair. Although matrices and the rules of matrix multiplication might seem abstract upon first encounter, they are actually very natural and encode in an entirely meaningful way notions of symmetry and transformation. This problem allows you to explore the effects matrix
multiplication has on various vectors. The &lt;span style=&quot;font-style: italic;&quot;&gt;eigenvectors&lt;/span&gt; of a matrix are those vectors whose direction is unchanged by the action of the matrix. The &lt;span style=&quot;font-style: italic;&quot;&gt;kernel&lt;/span&gt; of a matrix is the set of vectors which are squashed to zero. Both concepts are of fundamental importance in higher-level algebra and its applications to
science.&lt;/div&gt;
&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</indexXML>
  <solutionXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;
&lt;br&gt;&lt;/br&gt;
&lt;p&gt;&lt;span class=&quot;editorial&quot;&gt;Doug writes:&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
For the first part, I took a general matrix $\begin{bmatrix} a&amp;amp;b&amp;amp;c\\ d&amp;amp;e&amp;amp;f\\ g&amp;amp;h&amp;amp;i\\ \end{bmatrix}$, and multiplied this with $\mathbf{F}$ to get $\begin{pmatrix} a+b\\ d+e\\ g+h\\ \end{pmatrix} \therefore$ a+b=1, d+e=1, g+h=0, and c,f,i are irrelevant. There are an infinite number of solutions to this.&lt;br&gt;&lt;/br&gt;
Check the identity matrix is one, yes it is. The simplest non-identity is probably $\begin{bmatrix} 1&amp;amp;0&amp;amp;0\\ 0&amp;amp;1&amp;amp;0\\ 0&amp;amp;0&amp;amp;0\\ \end{bmatrix}$&lt;br&gt;&lt;/br&gt;
And a complicated one is $\begin{bmatrix} m&amp;amp;1-m&amp;amp;j\\ n&amp;amp;1-n&amp;amp;k\\ p&amp;amp;-p&amp;amp;l\\ \end{bmatrix}$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
To crush $\mathbf{Z}$, I followed the same process. The simplest non-zero matrix is probably $\begin{bmatrix} 1&amp;amp;0&amp;amp;0\\ 0&amp;amp;0&amp;amp;0\\ 0&amp;amp;0&amp;amp;0\\ \end{bmatrix}$&lt;br&gt;&lt;/br&gt;
And a complicated one is $\begin{bmatrix} j&amp;amp;m&amp;amp;-m\\ k&amp;amp;n&amp;amp;-n\\ l&amp;amp;p&amp;amp;-p\\ \end{bmatrix}$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
To find a matrix that achieves both, I just combined the equations found previously to the simultaneous set: a+b=1,d+e=1,g+h=0,b+c=0,e+f=0,h+i=0 $\therefore$ b=-c,e=-f,h=-i&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$\therefore$ a-c=1,d-f=1,g-i=0&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
9 variables, 6 equations, but there is probably not just one unique solution.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
In fact looking at these, we can quickly jump to $\begin{bmatrix} 1-j&amp;amp;j&amp;amp;-j\\ 1-k&amp;amp;k&amp;amp;-k\\ -l&amp;amp;l&amp;amp;-l\\ \end{bmatrix}$ which satisfies both sets, thus any matrix of this form will fix $\mathbf{F}$ and crush $\mathbf{Z}$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
The above matrix must be, and is, singular, i.e. the eigenvectors do not form an independent set. If the eigenvectors formed an independent set then there would be no vector that would be crushed by being transformed by the matrix.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
For the next part, it seems that $\mathbf{F}$ and $\mathbf{Z}$ have been carefully chosen to have 1s and 0s to make simultaneous fixing &amp;amp; crushing possible.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
I tried to prove this with the general matrix $\begin{bmatrix} a&amp;amp;b&amp;amp;c\\ d&amp;amp;e&amp;amp;f\\ g&amp;amp;h&amp;amp;i\\ \end{bmatrix}$ multiplied with a fixable general vector $\begin{pmatrix} j\\ k\\ l\\ \end{pmatrix}$ and a crushable general vector $\begin{pmatrix} m\\ n\\ p\\ \end{pmatrix}$&lt;br&gt;&lt;/br&gt;
so we have 6 simultaneous equations:&lt;br&gt;&lt;/br&gt;
aj+bk+cl=j&lt;br&gt;&lt;/br&gt;
dj+ek+fl=k&lt;br&gt;&lt;/br&gt;
gj+hk+il=l&lt;br&gt;&lt;/br&gt;
am+bn+cp=0&lt;br&gt;&lt;/br&gt;
dm+en+fp=0&lt;br&gt;&lt;/br&gt;
gm+hn+ip=0&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
I proceeded to attempt to solve the simultaneous equations, but did not find a general argument to prove it either way.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span class=&quot;editorial&quot;&gt;Steve notes:&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
The first matrix fixes all vectors and crushes no vectors. So, clearly not all matrices crush vectors. I wonder if others fail to crush vectors?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Anyway, to determine more generally if a matrix $M$ crushes a vector $\mathbf{Z}$ we need to solve $M\mathbf{Z}= \mathbf{0}$. By putting this into components we get three simultaneous equations in $x, y, z$. For the second matrix, the equations I get are&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$$x+2y+3z=0, 2x+3y+4z = 0, 3x+4y+5z=0$$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
I can solve these by elimination to get the solution as&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
2x=-y=2z&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
This is a line of solutions - each vector can be written as $(a, -2a, a)$ for any number $a$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
To check, we can see that&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
\begin{pmatrix} 1&amp;amp;2&amp;amp;3\\ 2&amp;amp;3&amp;amp;4\\ 3&amp;amp;4&amp;amp;5\\ \end{pmatrix}&lt;br&gt;&lt;/br&gt;
\begin{pmatrix} a\\ -2a\\ a\\ \end{pmatrix} = \begin{pmatrix} 0\\ 0\\ 0\\ \end{pmatrix}&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
To determine if the same matrix fixes a vector, I need to solve&lt;br&gt;&lt;/br&gt;
$$ \begin{pmatrix} 1&amp;amp;2&amp;amp;3\\ 2&amp;amp;3&amp;amp;4\\ 3&amp;amp;4&amp;amp;5\\ \end{pmatrix} \begin{pmatrix} x\\ y\\ z\\ \end{pmatrix} = \begin{pmatrix} x\\ y\\ z\\ \end{pmatrix} $$&lt;br&gt;&lt;/br&gt;
This gives me equations&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
2y+3z=0, 2x+2y+4z = 0, 3x+4y+4z=0&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
I tried to solve these, but they proved to be inconsistent with no solution. So the second matrix does not fix any vector. So, there are clearly matrices which don&amp;#39;t leave any vector fixed.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
For the third matrix I saved some time by noticing that the second row is $(1, 1, 0)$. So, if this matrix is to crush any vector then that vector must be of the form $(a, -a, z)$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Multiplying this vector by the matrix gives $(3a+z, 0, -3a-2z)$. This can&amp;#39;t be set equal to zero for any choice of $a\neq 0$ and $z$, so the last matrix does not crush any vector.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
What does it fix? The second row is again key. It implies that $x+y=y$ which implies that $x=0$. The other rows give equations $-2y+z=0$ and $y-2z=z$, which are inconsistent unless $y=z=0$. So, this matrix doesn&amp;#39;t fix a vector either! I wasn&amp;#39;t expecting that.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
For the last part, note that if the vector $\mathbf{F}$ has all non-zero components $x, y$ and $z$ then it is always possible to construct a matrix such that $\mathbf{F}$ is fixed&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$\begin{bmatrix} 1&amp;amp;a&amp;amp; -(x+ay)/z+x/z\\ 1&amp;amp;b&amp;amp; -(x+by)/z+y/z\\ 1&amp;amp;c&amp;amp;-(x+cy)/z+1\\ \end{bmatrix}$&lt;br&gt;&lt;/br&gt;
It looks like variable choices $a, b, c$ will be sufficient to make it possible to crush any choice of vector $\mathbf{Z}$ which is not parallel to $\mathbf{F}$, but I&amp;#39;d better make sure.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Acting with this matrix on any other vector $(X, Y, Z)$ gives me&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
X+aY+\left(\frac{x-(x+ay)}{z}\right)Z = X+bY+\left(\frac{y-(x+by)}{z}\right)Z =X+cY+\left(\frac{z-( x+cy)}{z}\right)Z=0&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
I can rewrite this to make the factors of $a, b, c$ more clear as&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
X+\left(\frac{x-x}{z}\right) Z+a\left(Y-\frac{y}{z}Z\right)=X+\left(\frac{y-x}{z}\right) Z+b\left(Y-\frac{y}{z}Z\right)=X+\left(\frac{z-x}{z}\right) Z+c\left(Y-\frac{y}{z}Z\right)&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
Each choice $a, b, c$ premultiplies the same factor. So, if this factor is not zero I can choose $a, b, c$ so that $(X, Y, Z)$ is annihilated.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
This leaves the case when the factor is zero, which occurs if and only if&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
\frac{Y}{Z} = \frac{y}{z}&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
Geometrically, this occurs when and only when the projections of the two vectors onto the $x=0$ plane are parallel.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
 &lt;/p&gt;

&lt;/mdoxml&gt;</solutionXML>
  <noteXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
&lt;h3&gt;Why do this problem?&lt;/h3&gt;

This problem gives students the opportunity to explore the effect
of matrix multiplication on vectors, and lays the foundations for
studying the eigenvectors and kernel of a matrix, ideas which are
very important in higher level algebra with applications in
science.&lt;br&gt;&lt;/br&gt;
&lt;h3&gt;Possible approach&lt;/h3&gt;

&lt;div&gt;Start by asking students to work with the vector ${\bf F}$ to
find a matrix which fixes it. Initially, let students find their
own methods of working - some may choose to try to fit numbers in
the matrix, some may straight away work with algebra. Once students
have had a chance to try the task, allow some time to discuss
methods, as well as the simplest and most complicated examples of
matrices they have managed to find.&lt;/div&gt;

&lt;div&gt;Repeat the same process to find a matrix which crushes the
vector $\bf Z$.&lt;/div&gt;

&lt;br&gt;&lt;/br&gt;

&lt;div&gt;The last part of the problem asks students to seek vectors
which are fixed or crushed by each of the three matrices given.
This works well if students are first given time to explore the
properties of the matrices and to construct the conditions needed
for a vector to be fixed or crushed by them. Then encourage
discussion of their findings, particularly focussing on
justification for matrices where appropriate vectors can't be
found.&lt;/div&gt;

&lt;h3&gt;Key questions&lt;/h3&gt;

&lt;div&gt;What properties must a matrix have if it fixes $\bf F$? Or if
it crushes $\bf Z$?&lt;/div&gt;

&lt;div&gt;What is the simplest matrix with these properties?&lt;/div&gt;

&lt;div&gt;What is the most general matrix you can write down?&lt;/div&gt;

&lt;div&gt;What properties must a vector have to be fixed or crushed by
the three matrices given?&lt;/div&gt;

&lt;br&gt;&lt;/br&gt;

&lt;br&gt;&lt;/br&gt;

&lt;br&gt;&lt;/br&gt;

&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</noteXML>
  <clueXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
This question becomes much more meaningful and straightforward if
you consider the geometrical interpretation of the action of a
matrix on a vector.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
For example, a rotation matrix will leave a line of points
invariant.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
A matrix which crushes a vector is a type of 'projection'. Clearly
a projection must send a non-zero vector to the origin.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-style: italic;&quot;&gt;This problem uses mathematical
concepts found in the later Further Pure Mathematics A
Level modules.&lt;/span&gt;&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</clueXML>
  <canonXML/>
  <end_user_role>2</end_user_role>
  <difficulty>4</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>0</keystage3>
  <keystage4>0</keystage4>
  <keystage4plus>1</keystage4plus>
  <title>Fix me or crush me</title>
  <description>Can you make matrices which will fix one lucky vector and crush
another to zero?</description>
  <spec_group>Vectors
    <specifier>Vectors</specifier>
  </spec_group>
  <spec_group>Advanced Algebra
    <specifier>Matrices</specifier>
  </spec_group>
  <spec_group>Applications
    <specifier>Maths Supporting SET</specifier>
  </spec_group>
  <spec_group>Admin
    <specifier>Individual</specifier>
  </spec_group>
  <spec_group>Secondary Mapping Document
    <specifier>Vectors and Matrices Further</specifier>
  </spec_group>
  <spec_group>Secondary Mapping Document
    <specifier>DisplayCabinet</specifier>
  </spec_group>
</resource>