|
142 | 142 | "source": [ |
143 | 143 | "If we keep in mind that there can be at most one pivot per column and one pivot per row, we can make a further statement about these properties based on the relative size of $m$ and $n$. If $T:\\mathbb{R}^n\\to\\mathbb{R}^m$, then $T$ cannot be onto $\\mathbb{R}^m$ if $m>n$, and cannot be one-to-one if $m<n$. Only when $m=n$ is it *possible* for $T$ to be invertible.\n", |
144 | 144 | "\n", |
145 | | - "Let's look at our examples. In **Example 1**, the matrix $[T]$ is $4\\times 2$. We know the matrix can have at most two pivots (at most one per column), so cannot have a pivot in each row. To see if there is are indeed pivots in each column, we can compute the RREF." |
| 145 | + "Let's look at our examples. In **Example 1**, the matrix $[T]$ is $4\\times 2$. We know the matrix can have at most two pivots (at most one per column), so it cannot have a pivot in each row. To see if there are pivots in each column, we can compute the RREF." |
146 | 146 | ] |
147 | 147 | }, |
148 | 148 | { |
|
154 | 154 | "name": "stdout", |
155 | 155 | "output_type": "stream", |
156 | 156 | "text": [ |
157 | | - "[[1 0]\n", |
158 | | - " [0 1]\n", |
159 | | - " [0 0]\n", |
160 | | - " [0 0]]\n" |
| 157 | + "[[1. 0.]\n", |
| 158 | + " [0. 1.]\n", |
| 159 | + " [0. 0.]\n", |
| 160 | + " [0. 0.]]\n" |
161 | 161 | ] |
162 | 162 | } |
163 | 163 | ], |
|
279 | 279 | "source": [ |
280 | 280 | "## Code solution here." |
281 | 281 | ] |
| 282 | + }, |
| 283 | + { |
| 284 | + "cell_type": "markdown", |
| 285 | + "metadata": {}, |
| 286 | + "source": [ |
| 287 | + "**Exercise 3:** $L:\\mathbb{R}^3\\to\\mathbb{R}^2$ is a **Linear Transformation**. Find $L(X)$ given the following vectors.\n", |
| 288 | + "\n", |
| 289 | + "\n", |
| 290 | + "$$\n", |
| 291 | + "\\begin{equation}\n", |
| 292 | + "L\\left(\\left[\\begin{array}{r} 1\\\\0\\\\0 \\end{array}\\right]\\right)= \\left[\\begin{array}{r} 2\\\\0 \\end{array}\\right] \\hspace{1cm} \n", |
| 293 | + "L\\left(\\left[\\begin{array}{r} 0\\\\1\\\\0 \\end{array}\\right]\\right)= \\left[\\begin{array}{r} 1\\\\3 \\end{array}\\right] \\hspace{1cm} \n", |
| 294 | + "L\\left(\\left[\\begin{array}{r} 0\\\\0\\\\1 \\end{array}\\right]\\right)= \\left[\\begin{array}{r} 1\\\\2 \\end{array}\\right] \\hspace{1cm}\n", |
| 295 | + "X = \\left[\\begin{array}{r} 4\\\\5\\\\3 \\end{array}\\right]\n", |
| 296 | + "\\end{equation}\n", |
| 297 | + "$$\n", |
| 298 | + "\n" |
| 299 | + ] |
| 300 | + }, |
| 301 | + { |
| 302 | + "cell_type": "code", |
| 303 | + "execution_count": null, |
| 304 | + "metadata": {}, |
| 305 | + "outputs": [], |
| 306 | + "source": [ |
| 307 | + "## Code solution here" |
| 308 | + ] |
| 309 | + }, |
| 310 | + { |
| 311 | + "cell_type": "markdown", |
| 312 | + "metadata": {}, |
| 313 | + "source": [ |
| 314 | + "**Exercise 4:** The standard matrix representation of a **linear transformation** $S$ is given below. Determine the input and output space of $S$ by looking at the dimensions of $\\left[S\\right]$. Determine whether $S$ is an invertible transformation.\n", |
| 315 | + "\n", |
| 316 | + "\n", |
| 317 | + "$$\n", |
| 318 | + "\\begin{equation}\n", |
| 319 | + "\\left[S\\right] =\\left[\\begin{array}{rr} 2 & 0 & 3 & 8\\\\ 0 & 1 & 9 & 4 \\end{array}\\right] \n", |
| 320 | + "\\end{equation}\n", |
| 321 | + "$$" |
| 322 | + ] |
| 323 | + }, |
| 324 | + { |
| 325 | + "cell_type": "code", |
| 326 | + "execution_count": null, |
| 327 | + "metadata": {}, |
| 328 | + "outputs": [], |
| 329 | + "source": [ |
| 330 | + "## Code solution here" |
| 331 | + ] |
| 332 | + }, |
| 333 | + { |
| 334 | + "cell_type": "markdown", |
| 335 | + "metadata": {}, |
| 336 | + "source": [ |
| 337 | + "**Exercise 5:** The **linear transformation** $W:\\mathbb{R}^3\\to\\mathbb{R}^3$ is an invertible transformation. Find $X$.\n", |
| 338 | + "\n", |
| 339 | + "\n", |
| 340 | + "$$\n", |
| 341 | + "\\begin{equation}\n", |
| 342 | + "\\left[W\\right] =\\left[\\begin{array}{rr} 1 & 1 & 0\\\\ 1 & 2 & 2 \\\\ 2 & 1 & 3 \\end{array}\\right] \\hspace{1cm}\n", |
| 343 | + "W(X) = \\left[\\begin{array}{r} 3 \\\\ 11 \\\\ 13 \\end{array}\\right]\n", |
| 344 | + "\\end{equation}\n", |
| 345 | + "$$" |
| 346 | + ] |
| 347 | + }, |
| 348 | + { |
| 349 | + "cell_type": "code", |
| 350 | + "execution_count": null, |
| 351 | + "metadata": {}, |
| 352 | + "outputs": [], |
| 353 | + "source": [ |
| 354 | + "## Code solution here" |
| 355 | + ] |
| 356 | + }, |
| 357 | + { |
| 358 | + "cell_type": "markdown", |
| 359 | + "metadata": {}, |
| 360 | + "source": [ |
| 361 | + "**Exercise 6:** Let $T:\\mathbb{R}^3\\to\\mathbb{R}^3$ be a **linear transformation**. Given that there are two vectors in $\\mathbb{R}^3$ which get mapped to the same vector in $\\mathbb{R}^3$, what can you say about the number of solutions for $[T]X=B$? Explain why $T$ is not an invertible transformation." |
| 362 | + ] |
282 | 363 | } |
283 | 364 | ], |
284 | 365 | "metadata": { |
|
0 commit comments