Skip to content

5.2-final-2001-spring

Final Exam, 2001 (spring) · Section 5.2: Computing and Using Determinants Source: finalexam_1.pdf, p. 62

Problem

3. (15pts.) Let

\[ A_n = \begin{bmatrix} a_1 & -1 & 0 & 0 & \cdots & 0 \\ 1 & a_2 & -1 & 0 & \cdots & 0 \\ 0 & 1 & a_3 & -1 & \cdots & 0 \\ \vdots & & \ddots & \ddots & \ddots & \vdots \\ 0 & 0 & \cdots & 1 & a_{n-1} & -1 \\ 0 & 0 & \cdots & 0 & 1 & a_n \end{bmatrix}. \]

(a) Show for \(n \geq 3\) that \(\det A_n = a_n \det A_{n-1} + \det A_{n-2}\).

(b) Calculate \(\det A_6\) for the cases that (i) \(a_j = j\) for all \(j = 1, \dots, 6\), and (ii) \(a_j = 6 - j\), for all \(j = 1, \dots, 6\).

Solution (a) Expand \(\det A_n\) along the last row \([0, \dots, 0, 1, a_n]\). The cofactor of \(a_n\) is \(\det A_{n-1}\). The cofactor of the 1 in position \((n, n-1)\) is \((-1)^{2n-1}\) times the determinant of the matrix obtained by deleting row \(n\) and column \(n-1\); that matrix has last column \((0, \dots, 0, -1)\), so expanding along that column gives \(-\det A_{n-2}\). Hence the second term contributes \(+ \det A_{n-2}\): \[ \det A_n = a_n \det A_{n-1} + \det A_{n-2}. \] (b) (i) \(a_j = j\): \(\det A_1 = 1\), \(\det A_2 = 1 \cdot 2 + 1 = 3\), \[ \det A_3 = 3 \cdot 3 + 1 = 10, \quad \det A_4 = 4 \cdot 10 + 3 = 43, \quad \det A_5 = 5 \cdot 43 + 10 = 225, \] \[ \det A_6 = 6 \cdot 225 + 43 = 1393. \] (ii) \(a_j = 6 - j\): \(a_1, \dots, a_6 = 5, 4, 3, 2, 1, 0\). \(\det A_1 = 5\), \(\det A_2 = 4 \cdot 5 + 1 = 21\), \[ \det A_3 = 3 \cdot 21 + 5 = 68, \quad \det A_4 = 2 \cdot 68 + 21 = 157, \quad \det A_5 = 1 \cdot 157 + 68 = 225, \] \[ \det A_6 = 0 \cdot 225 + 157 = 157. \]

Keywords: determinant, tridiagonal matrix, recurrence, cofactor expansion