Matrices Notes

Matrices

Basic Arithmetic of Matrices

  • Definition 7.1: A matrix is a rectangular array of numbers. Rows are horizontal units, and columns are vertical units.
    • The element in the iith row and jjth column is the (i,j)(i, j)th entry of the matrix.
    • An m×nm \times n matrix has mm rows and nn columns.
    • Rows are counted from the top, columns from the left.
    • The collection of all m×nm \times n matrices with real entries is denoted by Mm×n(R)M_{m\times n}(\mathbb{R}).
    • Capital letters denote matrices, small letters denote entries. For example, A=(a<em>ij)</em>m×nA = (a<em>{ij})</em>{m\times n} denotes an m×nm \times n matrix AA with entries aija_{ij}, where 1im1 \leqslant i \leqslant m and 1jn1 \leqslant j \leqslant n.
  • Example 7.1: The matrix A=(1amp;2amp;3 4amp;5amp;6)A = \begin{pmatrix} 1 &amp; 2 &amp; 3 \ 4 &amp; 5 &amp; 6 \end{pmatrix} is a 2×32 \times 3 matrix. Its first row is (1amp;2amp;3)\begin{pmatrix} 1 &amp; 2 &amp; 3 \end{pmatrix}, and its third column is (3 6)\begin{pmatrix} 3 \ 6 \end{pmatrix}. The (2,1)(2, 1)th entry of AA is 4.
  • Definition 7.2: A square matrix has the same number of rows and columns.
  • Definition 7.3: The main diagonal of a matrix consists of the (1,1)(1, 1)th, (2,2)(2, 2)th, …, (n,n)(n, n)th entries.
  • Definition 7.4: A diagonal matrix is a square matrix whose entries not on the main diagonal are all 0.
  • Example 7.2:
    • The matrix A=(4amp;0amp;0 0amp;5amp;0 0amp;0amp;0)A = \begin{pmatrix} 4 &amp; 0 &amp; 0 \ 0 &amp; 5 &amp; 0 \ 0 &amp; 0 &amp; 0 \end{pmatrix} is a diagonal matrix (and thus also a square matrix).
    • The matrix B=(0amp;0amp;1 0amp;2amp;0 3amp;0amp;0)B = \begin{pmatrix} 0 &amp; 0 &amp; 1 \ 0 &amp; 2 &amp; 0 \ 3 &amp; 0 &amp; 0 \end{pmatrix} is a square matrix but not a diagonal matrix.
  • Definition 7.5: Two matrices A=(a<em>ij)</em>m×nA = (a<em>{ij})</em>{m\times n} and B=(b<em>ij)</em>k×B = (b<em>{ij})</em>{k\times \ell} are equal if m=km = k, n=n = \ell, and a<em>ij=b</em>ija<em>{ij} = b</em>{ij} for all ii and jj. We write A=BA = B if AA and BB are equal matrices.
  • Definition 7.6: Let A=(a<em>ij)</em>m×nA = (a<em>{ij})</em>{m\times n} and B=(b<em>ij)</em>m×nB = (b<em>{ij})</em>{m\times n} be two matrices of the same size. The matrix addition is defined by A+B=(a<em>ij+b</em>ij)A + B = (a<em>{ij} + b</em>{ij}).
  • Example 7.3: (1amp;2 3amp;4)+(5amp;7 8amp;6)=(1+5amp;2+7 3+8amp;4+6)=(6amp;9 11amp;10)\begin{pmatrix} 1 &amp; 2 \ 3 &amp; 4 \end{pmatrix} + \begin{pmatrix} 5 &amp; 7 \ 8 &amp; 6 \end{pmatrix} = \begin{pmatrix} 1+5 &amp; 2+7 \ 3+8 &amp; 4+6 \end{pmatrix} = \begin{pmatrix} 6 &amp; 9 \ 11 &amp; 10 \end{pmatrix}.
  • Definition 7.7: The m×nm \times n zero matrix, denoted by Om×nO_{m\times n} or simply OO, is the m×nm \times n matrix where every entry is 0.
  • Definition 7.8: Let A=(a<em>ij)</em>m×nA = (a<em>{ij})</em>{m\times n} be a matrix. The additive inverse of AA, denoted by A-A, is the matrix (a<em>ij)</em>m×n(-a<em>{ij})</em>{m\times n}.
  • Proposition 7.1: Let AA, BB, and CC be matrices of the same size, and let OO be the zero matrix of the same size. Then the following hold:
    • (a) (commutativity) A+B=B+AA + B = B + A
    • (b) (associativity) (A+B)+C=A+(B+C)(A + B) + C = A + (B + C)
    • (c) O+A=AO + A = A
    • (d) A+(A)=OA + (-A) = O
  • Definition 7.9: Let A=(a<em>ij)</em>m×nA = (a<em>{ij})</em>{m\times n} and B=(b<em>ij)</em>m×nB = (b<em>{ij})</em>{m\times n} be two matrices of the same size. The matrix subtraction is defined by AB=(a<em>ijb</em>ij)A - B = (a<em>{ij} - b</em>{ij}).
  • Example 7.4: (5amp;7 8amp;6)(1amp;2 3amp;4)=(51amp;72 83amp;64)=(4amp;5 5amp;2)\begin{pmatrix} 5 &amp; 7 \ 8 &amp; 6 \end{pmatrix} - \begin{pmatrix} 1 &amp; 2 \ 3 &amp; 4 \end{pmatrix} = \begin{pmatrix} 5-1 &amp; 7-2 \ 8-3 &amp; 6-4 \end{pmatrix} = \begin{pmatrix} 4 &amp; 5 \ 5 &amp; 2 \end{pmatrix}.
  • Definition 7.10: Let A=(a<em>ij)</em>m×nA = (a<em>{ij})</em>{m\times n} be a matrix and let cc be a scalar. The scalar multiplication is defined by cA=(caij)cA = (ca_{ij}).
  • Example 7.5: 5(1amp;2 3amp;4)=(5(1)amp;5(2) 5(3)amp;5(4))=(5amp;10 15amp;20)5 \begin{pmatrix} 1 &amp; 2 \ 3 &amp; 4 \end{pmatrix} = \begin{pmatrix} 5(1) &amp; 5(2) \ 5(3) &amp; 5(4) \end{pmatrix} = \begin{pmatrix} 5 &amp; 10 \ 15 &amp; 20 \end{pmatrix}.
  • Proposition 7.2: Let AA and BB be matrices of the same size, and let cc and dd be two scalars. Then the following hold:
    • (a) 1(A)=A1(A) = A, 0(A)=O0(A) = O, (1)(A)=A(-1)(A) = -A
    • (b) (cd)A=c(dA)(cd)A = c(dA)
    • (c) (distributivity) c(A+B)=cA+cBc(A + B) = cA + cB, (c+d)A=cA+dA(c + d)A = cA + dA
  • Definition 7.11: Let A=(a<em>ij)</em>m×nA = (a<em>{ij})</em>{m\times n} be a matrix. The transpose of AA, denoted by ATA^T, is the matrix (a<em>ji)</em>n×m(a<em>{ji})</em>{n\times m}.
  • Example 7.6: (1amp;2 3amp;4 5amp;6)T=(1amp;3amp;5 2amp;4amp;6)\begin{pmatrix} 1 &amp; 2 \ 3 &amp; 4 \ 5 &amp; 6 \end{pmatrix}^T = \begin{pmatrix} 1 &amp; 3 &amp; 5 \ 2 &amp; 4 &amp; 6 \end{pmatrix}.
  • Proposition 7.3: Let AA and BB be matrices of the same size, and let cc be a scalar. Then the following hold:
    • (a) (AT)T=A(A^T)^T = A
    • (b) (A+B)T=AT+BT(A + B)^T = A^T + B^T
    • (c) (cA)T=cAT(cA)^T = cA^T
  • Definition 7.12: Let A=(a<em>ij)</em>m×nA = (a<em>{ij})</em>{m\times n} and B=(b<em>ij)</em>n×B = (b<em>{ij})</em>{n\times \ell} be matrices. The matrix product ABAB of AA and BB is defined to be the matrix (c<em>ij)</em>m×(c<em>{ij})</em>{m\times \ell} where c<em>ij=a</em>i1b<em>1j+a</em>i2b<em>2j++a</em>inbnjc<em>{ij} = a</em>{i1}b<em>{1j} + a</em>{i2}b<em>{2j} + \cdots + a</em>{in}b_{nj}.
  • The product ABAB is only defined when the number of columns of AA is the same as the number of rows of BB.
  • We can define the positive power of a square matrix in the natural way. For example, A2=AAA^2 = AA and A3=(A2)AA^3 = (A^2)A, etc.
  • Example 7.7: (1amp;2 3amp;4)(5amp;6 7amp;8)=((1)(5)+(2)(7)amp;(1)(6)+(2)(8) (3)(5)+(4)(7)amp;(3)(6)+(4)(8))=(19amp;22 43amp;50)\begin{pmatrix} 1 &amp; 2 \ 3 &amp; 4 \end{pmatrix} \begin{pmatrix} 5 &amp; 6 \ 7 &amp; 8 \end{pmatrix} = \begin{pmatrix} (1)(5)+(2)(7) &amp; (1)(6)+(2)(8) \ (3)(5)+(4)(7) &amp; (3)(6)+(4)(8) \end{pmatrix} = \begin{pmatrix} 19 &amp; 22 \ 43 &amp; 50 \end{pmatrix}.
  • Definition 7.13: The n×nn \times n identity matrix, denoted by InI_n or simply II, is the n×nn \times n diagonal matrix whose every diagonal entry is 1.
  • Proposition 7.4: Let AA, BB, and CC be matrices such that the following operations are well-defined, and let cc be a scalar. Then the following hold:
    • (a) (associativity) (AB)C=A(BC)(AB)C = A(BC)
    • (b) AO=OAO = O, OB=OOB = O, AI=AAI = A, IB=BIB = B
    • (c) (distributivity) A(B+C)=AB+ACA(B + C) = AB + AC, (A+B)C=AC+BC(A + B)C = AC + BC
    • (d) c(AB)=(cA)B=A(cB)c(AB) = (cA)B = A(cB)
    • (e) (AB)T=BTAT(AB)^T = B^T A^T
  • Matrix multiplication is not commutative in general. This means ABAB and BABA are not necessarily the same even if both are well-defined.
  • Definition 7.14: An n×nn \times n matrix AA is said to be invertible or non-singular if there exists an n×nn \times n matrix BB such that AB=In=BAAB = I_n = BA. Such a matrix BB is called the inverse of AA, and is usually denoted by A1A^{-1}. A square matrix which has no inverse is said to be non-invertible or singular.
  • Proposition 7.5: The inverse of a matrix, if it exists, is unique.
  • Example 7.8: The matrix A=(1amp;2 3amp;5)A = \begin{pmatrix} 1 &amp; 2 \ 3 &amp; 5 \end{pmatrix} is invertible, and A1=(5amp;2 3amp;1)A^{-1} = \begin{pmatrix} -5 &amp; 2 \ 3 &amp; -1 \end{pmatrix}.
  • Example 7.9: The matrix B=(1amp;2 3amp;6)B = \begin{pmatrix} 1 &amp; 2 \ 3 &amp; 6 \end{pmatrix} is non-invertible.
  • Proposition 7.6: Let AA and BB be invertible matrices of the same size, and let cc be a nonzero scalar. Then the following hold:
    • (a) A1A^{-1} is invertible and (A1)1=A(A^{-1})^{-1} = A
    • (b) cAcA is invertible and (cA)1=c1A1(cA)^{-1} = c^{-1}A^{-1}
    • (c) ABAB is invertible and (AB)1=B1A1(AB)^{-1} = B^{-1}A^{-1}
    • (d) ATA^T is invertible and (AT)1=(A1)T(A^T)^{-1} = (A^{-1})^T

Determinants

  • Definition 7.15: The determinants of a 1×11 \times 1 matrix A=(a)A = (a), a 2×22 \times 2 matrix B=(aamp;b camp;d)B = \begin{pmatrix} a &amp; b \ c &amp; d \end{pmatrix}, and a 3×33 \times 3 matrix C=(aamp;bamp;c damp;eamp;f gamp;hamp;i)C = \begin{pmatrix} a &amp; b &amp; c \ d &amp; e &amp; f \ g &amp; h &amp; i \end{pmatrix} are defined to be detA=a\det A = a, detB=adbc\det B = ad - bc, detC=aei+bfg+cdhgecdbiahf\det C = aei + bfg + cdh - gec - dbi - ahf respectively.
    • The determinant of AA can also be represented as A|A|. Another common notation for the determinant of a matrix (aamp;b camp;d)\begin{pmatrix} a &amp; b \ c &amp; d \end{pmatrix} is aamp;b camp;d\begin{vmatrix} a &amp; b \ c &amp; d \end{vmatrix}.
  • Example 7.10: 1amp;2amp;0 3amp;4amp;5 0amp;6amp;7=(1)(4)(7)+(2)(5)(0)+(0)(3)(6)(0)(4)(0)(3)(2)(7)(1)(6)(5)=44\begin{vmatrix} 1 &amp; 2 &amp; 0 \ 3 &amp; 4 &amp; 5 \ 0 &amp; 6 &amp; 7 \end{vmatrix} = (1)(4)(7) + (2)(5)(0) + (0)(3)(6) - (0)(4)(0) - (3)(2)(7) - (1)(6)(5) = -44. Also, we have detO=0\det O = 0 and detI=1\det I = 1.
  • Theorem 7.1: A square matrix AA is invertible if and only if detA0\det A \neq 0.
  • Example 7.11: Since 3amp;2 6amp;4=0\begin{vmatrix} 3 &amp; 2 \ 6 &amp; 4 \end{vmatrix} = 0, the matrix (3amp;2 6amp;4)\begin{pmatrix} 3 &amp; 2 \ 6 &amp; 4 \end{pmatrix} is non-invertible.
  • Proposition 7.7: Let AA and BB be square matrices of size n×nn \times n. Then the following hold:
    • (a) det(AB)=(detA)(detB)\det(AB) = (\det A)(\det B)
    • (b) det(kA)=kndetA\det(kA) = k^n \det A for any kRk \in \mathbb{R}
    • (c) det(AT)=detA\det(A^T) = \det A
    • (d) if AA is invertible, then det(A1)=1detA\det(A^{-1}) = \frac{1}{\det A}
    • (e) if AA has a zero row or a zero column, then detA=0\det A = 0
    • (f) if AA has two identical rows or two identical columns, then detA=0\det A = 0
  • Example 7.12: Let both AA and BB be 3×33 \times 3 matrices such that detA=2\det A = 2 and BB is invertible. Then det(BTA2B1)=4\det(-B^T A^2 B^{-1}) = -4.
  • Definition 7.16: Let A=(a<em>ij)A = (a<em>{ij}) be an n×nn \times n matrix where n2n \geqslant 2. Let A</em>ijA</em>{ij} be the (n1)×(n1)(n - 1) \times (n - 1) matrix obtained by deleting the iith row and the jjth column of AA. The (i,j)(i, j)-cofactor of AA is defined by c<em>ij=(1)i+jdet(A</em>ij)c<em>{ij} = (-1)^{i+j} \det(A</em>{ij}).
  • Example 7.13: The (2,3)(2, 3)-cofactor of (1amp;2amp;3 4amp;5amp;6 7amp;8amp;9)\begin{pmatrix} 1 &amp; 2 &amp; 3 \ 4 &amp; 5 &amp; 6 \ 7 &amp; 8 &amp; 9 \end{pmatrix} is 1amp;2 7amp;8=6-\begin{vmatrix} 1 &amp; 2 \ 7 &amp; 8 \end{vmatrix} = 6.
  • Theorem 7.2: Let AA be an invertible matrix. Let BB be the matrix whose (i,j)(i, j)th entry is the (j,i)(j, i)-cofactor cjic_{ji} of AA. Then A1=1detABA^{-1} = \frac{1}{\det A} B.
  • Example 7.14: Let A=(aamp;b camp;d)A = \begin{pmatrix} a &amp; b \ c &amp; d \end{pmatrix} where detA=adbc0\det A = ad - bc \neq 0. Then A1=1adbc(damp;b camp;a)A^{-1} = \frac{1}{ad - bc} \begin{pmatrix} d &amp; -b \ -c &amp; a \end{pmatrix}.
  • Example 7.15: The inverse of B=(1amp;1amp;2 2amp;3amp;4 1amp;0amp;1)B = \begin{pmatrix} 1 &amp; 1 &amp; 2 \ 2 &amp; 3 &amp; 4 \ 1 &amp; 0 &amp; 1 \end{pmatrix} is (3amp;1amp;2 2amp;1amp;0 3amp;1amp;1)\begin{pmatrix} -3 &amp; 1 &amp; 2 \ -2 &amp; 1 &amp; 0 \ 3 &amp; -1 &amp; -1 \end{pmatrix}.
  • Theorems
    • 7.1: Criterion for a matrix to be invertible
    • 7.2: Inverse of a matrix
  • Propositions
    • 7.1: Properties of matrix addition
    • 7.2: Properties of scalar multiplication
    • 7.3: Properties of transposes
    • 7.4: Properties of matrix multiplication
    • 7.5: Uniqueness of the matrix inverse
    • 7.6: Properties of matrix inverses
    • 7.7: Properties of determinants
  • Terminologies and Notations
    • Mm×n(R)M_{m\times n}(\mathbb{R})
    • additive inverse A-A
    • cofactor cijc_{ij}
    • column
    • determinant detA,A\det A, |A|
    • diagonal matrix
    • entry
    • equal (matrix)
    • identity matrix II
    • inverse (matrix) A1A^{-1}
    • invertible matrix
    • main diagonal
    • matrices
    • matrix
    • matrix addition A+BA + B
    • matrix power AkA^k
    • matrix product ABAB
    • matrix subtraction ABA - B
    • non-invertible matrix
    • non-singular
    • row
    • scalar multiplication cAcA
    • singular
    • square matrix
    • transpose ATA^T
    • zero matrix OO