|
49 | 49 | So far, when working with the Euclidean vector space <m>\IR^n</m>, we have primarily worked with the standard basis <m>\mathcal{E}=\setList{\vec{e}_1,\dots, \vec{e}_n}</m>. |
50 | 50 | We can explore alternative perspectives more easily if we expand our toolkit to analyze different bases. |
51 | 51 | </p> |
| 52 | + <figure xml:id="MX3-fig-doenet-change-basis"> |
| 53 | + <caption>Visualization of the change of basis in <m>\mathbb R^2</m></caption> |
| 54 | + <interactive label="MX3-interactive-doenet-change-basis" platform="doenetml" width="100%"> |
| 55 | + <slate surface="doenetml"> |
| 56 | + <xi:include parse="text" href="doenet/MX3-doenet-change-basis.xml"/> |
| 57 | + </slate> |
| 58 | + <description> |
| 59 | + <p>An interactive that visualizes the change of basis from the standard basis to a custom basis in the plane.</p> |
| 60 | + </description> |
| 61 | + </interactive> |
| 62 | + </figure> |
52 | 63 | </remark> |
53 | 64 | <activity> |
54 | 65 | <introduction> |
55 | 66 | <p> |
56 | | - Let <m>\mathcal{B}=\setList{\vec{v}_1,\vec{v}_2,\vec{v}_3}=\setList{\begin{bmatrix}1\\0\\1\end{bmatrix},\begin{bmatrix}1\\-1\\1\end{bmatrix},\begin{bmatrix}0\\1\\1\end{bmatrix}}</m>. |
| 67 | + Consider the non-standard basis <md>\mathcal{B}=\setList{\vec{b}_1,\vec{b}_2,\vec{b}_3}=\setList{\begin{bmatrix}1\\0\\1\end{bmatrix},\begin{bmatrix}1\\-1\\1\end{bmatrix},\begin{bmatrix}0\\1\\1\end{bmatrix}}</md> for <m>\mathbb R^3</m>. |
57 | 68 | </p> |
58 | | - </introduction> |
| 69 | + </introduction> |
59 | 70 | <task> |
| 71 | + <statement> |
60 | 72 | <p> |
61 | | - Is <m>\cal{B}</m> a basis of <m>\IR^3</m>? |
62 | | - </p> |
63 | | - <p> |
64 | | - <ol marker="A."> |
65 | | - <li> |
66 | | - <p> |
67 | | - Yes. |
68 | | - </p> |
69 | | - </li> |
70 | | - <li> |
71 | | - <p> |
72 | | - No. |
73 | | - </p> |
74 | | - </li> |
| 73 | + Since <m>\mathcal{B}</m> is a basis, how many ways can we write some |
| 74 | + arbitrary <m>\vec v\in \IR^3</m> in terms of <m>\mathcal B</m> vectors? |
| 75 | + <md> |
| 76 | + \vec v= x_1\vec{b}_1+x_2\vec{b}_2+x_3\vec{b}_3= |
| 77 | + x_1\begin{bmatrix}1\\0\\1\end{bmatrix}+ |
| 78 | + x_2\begin{bmatrix}1\\-1\\1\end{bmatrix}+ |
| 79 | + x_3\begin{bmatrix}0\\1\\1\end{bmatrix} |
| 80 | + </md> |
| 81 | + <ol label="A." cols="3"> |
| 82 | + <li><p>Zero</p></li> |
| 83 | + <li><p>At most one</p></li> |
| 84 | + <li><p>Exactly one</p></li> |
| 85 | + <li><p>At least one</p></li> |
| 86 | + <li><p>Infinitely-many</p></li> |
75 | 87 | </ol> |
76 | 88 | </p> |
| 89 | + </statement> |
| 90 | + <answer> |
| 91 | + <p> |
| 92 | + C. |
| 93 | + </p> |
| 94 | + <p> |
| 95 | + Exactly one |
| 96 | + </p> |
| 97 | + </answer> |
77 | 98 | </task> |
78 | 99 | <task> |
79 | | - <p> |
80 | | - Since <m>\cal{B}</m> is a basis, we know that if <m>\vec{v}\in \IR^3</m>, the following vector equation will have a unique solution: |
81 | | - <me>x_1\vec{v}_1+x_2\vec{v}_2+x_3\vec{v}_3=\vec{v}</me> |
82 | | - Given this, we define a map <m>C_{\mathcal{B}}\colon\IR^3\to\IR^3</m> via the rule that <m>C_{\mathcal{B}}(\vec{v})</m> is equal to the unique solution to the above vector equation. |
83 | | - The map <m>C_{\mathcal{B}}</m> is a linear map. |
84 | | - </p> |
85 | | - <p> |
86 | | - Compute <m>C_{\mathcal{B}}\left(\begin{bmatrix}1\\1\\1\end{bmatrix}\right)</m>, the unique solution to |
87 | | - <me> |
88 | | - x_1\vec{v}_1+x_2\vec{v}_2+x_3\vec{v}_3=\begin{bmatrix}1\\1\\1\end{bmatrix}. |
89 | | - </me> |
90 | | - |
91 | | - </p> |
| 100 | + <statement> |
| 101 | + <p> |
| 102 | + If <m>\vec x=\left[\begin{array}{c}x_1\\x_2\\x_3\end{array}\right]</m> |
| 103 | + and <m>B = \left[\begin{array}{ccc}\vec b_1& \vec b_2&\vec b_3\end{array}\right]=\left[\begin{array}{ccc}1&1&0\\0&-1&1\\1&1&1\end{array}\right]</m>, |
| 104 | + which of these matrix equations can be used to find <m>x_1,x_2,x_3</m>? |
| 105 | + <ol label="A." cols="3"> |
| 106 | + <li><p><m>\vec v=B\vec x</m></p></li> |
| 107 | + <li><p><m>B\vec v=\vec x</m></p></li> |
| 108 | + <li><p><m>\vec v=B^{-1}\vec x</m></p></li> |
| 109 | + <li><p><m>B^{-1}\vec v=\vec x</m></p></li> |
| 110 | + <li><p>A or D</p></li> |
| 111 | + <li><p>B or C</p></li> |
| 112 | + </ol> |
| 113 | + </p> |
| 114 | + </statement> |
| 115 | + <answer> |
| 116 | + <p> |
| 117 | + E. |
| 118 | + </p> |
| 119 | + <p> |
| 120 | + <m>B\vec v=\vec x</m> can be rewritten as <m>\vec v=B^{-1}\vec x</m> |
| 121 | + </p> |
| 122 | + </answer> |
92 | 123 | </task> |
93 | 124 | <task> |
94 | | - <p> |
95 | | - Compute <m>C_\mathcal{B}(\vec{e}_1),C_\mathcal{B}(\vec{e}_2), C_\mathcal{B}(\vec{e}_3)</m> and, in doing so, write down the standard matrix <m>M_\mathcal{B}</m> of <m>C_\mathcal{B}</m>. |
96 | | - </p> |
97 | | - <sage language="octave"> |
98 | | - <input> |
99 | | - |
100 | | - </input> |
101 | | - <output> |
102 | | - |
103 | | - </output> |
104 | | - </sage> |
| 125 | + <statement> |
| 126 | + <p> |
| 127 | + Let <m>\vec v=\begin{bmatrix}1\\2\\3\end{bmatrix}</m> and |
| 128 | + use this equation to find |
| 129 | + <md>x_1=\unknown,x_2=\unknown,x_3=\unknown</md>. |
| 130 | + </p> |
| 131 | + </statement> |
| 132 | + <answer> |
| 133 | + <p> |
| 134 | + <m>x_1=1,x_2=0,x_3=2</m> so |
| 135 | + <md>\begin{bmatrix}1\\2\\3\end{bmatrix}= |
| 136 | + 1\begin{bmatrix}1\\0\\1\end{bmatrix}+ |
| 137 | + 0\begin{bmatrix}1\\-1\\1\end{bmatrix}+ |
| 138 | + 2\begin{bmatrix}0\\1\\1\end{bmatrix}</md> |
| 139 | + </p> |
| 140 | + </answer> |
105 | 141 | </task> |
106 | | - |
107 | 142 | </activity> |
108 | 143 |
|
109 | 144 | <definition xml:id="def-change-of-basis"> |
110 | 145 | <statement> |
111 | 146 | <p> |
112 | | - Given a basis <m>\cal{B}=\setList{\vec{v}_1,\dots, \vec{v}_n}</m> of <m>\IR^n</m>, the <term>change of basis/coordinate</term> transformation <em>from</em> the standard basis <em>to</em> <m>\mathcal{B}</m> is the transformation <m>C_\mathcal{B}\colon\IR^n\to\IR^n</m> defined by the property that, for any vector <m>\vec{v}\in\IR^n</m>, the vector <m>C_\mathcal{B}(\vec{v})</m> is the unique solution to the vector equation: |
113 | | - <me>x_1\vec{v}_1+\dots+x_n\vec{v}_n=\vec{v}.</me> |
114 | | - Its standard matrix is called the change-of-basis matrix from the standard basis to <m>\mathcal{B}</m> and is denoted by <m>M_{\mathcal{B}}</m>. |
115 | | - It satisfies the following: |
116 | | - <me>M_{\mathcal{B}}=[\vec{v}_1\ \cdots\ \vec{v}_n]^{-1}.</me> |
| 147 | + Given a basis <m>\mathcal{B}=\setList{\vec{b}_1,\dots, \vec{b}_n}</m> of <m>\IR^n</m> and corresponding matrix <m>B=\begin{bmatrix}\vec b_1&\cdots&\vec b_n\end{bmatrix}</m>, the <term>change of basis/coordinate</term> transformation <em>from</em> the standard basis <em>to</em> <m>\mathcal{B}</m> is the transformation <m>C_\mathcal{B}\colon\IR^n\to\IR^n</m> defined by the property that, for any vector <m>\vec{v}\in\IR^n</m>, the vector <m>C_\mathcal{B}(\vec{v})</m> describes the unique way to write |
| 148 | + <m>\vec v</m> in terms of the basis, that is, |
| 149 | + the unique solution to the vector equation: |
| 150 | + <md>\vec v=x_1\vec{b}_1+\dots+x_n\vec{b}_n</md>. |
| 151 | + </p> |
| 152 | + <p> |
| 153 | + Since the solution vector |
| 154 | + <m>C_{\mathcal B}(\vec v)=\begin{bmatrix}x_1\\\vdots\\x_n\end{bmatrix}</m> |
| 155 | + describes the <q><m>\mathcal B</m>-coordinates</q> of <m>\vec v</m>, |
| 156 | + we will write |
| 157 | + <md>\vec v=x_1\vec{b}_1+\dots+x_n\vec{b}_n= |
| 158 | + B\begin{bmatrix}x_1\\\vdots\\x_n\end{bmatrix}= |
| 159 | + \begin{bmatrix}x_1\\\vdots\\x_n\end{bmatrix}_{\mathcal B}</md> |
117 | 160 | </p> |
118 | 161 | </statement> |
119 | 162 | </definition> |
120 | 163 |
|
121 | 164 | <remark> |
122 | 165 | <p> |
123 | | - The vector <m>C_\mathcal{B}(\vec{v})</m> is the <m>\mathcal{B}</m>-coordinates of <m>\vec{v}</m>. |
124 | | - If you work with standard coordinates, and I work with <m>\mathcal{B}</m>-coordinates, then to build the vector that you call <m>\vec{v}=\begin{bmatrix}a_1\\\vdots\\a_n\end{bmatrix}=a_1\vec{e}_1+\cdots+a_n\vec{e}_n</m>, I would first compute <m>C_\mathcal{B}(\vec{v})=\begin{bmatrix}x_1\\\vdots\\x_n\end{bmatrix}</m> and then build <m>\vec{v}=x_1\vec{v}_1+\cdots+x_n\vec{v}_n</m>. |
| 166 | + As was just shown, the standard matrix <m>M_{\mathcal B}</m> for this |
| 167 | + transformation is exactly the inverse matrix <m>B^{-1}</m>. |
125 | 168 | </p> |
126 | 169 | <p> |
127 | | - In particular, notation as above, we would have: |
128 | | - <me>a_1\vec{e}_1+\cdots a_n\vec{e}_n=\vec{v}=x_1\vec{v}_1+\cdots+x_n\vec{v}_n.</me> |
| 170 | + The vector <m>C_\mathcal{B}(\vec{v})</m> describes the |
| 171 | + <q><m>\mathcal{B}</m>-coordinates</q> of <m>\vec{v}</m>. |
| 172 | + If you work with standard coordinates, and I work with |
| 173 | + <m>\mathcal{B}</m>-coordinates, then you might write |
| 174 | + <md>\vec{v}=a_1\vec{e}_1+\cdots+a_n\vec{e}_n=\begin{bmatrix}a_1\\\vdots\\a_n\end{bmatrix}</md> |
| 175 | + and I might instead write |
| 176 | + <md>\vec{v}=x_1\vec{b}_1+\cdots+x_n\vec{b}_n=\begin{bmatrix}x_1\\\vdots\\x_n\end{bmatrix}_{\mathcal B}=B\begin{bmatrix}x_1\\\vdots\\x_n\end{bmatrix}</md> |
| 177 | + </p> |
| 178 | + <p> |
| 179 | + To convert from your standard coordinates to my <m>\mathcal B</m>-coordinates, |
| 180 | + we need simply compute: |
| 181 | + <md>\begin{bmatrix}x_1\\\vdots\\x_n\end{bmatrix}= |
| 182 | + C_{\mathcal B}\left(\begin{bmatrix}a_1\\\vdots\\a_n\end{bmatrix}\right)= |
| 183 | + M_{\mathcal B}\begin{bmatrix}a_1\\\vdots\\a_n\end{bmatrix}= |
| 184 | + B^{-1}\begin{bmatrix}a_1\\\vdots\\a_n\end{bmatrix}</md>. |
| 185 | + </p> |
| 186 | + <p> |
| 187 | + And similarly we can convert backwards: |
| 188 | + <md>\begin{bmatrix}a_1\\\vdots\\a_n\end{bmatrix}= |
| 189 | + C_{\mathcal B}^{-1}\left(\begin{bmatrix}x_1\\\vdots\\x_n\end{bmatrix}\right)= |
| 190 | + M_{\mathcal B}^{-1}\begin{bmatrix}x_1\\\vdots\\x_n\end{bmatrix}= |
| 191 | + B\begin{bmatrix}x_1\\\vdots\\x_n\end{bmatrix}</md>. |
129 | 192 | </p> |
130 | 193 | </remark> |
131 | 194 |
|
132 | 195 |
|
133 | 196 | <activity> |
134 | 197 | <introduction> |
135 | 198 | <p> |
136 | | - Let <m>\vec{v}_1=\begin{bmatrix}1\\-2\\1\end{bmatrix},\ \vec{v}_2=\begin{bmatrix}-1\\0\\3\end{bmatrix},\ \vec{v}_3=\begin{bmatrix}0\\1\\-1\end{bmatrix}</m>, and <m>\mathcal{B}=\setList{\vec{v}_1,\vec{v}_2,\vec{v}_3}</m> |
| 199 | + Let <m>\vec{b}_1=\begin{bmatrix}-1\\1\\2\end{bmatrix},\ \vec{b}_2=\begin{bmatrix}0\\-1\\-5\end{bmatrix},\ \vec{b}_3=\begin{bmatrix}-4\\2\\-1\end{bmatrix}</m>, and <m>\mathcal{B}=\setList{\vec{b}_1,\vec{b}_2,\vec{b}_3}</m> |
137 | 200 | </p> |
138 | 201 | </introduction> |
139 | 202 | <task> |
140 | 203 | <p> |
141 | | - Calculate <m>M_{\mathcal{B}}</m> using technology. |
| 204 | + Calculate <m>M_{\mathcal{B}}=B^{-1}</m> using technology. |
142 | 205 | </p> |
143 | 206 | <sage language="octave"> |
144 | 207 | <input> |
|
151 | 214 | </task> |
152 | 215 | <task> |
153 | 216 | <p> |
154 | | - Use your result to calculate <m>C_\mathcal{B}\left(\begin{bmatrix}1\\1\\1\end{bmatrix}\right)</m> and express the vector <m>\begin{bmatrix}1\\1\\1\end{bmatrix}</m> as a linear combination of <m>\vec{v}_1,\vec{v}_2,\vec{v}_3</m>. |
| 217 | + Use this matrix to write |
| 218 | + <md>\begin{bmatrix}-1\\0\\3\end{bmatrix}=\begin{bmatrix}\unknown\\\unknown\\\unknown\end{bmatrix}_{\mathcal B}=\unknown\vec b_1+\unknown\vec b_2+\unknown\vec b_3</md> |
| 219 | + as a linear combination of <m>\vec{b}_1,\vec{b}_2,\vec{b}_3</m>. |
155 | 220 | </p> |
156 | 221 | </task> |
157 | 222 | </activity> |
| 223 | + |
| 224 | +<activity> |
| 225 | + <introduction> |
| 226 | + <p> |
| 227 | + While defining linear transformations in terms of their standard |
| 228 | + matrix <m>A</m> is convenient when working with standard coordinates, it |
| 229 | + would be helpful to be able to apply transformations directly to |
| 230 | + non-standard bases/coordinates as well. |
| 231 | + </p> |
| 232 | + <p> |
| 233 | +Let <m>\mathcal B=\setList{\vec b_1,\cdots\vec b_n}</m> be a basis, and consider the matrix |
| 234 | +<m>B=\begin{bmatrix}\vec b_1&\cdots&\vec b_n\end{bmatrix}</m> |
| 235 | +<m>M_{\mathcal B}=B^{-1}</m>. |
| 236 | + </p> |
| 237 | + </introduction> |
| 238 | + <task> |
| 239 | + <statement> |
| 240 | + <p> |
| 241 | +Given <m>\vec v</m> representing <m>\mathcal B</m>-coordinates, which of these |
| 242 | +expressions would correctly compute the transformation of <m>\vec v</m> by a |
| 243 | +<em>standard</em> matrix <m>A</m> with output in <em>standard</em> coordinates? |
| 244 | + <ol marker="A."> |
| 245 | + <li><p><m>AB^{-1}\vec v=AM_{\mathcal B}\vec v</m></p></li> |
| 246 | + <li><p><m>AB\vec v=AM_{\mathcal B}^{-1}\vec v</m></p></li> |
| 247 | + <li><p><m>B^{-1}A\vec v=M_{\mathcal B}A\vec v</m></p></li> |
| 248 | + <li><p><m>BA\vec v=M_{\mathcal B}^{-1}A\vec v</m></p></li> |
| 249 | + </ol> |
| 250 | + </p> |
| 251 | + </statement> |
| 252 | + <answer> |
| 253 | + <p> |
| 254 | + B. |
| 255 | + </p> |
| 256 | + <p> |
| 257 | + Since <m>\vec v</m> represents <m>\mathcal B</m>-coordinates, |
| 258 | + the vector <m>B\vec v=M_{\mathcal B}^{-1}\vec v</m> represents |
| 259 | + its standard coordinates. |
| 260 | + </p> |
| 261 | + </answer> |
| 262 | + </task> |
| 263 | + <task> |
| 264 | + <statement> |
| 265 | + <p> |
| 266 | +Therefore, which matrix would directly calculate the transformation of |
| 267 | +vectors by a linear map with standard matrix <m>A</m>, |
| 268 | +but where inputs and outputs are all given in <m>\mathcal B</m>-coordinates? |
| 269 | + <ol marker="A."> |
| 270 | + <li><p><m>B^{-1}AB=M_{\mathcal B}AM_{\mathcal B}^{-1}</m></p></li> |
| 271 | + <li><p><m>BAB^{-1}=M_{\mathcal B}^{-1}AM_{\mathcal B}</m></p></li> |
| 272 | + <li><p><m>AB^{-1}B=AM_{\mathcal B}M_{\mathcal B}^{-1}</m></p></li> |
| 273 | + <li><p><m>ABB^{-1}=AM_{\mathcal B}^{-1}M_{\mathcal B}</m></p></li> |
| 274 | + </ol> |
| 275 | + </p> |
| 276 | + </statement> |
| 277 | + <answer> |
| 278 | + <p> |
| 279 | + A. |
| 280 | + </p> |
| 281 | + <p> |
| 282 | + We saw <m>AB</m> transforms <m>\mathcal B</m>-coordinates by the |
| 283 | + transformation, but outputs standard coordinates. Applying |
| 284 | + <m>B^{-1}=M_{\mathcal B}</m> on the left corrects the outputs to be |
| 285 | + in <m>\mathcal B</m>-coordinates. |
| 286 | + </p> |
| 287 | + </answer> |
| 288 | + </task> |
| 289 | +</activity> |
| 290 | + |
158 | 291 | <observation> |
159 | 292 | <p> |
160 | 293 | Let <m>T\colon\IR^n\to\IR^n</m> be a linear transformation and let <m>A</m> denote its standard matrix. |
161 | | - If <m>\cal{B}=\setList{\vec{v}_1,\dots, \vec{v}_n}</m> is some other basis, then we have: |
162 | | - <md> |
163 | | - <mrow>M_\mathcal{B}AM_{\mathcal{B}}^{-1} \amp= M_\mathcal{B}A[\vec{v_1}\cdots\vec{v}_n] </mrow> |
164 | | - <mrow> \amp= M_\mathcal{B}[T(\vec{v}_1)\cdots T(\vec{v}_n)]</mrow> |
165 | | - <mrow> \amp= [C_\mathcal{B}(T(\vec{v}_1))\cdots C_\mathcal{B}(T(\vec{v}_n))]</mrow> |
166 | | - </md> |
167 | | - In other words, the matrix <m>M_{\mathcal{B}}AM_{\mathcal{B}}^{-1}</m> is the matrix whose columns consist of <em><m>\mathcal{B}</m>-coordinate</em> vectors of the image vectors <m>T(\vec{v}_i)</m>. |
168 | | - The matrix <m>M_{\mathcal{B}}AM_{\mathcal{B}}^{-1}</m> is called the <alert>matrix of <m>T</m> with respect to <m>\mathcal{B}</m>-coordinates</alert>. |
| 294 | + If <m>\mathcal{B}=\setList{\vec{b}_1,\dots, \vec{v}_n}</m> is some other basis |
| 295 | + and <m>B=\begin{bmatrix}\vec b_1&\cdots&\vec b_n\end{bmatrix}</m>, |
| 296 | + then <m>M_{\mathcal B}AM_{\mathcal B}^{-1}=B^{-1}AB</m> is the |
| 297 | + <term><m>\mathcal B</m>-coordinate matrix</term> for <m>T</m>, |
| 298 | + which applies the transformation <m>T</m> where inputs and outputs are |
| 299 | + all given in <m>\mathcal B</m>-coordinates. |
169 | 300 | </p> |
170 | 301 | </observation> |
171 | 302 |
|
172 | 303 | <activity> |
173 | 304 | <introduction> |
174 | 305 | <p> |
175 | | - Let <m>\mathcal{B}=\setList{\vec{v}_1,\vec{v}_2,\vec{v}_3}=\setList{\begin{bmatrix}1\\-2\\1\end{bmatrix},\begin{bmatrix}-1\\0\\3\end{bmatrix},\begin{bmatrix}0\\1\\-1\end{bmatrix}}</m> be basis from the previous Activity. |
| 306 | + Let <m>\mathcal{B}=\setList{\vec{b}_1,\vec{b}_2,\vec{b}_3}=\setList{\begin{bmatrix}1\\-2\\1\end{bmatrix},\begin{bmatrix}-1\\0\\3\end{bmatrix},\begin{bmatrix}0\\1\\-1\end{bmatrix}}</m> be basis from the previous Activity. |
176 | 307 | Let <m>T</m> denote the linear transformation whose standard matrix is given by: |
177 | 308 | <me>A=\begin{bmatrix}9&4&4\\6&9&2\\-18&-16&-9\end{bmatrix}.</me> |
178 | 309 | </p> |
|
0 commit comments