Plugin installed incorrectly. Rename plugin directory '_include' to 'include'.
Plugin installed incorrectly. Rename plugin directory '__include' to 'include'.
lecture_10_slides
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| lecture_10_slides [2016/02/29 19:02] – [Proposition: solving $AX=B$ when $A$ is invertible] rupert | lecture_10_slides [2017/02/21 10:04] (current) – rupert | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ~~REVEAL~~ | ~~REVEAL~~ | ||
| - | ==== Last time ==== | + | |
| + | ===== Matrix equations ===== | ||
| + | |||
| + | * A linear equation can be written using [[row-column multiplication]]. | ||
| + | * e.g. $ \newcommand{\m}[1]{\left[\begin{smallmatrix}# | ||
| + | * or $ a\vec x=8$ where $a=\m{2& | ||
| + | |||
| + | ==== ==== | ||
| + | * We can write a whole [[system of linear equations]] in a similar way, as a matrix equation using [[matrix multiplication]]. | ||
| + | * e.g. the linear system $\begin{align*} 2x-3y+z& | ||
| + | |||
| + | * is same as $\m{2& | ||
| + | * or $ A\vec x=\vec b$ where $A=\m{2& | ||
| + | |||
| + | ==== ==== | ||
| + | |||
| + | In a similar way, any linear system \begin{align*} a_{11}x_1+a_{12}x_2+\dots+a_{1m}x_m& | ||
| + | can be written in the form | ||
| + | \[ A\vec x=\vec b\] | ||
| + | where $A$ is the $n\times m $ matrix, called the **coefficient matrix** of the linear system, whose $(i,j)$ entry is $a_{ij}$ (the number in front of $x_j$ in the $i$th equation of the system). | ||
| + | |||
| + | ==== Solutions of matrix equations ==== | ||
| + | |||
| + | * More generally, might want to solve a matrix equation like \[AX=B\] where $A$, $X$ and $B$ are matrices of any size, with $A$ and $B$ fixed matrices and $X$ a matrix of unknown variables. | ||
| + | * If $A$ is $n\times m$, we need $B$ to be $n\times k$ for some $k$, and then $X$ must be $m\times k$ | ||
| + | * so we know the size of any solution $X$. | ||
| + | * But which $m\times k$ matrices $X$ are solutions? | ||
| + | |||
| + | ==== Example ==== | ||
| + | |||
| + | If $A=\m{1& | ||
| + | |||
| + | * One solution is $X=0_{2\times 3}$ | ||
| + | * because then we have $AX=A0_{2\times 3}=0_{2\times 3}$. | ||
| + | * This is not the only solution! | ||
| + | * For example, $X=\m{0& | ||
| + | * because then we have $AX=\m{1& | ||
| + | |||
| + | * So a matrix equation can have more than one solution. | ||
| + | |||
| + | ==== Example ==== | ||
| + | |||
| + | * Let $A=\m{2& | ||
| + | * and $B=\m{3& | ||
| + | * Solve $AX=B$ for $X$ | ||
| + | |||
| + | * $X$ must be $2\times 2$ | ||
| + | * $X=\m{x_{11}& | ||
| + | * Do some algebra to solve for $X$ | ||
| + | * ... | ||
| + | * Is there a quicker way? | ||
| + | |||
| + | ==== Example ==== | ||
| + | |||
| + | * Consider $AX=B$, where | ||
| + | * $A=\def\m# | ||
| + | * $B=0_{2\times 3}$, | ||
| + | * i.e. $\m{1& | ||
| + | * then any solution $X$ to $AX=B$ must be $2\times 3$. | ||
| + | * One solution is $X=0_{2\times 3}$ | ||
| + | * Are there any more? | ||
| + | * Yes! e.g. $X=\m{0& | ||
| + | * So a matrix equation can have more than one solution. | ||
| + | |||
| + | ===== Invertibility ====== | ||
| + | |||
| + | ==== Example ==== | ||
| + | |||
| + | * Take $A=\def\mat# | ||
| + | * $\mat{2& | ||
| + | * $X$ must be $2\times 2$ matrix | ||
| + | * One way to solve: write $X=\mat{x_{11}& | ||
| + | * Plug in and do matrix multiplication: | ||
| + | * Get four linear equations: $\begin{align*}2x_{11}+4x_{21}& | ||
| + | * Can solve in the usual way.... | ||
| + | * Tedious! Can we do better? | ||
| + | |||
| + | ==== Simpler: $1\times 1$ matrix equations ==== | ||
| + | |||
| + | * Let $a,b$ be ordinary numbers ($1\times 1$ matrices) with $a\ne0$. How do we solve $ax=b$? | ||
| + | * Answer: multiply both sides by $a^{-1}$ | ||
| + | * (for numbers, $a^{-1}$ is same as $\tfrac1a$) | ||
| + | * Solution: $x=a^{-1}b$. | ||
| + | |||
| + | * Why does this work? | ||
| + | * If $x=\tfrac1a\cdot b$, then $ax=a(\tfrac1a\cdot b)=(a\cdot \tfrac1a)b=1b=b$ | ||
| + | * so $ax$ really is equal to $b$ | ||
| + | * We do have a solution to $ax=b$. | ||
| + | |||
| + | ==== Thinking about $a^{-1}$ for $a$ a number ==== | ||
| + | |||
| + | * What is special about $a^{-1}$ which made this all work? | ||
| + | * Write $c=a^{-1}$ | ||
| + | |||
| + | * $1b=b$, and $a c = 1$ | ||
| + | * so $ x=cb$ has $ax=acb=1b=b$ :-) | ||
| + | |||
| + | ==== What about matrices? ==== | ||
| + | |||
| + | * Can we do something similar for an $n\times n$ matrix $A$? | ||
| + | * i.e. find a matrix $C$ with similar properties? | ||
| + | * Replace $1$ with $I_n$ | ||
| + | * Then $I_nB=B$ | ||
| + | * So if we had a matrix $C$ with $CA=I_n$... | ||
| + | * Then $X=CB$ would have $AX=ACB=I_nB=B$ :-) | ||
| + | * The key property of $C$ is that $AC=I_n$. | ||
| + | * Turns out we also want $CA=I_n$ | ||
| + | |||
| + | ==== Example revisited ==== | ||
| + | * Let $A=\mat{2& | ||
| + | * The matrix $C=\mat{\tfrac12& | ||
| + | * Check this! | ||
| + | * Multiply both sides of $AX=B$ on the left by $C$ and use $CA=I_2$: | ||
| + | * Get $X=CB=\mat{\tfrac12& | ||
| + | * This is quicker than solving lots of equations | ||
| + | * although we don't yet know how to **find** $C$ from $A$ | ||
| + | * Also, if we change $B$ we can easily find solutions to the new equation | ||
| + | |||
| + | ==== Definition: invertible ==== | ||
| + | |||
| + | {{page> | ||
| + | |||
| + | ==== Examples ==== | ||
| + | |||
| + | * $A=\mat{2& | ||
| + | * a $1\times 1$ matrix $A=[a]$ is invertible if and only if $a\ne0$, and if $a\ne0$ then an inverse of $A=[a]$ is $C=[\tfrac1a]$. | ||
| + | * $I_n$ is invertible for any $n$, with inverse $I_n$ | ||
| + | * $0_{n\times n}$ is not invertible for any $n$... why? | ||
| + | * $A=\mat{1& | ||
| + | * $A=\mat{1& | ||
| + | |||
| + | ==== Proposition: | ||
| + | If $A$ is an invertible $n\times n$ matrix, then $A$ has a //unique// inverse. | ||
| + | |||
| + | === Proof === | ||
| + | * $A$ invertible, so $A$ has at least one inverse. | ||
| + | * Suppose it has two inverses, say $C$ and $D$. | ||
| + | * Then $AC=I_n=CA$ and $AD=I_n=DA$. | ||
| + | * So $C=CI_n=C(AD)=(CA)D=I_nD=D$ | ||
| + | * So $C=D$. | ||
| + | * So any two inverses of $A$ are equal. | ||
| + | * So $A$ has a unique inverse.■ | ||
| + | |||
| + | ==== Definition/ | ||
| {{page> | {{page> | ||
| - | | + | ==== Examples again ==== |
| + | |||
| + | | ||
| * i.e. $\mat{2& | * i.e. $\mat{2& | ||
| * if $a$ is a non-zero scalar, then $[a]^{-1}=[\tfrac 1a]$ | * if $a$ is a non-zero scalar, then $[a]^{-1}=[\tfrac 1a]$ | ||
| Line 30: | Line 175: | ||
| * Multiply both sides on the left by $A^{-1}$: | * Multiply both sides on the left by $A^{-1}$: | ||
| * $A^{-1}AX=A^{-1}AY$, | * $A^{-1}AX=A^{-1}AY$, | ||
| - | * So any two solutions are equal.■ | + | * So any two solutions are equal. |
| + | * So $AX=B$ has a unique solution.■ | ||
| ==== Corollary ==== | ==== Corollary ==== | ||
| Line 52: | Line 198: | ||
| * So $A$ is not invertible, by the Corollary. | * So $A$ is not invertible, by the Corollary. | ||
| - | ==== Example ==== | + | |
| - | + | ||
| - | | + | |
| - | * $X=\mat{1\\1\\-1}$ is non-zero | + | |
| - | * and $AX=0_{3\times 1}$. | + | |
| - | ===== $2\times 2$ matrices: determinants and invertibility ===== | + | |
| - | + | ||
| - | ==== Question ==== | + | |
| - | + | ||
| - | Which $2\times 2$ matrices are invertible? For the invertible matrices, can we find their inverse? | + | |
| - | + | ||
| - | + | ||
| - | ==== Lemma ==== | + | |
| - | + | ||
| - | If $A=\mat{a& | + | |
| - | \[ AJ=\delta I_2=JA\] | + | |
| - | where $\delta=ad-bc$. | + | |
| - | + | ||
| - | * Proof is a calculation! | + | |
| - | + | ||
| - | ==== Definition: the determinant of a $2\times 2$ matrix ==== | + | |
| - | + | ||
| - | {{page> | + | |
| - | + | ||
| - | ==== Theorem: the determinant determines the invertibility (and inverse) of a $2\times 2$ matrix ==== | + | |
| - | + | ||
| - | Let $A=\mat{a& | + | |
| - | + | ||
| - | - $A$ is invertible | + | |
| - | - If $A$ is invertible, then $A^{-1}=\frac{1}{\det(A)}\mat{d& | + | |
| - | + | ||
| - | ==== Proof ==== | + | |
| - | + | ||
| - | | + | |
| - | | + | |
| - | | + | |
| - | | + | |
| - | * So $ AB=I_2=BA$, so $A$ invertible with inverse $B=\frac1{\det(A)}J=\frac1{\det(A)}\mat{d& | + | |
| - | + | ||
| - | * If $\det(A)=0$, | + | |
| - | * Hence by the previous corollary, $A$ is not invertible in this case. ■ | + | |
lecture_10_slides.1456772570.txt.gz · Last modified: by rupert
