Plugin installed incorrectly. Rename plugin directory '_include' to 'include'.
Plugin installed incorrectly. Rename plugin directory '__include' to 'include'.
lecture_13
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| lecture_13 [2015/03/26 10:33] – [The transpose of a matrix] rupert | lecture_13 [2017/03/07 15:08] (current) – [Step 3: the determinant of a $3\times 3$ matrix using Laplace expansion along the first row] rupert | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ==== Corollary | + | ==== Example |
| - | If $A$ is an $n\times n$ matrix and $X$ is an $n\times k$ matrix with $X\ne 0_{n\times k}$ and $AX=0_{n\times k}$, then $A$ is not invertible. | + | |
| - | === Proof === | + | Let's solve the matrix |
| - | Apply the previous corollary (from the end of lecture 11) to $X$ and to the matrix $Y=0_{n\times k}$: we have $X\ne Y$ but $AY=A0_{n\times k}=0_{n\times k}$, so $AX=AY$. ■ | + | |
| - | ==== Example ==== | + | Write $A=\mat{1& |
| - | The matrix $\newcommand{\mat}[1]{\begin{bmatrix}# | ||
| - | ===== $2\times 2$ matrices: determinants and invertibility ===== | + | Hence the solution is $X=A^{-1}\mat{4& |
| - | ==== Question ==== | ||
| - | Which $2\times 2$ matrices are invertible? For the invertible matrices, can we find their inverse? | + | ====== The transpose of a matrix ====== |
| - | ==== Lemma ==== | + | We defined this in tutorial sheet 4: |
| - | If $A=\mat{a& | + | {{page> |
| - | \[ AJ=\delta I_2=JA\] | + | ==== Exercise: simple properties of the transpose ==== |
| - | where $\delta=ad-bc$. | + | Prove that for any matrix |
| - | === Proof === | + | * $(A^T)^T=A$; and |
| + | * $(A+B)^T=A^T+B^T$ if $A$ and $B$ are matrices of the [[same size]]; and | ||
| + | * $(cA)^T=c(A^T)$ for any [[scalar]] $c$. | ||
| + | |||
| + | In tutorial sheet 4, we proved: | ||
| - | This is a calculation (done in the lectures; you should also check it yourself). ■ | + | ==== Lemma: transposes and row-column multiplication ==== |
| - | ==== Definition: the determinant of a $2\times | + | If $a$ is a $1\times |
| + | \[ ab=b^Ta^T.\] | ||
| - | {{page> | + | ==== Observation: |
| - | ==== Theorem: the determinant determines the invertibility | + | Formally, for any matrix $A$ and any $i,j$, we have |
| + | \begin{align*}\def\col# | ||
| + | \row i(A^T)&=\col i(A)^T\\\col j(A^T)&=\row j(A)^T | ||
| + | .\end{align*} | ||
| - | Let $A=\mat{a& | + | ==== Theorem: the transpose reverses the order of matrix |
| - | - $A$ is invertible if and only if $\det(A)\ne0$. | + | If $A$ and $B$ are matrices and the [[matrix product]] |
| - | - If $A$ is invertible, then $A^{-1}=\frac{1}{\det(A)}\mat{d& | + | \[ (AB)^T=B^TA^T.\] |
| === Proof === | === Proof === | ||
| - | If $A=0_{2\times | + | If $AB$ is defined, then $A$ is $n\times |
| + | \begin{align*} | ||
| + | \text{the }(i, | ||
| + | \\&= \row j(A)\cdot\col i(B) | ||
| + | \\& | ||
| + | \\& | ||
| + | \\& | ||
| + | \end{align*} | ||
| + | Hence $(AB)^T=B^TA^T$. ■ | ||
| - | Now assume that $A\ne0_{2\times | + | ====== Determinants of $n\times |
| - | By the previous lemma, we have \[AJ=(\det(A))I_2=JA.\] | + | Given any $n\times n$ matrix $A$, it is possible to define a number $\det(A)$ (as a formula using the entries of $A$) so that |
| + | \[ A\text{ is invertible} \iff \det(A)\ne0.\] | ||
| - | If $\det(A)\ne0$, then multiplying this equation through by the scalar | + | - If $A$ is a $1\times 1$ matrix, say $A=[a]$, then we just define $\det[a]=a$. |
| - | \[ A\left(\frac1{\det(A)}J\right)=I_2=\left(\frac1{\det(A)}J\right) | + | - If $A$ is a $2\times 2$ matrix, say $A=\def\mat#1{\begin{bmatrix}#1\end{bmatrix}}\mat{a& |
| - | so if we write $B=\frac1{\det(A)}J$ to make this look simpler, then we obtain | + | - If $A$ is a $3\times 3$ matrix, say $A=\mat{a& |
| - | \[ AB=I_2=BA,\] | + | - If $A$ is a $4\times 4$ matrix, then the formula for $\det(A)$ is more complicated still, with $24$ terms. |
| - | so in this case $A$ is invertible with inverse | + | - If $A$ is a $5\times 5$ matrix, then the formula for $\det(A)$ |
| - | If $\det(A)=0$, then $AJ=0_{2\times | + | Trying to memorise a formula in every case (or even in the $3\times |
| - | ==== Examples | + | ==== Step 1: minors |
| - | * $\det\mat{2& | + | === Definition |
| - | * $\det\mat{2& | + | {{page> |
| + | === Examples === | ||
| - | ====== | + | * If $A=\mat{3& |
| + | * If $A=\mat{1& | ||
| - | We defined this in tutorial sheet 4: | + | ==== Step 2: cofactors ==== |
| + | |||
| + | ===Definition=== | ||
| + | {{page> | ||
| + | |||
| + | Note that $(-1)^{i+j}$ is $+1$ or $-1$, and can looked up in the matrix of signs: | ||
| + | $\mat{+& | ||
| + | This matrix starts with a $+$ in the $(1,1)$ entry (corresponding to $(-1)^{1+1}=(-1)^2=+1$) and the signs then alternate. | ||
| + | |||
| + | ===Examples=== | ||
| + | |||
| + | * If $A=\mat{3& | ||
| + | * If $A=\mat{1& | ||
| + | ==== Step 3: the determinant of a $3\times 3$ matrix using Laplace expansion along the first row ==== | ||
| + | |||
| + | ===Definition=== | ||
| + | |||
| + | {{page> | ||
| - | {{page> | ||
| - | ==== Exercise: simple properties of the transpose ==== | ||
| - | Prove that for any matrix $A$: | ||
| - | * $(A^T)^T=A$; | ||
| - | * $(A+B)^T=A^T+B^T$ if $A$ and $B$ are matrices of the [[same size]]; and | ||
| - | * $(cA)^T=c(A^T)$ for any [[scalar]] $c$. | ||
| - | | ||
| - | In tutorial sheet 4, we proved: | ||
| - | ==== Lemma: transposes and row-column multiplication ==== | ||
| - | If $a$ is a $1\times m$ row vector and $b$ is an $m\times 1$ column vector, then | ||
| - | \[ ab=b^Ta^T.\] | ||
lecture_13.1427365987.txt.gz · Last modified: by rupert
