Let AA be a m×nm\times n matrix

  1. A(BC)=(AB)CA(BC)=(AB)C
  2. A(B+C)=AB+ACA(B+C)=AB+AC
  3. (B+C)A=BA+CA(B+C)A=BA+CA
  4. r(AB)=(rA)B=A(rB)r(AB)=(rA)B=A(rB)
  5. ImA=A=AInI_mA=A=AI_n

The cancellation laws do not hold for matrix multiplication.

If AB=BAAB=BA, we say A,BA,B commute with one another. (In general, ABBAAB\ne BA)

Transpose and Symmatric Matrix

The matrix AA is symmetric if A=ATA=A^T

  1. (AT)T=A(A^T)^T=A
  2. (A+B)T=AT+BT(A+B)^T=A^T+B^T
  3. For any scalar rr, (rA)T=rAT(rA)^T=rA^T
  4. (AB)T=BTAT(AB)^T=B^TA^T

Sub-Matrix

Suppose AA is a m×nm\times n matrix. Submatrix A(ij)A(i|j) is the (m1)×(n1)(m-1)\times (n-1) matrix obtained from AA by removing row ii and column jj.

Determinant of a Matrix

Theorem: Determinant for Matrix Operation

Suppose AA is a square matrix. Let BB be the matrix obtained from AA by swapping 2 rows or columns. Then

detB=detA\det B=-\det A


Let CC be the square matrix obtain from AA by multiplying a single row or column by scalar rr, then

detC=rdetA\det C=r\det A


If AA has 2 same rows or 2 same columns, then

detA=0\det A=0


Let DD be the matrix obtained from AA by multiplying a row/column by scalar rr and then adding it to another row/column, then

detD=detA\det D=\det A


Singular Matrix

Singular Matrix

Suppose AA is square matrix. AA is singular iff detA=0\det A=0.


Inversion

Suppose A,BA,B are n×nn\times n matrices, and AB=BA=InAB=BA=I_n, we say AA is an inverse of BB

Non-singularity and Inversibility

Suppose AA is a square matric of size nn. The following are equivalent.

  1. AA is non-singular
  2. AA row-reduces to InI_n
  3. The columns of AA are linearly independent
  4. AA is invertible

Suppose AA is non-singular. Then the unique solution to LS(A,b)\mathcal{LS}(A,\mathbf{b}) is A1bA^{-1}\mathbf{b}

Cramer’s Rule


Cross Products

  1. a(b×c)=(a×b)ca\cdot (b\times c)=(a\times b)\cdot c
  2. a×(b×c)=(ac)b(ab)ca\times (b\times c)=(a\cdot c)b - (a\cdot b)c

Eigenvalue

An eigenvector of an n×nn\times n matrix AA is a non-zero vector xx such that Ax=λxAx=\lambda x for some scalar λ\lambda, λ\lambda is called eigenvalue.

λ\lambda is an eigenvalue of AA iff the equation

(AλI)x=0(A-\lambda I)x=0

has a nontrivial solution.

Eigenvalue of Triangular Matrix

The eigenvalues of a a triangular matrix are on its main diagonal.

Diagonalizable Matrix

Square matrix AA is diagonalizable if

A=PDP1A=PDP^{-1}

for some invertible PP and some diagonal matrix DD.

Diagonalizable and Eigenvectors

A square matrix AA is diagonalizable iff AA has nn linearly independent eigenvectors. And also,

P=[v1v2vn],D=[λ1000λ2000λn]P=[v_1\, v_2\, \cdots\, v_n], D=\begin{bmatrix}\lambda_1&0&\dots&0\\0&\lambda_2&\dots&0\\\vdots&\vdots&&\vdots\\0&0&\dots&\lambda_n\end{bmatrix}