Skip to main content

Section 5.2 Computing Determinants (GT2)

Subsection 5.2.1 Class Activities

Remark 5.2.1.

We've seen that row reducing all the way into RREF gives us a method of computing determinants.

However, we learned in Chapter 1 that this can be tedious for large matrices. Thus, we will try to figure out how to turn the determinant of a larger matrix into the determinant of a smaller matrix.

Activity 5.2.2.

The following image illustrates the transformation of the unit cube by the matrix [110131001].

Figure 62. Transformation of the unit cube by the linear transformation.

Recall that for this solid V=Bh, where h is the height of the solid and B is the area of its parallelogram base. So what must its volume be?

  1. det[1113]

  2. det[1031]

  3. det[1101]

  4. det[1300]

Activity 5.2.4.

Remove an appropriate row and column of det[1001512321] to simplify the determinant to a 2×2 determinant.

Activity 5.2.5.

Simplify det[0322512021] to a multiple of a 2×2 determinant by first doing the following:

(a)

Factor out a 2 from a column.

(b)

Swap rows or columns to put a 1 on the main diagonal.

Activity 5.2.6.

Simplify det[422314113] to a multiple of a 2×2 determinant by first doing the following:

(a)

Use row/column operations to create two zeroes in the same row or column.

(b)

Factor/swap as needed to get a row/column of all zeroes except a 1 on the main diagonal.

Observation 5.2.7.

Using row/column operations, you can introduce zeros and reduce dimension to whittle down the determinant of a large matrix to a determinant of a smaller matrix.

det[4301224014152803]=det[430161802014152803]=det[43161820283]==2det[134021430110]=2det[2143110]==2det[1672101]=2det[167]=2(167)det(I)=334

Activity 5.2.8.

Rewrite

det[2121301422302033]

as a multiple of a determinant of a 3×3 matrix.

Activity 5.2.9.

Compute det[2350032012031122] by using any combination of row/column operations.

Observation 5.2.10.

Another option is to take advantage of the fact that the determinant is linear in each row or column. This approach is called Laplace expansion or cofactor expansion.

For example, since [124]=1[100]+2[010]+4[001],

det[235135124]=1det[235135100]+2det[235135010]+4det[235135001]=1det[532531001]2det[253153001]+4det[235135001]=det[5353]2det[2515]+4det[2313]

Observation 5.2.11.

Applying Laplace expansion to a 2×2 matrix yields a short formula you may have seen:

det[abcd]=adet[10cd]+bdet[01cd]=adet[10cd]bdet[10dc]=adbc.

There are formulas for the determinants of larger matrices, but they can be pretty tedious to use. For example, writing out a formula for a 4×4 determinant would require 24 different terms!

det[a11a12a13a14a21a22a23a24a31a32a33a34a41a42a43a44]=a11(a22(a33a44a43a34)a23(a32a44a42a34)+)+

So this is why we either use Laplace expansion or row/column operations directly.

Activity 5.2.12.

Based on the previous activities, which technique is easier for computing determinants?

  1. Memorizing formulas.

  2. Using row/column operations.

  3. Laplace expansion.

  4. Some other technique (be prepared to describe it).

Activity 5.2.13.

Use your preferred technique to compute det[4300132132030322].

Insight 5.2.14.

You can check your answer using Octave.

Subsection 5.2.2 Videos

Figure 63. Video: Simplifying a determinant using row operations
Figure 64. Video: Computing a determinant

Subsection 5.2.3 Slideshow

Slideshow of activities available at https://teambasedinquirylearning.github.io/linear-algebra/2022/GT2.slides.html.

Exercises 5.2.4 Exercises

Exercises available at https://teambasedinquirylearning.github.io/linear-algebra/2022/exercises/#/bank/GT2/.

Subsection 5.2.5 Mathematical Writing Explorations

Exploration 5.2.15.

Prove that the equation of a line in the plane, through points (x1,y1),(x2,y2), when x1x2 is given by the equation det(xy1x1y11x2y21)=0.

Exploration 5.2.16.

Prove that the determinant of any diagonal matrix, upper triangular matrix, or lower triangular matrix, is the product of it's diagonal entries.

Exploration 5.2.17.

Show that, if an n×n matrix M has a non-zero determinant, then any vRn can be represented as a linear combination of the columns of M.

Exploration 5.2.18.

What is the smallest number of zeros necessary to place in a 4×4 matrix, and the placement of those zeros, such that the matrix has a zero determinant?

Subsection 5.2.6 Sample Problem and Solution

Sample problem Example B.1.22.

You have attempted 1 of 1 activities on this page.