LINEAR-ALGEBRA Β· Unit 18 Β· Video 2 Β· Interactive Practice
| Formula | Name | Description |
|---|---|---|
| 2Γ2 Determinant | Base case for cofactor expansion | |
| = det(submatrix after deleting row , col ) | Minor | The smaller determinant |
| Cofactor | Minor with checkerboard sign | |
| Cofactor Expansion | Expand along any row (or any column ) |
The cofactor's sign depends only on the position β it alternates like a chessboard.
π‘ Positions and always share a sign, since ignores order.
Expanding along any row or column rewrites it as a signed sum of entries times their minors.
π‘ Challenge: find a row or column whose expansion needs only two minors.
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.
Question 1 Β· Computing a Cofactor
Consider a matrix where the entry at position has value . After deleting row 2 and column 3, the remaining submatrix has determinant (minor) .
What is the cofactor ?
β Correct! Since is odd, the checkerboard sign is , giving .
β Not quite. You may have forgotten the checkerboard sign. Since is odd, the sign is , not .
β 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.
Solution:
The cofactor formula is .
For position :
Key distinction: The cofactor combines only the checkerboard sign and the minor. The entry value is used separately when computing the determinant contribution: .
Question 2 Β· Strategic Row/Column Choice
Consider the 4Γ4 matrix:
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.
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 sits at position in a matrix. The minor is .
What is the determinant contribution of this entry, i.e., ?
β Correct! The cofactor is , and the contribution is . Two negatives make a positive!
β Not quite. Watch the signs carefully: the entry is and the cofactor is . Negative times negative equals positive 44.
β Not quite. The contribution is entry cofactor = . Make sure you multiply the entry value by the full cofactor (sign minor).
Solution:
Three separate components:
Step 1 β Cofactor:
Step 2 β Contribution:
The entry's negative sign () and the checkerboard's negative sign () 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.
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:
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