Skip to main content
Logo image

Exercises 9.5 Exercises

Recognizing zero determinants.

For each matrix, give a reason why its determinant must be zero without doing any calculations.

1.

[6171312527475713616663632]
Answer.
Contains a pair of identical columns.

2.

[2046485456000001688653645]
Answer.
Contains a zero row.

3.

[4546015420387504459051290]
Answer.
Contains a zero column.

4.

[0662266261567897343606622]
Answer.
Contains a pair of identical rows.

5.

[2101012233366993213322122]
Answer.
Contains a pair of proportional rows.

6.

[0131131200231333123333222]
Answer.
Contains a pair of proportional columns.

Computing determinants using row operations.

Use the row reduction method (Procedure 9.2.2) to compute the determinant of each matrix.

7.

[021854274]
Solution.
This matrix can be reduced to upper triangular using the sequence of operations
  1. R1R3
  2. R24R1
  3. R2R3
  4. 12R2
  5. R3+33R2,
resulting in
[27401120072].
This matrix has determinant 7. From the sequence of operations, if the original matrix has determinant d then the above upper triangular matrix has determinant d/2. From d/2=7 we conclude that the original matrix has determinant d=14.
Note: If you chose a different sequence of row operations, your final upper triangular matrix could be different, with a different determinant, and the relationship between that determinant and the determinant of the original matrix could be different.

8.

[674846691]
Solution.
This matrix can be reduced to upper triangular using the sequence of operations
  1. 13R3
  2. R1R3
  3. R2+4R1;R3+3R1
  4. R32R2,
resulting in
[23130822300533].
This matrix has determinant 848/3. From the sequence of operations, if the original matrix has determinant d then the above upper triangular matrix has determinant d/3. From d/3=848/3 we conclude that the original matrix has determinant d=848.
Note: If you chose a different sequence of row operations, your final upper triangular matrix could be different, with a different determinant, and the relationship between that determinant and the determinant of the original matrix could be different.

9.

[3044423112535423]
Solution.
This matrix can be reduced to upper triangular using the sequence of operations
  1. R1R3
  2. R2+4R1;R3+3R1;R45R1
  3. R4+2R2;R3R2
  4. 12R4
  5. R2R4
  6. R4+6R2
  7. R4+20R3,
resulting in
[1253011922004200063].
This matrix has determinant 252. From the sequence of operations, if the original matrix has determinant d then the above upper triangular matrix has determinant d/2. From d/2=252 we conclude that the original matrix has determinant d=504.
Note: If you chose a different sequence of row operations, your final upper triangular matrix could be different, with a different determinant, and the relationship between that determinant and the determinant of the original matrix could be different.

10.

[4273896105368203]
Solution.
This matrix can be reduced to upper triangular using the sequence of operations
  1. R2+2R1;R4+2R1
  2. 12R2
  3. R2R4
  4. R3+5R2;R413R2
  5. R4+2R3
  6. 15R4
  7. R3R4
  8. R438R3,
resulting in
[427301732001191000073710].
This matrix has determinant 1474/5. From the sequence of operations, if the original matrix has determinant d then the above upper triangular matrix has determinant d/10. From d/10=1474/5 we conclude that the original matrix has determinant d=2948.
Note: If you chose a different sequence of row operations, your final upper triangular matrix could be different, with a different determinant, and the relationship between that determinant and the determinant of the original matrix could be different.

11.

[3121104142201321232433302]
Solution.
This matrix can be reduced to upper triangular using the sequence of operations
  1. R4
  2. R1R4
  3. R3+2R1;R4+3R1;R53R1
  4. R2+R5
  5. R34R2;R47R2;R5+3R2
  6. R4+2R5
  7. 12R4
  8. R3R4
  9. R4+35R3;R527R3
  10. R4+R5
  11. 2R5
  12. R5+7R4,
resulting in
[123240171012001523200094000039].
This matrix has determinant 351. The changes to the determinant from the sequence of operations above end up cancelling each other out, and so the original matrix has the same determinant, 351.
Note: If you chose a different sequence of row operations, your final upper triangular matrix could be different, with a different determinant, and the relationship between that determinant and the determinant of the original matrix could be different.

12.

[5251023443512433431503140]
Solution.
This matrix can be reduced to almost upper triangular using the sequence of operations
  1. R12R2
  2. R22R1;R35R1;R43R1
  3. R2+4R5
  4. R2
  5. R321R2;R48R2;R5+3R2
  6. R4+3R5
  7. R5+6R4
  8. R5
  9. R3R5
  10. R43R3;R5139R3,
resulting in
[14396016381500111030003301700014443759].
By repeatedly computing cofactor expansions along the first column, we can compute
det[14396016381500111030003301700014443759]=|16381501110300330170014443759|=|11103033017014443759|=|3301714443759|=3007591714443=4939.
From the sequence of operations, if the original matrix has determinant d then our final almost upper triangular matrix has determinant d. From d=4939 we conclude that the original matrix has determinant d=4939.
Note: If you chose a different sequence of row operations, your final reduced matrix could be different, with a different determinant, and the relationship between that determinant and the determinant of the original matrix could be different.

13.

[2210813711553411547310230322108145101136]
Solution.
This matrix can be reduced to upper triangular using the sequence of operations
  1. R1R2
  2. R22R1;R3+R1;R4R1;R52R1;R6R1
  3. R2R4
  4. R2
  5. R6+R2
  6. R3R6
  7. R4R6
  8. R5+2R4;R6+2R2
  9. R5R6,
resulting in
[115534013231001233000141000011000001].
This matrix has determinant 1. Our sequence of operations involves an odd number of row swaps, but also a single instance of multiplying a row by 1, so the original matrix and the simplified matrix have the same determinant value.
Note: If you chose a different sequence of row operations, your final upper triangular matrix could be different, with a different determinant, and the relationship between that determinant and the determinant of the original matrix could be different.

14.

[323110212122313202331133333103201103]
Solution.
This matrix can be reduced to upper triangular using the sequence of operations
  1. R12R2
  2. R2+2R1;R33R1;R4+3R1;R53R1;R6+2R1
  3. R2R6
  4. R313R2;R4+9R2;R59R2;R6+8R2
  5. R62R4
  6. R3R6
  7. R4+5R3;R59R3;R615R3
  8. R5+2R4
  9. R4R5
  10. R513R4;R6+40R4
  11. R6+3R5
  12. 120R6
  13. R5R6
  14. R6+71R5,
resulting in
[147134013021001314230001150000111100000046110].
This matrix has determinant 461/10. From the sequence of operations, if the original matrix has determinant d then the above upper triangular matrix has determinant d/20. From d/20=461/10 we conclude that the original matrix has determinant d=922.
Note: If you chose a different sequence of row operations, your final upper triangular matrix could be different, with a different determinant, and the relationship between that determinant and the determinant of the original matrix could be different.

Computing determinants of matrices involving variables.

For each matrix:
  1. Compute the determinant as a formula in x by performing row operations to simplify before computing a cofactor expansion.
  2. Determine the values of x for which the determinant value is 0.

15.

[x+4371x311x1]
Solution.
  1. One choice of a sequence of simplifying operations is:
    1. R1R2
    2. R1
    3. R2(x+4)R1;R3+R1
    4. R2R3
    5. R2
    6. R3(x+3)R2,
    resulting in upper triangular matrix
    [1x30x+1(x+2)00(x+1)2].
    This matrix has determinant
    (x+1)3.
    Our sequence of operations used two row swaps and two multiplications of a row by 1, all of which cancels out in terms of the effect on the determinant. Therefore, the original matrix has the same determinant value.
  2. The determinant calculated above is equal to 0 only when x=1.

16.

[x+1230605x+720510x23]
Solution.
  1. One choice of a sequence of simplifying operations is:
    1. R1R2
    2. 5R2
    3. R2+(x+12)R1;R3R1
    4. R2R3
    5. R2
    6. R3(x+22)R2,
    resulting in upper triangular matrix
    [5x+7200x3(x3)00(x3)(x+2)].
    This matrix has determinant
    5(x3)2(x+2).
    From the sequence of operations, if the original matrix has determinant d then the above upper triangular matrix has determinant 5d, from which we conclude that
    d=(x3)2(x+2).
  2. The determinant calculated above is equal to 0 when x=3 and when x=2.

17.

[x+2244x+3454x7]
Solution.
  1. One choice of a sequence of simplifying operations is the following. (We do not aim for upper triangular here, but instead aim for as many zero entries as is reasonably possible.)
    1. R1R2
    2. 4R2;4R3
    3. R2+(x+2)R1;R3+5R1
    4. R2R3
    The result of these operations is
    [4x+340x21005x14(x2)],
    which is enough zero entries to be as good as upper triangular for the purpose of computing the determinant:
    det[4x+340x21005x14(x2)]=4|x2105x14(x2)|=4((x21)4(x2)0(5x1))=16(x21)(x2).
    From the sequence of operations, if the original matrix has determinant d then our simplified matrix has determinant 16d, from which we conclude that
    d=(x21)(x2).
  2. The determinant calculated above is equal to 0 when x=1, when x=1, and when x=2.

18.

[x30102x32102x32212x5]
Solution 1.
  1. One choice of a sequence of simplifying operations is the following. (We do not aim for upper triangular here, but instead aim for as many zero entries as is reasonably possible.)
    1. R1R2
    2. 2R1
    3. R2(x3)R1;R4R1
    4. R2R3
    5. 2R3;2R4
    6. R3+(x3)2R2;R4+(x4)R2
    The result of these operations is
    [2x32102x3200(x3)3+4(x4)2(x3)(x4)00(x3)(x4)0],
    which is enough zero entries to be as good as upper triangular for the purpose of computing the determinant:
    det[2x32102x3200(x3)3+4(x4)2(x3)(x4)00(x3)(x4)0]=2|2x320(x3)3+4(x4)2(x3)(x4)0(x3)(x4)0|=22|(x3)3+4(x4)2(x3)(x4)(x3)(x4)0|=4(((x3)3+4(x4))0=(2(x3)(x4))((x3)(x4)))=8(x3)2(x4)2.
    From the sequence of operations, if the original matrix has determinant d then our simplified matrix has determinant 8d, from which we conclude that
    d=(x3)2(x4)2.
  2. The determinant calculated above is equal to 0 when x=3 and when x=4.
Solution 2.
  1. Using Lemma 9.4.3, we can instead compute the determinant of the transpose matrix
    [x32020x32112x32012x5].
    (Note that performing row operations on a transposed matrix is equivalent to performing column operations on the original matrix.)
    One choice of a sequence of simplifying operations for this transpose matrix is the following. (We do not aim for upper triangular here, but instead aim for as many zero entries as is reasonably possible.)
    1. R1R3
    2. R1
    3. R3(x3)R1
    4. R2R4
    5. R2
    6. R3+2(x4)R2;R4(x3)R2
    7. R3+2R4
    The result of these operations is
    [12x+32012x+500(x3)20002(x4)(x4)2],
    which is enough zero entries to be as good as upper triangular for the purpose of computing the determinant:
    det[12x+32012x+500(x3)20002(x4)(x4)2]=|12x+50(x3)2002(x4)(x4)2|=|(x3)202(x4)(x4)2|=((x3)2(x4)20(2(x4)))=(x3)2(x4)2.
    Our sequence of operations used two row swaps and two multiplications of a row by 1, all of which cancels out in terms of the effect on the determinant. Therefore, the original matrix has the same determinant value.
  2. The determinant calculated above is equal to 0 when x=3 and when x=4.

19. Determinant of a Vandermonde matrix.

Recall that in a polynomial interpolation problem, we need n+1 data points to uniquely determine a degree-n polynomial. (See Subsection 3.2.4 and Theorem 3.4.1.) And in that case, the associated Vandermonde matrix (the coefficient matrix of the polynomial interpolation problem) is square:
[1x1x12x1n1x2x22x2n1xn+1xn+12xn+1n].

(a)

Compute the determinant of the 2×2 Vandermonde matrix
[1x11x2],
expressed as a formula in x1 and x2.

(b)

Compute the determinant of the 3×3 Vandermonde matrix
[1x1x121x2x221x3x32],
expressed as a formula in x1,x2,x3. Simplify your expression by factoring instead of expanding.
Hint.
Begin by performing two simplifying row operations, then carry out a cofactor expansion. When simplifying, recall the difference of squares factorization formula:
a2b2=(ab)(a+b).

(c)

Based on your answers to Task a and Task b, conjecture a formula for the determinant of the 4×4 Vandermonde matrix
[1x1x12x131x2x22x231x3x32x331x4x42x43].
Then attempt to verify your conjectured formula through calculation.
Hint.
You may find it easier to compute the determinant of the transpose of the matrix (see Lemma 9.4.3). When choosing simplifying row operations, and when attempting to simplify your final determinant calculation into factored form, you should find the following difference of like powers factorization formulas useful:
a2b2=(ab)(a+b)a3b3=(ab)(a2+ab+b2).