Plugin installed incorrectly. Rename plugin directory '_include' to 'include'.
Plugin installed incorrectly. Rename plugin directory '__include' to 'include'.
lecture_14
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| lecture_14 [2016/03/10 11:36] – rupert | lecture_14 [2017/03/09 10:49] (current) – [Corollary on invertibility] rupert | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | === Example === | ||
| + | |||
| + | \begin{align*}\def\mat# | ||
| + | &= 1 \cdot (+M_{11}) + 2 \cdot (-M_{12}) + 3 \cdot(+M_{13})\\ | ||
| + | &= M_{11}-2M_{12}+3M_{13}\\ | ||
| + | &= \det\mat{8& | ||
| + | &= (8\cdot 13-9\cdot 12) -2(7\cdot 13-9\cdot 11)+3(7\cdot 12-8\cdot 11)\\ | ||
| + | &=-4 -2(-8)+3(-4)\\ | ||
| + | & | ||
| + | & | ||
| + | |||
| + | From this, we can conclude that $\mat{1& | ||
| + | |||
| === Notation === | === Notation === | ||
| Line 77: | Line 90: | ||
| - If $B$ is another $n\times n$ matrix, then $\det(AB)=\det(A)\det(B)$ | - If $B$ is another $n\times n$ matrix, then $\det(AB)=\det(A)\det(B)$ | ||
| - | ==== Theorem: row/column operations and determinants | + | ==== Corollary on invertibility |
| - | Let $A$ be an $n\times n$ matrix, let $c$ be a scalar | + | - $A^T$ is invertible if and only if $A$ is invertible |
| + | - $AB$ is invertible if and only if **both** $A$ and $B$ are invertible | ||
| - | $A_{Ri\to x}$ means $A$ but with row $i$ replaced by $x$. | + | === Proof === |
| - | + | ||
| - | - If $i\ne j$, then $\det(A_{Ri\leftrightarrow Rj})=-\det(A)$ (swapping two rows changes the sign of det). | + | |
| - | - $\det(A_{Ri\to c Ri}) = c\det(A)$ (scaling one row scales $\det(A)$ in the same way) | + | |
| - | - $\det(A_{Ri\to Ri + c Rj}) = \det(A)$ (adding a multiple of one row to another row doesn' | + | |
| - | + | ||
| - | * Also, these properties all hold if you change " | + | |
| + | - We have $\det(A^T)=\det(A)$. So $A^T$ is invertible $\iff$ $\det(A^T)\ne0$ $\iff$ $\det(A)\ne 0$ $\iff$ $A$ is invertible. | ||
| + | - We have $\det(AB)=\det(A)\det(B)$. So $AB$ is invertible $\iff$ $\det(AB)\ne 0$ $\iff$ $\det(A)\det(B)\ne0$ $\iff$ $\det(A)\ne0$ and $\det(B)\ne 0$ $ \iff$ $A$ is invertible and $B$ is invertible. ■ | ||
lecture_14.1457609794.txt.gz · Last modified: by rupert
