LINEAR-ALGEBRA Β· Unit 18 Β· Video 2 Β· Interactive Practice

Determinants Inside Determinants β€” Cofactor Expansion

IKey Formulas

Formula Name Description
det⁑(abcd)=adβˆ’bc\det\begin{pmatrix} a & b \\ c & d \end{pmatrix} = ad - bc 2Γ—2 Determinant Base case for cofactor expansion
MijM_{ij} = det(submatrix after deleting row ii, col jj) Minor The smaller determinant
Cij=(βˆ’1)i+jβ‹…MijC_{ij} = (-1)^{i+j} \cdot M_{ij} Cofactor Minor with checkerboard sign
det⁑(A)=βˆ‘j=1naij Cij\det(A) = \displaystyle\sum_{j=1}^{n} a_{ij} \, C_{ij} Cofactor Expansion Expand along any row ii (or any column jj)

IIVisualization 1 β€” The Checkerboard Sign

The cofactor's sign (βˆ’1)i+j(-1)^{i+j} depends only on the position (i,j)(i,j) β€” it alternates like a chessboard.

πŸ’‘ Positions (i,j)(i,j) and (j,i)(j,i) always share a sign, since i+ji+j ignores order.

IIIVisualization 2 β€” Expanding a 3Γ—3 Determinant

Expanding det⁑A\det A along any row or column rewrites it as a signed sum of entries times their 2Γ—22\times2 minors.

πŸ’‘ Challenge: find a row or column whose expansion needs only two 2Γ—22\times2 minors.

IVVisualization 3 β€” Zero Hunting

Every row and column yields the same determinant β€” but each zero you land on erases a whole cofactor.

πŸ’‘ Before expanding, scan for the line with the most zeros β€” it needs the fewest minors.

VQuiz Questions

Question 1 Β· Computing a Cofactor

Consider a matrix where the entry at position (2,3)(2, 3) has value a23=5a_{23} = 5. After deleting row 2 and column 3, the remaining submatrix has determinant (minor) M23=8M_{23} = 8.

What is the cofactor C23C_{23}?

βœ… Correct! Since i+j=2+3=5i+j = 2+3 = 5 is odd, the checkerboard sign is βˆ’1-1, giving C23=(βˆ’1)(8)=βˆ’8C_{23} = (-1)(8) = -8.

❌ Not quite. You may have forgotten the checkerboard sign. Since i+j=5i+j = 5 is odd, the sign is βˆ’1-1, not +1+1.

❌ Not quite. You multiplied the entry value (5) into the result. The cofactor uses only the sign and the minor β€” not the entry itself.

❌ Not quite. Two issues: the cofactor doesn't include the entry value, and the sign at position (2,3) is negative, not positive.

❌ Not quite. Try again β€” the hints above can help.

Show solution

Solution:

The cofactor formula is Cij=(βˆ’1)i+jβ‹…MijC_{ij} = (-1)^{i+j} \cdot M_{ij}.

For position (2,3)(2, 3): C23=(βˆ’1)2+3β‹…M23=(βˆ’1)5β‹…8=(βˆ’1)(8)=βˆ’8C_{23} = (-1)^{2+3} \cdot M_{23} = (-1)^5 \cdot 8 = (-1)(8) = -8

Key distinction: The cofactor combines only the checkerboard sign and the minor. The entry value a23=5a_{23} = 5 is used separately when computing the determinant contribution: a23β‹…C23=5Γ—(βˆ’8)=βˆ’40a_{23} \cdot C_{23} = 5 \times (-8) = -40.

Question 2 Β· Strategic Row/Column Choice

Consider the 4Γ—4 matrix: B=(3002150407106003)B = \begin{pmatrix} 3 & 0 & 0 & 2 \\ 1 & 5 & 0 & 4 \\ 0 & 7 & 1 & 0 \\ 6 & 0 & 0 & 3 \end{pmatrix}

Which expansion requires computing the fewest 3Γ—3 cofactors?

βœ… Correct! Column 3 has three zeros, so only 1 cofactor needs computing β€” maximum efficiency!

❌ Not quite. Look for the row or column with the most zeros. Each zero eliminates an entire cofactor computation.

Show solution

Solution:

Count the nonzero entries (= cofactors you must compute) for each option:

Option Entries Zeros Cofactors needed
Row 1 3, 0, 0, 2 2 2
Row 3 0, 7, 1, 0 2 2
Column 3 0, 0, 1, 0 3 1 βœ…
Column 4 2, 4, 0, 3 1 3

Column 3 has three zeros, leaving only one nonzero entry (the 1 in row 3). Only one 3Γ—3 cofactor must be computed β€” the minimum possible!

Question 3 Β· Entry Sign vs. Checkerboard Sign

An entry a21=βˆ’4a_{21} = -4 sits at position (2,1)(2, 1) in a matrix. The minor is M21=11M_{21} = 11.

What is the determinant contribution of this entry, i.e., a21β‹…C21a_{21} \cdot C_{21}?

βœ… Correct! The cofactor is C21=(βˆ’1)(11)=βˆ’11C_{21} = (-1)(11) = -11, and the contribution is (βˆ’4)(βˆ’11)=+44(-4)(-11) = +44. Two negatives make a positive!

❌ Not quite. Watch the signs carefully: the entry is βˆ’4-4 and the cofactor is βˆ’11-11. Negative times negative equals positive 44.

❌ Not quite. The contribution is entry Γ—\times cofactor = a21Γ—C21a_{21} \times C_{21}. Make sure you multiply the entry value by the full cofactor (sign Γ—\times minor).

Show solution

Solution:

Three separate components:

  1. Entry value: a21=βˆ’4a_{21} = -4 (from the matrix)
  2. Checkerboard sign: (βˆ’1)2+1=(βˆ’1)3=βˆ’1(-1)^{2+1} = (-1)^3 = -1
  3. Minor: M21=11M_{21} = 11

Step 1 β€” Cofactor: C21=(βˆ’1)2+1β‹…M21=(βˆ’1)(11)=βˆ’11C_{21} = (-1)^{2+1} \cdot M_{21} = (-1)(11) = -11

Step 2 β€” Contribution: a21β‹…C21=(βˆ’4)(βˆ’11)=+44a_{21} \cdot C_{21} = (-4)(-11) = +44

The entry's negative sign (βˆ’4-4) and the checkerboard's negative sign (βˆ’1-1) are independent. Negative times negative = positive!

Question 4 Β· True or False

Statement: Expanding a determinant along different rows of the same matrix can produce different determinant values.

βœ… Correct! The determinant is unique β€” every expansion (any row or column) gives the same value. Only the workload differs.

❌ Incorrect. The determinant is a fixed property of the matrix. Different expansion choices change the computation path, but always arrive at the same number.

❌ Not quite. Try again β€” the hints above can help.

Show solution

Solution: False

The determinant is a unique number associated with each square matrix. Cofactor expansion along any row or any column always produces the same value:

det⁑(A)=βˆ‘j=1naij Cij(sameΒ forΒ everyΒ rowΒ i)\det(A) = \sum_{j=1}^{n} a_{ij}\, C_{ij} \quad \text{(same for every row } i\text{)}

det⁑(A)=βˆ‘i=1naij Cij(sameΒ forΒ everyΒ columnΒ j)\det(A) = \sum_{i=1}^{n} a_{ij}\, C_{ij} \quad \text{(same for every column } j\text{)}

The choice only affects the amount of computation β€” which is precisely why we can "hunt for zeros" to minimize work without changing the answer.

Solved: 0 / 4