Determinant Properties: Row Rules, Proofs, Examples

Determinants obey a small set of powerful rules that let you simplify a determinant before computing it, instead of the full expansion. Headline rules: swapping two rows flips the sign; multiplying one row by k multiplies the whole determinant by k; adding a multiple of one row to another leaves the determinant unchanged.

These properties matter because they turn determinant calculation from heavy arithmetic into clever row operations. The "add a multiple of one row to another" rule is the engine of Gaussian elimination: create zeros, then expand along that row so most terms vanish. Every fast determinant computation runs on these properties.

Key Concepts

• Row swap: interchanging two rows (or columns) multiplies the determinant by −1.
• Row scaling: multiplying a single row by k multiplies the determinant by k: |k·R_1, R_2, R_3| = k·|R_1, R_2, R_3|.
• Row addition (invariance): replacing R_i with R_i + k·R_j does not change the determinant — the most-used simplification rule.
• Zero/proportional rows: a zero row, or two identical or proportional rows, makes the determinant 0.
• Product: det(AB) = det(A)·det(B); hence det(A^−1) = 1/det(A) when A is invertible.

Formulas

• Swap: det after swapping rows i and j = −det before. Swapping twice restores the original.
• Scalar matrix: det(kA) = k^n·det(A) for an n × n matrix — the k comes out of EVERY row, not just once. For 3 × 3, det(2A) = 8·det(A).
• Row-addition invariance: det(R_1 + kR_2, R_2, R_3) = det(R_1, R_2, R_3). Proof sketch: the determinant is linear in each row, and the extra term det(kR_2, R_2, R_3) = k·det(R_2, R_2, R_3) = 0 by the repeated-row rule.

Worked Example

Evaluate |[[1, 2, 3], [4, 5, 6], [7, 8, 9]]| using row operations.

1. Spot the pattern: row 2 − row 1 = [3, 3, 3] and row 3 − row 2 = [3, 3, 3] — the rows are evenly spaced, hinting at dependence.
2. Operation 1: R_2 → R_2 − 4R_1: new row 2 = [4−4, 5−8, 6−12] = [0, −3, −6]. Determinant unchanged.
3. Operation 2: R_3 → R_3 − 7R_1: new row 3 = [7−7, 8−14, 9−21] = [0, −6, −12]. Determinant unchanged.
4. Proportional rows: row 3 = [0, −6, −12] = 2 × [0, −3, −6] = 2 × row 2. Two proportional rows → determinant = 0.
5. Result: det = 0, so the matrix is singular. Quick check: row 1 + row 3 = [8, 10, 12] = 2 × row 2 confirms dependence.

Common Misconceptions

• "det(kA) = k·det(A)." Only for 1 × 1. For n × n it is k^n — students lose marks on this constantly.
• "det(A + B) = det(A) + det(B)." False in general. The determinant is not linear across matrix addition — try [[1,0],[0,1]] + [[1,0],[0,1]]: det = 4, but 1 + 1 = 2.
• "Adding a multiple of a row to another changes the determinant." It does not — that is the whole point of the invariance rule, and confusing it with row scaling is the classic error.

Real-World Applications

• Gaussian elimination: solving AX = B by row operations tracks determinant changes with these exact rules to test solvability.
• Eigenvalue computation: solving det(A − λI) = 0 uses row operations to simplify the characteristic determinant before expanding.
• Testing linear dependence: a zero determinant instantly reveals that vectors or equations are redundant — used in data analysis to spot duplicate features.

Row swaps flip the sign, single-row scaling scales the determinant, and adding a multiple of one row to another changes nothing — while identical or proportional rows force it to zero. The k^n rule for det(kA) completes the toolkit for smart elimination.