AoZai
AoZai

Reading Notice

These are personal study and translation notes for reference only; the original course materials belong to MIT OpenCourseWare and their respective rights holders.

ZoomNotes for Linear Algebra

Gilbert Strang, MIT 18.06 · Ch.5 / 11

Part 5: Determinant of a Square Matrix

5.1 3 by 3 and nn by nn Determinants

The determinant is a number associated with every square matrix that determines whether the matrix is invertible (detA0\det A \neq 0) or singular (detA=0\det A = 0).

3x3 Determinant (6 signed terms):

det[a11a12a13a21a22a23a31a32a33]=a11a22a33+a12a23a31+a13a21a32a11a23a32a12a21a33a13a22a31\det \begin{bmatrix} a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33} \end{bmatrix} = a_{11}a_{22}a_{33} + a_{12}a_{23}a_{31} + a_{13}a_{21}a_{32} - a_{11}a_{23}a_{32} - a_{12}a_{21}a_{33} - a_{13}a_{22}a_{31}

The three positive terms come from even permutations (identity, (1 2 3), (1 3 2)) and the three negative terms from odd permutations ((2 3), (1 2), (1 3)).

Three Defining Properties of Determinants:

  1. Row exchange flips sign: If two rows are swapped, the determinant changes sign.
  2. Linearity in each row:
    • Multiplying a row by a scalar multiplies the determinant by that scalar.
    • Adding two matrices that differ only in one row: determinant adds.
  3. detI=1\det I = 1

Big Formula for n×nn \times n:

detA=permutations P(detP)a1,α1a2,α2an,αn\det A = \sum_{\text{permutations } P} (\det P) \, a_{1,\alpha_1} a_{2,\alpha_2} \cdots a_{n,\alpha_n}

There are n!n! terms. Each term picks one entry from each row and each column, multiplies them, and assigns sign +1+1 for even permutations and 1-1 for odd permutations.

Immediate Consequences:

  • If AA has a zero row, detA=0\det A = 0
  • If two rows are identical, detA=0\det A = 0
  • det\det of a triangular matrix = product of diagonal entries (pivots)
  • detA=0\det A = 0 iff AA is singular

5.2 Cofactors and the Formula for A1A^{-1}

Minor: MijM_{ij} is the determinant of the (n1)×(n1)(n-1) \times (n-1) matrix obtained by removing row ii and column jj.

Cofactor:

Cij=(1)i+jMijC_{ij} = (-1)^{i+j} M_{ij}

Cofactor Expansion (along row 1):

detA=a11C11+a12C12++a1nC1n\det A = a_{11} C_{11} + a_{12} C_{12} + \cdots + a_{1n} C_{1n}

Expansion works along any row or column with the same result.

Inverse Formula via Cofactors:

A1=(cofactor matrix)TdetAA^{-1} = \frac{(\text{cofactor matrix})^T}{\det A}

The cofactor matrix (also called the adjugate or adjoint) has CijC_{ij} in position (i,j)(i,j). Its transpose is the adjugate matrix.

For 2x2:

A1=1detA[C11C21C12C22]=1adbc[dbca]A^{-1} = \frac{1}{\det A} \begin{bmatrix} C_{11} & C_{21} \\ C_{12} & C_{22} \end{bmatrix} = \frac{1}{ad-bc} \begin{bmatrix} d & -b \\ -c & a \end{bmatrix}

5.3 det(AB)=(detA)(detB)\det(AB) = (\det A)(\det B) and Cramer's Rule

The Product Rule:

det(AB)=(detA)(detB)\det(AB) = (\det A)(\det B)

This is the most important determinant property.

Corollaries:

  • detA1=1/detA\det A^{-1} = 1/\det A
  • det(Ak)=(detA)k\det(A^k) = (\det A)^k
  • det(Q)=±1\det(Q) = \pm 1 for any orthogonal matrix QQ
  • det(U)=\det(U) = \prod of pivots for triangular UU

Cramer's Rule: Solve Ax=bAx = b using determinants:

xj=detBjdetAx_j = \frac{\det B_j}{\det A}

where BjB_j is AA with column jj replaced by bb.

While theoretically elegant, Cramer's Rule is computationally expensive (O(n!)O(n!) operations via the big formula) and is never used for numerical computation in practice. Gaussian elimination (O(n3)O(n^3)) is far more efficient.


5.4 Volume of Box = detE|\det E| where EE is Edge Matrix

Geometric Interpretation: The absolute value of the determinant equals the volume of the parallelepiped formed by the column (or row) vectors of the matrix.

For a 2x2 matrix A=[a1  a2]A = [\mathbf{a}_1 \; \mathbf{a}_2]:

detA=area of parallelogram formed by a1 and a2|\det A| = \text{area of parallelogram formed by } \mathbf{a}_1 \text{ and } \mathbf{a}_2

For a 3x3 matrix:

detA=volume of parallelepiped formed by a1,a2,a3|\det A| = \text{volume of parallelepiped formed by } \mathbf{a}_1, \mathbf{a}_2, \mathbf{a}_3

Edge Matrix EE: If we have vectors e1,,en\mathbf{e}_1, \dots, \mathbf{e}_n as the edges of a parallelepiped, then:

Volume=det(E)where E=[e1  e2    en]\text{Volume} = |\det(E)| \quad \text{where } E = [\mathbf{e}_1 \; \mathbf{e}_2 \; \cdots \; \mathbf{e}_n]

Why QR factorization makes this clear: A=QRA = QR where QQ is orthogonal (detQ=1|\det Q| = 1) and RR is triangular with pivots on the diagonal. The volume is detR=r11r22rnn|\det R| = |r_{11} r_{22} \cdots r_{nn}|, which is the product of base lengths and perpendicular heights.

Linear Transformation Interpretation: When a linear transformation TT represented by matrix AA acts on a region, volumes are multiplied by detA|\det A|:

Vol(T(Ω))=detAVol(Ω)\text{Vol}(T(\Omega)) = |\det A| \cdot \text{Vol}(\Omega)

This is the basis for the change-of-variables formula in multivariable calculus.

Previous Next
© MIT OpenCourseWare  |  18.06 Linear Algebra  |  Gilbert Strang  |  Spring 2010
ocw.mit.edu  ·  CC BY-NC-SA 4.0