Learn Linear Algebra

Theorem

Let A=[abcd] A = \begin{bmatrix} a & b \\ c & d \end{bmatrix} . If adbc0 ad - bc \neq 0 , then A A is invertible and A1=1adbc[dbca] A^{-1} = \frac{1}{ad - bc} \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} If adbc=0 ad - bc = 0 , then A A is not invertible.

Theorem

If A A is an invertible n×n n \times n matrix, then for each b \vec{b} in Rn \mathbb{R}^n , the equation Ax=b A\vec{x} = \vec{b} has the unique solution x=A1b \vec{x} = A^{-1}\vec{b} .

Theorem

a. If A A is an invertible matrix, then A1 A^{-1} is invertible and (A1)1=A (A^{-1})^{-1} = A b. If A A and B B are n×n n \times n invertible matrices, then so is AB AB , and the inverse of AB AB is the product of the inverses of A A and B B in the reverse order. That is, (AB)1=B1A1 (AB)^{-1} = B^{-1}A^{-1} c. If A A is an invertible matrix, then so is AT A^T , and the inverse of AT A^T is the transpose of A1 A^{-1} . That is, (AT)1=(A1)T (A^T)^{-1} = (A^{-1})^T

Theorem

An n×n n \times n matrix A A is invertible if and only if A A is row equivalent to In I_n , and in this case, any sequence of elementary row operations that reduces A A to In I_n also transforms In I_n into A1 A^{-1} .