Chapter 13

Determinants

[14/100%]
Show
LaTeX
Problem 13.1

Let

A=(a11a12a13a14a21a22a23a24a31a32a33a34a41a42a43a44). \mathbf{A} = \left(\begin{smallmatrix} a_{11} & a_{12} & a_{13} & \boxed {a_{14}} \\ \boxed {a_{21}} & a_{22} & a_{23} & a_{24} \\ a_{31} & a_{32} & \boxed {a_{33}} & a_{34} \\ a_{41} & \boxed {a_{42}} & a_{43} & a_{44} \end{smallmatrix}\right) .
?
(a)

Write out all of the pairs that can be formed from the four boxed elements of A\mathbf{A}.

(b)

Indicate which of the pairs from Part (a) are positive and which are negative.

(c)

Use the formula

σn(1,i1;…;n,in)=σn(i1,1;…;in,n)=ϕn(i1,…,in) \sigma _{n}(1, i_{1}; \ldots ; n, i_{n}) = \sigma _{n}(i_{1}, 1; \ldots ; i_{n}, n) = \phi _{n}(i_{1}, \ldots , i_{n})

(in which i1,…,ini_{1}, \ldots , i_{n} represents an arbitrary permutation of the first nn positive integers) to compute the number of pairs from Part (a) that are negative, and check that the result of this computation is consistent with your answer to Part (b).

Problem 13.2

Consider the n×nn \times n matrix

A=(x+λx…xxx+λx⋮⋱xxx+λ). \mathbf{A} = \left(\begin{smallmatrix} x+\lambda & x & \ldots & x \\ x & x+\lambda & & x \\ \vdots & & \ddots & \\ x & x & & x+\lambda \end{smallmatrix}\right) .

``Recall'' that

∣S∣=∣R∣(*) \left|\mathbf{S}\right| = \left|\mathbf{R}\right| \tag {*}

for any n×nn \times n matrix R\mathbf{R} and for any matrix S\mathbf{S} formed from R\mathbf{R} by adding to any one of its rows or columns, scalar multiples of one or more other rows or columns; and use this result to show that

∣A∣=λn−1(nx+λ). \left|\mathbf{A}\right| = \lambda ^{n-1}(nx+\lambda ) .
?
Problem 13.3

Let A\mathbf{A} represent an n×nn \times n nonsingular matrix. Show that if the elements of A\mathbf{A} and A−1\mathbf{A}^{-1} are all integers, then ∣A∣=±1\left|\mathbf{A}\right| = \pm 1.

?
Problem 13.4

Let T\mathbf{T} represent an m×mm \times m matrix, U\mathbf{U} an m×nm \times n matrix, V\mathbf{V} an n×mn \times m matrix, and W\mathbf{W} an n×nn \times n matrix. Show that if T\mathbf{T} is nonsingular, then

∣VWTU∣=∣UTWV∣=(−1)mn∣T∣∣W−VT−1U∣. \begin{vmatrix} \mathbf{V} & \mathbf{W} \\ \mathbf{T} & \mathbf{U} \end{vmatrix} = \begin{vmatrix} \mathbf{U} & \mathbf{T} \\ \mathbf{W} & \mathbf{V} \end{vmatrix} = (-1)^{mn}\left|\mathbf{T}\right|\left|\mathbf{W} - \mathbf{V}\mathbf{T}^{-1}\mathbf{U}\right|.
?
Problem 13.5

Compute the determinant of the n×nn \times n matrix A={aij}\mathbf{A} = \{ a_{ij}\} in the special case where n=4n = 4 and

A=(040510−12030−200−60). \mathbf{A} = \left(\begin{smallmatrix} 0 & 4 & 0 & 5 \\ 1 & 0 & -1 & 2 \\ 0 & 3 & 0 & -2 \\ 0 & 0 & -6 & 0 \end{smallmatrix}\right) .

Do so in each of the following two ways:

?
(a)

by finding and summing the nonzero terms in the expression

∑(−1)ϕn(j1,…,jn)a1j1⋯anjnor∑(−1)ϕn(i1,…,in)ai11⋯ainn, \sum (-1)^{\phi _{n}(j_{1}, \ldots , j_{n})} a_{1j_{1}} \cdots a_{nj_{n}} \quad \text{or} \quad \sum (-1)^{\phi _{n}(i_{1}, \ldots , i_{n})} a_{i_{1}1} \cdots a_{i_{n}n},

(where j1,…,jnj_{1}, \ldots , j_{n} or i1,…,ini_{1}, \ldots , i_{n} is a permutation of the first nn positive integers and the summation is over all such permutations);

(b)

by repeated expansion in terms of cofactors---use the (general) formula

∣A∣=∑j=1naijαijor∣A∣=∑i=1naijαij \left|\mathbf{A}\right| = \sum _{j=1}^{n} a_{ij}\alpha _{ij} \quad \text{or} \quad \left|\mathbf{A}\right| = \sum _{i=1}^{n} a_{ij}\alpha _{ij}

(where ii or jj, respectively, is any integer between 1 and nn inclusive and where αij\alpha_{ij} is the cofactor of aija_{ij}) to expand ∣A∣\left|\mathbf{A}\right| (in the special case) in terms of the determinants of 3×33 \times 3 matrices, to expand the determinants of the 3×33 \times 3 matrices in terms of the determinants of 2×22 \times 2 matrices, and finally to expand the determinants of the 2×22 \times 2 matrices in terms of the determinants of 1×11 \times 1 matrices.

Problem 13.6

Let A={aij}\mathbf{A} = \{ a_{ij}\} represent an n×nn \times n matrix. Verify that if A\mathbf{A} is symmetric, then the matrix of cofactors (of A\mathbf{A}) is also symmetric.

?
Problem 13.7

Let A\mathbf{A} represent an n×nn \times n matrix.

?
(a)

Show that if A\mathbf{A} is singular, then adj⁡(A)\operatorname {adj}(\mathbf{A}) is singular.

(b)

Show that det⁡(adj⁡(A))=[det⁡(A)]n−1\operatorname {det}\left(\operatorname {adj}(\mathbf{A})\right) = [\operatorname {det}\left(\mathbf{A}\right)]^{n-1}.

Problem 13.8

For any n×nn \times n nonsingular matrix A\mathbf{A},

A−1=(1/∣A∣)adj⁡(A).(*) \mathbf{A}^{-1} = (1/\left|\mathbf{A}\right|) \operatorname {adj}(\mathbf{A}). \tag {*}

Use formula (*) to verify that, for any 2×22 \times 2 nonsingular matrix A=(a11a12a21a22)\mathbf{A} = \left(\begin{smallmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{smallmatrix}\right),

A−1=(1/k)(a22−a12−a21a11),(**) \mathbf{A}^{-1} = (1/k) \left(\begin{smallmatrix} a_{22} & -a_{12} \\ -a_{21} & a_{11} \end{smallmatrix}\right), \tag {**}

where k=a11a22−a12a21k = a_{11}a_{22} - a_{12}a_{21}.

?
Problem 13.9

Let

A=(20−1−1310−45). \mathbf{A} = \left(\begin{smallmatrix} 2 & 0 & -1 \\ -1 & 3 & 1 \\ 0 & -4 & 5 \end{smallmatrix}\right) .
?
(a)

Compute the cofactor of each element of A\mathbf{A}.

(b)

Compute ∣A∣\left|\mathbf{A}\right| by expanding ∣A∣\left|\mathbf{A}\right| in terms of the cofactors of the elements of the second row of A\mathbf{A}, and then check your answer by expanding ∣A∣\left|\mathbf{A}\right| in terms of the cofactors of the elements of the second column of A\mathbf{A}.

(c)

Use formula (*) of Exercise 8 to compute A−1\mathbf{A}^{-1}.

Problem 13.10

Let A={aij}\mathbf{A} = \{ a_{ij}\} represent an n×nn \times n matrix (where n≥2n \geq 2), and let αij\alpha_{ij} represent the cofactor of aija_{ij}.

?
(a)

Show [by, for instance, making use of the result of Part (b) of Exercise 11.3] that if rk⁡(A)=n−1\operatorname {rk}\left(\mathbf{A}\right) = n-1, then there exists a scalar cc such that adj⁡(A)=cxy′\operatorname {adj}(\mathbf{A}) = c\mathbf{x}\mathbf{y}', where x={xj}\mathbf{x} = \{ x_{j}\} and y={yi}\mathbf{y} = \{ y_{i}\} are any nonnull nn-dimensional column vectors such that Ax=0\mathbf{A}\mathbf{x} = \mathbf{0} and A′y=0\mathbf{A}'\mathbf{y} = \mathbf{0}. Show also that cc is nonzero and is expressible as c=αij/(yixj)c = \alpha_{ij}/(y_{i}x_{j}) for any ii and jj such that yi≠0y_{i} \neq 0 and xj≠0x_{j} \neq 0.

(b)

Show that if rk⁡(A)≤n−2\operatorname {rk}\left(\mathbf{A}\right) \leq n-2, then adj⁡(A)=0\operatorname {adj}(\mathbf{A}) = \mathbf{0}.

Problem 13.11

Let A\mathbf{A} represent an n×nn \times n nonsingular matrix and b\mathbf{b} an n×1n \times 1 vector. Show that the solution to the linear system Ax=b\mathbf{A}\mathbf{x} = \mathbf{b} (in x\mathbf{x}) is the n×1n \times 1 vector whose jjth component is

∣Aj∣/∣A∣, \left|\mathbf{A}_{j}\right| / \left|\mathbf{A}\right|,

where Aj\mathbf{A}_{j} is a matrix formed from A\mathbf{A} by substituting b\mathbf{b} for the jjth column of A\mathbf{A} (j=1,…,nj = 1, \ldots , n).

?
Remark.
?

This result is called Cramer's rule, after Gabriel Cramer (1704--1752).

Problem 13.12

Let cc represent a scalar, let x\mathbf{x} and y\mathbf{y} represent n×1n \times 1 vectors, and let A\mathbf{A} represent an n×nn \times n matrix.

?
(a)

Show that

∣Ayx′c∣=c∣A∣−x′adj⁡(A)y.(E.1) \begin{vmatrix} \mathbf{A} & \mathbf{y} \\ \mathbf{x}' & c \end{vmatrix} = c\left|\mathbf{A}\right| - \mathbf{x}'\operatorname {adj}(\mathbf{A})\mathbf{y}. \tag {E.1}
(b)

Show that, in the special case where A\mathbf{A} is nonsingular, result (E.1) can be reexpressed as

∣Ayx′c∣=∣A∣(c−x′A−1y), \begin{vmatrix} \mathbf{A} & \mathbf{y} \\ \mathbf{x}' & c \end{vmatrix} = \left|\mathbf{A}\right|(c - \mathbf{x}'\mathbf{A}^{-1}\mathbf{y}),

in agreement with the more general result that, for any n×nn \times n nonsingular matrix T\mathbf{T}, n×mn \times m matrix U\mathbf{U}, m×nm \times n matrix V\mathbf{V}, and m×mm \times m matrix W\mathbf{W},

∣TUVW∣=∣WVUT∣=∣T∣∣W−VT−1U∣.(*) \begin{vmatrix} \mathbf{T} & \mathbf{U} \\ \mathbf{V} & \mathbf{W} \end{vmatrix} = \begin{vmatrix} \mathbf{W} & \mathbf{V} \\ \mathbf{U} & \mathbf{T} \end{vmatrix} = \left|\mathbf{T}\right|\left|\mathbf{W} - \mathbf{V}\mathbf{T}^{-1}\mathbf{U}\right|. \tag {*}
Problem 13.13

Let Vk\mathbf{V}_{k} represent the (n−1)×(n−1)(n-1) \times (n-1) submatrix of the n×nn \times n Vandermonde matrix

V=(1x1x12…x1n−11x2x22…x2n−1⋮⋮⋮⋮1xnxn2…xnn−1) \mathbf{V} = \left(\begin{smallmatrix} 1 & x_{1} & x_{1}^{2} & \ldots & x_{1}^{n-1} \\ 1 & x_{2} & x_{2}^{2} & \ldots & x_{2}^{n-1} \\ \vdots & \vdots & \vdots & & \vdots \\ 1 & x_{n} & x_{n}^{2} & \ldots & x_{n}^{n-1} \end{smallmatrix}\right)

(where x1,x2,…,xnx_{1}, x_{2}, \ldots , x_{n} are arbitrary scalars) obtained by striking out the kkth row and the nnth (last) column (of V\mathbf{V}). Show that

∣V∣=∣Vk∣(−1)n−k∏i≠k(xk−xi). \left|\mathbf{V}\right| = \left|\mathbf{V}_{k}\right|(-1)^{n-k} \prod _{i \neq k} (x_{k} - x_{i}).
?
Problem 13.14

Show that, for n×nn \times n matrices A\mathbf{A} and B\mathbf{B},

adj⁡(AB)=adj⁡(B)adj⁡(A). \operatorname {adj}(\mathbf{A}\mathbf{B}) = \operatorname {adj}(\mathbf{B})\operatorname {adj}(\mathbf{A}).
?
Remark.
?

Use the Binet-Cauchy formula to establish that the ijijth element of adj⁡(AB)\operatorname {adj}(\mathbf{A}\mathbf{B}) equals the ijijth element of adj⁡(B)adj⁡(A)\operatorname {adj}(\mathbf{B})\operatorname {adj}(\mathbf{A}).