Kunze Linear Algebra · Problem 5.2.10

Determinants

Mathematics — Methods · rank-determinants

Problem

Let FF be a field, AA a 2×32 \times 3 matrix over FF, and (c1,c2,c3)(c_1, c_2, c_3) the vector in F3F^3 defined by c1=∣A12A13A22A23∣,c2=∣A13A11A23A21∣,c3=∣A11A12A21A22∣.c_1 = \begin{vmatrix}A_{12} & A_{13}\\ A_{22} & A_{23}\end{vmatrix}, \quad c_2 = \begin{vmatrix}A_{13} & A_{11}\\ A_{23} & A_{21}\end{vmatrix}, \quad c_3 = \begin{vmatrix}A_{11} & A_{12}\\ A_{21} & A_{22}\end{vmatrix}. Show that ((a)) rank(A)=2\text{rank}(A) = 2 if and only if (c1,c2,c3)≠0(c_1, c_2, c_3) \neq 0; ((b)) if AA has rank 22, then (c1,c2,c3)(c_1, c_2, c_3) is a basis for the solution space of the system of equations AX=0AX = 0.
Intuitive explanation

The vector (c1,c2,c3)(c_1, c_2, c_3) is built from all possible 2×22 \times 2 minors of AA—these capture the "obstruction" to AA having full rank. The key insight is that AA has rank 2 exactly when at least one minor is nonzero, and when that happens, this vector encodes the left nullspace of AA: it's orthogonal to every row of AA, making it a natural candidate for solving AX=0AX = 0. Verifying the orthogonality and dimension will establish both parts.

Intuitive explanation

The vector (c1,c2,c3)(c_1, c_2, c_3) is built from all possible 2×22 \times 2 minors of AA—these capture the "obstruction" to AA having full rank. The key insight is that AA has rank 2 exactly when at least one minor is nonzero, and when that happens, this vector encodes the left nullspace of AA: it's orthogonal to every row of AA, making it a natural candidate for solving AX=0AX = 0. Verifying the orthogonality and dimension will establish both parts.

Browse the problem library