These are personal study and translation notes for reference only; the original course materials belong to MIT OpenCourseWare and their respective rights holders.
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:
Row exchange flips sign: If two rows are swapped, the determinant changes sign.
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.
detI=1
Big Formula for n×n:
detA=permutations P∑(detP)a1,α1a2,α2⋯an,αn
There are n! terms. Each term picks one entry from each row and each column, multiplies them, and assigns sign +1 for even permutations and −1 for odd permutations.
Immediate Consequences:
If A has a zero row, detA=0
If two rows are identical, detA=0
det of a triangular matrix = product of diagonal entries (pivots)
detA=0 iff A is singular
5.2 Cofactors and the Formula for A−1
Minor:Mij is the determinant of the (n−1)×(n−1) matrix obtained by removing row i and column j.
Cofactor:
Cij=(−1)i+jMij
Cofactor Expansion (along row 1):
detA=a11C11+a12C12+⋯+a1nC1n
Expansion works along any row or column with the same result.
Inverse Formula via Cofactors:
A−1=detA(cofactor matrix)T
The cofactor matrix (also called the adjugate or adjoint) has Cij in position (i,j). Its transpose is the adjugate matrix.
For 2x2:
A−1=detA1[C11C12C21C22]=ad−bc1[d−c−ba]
5.3 det(AB)=(detA)(detB) and Cramer's Rule
The Product Rule:
det(AB)=(detA)(detB)
This is the most important determinant property.
Corollaries:
detA−1=1/detA
det(Ak)=(detA)k
det(Q)=±1 for any orthogonal matrix Q
det(U)=∏ of pivots for triangular U
Cramer's Rule: Solve Ax=b using determinants:
xj=detAdetBj
where Bj is A with column j replaced by b.
While theoretically elegant, Cramer's Rule is computationally expensive (O(n!) operations via the big formula) and is never used for numerical computation in practice. Gaussian elimination (O(n3)) is far more efficient.
5.4 Volume of Box = ∣detE∣ where E 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=[a1a2]:
∣detA∣=area of parallelogram formed by a1 and a2
For a 3x3 matrix:
∣detA∣=volume of parallelepiped formed by a1,a2,a3
Edge Matrix E: If we have vectors e1,…,en as the edges of a parallelepiped, then:
Volume=∣det(E)∣where E=[e1e2⋯en]
Why QR factorization makes this clear:A=QR where Q is orthogonal (∣detQ∣=1) and R is triangular with pivots on the diagonal. The volume is ∣detR∣=∣r11r22⋯rnn∣, which is the product of base lengths and perpendicular heights.
Linear Transformation Interpretation: When a linear transformation T represented by matrix A acts on a region, volumes are multiplied by ∣detA∣:
Vol(T(Ω))=∣detA∣⋅Vol(Ω)
This is the basis for the change-of-variables formula in multivariable calculus.