# 3.1: The Cofactor Expansion

## The Cofactor Expansion

In Section [sec:2_4] we defined the determinant of a (2 imes 2) matrix (A = leftBegin{array}{cc}a & b c & dend{array} ightB) as follows:1 [func{det } A = left| egin{array}{cc}a & b c & dend{array} ight| = ad - bc] and showed (in Example [exa:004261]) that (A) has an inverse if and only if det (A eq 0). One objective of this chapter is to do this for any square matrix A. There is no difficulty for (1 imes 1) matrices: If (A = leftB a ightB), we define (func{det} A = func{det} leftB a ightB = a) and note that (A) is invertible if and only if (a eq 0).

If (A) is (3 imes 3) and invertible, we look for a suitable definition of (func{det } A) by trying to carry (A) to the identity matrix by row operations. The first column is not zero ((A) is invertible); suppose the (1, 1)-entry (a) is not zero. Then row operations give [A = leftB egin{array}{ccc}a & b & c d & e & f g & h & iend{array} ightB ightarrowleftB egin{array}{ccc}a & b & c ad & ae & af ag & ah & aiend{array} ightB ightarrowleftB egin{array}{ccc}a & b & c & ae-bd & af-cd & ah-bg & ai-cgend{array} ightB=leftB egin{array}{ccc}a & b & c & u & af-cd & v & ai-cgend{array} ightB] where (u = ae - bd) and (v = ah - bg). Since (A) is invertible, one of (u) and (v) is nonzero (by Example [exa:004627]); suppose that (u eq 0). Then the reduction proceeds [A ightarrow leftB egin{array}{ccc}a & b & c & u & af-cd & v & ai-cgend{array} ightB ightarrowleftB egin{array}{ccc}a & b & c & u & af-cd & uv & u(ai-cg)end{array} ightB ightarrowleftB egin{array}{ccc}a & b & c & u & af-cd & 0 & wend{array} ightB] where (w = u(ai - cg)- v(af - cd) = a(aei + bfg + cdh - ceg - afh - bdi)). We define [label{eq:detdefinition}func{det } A = aei + bfg + cdh - ceg - afh - bdi] and observe that (func{det } A eq 0) because (a func{det } A = w eq 0) (is invertible).

To motivate the definition below, collect the terms in Equation [eq:detdefinition] involving the entries (a), (b), and (c) in row 1 of (A): [egin{aligned}func{det } A = left| egin{array}{ccc}a & b & c d & e & f g & h & iend{array} ight| &= aei + bfg + cdh - ceg - afh - bdi &= a (ei-fh) - b(di-fg) + c(dh-eg) &= a left| egin{array}{cc}e & f h & iend{array} ight| - b left| egin{array}{cc}d & f g & iend{array} ight|+ c left| egin{array}{cc}d & e g & hend{array} ight|end{aligned}] This last expression can be described as follows: To compute the determinant of a (3 imes 3) matrix (A), multiply each entry in row 1 by a sign times the determinant of the (2 imes2) matrix obtained by deleting the row and column of that entry, and add the results. The signs alternate down row 1, starting with (+). It is this observation that we generalize below.

007706 [egin{aligned}func{det}leftB egin{array}{rrr}2 & 3 & 7 -4 & 0 & 6 1 & 5 & 0end{array} ightB&= 2 left| egin{array}{rr}0 & 6 5 & 0end{array} ight|- 3 left| egin{array}{rr}-4 & 6 1 & 0end{array} ight|+ 7 left| egin{array}{rr}-4 & 0 1 & 5end{array} ight| &= 2 (-30) - 3(-6) + 7(-20) &= -182end{aligned}]

This suggests an inductive method of defining the determinant of any square matrix in terms of determinants of matrices one size smaller. The idea is to define determinants of (3 imes 3) matrices in terms of determinants of (2 imes 2) matrices, then we do (4 imes 4) matrices in terms of (3 imes 3) matrices, and so on.

To describe this, we need some terminology.

Cofactors of a Matrix007711 Assume that determinants of ((n - 1) imes (n - 1)) matrices have been defined. Given the (n imes n) matrix (A), let [A_{ij} mbox{ denote the } (n - 1) imes (n - 1) mbox{ matrix obtained from } A mbox{ by deleting row } i mbox{ and column } j.] Then the ((i,j))-cofactor (c_{ij}(A)) is the scalar defined by [c_{ij}(A) = (-1)^{i+j} func{det}(A_{ij})] Here ((-1)^{i+j}) is called the sign of the ((i, j))-position.

The sign of a position is clearly (1) or (-1), and the following diagram is useful for remembering it: [leftB egin{array}{ccccc}+ & - & + & - & cdots - & + & - & + & cdots + & - & + & - & cdots - & + & - & + & cdots vdots & vdots & vdots & vdots & end{array} ightB] Note that the signs alternate along each row and column with (+) in the upper left corner.

007723 Find the cofactors of positions ((1, 2), (3, 1)), and ((2, 3)) in the following matrix. [A = leftB egin{array}{rrr}3 & -1 & 6 5 & 2 & 7 8 & 9 & 4end{array} ightB]

Here (A_{12}) is the matrix (leftB egin{array}{rr}5 & 7 8 & 4end{array} ightB) that remains when row (1) and column (2) are deleted. The sign of position ((1, 2)) is ((-1)^{1+2} = -1) (this is also the ((1, 2))-entry in the sign diagram), so the ((1, 2))-cofactor is [c_{12}(A) = (-1)^{1+2} left| egin{array}{rr}5 & 7 8 & 4end{array} ight|=(-1)(5 cdot 4 - 7 cdot 8) = (-1)(-36)=36] Turning to position ((3, 1)), we find [c_{31}(A) = (-1)^{3+1}A_{31}= (-1)^{3+1} left| egin{array}{rr}-1 & 6 2 & 7end{array} ight|=(+1)(-7-12)=-19] Finally, the ((2, 3))-cofactor is [c_{23}(A) = (-1)^{2+3}A_{23}= (-1)^{2+3} left| egin{array}{rr}3 & -1 8 & 9end{array} ight|=(-1)(27+8)=-35] Clearly other cofactors can be found—there are nine in all, one for each position in the matrix.

We can now define (func{det } A) for any square matrix (A)

Cofactor expansion of a Matrix007740 Assume that determinants of ((n - 1) imes (n - 1)) matrices have been defined. If (A = leftB a_{ij} ightB) is (n imes n) define [func{det } A = a_{11}c_{11}(A) + a_{12}c_{12}(A) + cdots + a_{1n}c_{1n}(A)] This is called the cofactor expansion of (func{det } A) along row (1).

It asserts that (func{det } A) can be computed by multiplying the entries of row (1) by the corresponding cofactors, and adding the results. The astonishing thing is that (func{det } A) can be computed by taking the cofactor expansion along any row or column: Simply multiply each entry of that row or column by the corresponding cofactor and add.

Cofactor Expansion Theorem007747 The determinant of an (n imes n) matrix (A) can be computed by using the cofactor expansion along any row or column of (A). That is (func{det } A) can be computed by multiplying each entry of the row or column by the corresponding cofactor and adding the results.

The proof will be given in Section [sec:3_6].

007753 Compute the determinant of (A = leftB egin{array}{rrr}3 & 4 & 5 1 & 7 & 2 9 & 8 & -6end{array} ightB).

The cofactor expansion along the first row is as follows: [egin{aligned}func{det } A &= 3c_{11}(A) + 4c_{12}(A) + 5c_{13}(A) &= 3 left| egin{array}{rr}7 & 2 8 & -6end{array} ight| - 4 left| egin{array}{rr}1 & 2 9 & -6end{array} ight| + 5left| egin{array}{rr}1 & 7 9 & 8end{array} ight| &= 3 (-58) - 4(-24) + 5(-55) &= -353end{aligned}] Note that the signs alternate along the row (indeed along any row or column). Now we compute (func{det } A) by expanding along the first column. [egin{aligned}func{det } A &= 3c_{11}(A) + 1c_{21}(A) + 9c_{31}(A) &= 3 left| egin{array}{rr}7 & 2 8 & -6end{array} ight| - left| egin{array}{rr}4 & 5 8 & -6end{array} ight| + 9left| egin{array}{rr}4 & 5 7 & 2end{array} ight| &= 3 (-58) - (-64) + 9(-27) &= -353end{aligned}] The reader is invited to verify that (func{det } A) can be computed by expanding along any other row or column.

The fact that the cofactor expansion along any row or column of a matrix (A) always gives the same result (the determinant of (A)) is remarkable, to say the least. The choice of a particular row or column can simplify the calculation.

007765 Compute (func{det } A) where (A = leftB egin{array}{rrrr}3 & 0 & 0 & 0 5 & 1 & 2 & 0 2 & 6 & 0 & -1 -6 & 3 & 1 & 0end{array} ightB).

The first choice we must make is which row or column to use in the cofactor expansion. The expansion involves multiplying entries by cofactors, so the work is minimized when the row or column contains as many zero entries as possible. Row (1) is a best choice in this matrix (column (4) would do as well), and the expansion is [egin{aligned}func{det } A &= 3c_{11}(A) + 0c_{12}(A) + 0c_{13}(A) + 0c_{14}(A) &= 3 left| egin{array}{rrr}1 & 2 & 0 6 & 0 & -1 3 & 1 & 0end{array} ight|end{aligned}] This is the first stage of the calculation, and we have succeeded in expressing the determinant of the (4 imes 4) matrix (A) in terms of the determinant of a (3 imes 3) matrix. The next stage involves this (3 imes 3) matrix. Again, we can use any row or column for the cofactor expansion. The third column is preferred (with two zeros), so [egin{aligned}func{det } A &= 3 left( 0 left| egin{array}{rr}6 & 0 3 & 1end{array} ight| - (-1)left| egin{array}{rr}1 & 2 3 & 1end{array} ight|+ 0left| egin{array}{rr}1 & 2 6 & 0end{array} ight| ight) &= 3 [ 0 + 1(-5) + 0] &= -15end{aligned}] This completes the calculation.

Computing the determinant of a matrix (A) can be tedious. For example, if (A) is a (4 imes 4) matrix, the cofactor expansion along any row or column involves calculating four cofactors, each of which involves the determinant of a (3 imes 3) matrix. And if (A) is (5 imes 5), the expansion involves five determinants of (4 imes 4) matrices! There is a clear need for some techniques to cut down the work.2

The motivation for the method is the observation (see Example [exa:007765]) that calculating a determinant is simplified a great deal when a row or column consists mostly of zeros. (In fact, when a row or column consists entirely of zeros, the determinant is zero—simply expand along that row or column.)

Recall next that one method of creating zeros in a matrix is to apply elementary row operations to it. Hence, a natural question to ask is what effect such a row operation has on the determinant of the matrix. It turns out that the effect is easy to determine and that elementary column operations can be used in the same way. These observations lead to a technique for evaluating determinants that greatly reduces the labour involved. The necessary information is given in Theorem [thm:007779].

007779 Let (A) denote an (n imes n) matrix.

1. If A has a row or column of zeros, (func{det } A = 0).

2. If two distinct rows (or columns) of (A) are interchanged, the determinant of the resulting matrix is (- func{det } A).

3. If a row (or column) of (A) is multiplied by a constant (u), the determinant of the resulting matrix is (u(func{det } A)).

4. If two distinct rows (or columns) of (A) are identical, (func{det } A = 0).

5. If a multiple of one row of (A) is added to a different row (or if a multiple of a column is added to a different column), the determinant of the resulting matrix is (func{det } A).

We prove properties 2, 4, and 5 and leave the rest as exercises.

Property 2. If (A) is (n imes n), this follows by induction on (n). If (n = 2), the verification is left to the reader. If (n > 2) and two rows are interchanged, let (B) denote the resulting matrix. Expand (func{det } A) and (func{det } B) along a row other than the two that were interchanged. The entries in this row are the same for both (A) and (B), but the cofactors in (B) are the negatives of those in (A) (by induction) because the corresponding ((n - 1) imes (n - 1)) matrices have two rows interchanged. Hence, (func{det } B = - func{det } A), as required. A similar argument works if two columns are interchanged.

Property 4. If two rows of (A) are equal, let (B) be the matrix obtained by interchanging them. Then (B = A), so (func{det } B = det A). But (func{det } B = -func{det } A) by property 2, so (func{det } A = func{det } B = 0). Again, the same argument works for columns.

Property 5. Let (B) be obtained from (A = leftB a_{ij} ightB) by adding (u) times row (p) to row (q). Then row (q) of (B) is [(a_{q1} + ua_{p1},a_{q2} + ua_{p2}, dots , a_{qn} + ua_{pn})] The cofactors of these elements in (B) are the same as in (A) (they do not involve row (q)): in symbols, (c_{qj}(B) = c_{qj}(A)) for each (j). Hence, expanding (B) along row (q) gives [egin{aligned}func{det } B &= (a_{q1} + ua_{p1})c_{q1}(A) + (a_{q2} + ua_{p2})c_{q2}(A) + cdots + (a_{qn}+ua_{pn})c_{qn}(A) &= [a_{q1}c_{q1}(A) + a_{q2}c_{q2}(A) + cdots + a_{qn}c_{qn}(A)] + u[a_{p1}c_{q1}(A) + a_{p2}c_{q2}(A) + cdots + a_{pn}c_{qn}(A)] &= func{det } A + u func{det } Cend{aligned}] where (C) is the matrix obtained from (A) by replacing row (q) by row (p) (and both expansions are along row (q)). Because rows (p) and (q) of (C) are equal, (func{det } C = 0) by property 4. Hence, (func{det } B = func{det } A), as required. As before, a similar proof holds for columns.

To illustrate Theorem [thm:007779], consider the following determinants.

lX[2] (left|egin{array}{rrr}3 & -1 & 2 2 & 5 & 1 & 0 & 0end{array} ight| =0) & (because the last row consists of zeros)

(left| egin{array}{rrr}3 & -1 & 5 2 & 8 & 7 1 & 2 & -1end{array} ight| = - left| egin{array}{rrr}5 & -1 & 3 7 & 8 & 2 -1 & 2 & 1 end{array} ight|) & (because two columns are interchanged)

(left|egin{array}{rrr}8 & 1 & 2 3 & 0 & 9 1 & 2 & -1end{array} ight|= 3 left|egin{array}{rrr}8 & 1 & 2 1 & 0 & 3 1 & 2 & -1end{array} ight|) & (because the second row of the matrix on the left is (3) times the second row of the matrix on the right)

(left|egin{array}{rrr}2 & 1 & 2 4 & 0 & 4 1 & 3 & 1end{array} ight| =0) & (because two columns are identical)

(left|egin{array}{rrr}2 & 5 & 2 -1 & 2 & 9 3 & 1 & 1end{array} ight|= left|egin{array}{rrr}0 & 9 & 20 -1 & 2 & 9 3 & 1 & 1end{array} ight|) & (because twice the second row of the matrix on the left was added to the first row)

The following four examples illustrate how Theorem [thm:007779] is used to evaluate determinants.

007817 Evaluate (func{det } A) when (A = leftB egin{array}{rrr}1 & -1 & 3 1 & 0 & -1 2 & 1 & 6end{array} ightB).

The matrix does have zero entries, so expansion along (say) the second row would involve somewhat less work. However, a column operation can be used to get a zero in position ((2, 3))—namely, add column 1 to column 3. Because this does not change the value of the determinant, we obtain [func{det } A = left| egin{array}{rrr}1 & -1 & 3 1 & 0 & -1 2 & 1 & 6end{array} ight| = left| egin{array}{rrr}1 & -1 & 4 1 & 0 & 0 2 & 1 & 8end{array} ight|= - left| egin{array}{rr}-1 & 4 1 & 8end{array} ight|=12] where we expanded the second (3 imes 3) matrix along row 2.

007825 If (func{det} leftB egin{array}{rrr}a & b & c p & q & r x & y & zend{array} ightB = 6), evaluate (func{det } A) where (A = leftB egin{array}{ccc}a+x & b+y & c+z 3x & 3y & 3z -p & -q & -rend{array} ightB).

First take common factors out of rows 2 and 3. [func{det } A = 3(-1) func{det} leftB egin{array}{ccc}a+x & b+y & c+z x & y & z p & q & rend{array} ightB] Now subtract the second row from the first and interchange the last two rows. [func{det } A = -3 func{det} leftB egin{array}{ccc}a & b & c x & y & z p & q & rend{array} ightB= 3 func{det} leftB egin{array}{ccc}a & b & c p & q & r x & y & zend{array} ightB= 3 cdot 6 = 18]

The determinant of a matrix is a sum of products of its entries. In particular, if these entries are polynomials in (x), then the determinant itself is a polynomial in (x). It is often of interest to determine which values of (x) make the determinant zero, so it is very useful if the determinant is given in factored form. Theorem [thm:007779] can help.

007837 Find the values of (x) for which (func{det } A = 0), where (A = leftB egin{array}{ccc}1 & x & x x & 1 & x x & x & 1end{array} ightB).

To evaluate (func{det } A), first subtract (x) times row 1 from rows 2 and 3. [func{det } A = left| egin{array}{ccc}1 & x & x x & 1 & x x & x & 1end{array} ight|=left| egin{array}{ccc}1 & x & x & 1-x^2 & x-x^2 & x-x^2 & 1-x^2end{array} ight|=left| egin{array}{cc}1-x^2 & x-x^2 x-x^2 & 1-x^2end{array} ight|] At this stage we could simply evaluate the determinant (the result is (2x^3-3x^2+1)). But then we would have to factor this polynomial to find the values of (x) that make it zero. However, this factorization can be obtained directly by first factoring each entry in the determinant and taking a common factor of ((1-x)) from each row. [egin{aligned}func{det } A = left| egin{array}{cc}(1-x)(1+x) & x(1-x) x(1-x) & (1-x)(1+x)end{array} ight| &=(1-x)^2 left| egin{array}{cc}1+x & x x & 1+xend{array} ight| &= (1-x)^2(2x+1)end{aligned}] Hence, (func{det } A = 0) means ((1 - x)^2(2x + 1) = 0), that is (x = 1) or (x = -frac{1}{2}).

007851 If (a_1), (a_2), and (a_3) are given show that [func{det}leftB egin{array}{ccc}1 & a_1 & a_1^2 1 & a_2 & a_2^2 1 & a_3 & a_3^2end{array} ightB = (a_3-a_1)(a_3-a_2)(a_2-a_1)]

Begin by subtracting row 1 from rows 2 and 3, and then expand along column 1: [func{det} leftB egin{array}{ccc}1 & a_1 & a_1^2 1 & a_2 & a_2^2 1 & a_3 & a_3^2end{array} ightB = func{det} leftB egin{array}{ccc}1 & a_1 & a_1^2 & a_2-a_1 & a_2^2-a_1^2 & a_3-a_1 & a_3^2-a_1^2end{array} ightB= func{det} leftB egin{array}{cc}a_2-a_1 & a_2^2-a_1^2 a_3-a_1 & a_3^2-a_1^2end{array} ightB] Now ((a_2 - a_1)) and ((a_3 - a_1)) are common factors in rows 1 and 2, respectively, so [egin{aligned}func{det} leftB egin{array}{ccc}1 & a_1 & a_1^2 1 & a_2 & a_2^2 1 & a_3 & a_3^2end{array} ightB &= (a_2-a_1)(a_3-a_1)func{det} leftB egin{array}{cc}1& a_2+a_1 1 & a_3+a_1end{array} ightB &= (a_2-a_1)(a_3-a_1)(a_3-a_2)end{aligned}]

The matrix in Example [exa:007851] is called a Vandermonde matrix, and the formula for its determinant can be generalized to the (n imes n) case (see Theorem [thm:008552]).

If (A) is an (n imes n) matrix, forming (uA) means multiplying every row of (A) by (u). Applying property 3 of Theorem [thm:007779], we can take the common factor (u) out of each row and so obtain the following useful result.

007870 If A is an (n imes n) matrix, then (func{det}(uA) = u^n func{det } A) for any number (u).

The next example displays a type of matrix whose determinant is easy to compute.

007875 Evaluate (func{det } A) if (A = leftB egin{array}{rrrr}a & 0 & 0 & 0 u & b & 0 & 0 v & w & c & 0 x & y & z & dend{array} ightB).

Expand along row 1 to get (func{det } A = a left| egin{array}{rrr}b & 0 & 0 w & c & 0 y & z & dend{array} ight|). Now expand this along the top row to get (func{det } A = ab left| egin{array}{cc}c & 0 z & dend{array} ight| = abcd), the product of the main diagonal entries.

A square matrix is called a lower triangular matrix if all entries above the main diagonal are zero (as in Example [exa:007875]). Similarly, an upper triangular matrix is one for which all entries below the main diagonal are zero. A triangular matrix is one that is either upper or lower triangular. Theorem [thm:007885] gives an easy rule for calculating the determinant of any triangular matrix. The proof is like the solution to Example [exa:007875].

007885 If A is a square triangular matrix, then det A is the product of the entries on the main diagonal.

Theorem [thm:007885] is useful in computer calculations because it is a routine matter to carry a matrix to triangular form using row operations.

Block matrices such as those in the next theorem arise frequently in practice, and the theorem gives an easy method for computing their determinants. This dovetails with Example [exa:004627].

007890 Consider matrices (leftB egin{array}{cc}A & X & Bend{array} ightB) and (leftB egin{array}{cc}A & 0 Y & Bend{array} ightB) in block form, where (A) and (B) are square matrices. Then [func{det} leftB egin{array}{cc}A & X & Bend{array} ightB = func{det } A func{det } B mbox{ and }func{det} leftB egin{array}{cc}A & 0 Y & Bend{array} ightB = func{det } A func{det } B]

Write (T = func{det} leftB egin{array}{cc}A & X & Bend{array} ightB) and proceed by induction on (k) where (A) is (k imes k). If (k = 1), it is the cofactor expansion along column 1. In general let (S_i(T)) denote the matrix obtained from (T) by deleting row (i) and column 1. Then the cofactor expansion of (func{det } T) along the first column is [label{eq:cofexpdeterminant}func{det } T = a_{11}func{det}(S_1(T))-a_{21}func{det}(S_2(T)) + cdots pm a_{k1}func{det}(S_k(T))] where (a_{11}, a_{21}, cdots, a_{k1}) are the entries in the first column of (A). But (S_i(T) = leftB egin{array}{cc}S_i(A) & X_i & Bend{array} ightB) for each (i = 1, 2, cdots, k), so (func{det}(S_i(T)) = func{det}(S_i(A)) cdot func{det } B) by induction. Hence, Equation [eq:cofexpdeterminant] becomes [egin{aligned}func{det } T &= left{ a_{11}func{det}(S_1(T))-a_{21}func{det}(S_2(T)) + cdots pm a_{k1}func{det}(S_k(T)) ight} func{det } B &= left{ func{det } A ight} func{det } Bend{aligned}] as required. The lower triangular case is similar.

007910 [func{det} leftB egin{array}{rrrr}2 & 3 & 1 & 3 1 & -2 & -1 & 1 & 1 & 0 & 1 & 4 & 0 & 1end{array} ightB=- left| egin{array}{rrrr}2 & 1 & 3 & 3 1 & -1 & -2 & 1 & 0 & 1 & 1 & 0 & 4 & 1end{array} ight|=-left| egin{array}{rr}2 & 1 1 & -1end{array} ight|left| egin{array}{rr}1 & 1 4 & 1end{array} ight|= - (-3)(-3) = -9]

The next result shows that (func{det } A) is a linear transformation when regarded as a function of a fixed column of (A). The proof is Exercise [ex:3_1_21].

007914 Given columns (vect{c}_{1}, cdots , vect{c}_{j-1}, vect{c}_{j+1}, cdots , vect{c}_{n}) in (RR^n), define (T: RR^n o RR) by [T(vect{x}) = func{det} leftBegin{array}{ccccccc}vect{c}_1 & cdots & vect{c}_{j-1} & vect{x} & vect{c}_{j+1} & cdots & vect{c}_nend{array} ightBmbox{ for all } vect{x} mbox{ in } RR^n] Then, for all (vect{x}) and (vect{y}) in (RR^n) and all (a) in (RR), [T(vect{x}+vect{y})= T(vect{x}) + T(vect{y}) quad mbox{ and } quad T(avect{x}) = aT(vect{x})]

## Exercises for 1

solutions

2

Compute the determinants of the following matrices.

(leftB egin{array}{rr}2 & -1 3 & 2end{array} ightB) (leftB egin{array}{rr}6 & 9 8 & 12end{array} ightB) (leftB egin{array}{rr}a^2 & ab ab & b^2end{array} ightB) (leftB egin{array}{cc}a+1 & a a & a-1end{array} ightB) (leftB egin{array}{rr}cos heta & -sin heta sin heta & cos hetaend{array} ightB) (leftB egin{array}{rrr}2 & 0 & -3 1 & 2 & 5 & 3 & 0end{array} ightB) (leftB egin{array}{rrr}1 & 2 & 3 4 & 5 & 6 7 & 8 & 9end{array} ightB) (leftB egin{array}{rrr}0 & a & 0  & c & d & e & 0end{array} ightB) (leftB egin{array}{rrr}1 & b & c  & c & 1 c & 1 & bend{array} ightB) (leftB egin{array}{rrr}0 & a & b a & 0 & c  & c & 0end{array} ightB) (leftB egin{array}{rrrr}0 & 1 & -1 & 0 3 & 0 & 0 & 2 & 1 & 2 & 1 5 & 0 & 0 & 7end{array} ightB) (leftB egin{array}{rrrr}1 & 0 & 3 & 1 2 & 2 & 6 & 0 -1 & 0 & -3 & 1 4 & 1 & 12 & 0end{array} ightB) (leftB egin{array}{rrrr}3 & 1 & -5 & 2 1 & 3 & 0 & 1 1 & 0 & 5 & 2 1 & 1 & 2 & -1end{array} ightB) (leftB egin{array}{rrrr}4 & -1 & 3 & -1 3 & 1 & 0 & 2 & 1 & 2 & 2 1 & 2 & -1 & 1end{array} ightB) (leftB egin{array}{rrrr}1 & -1 & 5 & 5 3 & 1 & 2 & 4 -1 & -3 & 8 & 0 1 & 1 & 2 & -1end{array} ightB) (leftB egin{array}{rrrr}0 & 0 & 0 & a & 0 & b & p & c & q & k d & s & t & uend{array} ightB)

1. (0)

2. (-1)

3. (-39)

4. (0)

5. (2abc)

6. (0)

7. (-56)

8. (abcd)

Show that (func{det } A = 0) if (A) has a row or column consisting of zeros.

Show that the sign of the position in the last row and the last column of (A) is always (+1).

Show that (func{det } I = 1) for any identity matrix (I).

Evaluate the determinant of each matrix by reducing it to upper triangular form.

(leftB egin{array}{rrr}1 & -1 & 2 3 & 1 & 1 2 & -1 & 3end{array} ightB) (leftB egin{array}{rrr}-1 & 3 & 1 2 & 5 & 3 1 & -2 & 1end{array} ightB) (leftB egin{array}{rrrr}-1 & -1 & 1 & 0 2 & 1 & 1 & 3 & 1 & 1 & 2 1 & 3 & -1 & 2end{array} ightB) (leftB egin{array}{rrrr}2 & 3 & 1 & 1 & 2 & -1 & 3 & 5 & 1 & 1 1 & 1 & 2 & 5end{array} ightB)

1. (-17)

2. (106)

Evaluate by cursory inspection:

1. (func{det} leftB egin{array}{ccc}a & b & c a+1 & b+1 & c+1 a-1 & b-1 & c-1end{array} ightB)

2. (func{det} leftB egin{array}{ccc}a & b & c a+b & 2b & c+b 2 & 2 & 2end{array} ightB)

1. (0)

If (func{det} leftB egin{array}{rrr}a & b & c p & q & r x & y & zend{array} ightB = -1) compute:

1. (func{det} leftB egin{array}{ccc}-x & -y & -z 3p+a & 3q+b & 3r+c 2p & 2q & 2rend{array} ightB)

2. (func{det} leftB egin{array}{ccc}-2a & -2b & -2c 2p+x & 2q+y & 2r+z 3x & 3y & 3zend{array} ightB)

1. (12)

Show that:

1. (func{det} leftB egin{array}{rrr}p+x & q+y & r+z a+x & b+y & c+z a+p & b+q & c+rend{array} ightB = 2func{det} leftB egin{array}{rrr}a & b & c p & q & r x & y & zend{array} ightB)

2. (func{det} leftB egin{array}{rrr}2a+p & 2b+q & 2c+r 2p+x & 2q+y & 2r+z 2x+a & 2y+b & 2z+cend{array} ightB = 9func{det} leftB egin{array}{rrr}a & b & c p & q & r x & y & zend{array} ightB)

1. (func{det} leftB egin{array}{rrr}2a+p & 2b+q & 2c+r 2p+x & 2q+y & 2r+z 2x+a & 2y+b & 2z+cend{array} ightB)
(= 3 func{det} leftB egin{array}{rrr}a+p+x & b+q+y & c+r+z 2p+x & 2q+y & 2r+z 2x+a & 2y+b & 2z+cend{array} ightB)
(= 3 func{det} leftB egin{array}{rrr}a+p+x & b+q+y & c+r+z p-a & q-b & r-c x-p & y-q & z-rend{array} ightB)
(= 3 func{det} leftB egin{array}{rrr}3x & 3y & 3z p-a & q-b & r-c x-p & y-q & z-rend{array} ightB cdots)

In each case either prove the statement or give an example showing that it is false:

1. (func{det}(A + B) = func{det } A + func{det } B.)

2. If (func{det } A = 0), then (A) has two equal rows.

3. If (A) is (2 imes 2), then (func{det}(A^T) = func{det } A).

4. If (R) is the reduced row-echelon form of (A), then (func{det } A = func{det } R).

5. If (A) is (2 imes 2), then (func{det}(7A) = 49 func{det } A).

6. (func{det}(A^T) = - func{det } A).

7. (func{det}(-A) = - func{det } A).

8. If (func{det } A = func{det } B) where (A) and (B) are the same size, then (A) = (B).

1. False. (A = leftB egin{array}{rr}1 & 1 2 & 2end{array} ightB)

2. False. (A = leftB egin{array}{rr}2 & 0 & 1end{array} ightB ightarrowR = leftB egin{array}{rr}1 & 0 & 1end{array} ightB)

3. False. (A = leftB egin{array}{rr}1 & 1 & 1end{array} ightB)

4. False. (A = leftB egin{array}{rr}1 & 1 & 1end{array} ightB) and (B = leftB egin{array}{rr}1 & 0 1 & 1end{array} ightB)

Compute the determinant of each matrix, using Theorem [thm:007890].

1. (leftB egin{array}{rrrrr}1 & -1 & 2 & 0 & -2 & 1 & 0 & 4 & 1 1 & 1 & 5 & 0 & 0 & 0 & 0 & 3 & -1 & 0 & 0 & 1 & 1end{array} ightB)

2. (leftB egin{array}{rrrrr}1 & 2 & 0 & 3 & 0 -1 & 3 & 1 & 4 & 0 & 0 & 2 & 1 & 1 & 0 & -1 & 0 & 2 & 0 & 3 & 0 & 1end{array} ightB)

1. (35)

If (func{det } A = 2, func{det } B = -1), and (func{det } C = 3), find:

(func{det} leftB egin{array}{ccc}A & X & Y & B & Z & 0 & Cend{array} ightB) (func{det} leftB egin{array}{ccc}A & 0 & 0 X & B & 0 Y & Z & Cend{array} ightB) (func{det} leftB egin{array}{ccc}A & X & Y & B & 0 & Z & Cend{array} ightB) (func{det} leftB egin{array}{ccc}A & X & 0 & B & 0 Y & Z & Cend{array} ightB)

1. (-6)

2. (-6)

If (A) has three columns with only the top two entries nonzero, show that (func{det } A = 0).

1. Find (func{det } A) if (A) is (3 imes 3) and (func{det}(2A) = 6).

2. Under what conditions is (func{det}(-A) = func{det } A)?

Evaluate by first adding all other rows to the first row.

1. (func{det } leftB egin{array}{ccc}x-1 & 2 & 3 2 & -3 & x-2 -2 & x & -2end{array} ightB)

2. (func{det } leftB egin{array}{ccc}x-1 & -3 & 1 2 & -1 & x-1 -3 & x+2 & -2end{array} ightB)

1. (-(x-2)(x^2 + 2x-12))

1. Find (b) if (func{det} leftB egin{array}{rrr}5 & -1 & x 2 & 6 & y -5 & 4 & zend{array} ightB = ax + by + cz).

2. Find (c) if (func{det} leftB egin{array}{rrr}2 & x & -1 1 & y & 3 -3 & z & 4end{array} ightB = ax + by + cz).

1. (-7)

Find the real numbers (x) and (y) such that (func{det } A = 0) if:

(A = leftB egin{array}{rrr}0 & x & y y & 0 & x x & y & 0end{array} ightB) (A = leftB egin{array}{rrr}1 & x & x -x & -2 & x -x & -x & -3end{array} ightB) (A = leftB egin{array}{rrrr}1 & x & x^2 & x^3 x & x^2 & x^3 & 1 x^2 & x^3 & 1 & x x^3 & 1 & x & x^2end{array} ightB) (A = leftB egin{array}{rrrr}x & y & 0 & 0 & x & y & 0 & 0 & x & y y & 0 & 0 & xend{array} ightB)

1. (pm frac{sqrt{6}}{2})

2. (x = pm y)

Show that
(func{det} leftB egin{array}{rrrr}0 & 1 & 1 & 1 1 & 0 & x & x 1 & x & 0 & x 1 & x & x & 0end{array} ightB = -3x^2)

Show that
(func{det} leftB egin{array}{rrrr}1 & x & x^2 & x^3 a & 1 & x & x^2 p & b & 1 & x q & r & c & 1end{array} ightB = (1-ax)(1-bx)(1-cx).)

[ex:3.1.19] Given the polynomial (p(x) = a + bx + cx^2 + dx^3 + x^4), the matrix (C = leftB egin{array}{rrrr}0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 -a & -b & -c & -dend{array} ightB) is called the companion matrix of (p(x)). Show that (func{det}(xI - C) = p(x)).

Show that
(func{det} leftB egin{array}{rrr}a+x & b+x & c+x +x & c+x & a+x c+x & a+x & b+xend{array} ightB = (a+b+c+3x)[(ab+ac+bc)-(a^2+b^2+c^2)])

[ex:3_1_21]. Prove Theorem [thm:007914]. [Hint: Expand the determinant along column j.]

Let (vect{x} = leftB egin{array}{c}x_1 x_2 vdots x_nend{array} ightB), (vect{y} = leftB egin{array}{c}y_1 y_2 vdots y_nend{array} ightB) and (A = leftB egin{array}{ccccc} vect{c}_1 & cdots & vect{x} + vect{y}& cdots & vect{c}_n end{array} ightB) where (vect{x} + vect{y}) is in column (j). Expanding (func{det } A) along column (j) (the one containing (vect{x} + vect{y})):

[egin{aligned}T(vect{x} + vect{y}) = func{det } A &= sum_{i=1}^{n} (x_i + y_i)c_{ij}(A) &= sum_{i=1}^{n} x_ic_{ij}(A) + sum_{i=1}^{n} y_ic_{ij}(A)&= T(vect{x}) + T(vect{y})end{aligned}]

Similarly for (T(avect{x}) = aT(vect{x})).

Show that [func{det} leftB egin{array}{ccccc}0 & 0 & cdots & 0 & a_1 & 0 & cdots & a_2 & * vdots & vdots & & vdots & vdots & a_{n-1} & cdots & * & * a_n & * & cdots & * & *end{array} ightB=(-1)^k a_1a_2 cdots a_n] where either (n = 2k) or (n = 2k + 1), and (*)-entries are arbitrary.

By expanding along the first column, show that: [func{det} leftB egin{array}{ccccccc}1 & 1 & 0 & 0 & cdots & 0 & 0 & 1 & 1 & 0 & cdots & 0 & 0 & 0 & 1 & 1 & cdots & 0 & 0 vdots & vdots & vdots & vdots & & vdots & vdots & 0 & 0 & 0 & cdots & 1 & 1 1 & 0 & 0 & 0 & cdots & 0 & 1 end{array} ightB= 1 + (-1)^{n+1}]

if the matrix is (n imes n, n geq 2).

Form matrix (B) from a matrix (A) by writing the columns of (A) in reverse order. Express (func{det } B) in terms of (func{det } A).

If (A) is (n imes n), then (func{det } B = (-1)^k func{det } A) where (n = 2k) or (n = 2k + 1).

Prove property 3 of Theorem [thm:007779] by expanding along the row (or column) in question.

Show that the line through two distinct points ((x_{1}, y_{1})) and ((x_{2}, y_{2})) in the plane has equation [func{det}leftB egin{array}{ccc}x & y & 1 x_1 & y_1 & 1 x_2 & y_2 & 1end{array} ightB = 0]

Let (A) be an (n imes n) matrix. Given a polynomial (p(x) = a_0 + a_1x + cdots + a_mx^m), we write
(p(A) = a_{0}I + a_1A + cdots + a_mA^m).

For example, if (p(x) = 2-3x+5x^2), then
(p(A) = 2I -3A +5A^2). The characteristic polynomial of (A) is defined to be (c_A(x) = func{det} [xI - A]), and the Cayley-Hamilton theorem asserts that (c_A(A) = 0) for any matrix (A).

1. 2
1. (A = leftB egin{array}{rr}3 & 2 1 & -1end{array} ightB)

2. (A = leftB egin{array}{rrr}1 & -1 & 1 & 1 & 0 8 & 2 & 2end{array} ightB)

2. Prove the theorem for (A = leftB egin{array}{rr}a & b c & dend{array} ightB)

1. Determinants are commonly written (|A| = func{det } A) using vertical bars. We will use both notations.↩

2. If (A = leftB egin{array}{rrr}a & b & c d & e & f g & h & iend{array} ightB) we can calculate (func{det } A) by considering (leftB egin{array}{rrrrr}a & b & c & a & bd & e & f & d & e g & h & i & g & hend{array} ightB) obtained from (A) by adjoining columns (1) and (2) on the right. Then (func{det } A = aei + bfg + cdh - ceg - afh - bdi), where the positive terms (aei, bfg,) and (cdh) are the products down and to the right starting at (a,b), and (c), and the negative terms (ceg, afh), and (bdi) are the products down and to the left starting at (c, a), and (b). Warning: This rule does not apply to (n imes n) matrices where (n > 3) or (n = 2).↩