5.2-final-2001-spring-conflict¶
Final Exam (Conflict), 2001 (spring-conflict) · Section 5.2: Computing and Using Determinants Source: finalexam_1.pdf, p. 72
Problem¶
2. (15pts.) Let \(A_n\) be the \(n \times n\) matrix
\[
A_n = \begin{bmatrix}
1 & 2 & 0 & \cdots & 0 & 0 \\
2 & 1 & 2 & \cdots & 0 & 0 \\
0 & 2 & 1 & \cdots & 0 & 0 \\
\vdots & \vdots & \vdots & \ddots & \vdots & \vdots \\
0 & 0 & 0 & \cdots & 1 & 2 \\
0 & 0 & 0 & \cdots & 2 & 1
\end{bmatrix}.
\]
Prove that for \(n \geq 3\), \(\det(A_n) = \det(A_{n-1}) - 4 \det(A_{n-2})\), and evaluate \(\det(A_5)\).
Solution
Expand \(\det(A_n)\) along the first row \([1, 2, 0, \dots, 0]\): \(\det(A_n) = \det(A_{n-1}) - 2\det(M)\), where \(M\) is obtained by deleting row 1 and column 2: \[ M = \begin{bmatrix} 2 & 2 & 0 & \cdots & 0 \\ 0 & 1 & 2 & \cdots & 0 \\ 0 & 2 & 1 & \cdots & 0 \\ \vdots & & & \ddots & \vdots \\ 0 & \cdots & 0 & 2 & 1 \end{bmatrix}. \] Expanding \(\det(M)\) along its first row \([2, 2, 0, \dots, 0]\): the first cofactor is \(\det(A_{n-2})\) (the matrix with 1 on the diagonal and 2 on the neighboring diagonals), and the second cofactor has a column of zeros, so its determinant is 0. Thus \(\det(M) = 2\det(A_{n-2})\), and \[ \det(A_n) = \det(A_{n-1}) - 4\det(A_{n-2}). \] Base cases: \(\det(A_1) = 1\), \(\det(A_2) = \begin{vmatrix} 1 & 2 \\ 2 & 1 \end{vmatrix} = -3\). Then \[ \det(A_3) = -3 - 4 = -7, \qquad \det(A_4) = -7 - 4(-3) = 5, \] \[ \det(A_5) = 5 - 4(-7) = 33. \]Keywords: determinant, tridiagonal matrix, recurrence, cofactor expansion